VIAR, DIMENSION FORMULA 377subspace and applying the case n = 2 we havedim(Vl + - +Vn) = dimVn + dim(V1 + - +Vn.,) - dim(Vnn(Vl + - +V,,.,))3 78 PI MU EPSILON JOURNALProof. This is really a corollary to the first theorem. Take dimensions of bothsides. The dimension of the left side is the same as the dimension of the right sideby the first theorem. Since the left side and the right side have the same dimensionand they are over the same field they must be isomorphic.The second theorem isn't very satisfying. It gives us a way of looking atthe dimension formula of the first theorem in terms of quotient spaces, but thegiven isomorphism is "unnatural" in that we haven't given the isomorphism andit seems unlikely that one will be found. Is there a better generalization of thedimension formula, and does it lead to a natural generalization of the secondisomorphism theorem? We leave this question the reader.Hence the theorem follows by induction. DThe problem with our formula is that it is not very symmetric inV,, V,, - , Vn . To get a more symmetric formula, write down our formula n!times (once for each permutation of {Vl, V,, - , Vn}), and then add each column.For example, in the case n = 3 this leads to-2dim(VlnV3)-2dim(V2nV3)- 2dim(Vl n(V2 +V3))- 2dim(V2n(V, +VJ)- 2dim(V3n(Vl +VJ)We leave it to the reader to write down a general form for this.Recall that the second isomorphism theorem for vector spaces says thatif V, and V, are subspaces thenTaking dimensions of both sides of this formula yields the well known formulathat we started with. One would guess that our dimension formula must also giverise to a quotient isomorphism. In fact, we have the following.Theorem 2. If Vl, V,,-, Vn are subspaces of a finite dimensional vector space,then
Self-similarity and Fractal Dimension of CertainGeneralized Arithmetical TrianglesMark Tomforde (student)Gustavus Adolphus CollegeThe following two forms of Pascal's (or the arithmetical) triangle areequivalent:where C(m, n) is the number of combinations of m + n objects taken n at a time.If we let p be a prime and code p different colors to the numbers 0 to p - 1, thenwe can replace each number in the above figure by the color coded to its leastpositive residue modulo p and thereby "visualize" the relation among the numbers.It is well known that the nonzero residues of Pascal's Triangle modulo a prime pform a fractal image which is self-similar and has fractal dimension1In this paper we investigate a generalized combination C(m, n) which is definedas follows: Given a sequence of integers C,, C2, . . .,Cn we denote the generalizedfactorial of a number n as [n]!, and define it as [O]! = 1 and [n]! = C, C, * . . . -Cn for n e N. We then denote_the generalized binomial coefficient byII and define it as In]! . We can now define C(m, n) =k &]!in-k]!For our purposes in this paper we will only discriminate betweenelements which are congruent to 0 modulo a given prime (which will always becolored white) versus those which are not congruent to 0 modulo the prime (andwinch will be colored nonwhite). We shall also use the following definitions forvarious types of sequences:A U-sequene is a sequence {Un) such that U, = 0, U, = 1 andUn+2 = aUn+, +bun for all n e {O, 1, 2 ...} and for somefixed integers a and b. In this paper, values of C(m, n)1:1 11380 PI MU EPSILON JOURNALwhich are determined by a U-Sequence will be denotedU(m, n).A Gaussian seauence is a sequence {Q,,] which is a U-sequence such that a = 1+ q and b = -q for some interger q. Thw Qn = 0 and Q,, = 1+q+q 2 +.. .+qn-l. Whenq# l,Q,,=(l -qn)/(l -@;whenq = 1 this is the sequence 1, 2, 3,4, .. . . In this paper,values of C(m, n) which are determined by a Gaussiansequence will be denoted either by Q(m, n) or by Q, (m, n) tospecify the value of q.A divisible is a sequence {Cn] such that gcd(C m, C,,) =CgaKnuil for all m, n > 0. All U-sequences with gcd(a, b) = 1are regularly divisible [2, p 132L and thus all Gaussiansequences are also regularly divisible.In addition, there are some well known facts about U-sequences which will bemade use of in this paper. Some of these are listed here:U,+, = Un+]Un + b UmUn-, (Fact 1)U(m, n) = U,,,+,U(m, n - 1) + b Un.lU(m - 1, n) (Fact 2)U(m, 0) = 1 (Fact 3)U(m, 1) = U^l (Fact 4)U(m, n) = U(n, m) (Fact 5)It is now possible to begin proving facts about generalized arithmetical trianglesand the sequences used to form them.Lemma 1: Ifp is a prime and plb for a U-sequence, then Un = a n -'(mod p) for alln 6 N where a and b are as defined before.Proof: This theorem can easily be proven by induction using the basic recurrencein the inductive step and the relationships U, = 1 and U2 = a as the base cases.Theorem 1: Ifp is a prime, then p 1 U(m, n) for all m, n e N iffpla and plb.Proof: First it will be shown that pla and plb => p 1 U(m, n) for all m, n 6 N.Since plb we know from lemma 1 that Un = a n -'(mod p) which means that for m,neNU(m, n) = U,,,+,U(m,= amU(m, n -1) + b an-vm - 1, n)(mod p).n - 1) + b Un.,U(m - 1, n) (by fact 2)<strong>No</strong>w since pla and plb it follows that p divides each of these terms in the sum andhence p 1 U(m, n) for all my n e N. Next it will be shown that p 1 U(m, n) for all379
- Page 2 and 3: - Another Matching Problem with aMa
- Page 4 and 5: Red Light, Green Light:A Model of T
- Page 6 and 7: BENNINK. RED LIGHT, GREEN LIGHT 357
- Page 8 and 9: BENNINK, RED LIGHT, GREEN LIGHT 361
- Page 10 and 11: 365 PI MU EPSILON JOURNALROUSSEAU,
- Page 12 and 13: 369 PI MU EPSILON JOURNALwe havec(n
- Page 14 and 15: 3 73 PI MU EPSILON JOURNALThis can
- Page 18 and 19: TOMFORDE, SELF-SIMILARITY 38 1m, n
- Page 20 and 21: TOMFORDE, SELF-SIMILARITY 385Note t
- Page 22 and 23: TOMFORDE, SELF-SIMILARITY 3 896. G.
- Page 24 and 25: 393 PI MU EPSILON JOURNALA Particul
- Page 26 and 27: 397 PI MU EPSILON JOURNALy = ax - b
- Page 28 and 29: 40 1 PI MU EPSILON JOURNALFigure 8P
- Page 30 and 31: The Power Means Theorem via the Wei
- Page 32 and 33: MISCELLANY 409The 1995 GameIn die F
- Page 34 and 35: 0. Co-author of convexity theoremP.
- Page 36 and 37: Pi MU EPSILON JOURNALii) JK is para
- Page 38 and 39: PROBLEMS AND SOLUTIONS 42 1Henry S.
- Page 40 and 41: PROBLEMS AND SOLUTIONS 425865. [Fal
- Page 42 and 43: PROBLEMS AND SOLUTIONS 429868. [Fal
- Page 44 and 45: BENNINK, RED LIGHT, GREEN LIGHT 3 6
- Page 46 and 47: PROBLEMS AND SOLUTIONS 437Solution
- Page 48 and 49: Editor's NoteThe Pi Mu Epsilon Jour