Вы находитесь на странице: 1из 2

Lenarz Math 380

Homework # 1

Due: Friday, Sept. 9

1. Use de la Loub`res method to construct a magic square of order 9. e

Solution:

47 57 67 77 6 16 26 36 37

58 68 78 7 17 27 28 38 48

69 79 8 18 19 29 39 49 59

80 9 10 20 30 40 50 60 70

1 11 21 31 41 51 61 71 81

12 22 32 42 52 62 72 73 2

23 33 43 53 63 64 74 3 13

34 44 54 55 65 75 4 14 24

45 46 56 66 76 5 15 25 35

2. Show that the result of replacing every integer a in a magic square of order n with n2 + 1 a is a magic square of order n.

Solution: Let a1 , a2 , . . . , an be the numbers in the ith row of a magic square of order n. Then we know that n n(n2 + 1) aj = 2 j=1 Replace each aj with n2 + 1 a. Then the ith row is now the numbers n2 + 1 a1 , n2 + 1 a2 , . . . , n2 + 1 an and the row sum is (n2 + 1 a1 ) + (n2 + 1 a2 ) + + (n2 + 1 an ) = n(n2 ) + n(1) (a1 + a2 + + an ) = n(n2 + 1) (a1 + a2 + + an ) n(n2 + 1) 2 = n(n + 1) 2 n(n2 + 1) = 2 So the row sum is still equal to the magic sum. This works for every row and by a similar argument, works for every column and both diagonals. Since the map a n2 + 1 a is one-to-one, each number 1, 2, . . . , n2 occurs exactly once in the array. Thus the result is still a magic square.

Math 380

HW # 1

Page 2

3. Let n be a positive integer divisible by 4, say n = 4m. Consider the following construction of an n n array: (i) Proceeding from left to right and from rst row to nth row, ll in the places of the array with the integers 1, 2, . . . , n2 in order. (ii) Partition the resulting square array into m2 4 4 smaller arrays. Replace each number a on the two diagonals of each of the 4 4 arrays with its complement n2 + 1 a. Verify that this construction produces a magic square of order n when n = 4 and when n = 8. (It actually works for all n divisible by 4.)

Solution: For n = 4

16 2 3 13 5 11 10 8 9 7 6 12 4 14 15 1 64 9 17 40 32 41 49 8 2 55 47 26 34 23 15 58 3 54 46 27 35 22 14 59 61 12 20 37 29 44 52 5 60 13 21 36 28 45 53 4 6 51 43 30 38 19 11 62 7 50 42 31 39 18 10 63 57 16 24 33 25 48 56 1

For n = 8

Page 2

Вам также может понравиться