# Something different on arrays.

Consider the following six by six array (Figure 1):Figure 1 2 5 12 11 14 17 10 13 20 19 22 25 34 37 44 43 46 49 27 30 37 36 39 42 18 21 28 27 30 33 42 45 52 51 54 57

If asked to pick six numbers from this array, no two of which are in the same row or column, you could proceed as follows:

1. Choose any number from the array, and then cross out all remaining numbers from the row and column in which it is lies (the numbers chosen in this example appear in bold enlarged print in Figures 2-4).

2. Choose a second number from the numbers not yet eliminated and then strike out all remaining numbers from the row and column in which it appears (see Figure 3).

3. Similarly choose three additional numbers (5, 46 and 42), thus arriving at Figure 4.

4. When "choosing" the sixth and final number, there is hardly any choice.

Having already chosen numbers in the first, second, third, fourth, and sixth rows as well as in the first, second, third, fourth and fifth columns, we must select a number from the remaining row (row five) as well as from the column yet to be chosen (column six). This leaves us with the number 33 found in row five and column six of Figure 4.

5. Add the six numbers chosen and write down the sum of those numbers:

5 + 19 + 33 + 37 + 46 + 42 = 182

At this point we invite the reader to choose a different set of six numbers from the array above using the procedure outlined in steps 1-4 and calculate their sum. What is remarkable is that the same total, 182, will be obtained!

We intend to:

* explain why this is so;

* focus on arrays resembling the given illustration, and determine the conditions that assure us that the sum of any six numbers obtained in the manner outlined above will be invariant;

* show how one may predetermine the sum of any six numbers picked by the procedure described in steps 1-4 above.

In this paper, we utilise the following definition:

Definition 1: A k-translation of a sequence

Let the elements of a sequence be [a.sub.1], [a.sub.2], [a.sub.3], ... [a.sub.n]; the k-translation of that sequence is the sequence [a.sub.1] + k, [a.sub.2] + k, [a.sub.3] + k, ... [a.sub.n] + k for any non-zero number k.

Example 1

Were we to consider the numbers in the first row of the array in Figure 1 in the order of their appearance as a sequence:

2, 5, 12, 11, 14, 17

then the second row of the array, when viewed as a number sequence, is an 8-translation of the row-one sequence:

2 + 8, 5 + 8, 12 + 8, 11 + 8, 14 + 8, 17 + 8 or 10, 13, 20, 19, 22, 25

The arithmetic progression translation property

We assume without proof the following property of all arithmetic progressions: the sequence [a.sub.1], [a.sub.2], [a.sub.3], ... an is an arithmetic progression if and only for any constant k, its k-translation [a.sub.1] + k, [a.sub.2] + k, [a.sub.3] + k, ... [a.sub.n] + k is also an arithmetic progression.

This means that increasing (or decreasing) all numbers in an arithmetic progression by a constant yields another arithmetic progression. We refer to this property henceforth as the APT property.

A generalised array satisfying the invariance requirement

We now show that the generalised six-by-six array in Figure 5 meets the conditions needed to yield the same sum of any six numbers taken from the array, provided that these numbers include representatives of all rows and columns.

We define [a.sub.1] = 0 and [b.sub.1] = 0 in this array, but include "+ [a.sub.1]" and "+ [b.sub.1]" in all the elements of column one and row one respectively to preserve uniformity. As a result, all array elements assume the form a + [a.sub.r] + [b.sub.s], r and s being integers between 1 and 6 (with the value of subscript s not dependent on that of r). We note that the element in the array corresponding to a + [a.sub.r] + [b.sub.s] lies in row s and column r.

Since [b.sub.1] is zero by definition, a + [a.sub.r] + [b.sub.2] = (a + [a.sub.r] + [b.sub.1]) + [b.sub.2] for each [a.sub.r], r = 1, 2, 3, 4, 5 or 6. This means that the sequence in row two of Figure 5 is a [b.sub.2]-translation of the sequence of numbers in row one. Similarly, the sequences in rows three, four, five and six are [b.sub.3-], [b.sub.4-], [b.sub.5-] and [b.sub.6-] translations respectively of the row-one sequence.

We now intend to show that requiring all successive rows in a six by six array be translations of the first row sequence ensures that the sum of the six numbers chosen from the Figure 5 array in the manner described above will always be invariant.

Theorem 1

If a six-by-six array assumes the form of the generalised six-by-six array of Figure 5, then no matter which six numbers are chosen--so long as no pair of them lie in the same row or column--their sum is invariant.

Proof

1. Upon examination of the generalised array in Figure 5, we find that for each [a.sub.r] and [b.sub.s], r = 1, 2, 3, 4, 5 or 6 and s = 2, 3, 4, 5 or 6:

a + [a.sub.r] + [b.sub.s] = (a + [a.sub.r] + [b.sub.1]) + [b.sub.s] (since [b.sub.1] = 0 by definition).

This means that for each s, s = 2, 3, 4, 5 or 6, the sth row of the array, when viewed as a number sequence, is a [b.sub.s]-translation of the first row. We now show that this property ensures that the sum of the six numbers picked, no two of which lie in the same row or column is invariant.

2. Next, we note the following:

(a) All elements in every row s, s = 1, 2, 3, 4, 5 or 6 of the generalised array contain the addend [b.sub.s]. For example, all elements of row 3 contain the addend [b.sub.3]. On the other hand, [b.sub.3] does not appear as an addend in the expression representing any element of a different row.

(b) Similarly, all elements in every column, r, r = 1, 2, 3, 4, 5 or 6 contain an addend [a.sub.r]. For example, all elements of column 2 above contain the addend [a.sub.2], but [a.sub.2] does not appear in the expression representing an element of any other column.

(c) From the above we conclude that for every integral value of m and n between 1 and 6, there is a one-to-one correspondence between the expression a + [a.sub.m] + [b.sub.n] and the element situated in row n and column m of the array.

3. Suppose we have chosen six elements from the array through the method described above, no two of which lie in the same row or column. The sum of the expressions representing these elements is:

(a + [a.sub.g] + [b.sub.l]) + (a + [a.sub.i] + [b.sub.j]) + (a + [a.sub.m] + [b.sub.n]) + () + () + (a + [a.sub.f] + [b.sub.t])

(a) We note that each of the six expressions to be summed contains a. This contributes 6 x a to the overall sum.

(b) Furthermore, since each of the elements comes from a different column, each one of the six expressions will contain a different [a.sub.r]. Consequently when adding these six expressions--regardless of the original choice of elements--and following appropriate rearrangement and regrouping of these terms, the sum of the six numbers picked from the array will include a component [a.sub.1] + [a.sub.2] + [a.sub.3] + [a.sub.4] + [a.sub.5] + [a.sub.6].

(c) Similarly, since the six numbers to be added have been chosen from different rows, each of the six expressions representing them will contain a different [b.sub.s]. After rearranging and regrouping these terms, we find that their constituent sum will be [b.sub.1] + [b.sub.2] + [b.sub.3] + [b.sub.4] + [b.sub.5] + [b.sub.6], irrespective of the array numbers chosen randomly.

(d) It follows from the above that the sum of the expressions representing the selected six numbers will always be

6 x a + ([a.sub.1] + [a.sub.2] + [a.sub.3] + [a.sub.4] + [a.sub.5] + [a.sub.6]) + ([b.sub.1] + [b.sub.2] + [b.sub.3] + [b.sub.4] + [b.sub.5] + [b.sub.6])

This means that the sum of any six numbers of the array chosen from different rows and columns never changes, so long as the sequence of numbers in rows two through six are translations of the number sequence in row one.

As for predicting the invariant six-number sum for a given array, one can calculate the sum of the numbers lying along either array diagonal before the selection of the six numbers. Since the six numbers along either diagonal belong to different rows and different columns they are valid six-number selections and their sum provides the invariant result.

Thus, in the original illustration, one could have predicted the sum of the six arbitrary numbers to be chosen from different rows and columns by summing the numbers along either diagonal of Figure 1:

2 + 13 + 44 + 36 + 30 + 57 or 17 + 22 + 43 + 37 + 21 + 42,

both equalling 182. Either calculation easily provides the expected result when the six numbers are chosen randomly as described above.

A special case

In the event that the sequences [a.sub.1], [a.sub.2], [a.sub.3], [a.sub.4], [a.sub.5], [a.sub.6] and [b.sub.1], [b.sub.2], [b.sub.3], [b.sub.4], [b.sub.5], [b.sub.6] are both arithmetic progressions (1), one can readily show that the sum of the six elements chosen as described above is

6 x a + 3 x([a.sub.6] + [b.sub.6])

This follows from the fact that the sum of an arithmetic progression [a.sub.1] + [a.sub.2] + [a.sub.3] + [a.sub.4] + [a.sub.5] + [a.sub.6] equals

6 x ([a.sub.1] + [a.sub.6])/2

or 3 x [a.sub.6] (since [a.sub.1] equals zero by definition).

In like manner it follows that the sum [b.sub.1] + [b.sub.2] + [b.sub.3] + [b.sub.4] + [b.sub.5] + [b.sub.6] equals 3 x [b.sub.6]. Thus we conclude that whenever both the first column and the first row are arithmetic progressions (2), the "fixed" sum

6 x a + ([a.sub.1] + [a.sub.2] + [a.sub.3] + [a.sub.4] + [a.sub.5] + [a.sub.6]) + ([b.sub.1] + [b.sub.2] + [b.sub.3] + [b.sub.4] + [b.sub.5] + [b.sub.6])

can be replaced by 6 x a + 3 x ([a.sub.6] + [b.sub.6]).

We are able to replace this last result by a more useful formula as follows: Since [a.sub.1] and [b.sub.1] are both zero by definition, then

6 x a + 3 x ([a.sub.6] + [b.sub.6]) = 3 x (a + [a.sub.1] + [b.sub.1]) + 3 x (a + [a.sub.6] + [b.sub.6]) = 3 x [(a + [a.sub.1] + [b.sub.1]) + (a + [a.sub.6] + [b.sub.6])]

We prefer to restate the last expression as follows:

3 x [(a + [a.sub.1] + [b.sub.1]) + (a + [a.sub.6] + [b.sub.6])] = 6 x (a + [a.sub.1] + [b.sub.1]) + a + [a.sub.6] + [b.sub.6]/2

Conclusion in the special case

If in a six by six array in which all rows are translations of the first row, and the numbers in both the first row and column form arithmetic progressions, then the sum of any six numbers of the array, no two of which are in the same row or column, is six times the arithmetic mean of the numbers in the upper left and lower right corners of the array.

Verification of the preceding formula

Example 2

Show that the formula just derived applies to the array in Figure 6, and utilise that formula to determine the sum of any sextet of numbers drawn from that array, no two lying in the same row or column.

Solution

1. Both the first row and the first column are arithmetic progressions: 1, 2, 3, 4, 5, 6 and 1, 7, 13, 19, 25, 31.

2. In addition, rows 2, 3, 4, 5 and 6 are a 6-translation, a 12-translation, an 18-translation, a 24-translation and a 30-translation respectively of the sequence in row 1.

3. In this example, 1 and 36 are the two relevant corner elements.

4. It follows from our conclusion above that the sum of any sextet drawn from the given array, no two of which lie in the same row or column equals

6 x 1 + 36/2 = 3 x 37 = 111

Note: Were we to sum the numbers along either diagonal, we would obtain the same result:

1 + 8 + 15 + 22 + 29 + 36 = 6 + 11 + 16 + 21 + 26 + 31 = 111

Multiplicatively invariant arrays

We have produced the array in Figure 7 by systematically altering symbols appearing in Figure 5. For each addition sign in Figure 5 we have substituted a multiplication sign. Subscripts were left unchanged, and each small letter replaced by the corresponding large letter.

The element in the sth row and rth column of Figure 7 is A x [A.sub.r] x [B.sub.s] whereas the corresponding element in Figure 5 was a + [a.sub.r] + [b.sub.s]. Examining Figure 7 we find that [A.sub.r] appears as a factor in all elements of column r, r = 1, 2, ... 6 whereas [B.sub.s] appears as a factor in all elements of row s, s = 1, 2, ... 6.

We have established that Figure 5 represents the general form of a 6 by 6 additively invariant array (AIA). We intend to convince the reader that the general array in Figure 7 provides 6-element products that are invariant so long as no two of the six elements are chosen from the same row or column. We refer to such arrays as multiplicatively invariant arrays (MIA).

We surmise that products of six elements of the array in Figure 7 lying in different rows and columns are multiplicatively invariant from the following considerations:

1. Each of the 6 elements in such products will contribute a factor of A.

2. Each of the 6 elements in any "appropriate" product contributes a factor [A.sub.r] and a factor of [B.sub.s] where both r and s must take on the values 1, 2, 3, 4, 5 and 6 precisely once. For example, [A.sub.3] cannot appear twice among the 6 element factors chosen because this would mean that two of the elements were taken from column 3, and we have required that no two elements come from the same column. Similarly [B.sub.5] could not appear more than once among the 6 arbitrary element factors chosen, because this would mean we had chosen two different elements from row 5 of the array.

3. It follows from the preceding that the product obtained by multiplying 6 arbitrary elements, no two of which lie in the same row or column--after appropriate regrouping and reordering of all the factors--will always be

(A x A x A x A x A x A) x ([A.sub.1] x [A.sub.2] x [A.sub.3] x [A.sub.4] x [A.sub.5] x [A.sub.6]) x ([B.sub.1] x [B.sub.2] x [B.sub.3] x [B.sub.4] x [B.sub.5] x [B.sub.6]), or [A.sup.6] x ([A.sub.1] x [A.sub.2] x [A.sub.3] x [A.sub.4] x [A.sub.5] x [A.sub.6]) x ([B.sub.1] x [B.sub.2] x [B.sub.3] x [B.sub.4] x [B.sub.5] x [B.sub.6]).

This assures us that the product will never change.

We still need to determine the characteristics of the general array in Figure 7 that guarantee it is an MIA. For this purpose we introduce the following definition.

Definition 2: A k-magnification of a sequence

Let the elements of a sequence be [A.sub.1], [A.sub.2], [A.sub.3], ... [A.sub.n]; the k-magnification of that sequence is the sequence [A.sub.1] x k, [A.sub.2] x k, [A.sub.3] x k, ... [A.sub.n] x k for any non-zero number k.

Example 3

Suppose we are given the sequence: 2, -1, 7, 4, -3, 5. A 3-magnification of that sequence is the sequence 2 x 3, (-1) x 3, 7 x 3, 4 x 3, (-3) x 3, 5 x 3 or 6, -3, 21, 12, -9, 15.

We now apply this definition to the array in Figure 7 after assigning [B.sub.1] = 1. (3) Let us choose as a sequence the first row of that general array: A x [A.sub.1] x [B.sub.1], A x [A.sub.2] x [B.sub.1], A x [A.sub.3] x [B.sub.1], A x [A.sub.4] x [B.sub.1], A x [A.sub.5] x [B.sub.1], A x [A.sub.6] x [B.sub.1]. Since we have assigned to [B.sub.1] the value 1, we may rewrite the sequence as A x [A.sub.1], A x [A.sub.2], A x [A.sub.3], A x [A.sub.4], A x [A.sub.5], A x [A.sub.6]. Then a [B.sub.2]-magnification of that sequence will be A x [A.sub.1] x [B.sub.2], A x [A.sub.2] x [B.sub.2], A x [A.sub.3] x [B.sub.2], A x [A.sub.4] x [B.sub.2], A x [A.sub.5] x [B.sub.2], A x [A.sub.6] x [B.sub.2]. Lo and behold, this is nothing less than the sequence in row 2 of our Figure 7 array! Similarly we find that the arrays in rows 3, 4, 5 and 6 of Figure 7 are [B.sub.3-], [B.sub.4-], [B.sub.5-] and [B.sub.6-] magnifications respectively of the sequence in row 1 of the array, provided we define [B.sub.1] = 1. From this we surmise the following: if all rows in a six by six array except the first one are magnifications of the sequence of numbers in row 1, then multiplying any 6 numbers from the array, no two lying in the same row or column always yields the same product. We illustrate this result using the array in Figure 8. (4)

Example 4

Show that the array in Figure 8 is multiplicatively invariant, and then determine the product to be obtained by multiplying any 6 elements (numbers) of the array, no two of which lie in the same row or column.

Solution

Based on our deductions above, the array is a MIA, being that the sequences in row 2, 3, 4, 5 and 6 are 3-, 9-, 27-, 81- and 243-magnifications respectively of the row one sequence. To predetermine the product of any 6 elements of the array, no two lying in the same row or column, it suffices to multiply the numbers along one of the diagonals: 1 x 6 x 36 x 216 x 1296 x 7776 = 470 184 984 576. This is so because all the numbers along either diagonal lie in different rows and columns (just as in an AIA, or additively invariant array).

An AIA-MIA Comparison

Let us re-examine the relationship between additively and multiplicatively invariant 6 by 6 arrays. We begin by comparing their features in Table 1.

In moving from Figure 5 to Figure 7, we replaced small letters and addition signs by large letters and multiplication signs respectively. Our setting [b.sub.1] = 0 for AIA but [B.sub.1] = 1 for MIA is due to these assignments corresponding to the identity elements for addition and multiplication. These substitutions led to the sequences in all rows other than the first one being translations of the first row sequence in an AIA and magnifications of the first row sequence in an MIA. In one case we add the same constant to all terms of a sequence, whereas in the dual system we multiply each term of a sequence by the same constant.

The interrelationships between AIA and MIA are so pronounced that appropriate replacements using Table 1, as well as Table 2 that follows, led the writer to a result for MIA that matches a formula for the special case of AIA presented above. In that situation both sequences [A.sub.1], [a.sub.2], [a.sub.3], [A.sub.4], [a.sub.5], [a.sub.6] and [b.sub.1], [b.sub.2], [b.sub.3], [b.sub.4], [b.sub.5], [b.sub.6] were arithmetic progressions. That meant that there existed constants c and k such that [a.sub.m+1] = [a.sub.m] + c and [b.sub.m+1] = [b.sub.m] + k for m = 1, 2, ... 5. To find a formula for an MIA comparable to the one discovered in the special case pertaining to an AIA, it would be necessary that there must exist constants C and K such that [A.sub.m+1] = [A.sub.m] x C and [B.sub.m+1] = [B.sub.m] x K for m = 1, 2, ... 5. The latter two conditions are equivalent to requiring that the sequences [A.sub.1], [A.sub.2], [A.sub.3], ... [A.sub.6] and [B.sub.1], [B.sub.2], [B.sub.3], ... [B.sub.6] both be geometric progressions.

Furthermore, for the same reason that [b.sub.1] = 0 had to correspond to [B.sub.1] = 1, so did [A.sub.1] = 1 need to be the condition analogous to [a.sub.1] = 0 in the special case for AIA. The analogy further required that the product of the terms of a geometric progression in an MIA be matched to the sum of the terms of an arithmetic sequence in an AIA. We compare these special cases in Table 2.

Example 5

Use the result in cell 6b of Table 2 to calculate the product of any 6 numbers in the array of Figure 8, no two of which lie in the same row or column.

Solution

In our previous encounter with the Figure 8 array, we were not in a position to benefit from the fact that the first row and the first column were both geometric progressions: (1, 2, 4, 8, 16, 32 and 1, 3, 9, 27, 81, 243). Using the result in cell 6b of Table 2, we are now able to calculate the invariant product in an easier manner. The product of any six numbers of the array, no two of which lie in the same row or column equals

([square root of 1 x 7776]).sup.6 = [7776.sup.3] = 470 184 984 576

Final remarks

Our paper on additively and multiplicatively invariant arrays provides a good opportunity to re-examine two comparable mathematical structures that are familiar to secondary school students. The topic lends itself to reaching new conclusions, by exploiting a rich duality to both translate features of one structure into the "language" of the other as well as to produce full proofs of our discoveries. The unit focuses on comparable features of addition and multiplication, and exploits a relatively unknown connection between arithmetic and geometric progressions.

The subject we have introduced invites further exploration. Suggestions for additional study include:

1. a generalisation of AIA and MIA to 3 and 4 dimensional arrays (including the "special" cases) as well as to larger-sized square arrays;

2. an examination of the effect on the invariant sum/product caused by interchanging rows or columns or all the rows with all the columns of a given AIA or MIA.

Nomenclature adopted in this paper, as well as similar notions of duality appear in a previous ASMJ article (Berenson, 2002) dealing with invariance, both additive and multiplicative, in the context of third-order magic squares. Study of that article would undoubtedly reinforce ideas developed in this paper.

Reference

Berenson, L. (2002). Something different on magic squares. Australian Senior Mathematics Journal, 16 (1), 43-55.

(1.) If the sequences [a.sub.1], [a.sub.2], [a.sub.3], [a.sub.4], [a.sub.5], [a.sub.6] and [b.sub.1], [b.sub.2], [b.sub.3], [b.sub.4], [b.sub.5], [b.sub.6] are both arithmetic progressions, then the APT property ensures that the sequences in the first row and column of Figure 5 will also be arithmetic progressions (both are translations of sequences assumed to be arithmetic progressions).

(2.) See (1).

(3.) Why [B.sub.1] is assigned the value 1 is explained below.

(4.) The particular choice of numbers in Example 4, though cumbersome, was motivated by the ease with which one can solve the same problem in Example 5 using an improved formula.

(5.) A proof of the formula in entry 5b of Table 2 can be found at http://en.wikipedia.org/wiki/Geometric_progression. Applying duality to Gauss' trick for producing the formula in 5a is more satisfying.

(6.) To prove entry 6b of Table 2 the reader could start with the general-case invariant product found in Table 1, and arrive at the special-case result by applying duality to the given proof of entry 6a and employing entry 5b.

Lewis Berenson

Tel-Aviv University, Israel

<berenson@post.tau.ac.il>

Table 1 terms/operations in AIA terms/operations in MIA sum product a + [a.sub.r] + [b.sub.s] A x [A.sub.r] x [B.sub.s] (element insth row and rth column) (element insth row and rth column) [b.sub.1] = 0 [B.sub.1] = 1 replaced a + a + a + a + a + a = 6 x a by A x A x A x A x A x A = [A.sup.6] summed multiplied 6 x a+([a.sub.1]+[a.sub.2]+ [a.sub.6] x ([a.sub.1]x [a.sub.3]+[a.sub.4]+[a.sub.5]+ [a.sub.2]x[a.sub.3]x[a.sub.4] [a.sub.6])+([b.sub.1]+[b.sub.2]+ x[a.sub.5]x[a.sub.6])x [b.sub.3]+[b.sub.4]+[b.sub.5]+ ([b.sub.1]x[b.sub.2]x [b.sub.6]) is the invariant sum [b.sub.3]x[B.sub.4] x[B.sub.5]x[B.sub.6]) is the invariant product translation magnification [b.sub.3]-translation [b.sub.3]-magnification Table 2 Special case of a 6 by 6 AIA 1a The first row and column are arith- metic progressions 2a Successive rows of this array are translations of the first row sequence 3a [a.sub.1] = 0 4a The arithmetic mean, m, of a and b satisfies the condition: m+m=a+b or m = a+b/2 5a [a.sub.1]+[a.sub.2]+[a.sub.3]+ [a.sub.4]+[a.sub.5]+[a.sub.6] = 6 x ([a.sub.1]+]a.sub.6]/2 or 3x([a.sub.1]+[a.sub.6]) (the sum of 6 successive terms of an arithmetic progression) 6a The sum of any six numbers of the array, no two lying in the same row or column equals six times the arith- metic mean of the numbers in the upper left and lower right corners of the array. Corresponding special case of a 6 by 6 MIA 1b The first row and column are geometric progressions 2b Successive rows of this array are magnifications of the first row sequence 3b [A.sub.1] = 1 4b The geometric mean, M, of A and B satisfies the condition: MxM = AxB or M = [square root AxB] 5b [A.sub.1]x[A.sub.2]x[A.sub.3]x[A.sub. 4]x[A.sub.5]x[A.sub.6]=[square root [A.sub.1]x[A.sub.6] or [([A.sub.1]x [A.sub.6])].sup.3] (the product of 6 successive terms of a geometric progression). (5) 5c The product of any six numbers of the array, no two lying in the same row or column equals the sixth power of the geometric mean of the numbers in the upper left and lower right corners of the array. (6) Figure 2 2 5 [begin strikethrough]10 [begin strikethrough]13 [end strikethrough] [end strikethrough] 34 37 27 30 18 21 42 45 12 [begin strikethrough]11 [end strikethrough] [begin strikethrough]20 19 [end strikethrough] 44 [begin strikethrough]43 [end strikethrough] 37 [begin strikethrough]36 [end strikethrough] 28 [begin strikethrough]27 [end strikethrough] 52 [begin strikethrough]51 [end strikethrough] 14 17 [begin strikethrough]22 [begin strikethrough]25 [end strikethrough] [end strikethrough] 46 49 39 42 30 33 54 57 Figure 3 2 5 [begin strikethrough]10 [begin strikethrough]13 [end strikethrough] [end strikethrough] 34 37 [begin strikethrough]27 [begin strikethrough]30 [end strikethrough] [end strikethrough] 18 21 42 45 [begin strikethrough]12 [begin strikethrough]11 [end strikethrough] [end strikethrough] [begin strikethrough]20 19 [end strikethrough] [begin strikethrough]44 [begin strikethrough]43 [end strikethrough] [end strikethrough] 37 [begin strikethrough]36 [end strikethrough] [begin strikethrough]28 [begin strikethrough]27 [end strikethrough] [end strikethrough] [begin strikethrough]52 [begin strikethrough]51 [end strikethrough] 14 17 [begin strikethrough]22 [begin strikethrough]25 [end strikethrough] [end strikethrough] 46 49 [begin strikethrough]39 [begin strikethrough]42 [end strikethrough] [end strikethrough] 30 33 54 57 Figure 4 [begin strikethrough]2 5 [end strikethrough] [begin strikethrough]10 [begin strikethrough]13 [end strikethrough] [end strikethrough] [begin strikethrough]34 [begin strikethrough]37 [end strikethrough] [end strikethrough] [begin strikethrough]27 [begin strikethrough]30 [end strikethrough] [end strikethrough] [begin strikethrough]18 [begin strikethrough]21 [end strikethrough] [end strikethrough] 42 [begin strikethrough]45 [end strikethrough] [begin strikethrough]12 [begin strikethrough]11 [end strikethrough] [end strikethrough] [begin strikethrough]20 19 [end strikethrough] [begin strikethrough]44 [begin strikethrough]43 [end strikethrough] [end strikethrough] 37 [begin strikethrough]36 [end strikethrough] [begin strikethrough]28 [begin strikethrough]27 [end strikethrough] [end strikethrough] [begin strikethrough]52 [begin strikethrough]51 [end strikethrough] [end strikethrough] [begin strikethrough]14 [begin strikethrough]17 [end strikethrough] [end strikethrough] [begin strikethrough]22 [begin strikethrough]25 [end strikethrough] [end strikethrough] 46 [begin strikethrough]49 [end strikethrough] [begin strikethrough]39 [begin strikethrough]42 [end strikethrough] [end strikethrough] [begin strikethrough]30 33 [end strikethrough] [begin strikethrough]54 [begin strikethrough]57 [end strikethrough] [end strikethrough] Figure 5 a + [a.sub.1] + [b.sub.1] a + [a.sub.2] + [b.sub.1] a + [a.sub.1] + [b.sub.2] a + [a.sub.2] + [b.sub.2] a + [a.sub.1] + [b.sub.3] a + [a.sub.2] + [b.sub.3] a + [a.sub.1] + [b.sub.4] a + [a.sub.2] + [b.sub.4] a + [a.sub.1] + [b.sub.5] a + [a.sub.2] + [b.sub.5] a + [a.sub.1] + [b.sub.6] a + [a.sub.2] + [b.sub.6] a + [a.sub.3] + [b.sub.1] a + [a.sub.4] + [b.sub.1] a + [a.sub.3] + [b.sub.2] a + [a.sub.4] + [b.sub.2] a + [a.sub.3] + [b.sub.3] a + [a.sub.4] + [b.sub.3] a + [a.sub.3] + [b.sub.4] a + [a.sub.4] + [b.sub.4] a + [a.sub.3] + [b.sub.5] a + [a.sub.4] + [b.sub.5] a + [a.sub.3] + [b.sub.6] a + [a.sub.4] + [b.sub.6] a + [a.sub.5] + [b.sub.1] a + [a.sub.6] + [b.sub.1] a + [a.sub.5] + [b.sub.2] a + [a.sub.6] + [b.sub.2] a + [a.sub.5] + [b.sub.3] a + [a.sub.6] + [b.sub.3] a + [a.sub.5] + [b.sub.4] a + [a.sub.6] + [b.sub.4] a + [a.sub.5] + [b.sub.5] a + [a.sub.6] + [b.sub.5] a + [a.sub.5] + [b.sub.6] a + [a.sub.6] + [b.sub.6] Figure 6 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 Figure 7 A x [A.sub.1] x [B.sub.1] A x [A.sub.2] x [B.sub.1] A x [A.sub.1] x [B.sub.2] A x [A.sub.2] x [B.sub.2] A x [A.sub.1] x [B.sub.3] A x [A.sub.2] x [B.sub.3] A x [A.sub.1] x [B.sub.4] A x [A.sub.2] x [B.sub.4] A x [A.sub.1] x [B.sub.5] A x [A.sub.2] x [B.sub.5] A x [A.sub.1] x [B.sub.6] A x [A.sub.2] x [B.sub.6] A x [A.sub.3] x [B.sub.1] A x [A.sub.4] x [B.sub.1] A x [A.sub.3] x [B.sub.2] A x [A.sub.4] x [B.sub.2] A x [A.sub.3] x [B.sub.3] A x [A.sub.4] x [B.sub.3] A x [A.sub.3] x [B.sub.4] A x [A.sub.4] x [B.sub.4] A x [A.sub.3] x [B.sub.5] A x [A.sub.4] x [B.sub.5] A x [A.sub.3] x [B.sub.6] A x [A.sub.4] x [B.sub.6] A x [A.sub.5] x [B.sub.1] A x [A.sub.6] x [B.sub.1] A x [A.sub.5] x [B.sub.2] A x [A.sub.6] x [B.sub.2] A x [A.sub.5] x [B.sub.3] A x [A.sub.6] x [B.sub.3] A x [A.sub.5] x [B.sub.4] A x [A.sub.6] x [B.sub.4] A x [A.sub.5] x [B.sub.5] A x [A.sub.6] x [B.sub.5] A x [A.sub.5] x [B.sub.6] A x [A.sub.6] x [B.sub.6] Figure 8 1 2 4 8 16 32 3 6 12 24 48 96 9 18 36 72 144 288 27 54 108 216 432 864 81 162 324 648 1296 2592 243 486 972 1944 3888 7776

Printer friendly Cite/link Email Feedback | |

Author: | Berenson, Lewis |
---|---|

Publication: | Australian Senior Mathematics Journal |

Article Type: | Report |

Geographic Code: | 8AUST |

Date: | Jul 1, 2007 |

Words: | 5857 |

Previous Article: | Polya's legacy: fully forgotten or getting a new perspective in theory and practice? |

Next Article: | Editorial. |

Topics: |