1

Can you nd them all?

Let M be the 10 10 array of numbers given below.

0 10 20 30 40 50 60 70 80 90 1 11 21 31 41 51 61 71 81 91 2 12 22 32 42 52 62 72 82 92 3 13 23 33 43 53 63 73 83 93 4 14 24 34 44 54 64 74 84 94 5 15 25 35 45 55 65 75 85 95 6 16 26 36 46 56 66 76 86 96 7 17 27 37 47 57 67 77 87 97 8 18 28 38 48 58 68 78 88 98 9 19 29 39 49 59 69 79 89 99

The trace of M is dened to be the sum of the entries from the main diagonal (the rst entry of the rst row plus the second entry of the second row plus the third entry of the third row, and so on): 0 + 11 + 22 + 33 + 44 + 55 + 66 + 77 + 88 + 99 A pseudotrace of M is the sum of any 10 entries of M chosen under the following rules: Exactly one entry is chosen from each row. Exactly one entry is chosen from each column. One way to nd a pseudotrace of M is to pick an element from the array, then cross out all the entries in the same row and the same column. Next, pick an entry that has not been crossed out, add it to the rst entry, and cross out the entries from the same row and column. Then, pick an entry that hasnt been crossed out, add it to the sum of the rst two chosen, and cross out the entries from its row and column. Continue until all entries are crossed out. 1. 2. Determine all possible pseudotraces of M . Show your work and explain how you know youve found every possibility. Compute all possible pseudotraces of the array given below. 1 2 3 4 5 6 7 8 9 10
21 31 41 51 61 71
81 91 11 12 22 32 42 52 62 72 82 92 13 23 33 43 53 63 73 83 93 14 24 34 44 54 64 74 84 94 15 25 35 45 55 65 75 85 95 16 26 36 46 56 66 76 86 96 17 27 37 47 57 67 77 87 97 18 28 38 48 58 68 78 88 98 19 29 39 49 59 69 79 89 99 20 30 40 50 60 70 80 90 100

In fact, the trace of M is one of the pseudotraces of M !

Problems with a Point: August 9, 2002

c EDC 2002

Can you nd them all?: Problem

3.

Challenge: Let n be a positive integer greater than 10. (a) Fill in the boxes in the array below with the rst three entries of the last row. (b) Compute all possible pseudotraces of the array. 1 2 3 n n+2 n + 3 2n n+1 2n + 1 2n + 2 2n + 3 3n . . . ... . . . . . . . . . n2

Problems with a Point: August 9, 2002

c EDC 2002

Can you nd them all?: Hints

Hints
Hint to problems 1 and 2. You might want to start by trying a few pseudotraces and look for a pattern in the results. To do this, you must pick 10 entries, no two of which come from the same row or column. Once you nd a pattern, think about how the array is set up. What do you notice about the ones place and tens place of each entry in a given row and in a given column? When you add the 10 entries that make up the pseudotrace, what is the sum of the numbers in the tens place and what is the sum of the numbers in the ones place? Hint to problem 3 (a). There are n rows and n columns. What should the rst entry of row n be? What should the second and third entries be? Hint to problem 3 (b). In this array, you cannot just look at the ones and tens places of the numbers. Pick a row of the array. What common property is shared by each entry? What property is shared by each entry in a given column?

Problems with a Point: August 9, 2002

c EDC 2002

Can you nd them all?: Answers

Answers
1. 2. Every pseudotrace of M equals 495. Every pseudotrace of this array equals 505. The rst three entries in row n are n2 n +1, n2 n +2, and n2 n + 3. Another way to express these entries is (n 1)n + 1, (n 1)n + 2, and (n 1)n + 3. 2 (b) Every pseudotrace of this array equals n(n2+1) .

3. (a)

Problems with a Point: August 9, 2002

c EDC 2002

Can you nd them all?: Solutions

Solutions
1. Number the rows of M from 1 to 10, starting at the top row, and number each column of M from 1 to 10, starting at the left column. The tens place of each entry in row i is i 1 and the ones place of each entry in column j is j 1, so the entry in row i, column j , is equal to 10(i1)+(j 1). In creating a pseudotrace, every column and every row must be represented exactly once, so each of the ones places (0, 1, 2, 3, 4, 5, 6, 7, 8, and 9) and each of the tens places (0, 1, 2, 3, 4, 5, 6, 7, 8, and 9) are used exactly once. Therefore, when the 10 entries are added, the sum of the ones place is 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9, or 45, and the sum of the tens places is also 45. Therefore, each pseudotrace equals 10(45) + 45, or 495. There are at least two ways to see that the pseudotraces of this array all equal 505. First, notice that each entry in this array is exactly 1 more than the entry in the same row and column of M , in the previous problem. Therefore, each pseudotrace of this array will be 10 more (1 more for each of the 10 entries) than the pseudotrace of M . Therefore, every pseudotrace of this array must equal 495 + 10, or 505. The second solution method uses the strategy of problem 1. In this array, the entry in row i, column j , will be of the form 10(i 1) + j . Since each i and each j can get used exactly once, every pseudotrace will equal [10(0)+10(1)+10(2)+10(3)+10(4)+10(5)+10(6)+10(7) +10(8) + 10(9)] + (1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + 10), which equals 450 + 55, or 505. Using summation notation, the computation goes like this:
10 i=1

2.

Teachers note: If students need a review of sums of the form

n

10(i 1) +

10

10

j =
j =1 i=1

10i
10

10

10

10 +
i=1 j =1 10

j
10

k, see the Triangular

k=1

numbers problem set, which derives the formula

= 10
i=1

i 10

1+
i=1 j =1

k=
k=1

= 10

10(11) 10(11) 10(10) + 2 2 = 550 100 + 55 = 505

c EDC 2002

n(n + 1) . 2

Problems with a Point: August 9, 2002

Can you nd them all?: Solutions

3. (a)

Number the rows (starting at the top) and columns (starting at the left) 1 to n. The entry in row i, column j , will equal (i 1)n + j . Then the rst three entries of the last row will be (n 1)n + 1, (n 1)n + 2, and (n 1)n + 3, which can also be expressed as n2 n + 1, n2 n + 2, and n2 n + 3. (b) As shown in part (a), the entry in row i, column j , is (i 1)n + j . Since each row and column has exactly one representative in any pseudotrace, each i and j gets added exactly once in the sum, so every pseudotrace equals
n i=1

n(i 1) +

j =
j =1

ni

n+
i=1 n i=1

j
j =1 n

i=1 n

= n
i=1

in

1+
j =1

n(n + 1) n(n + 1) n2 + 2 2 n2 (n + 1) 2n2 + n(n + 1) = 2 3 2 2 n + n 2n + n2 + n = 2 n3 + n = , 2 = n which can also be expressed

n(n2 +1) . 2

Problems with a Point: August 9, 2002

c EDC 2002