Sponsored by: UGA Math Department and UGA Math Club

Written test, 25 problems / 90 minutes

WITH SOLUTIONS No calculators are allowed on this test. 10 points for a correct answer, 0 points for an incorrect answer, and 2 points for an answer left blank.

Easy Problems

Problem 1. The star below is drawn on the standard rectangular grid on which every square has size 1 by 1. What is the area of the star?

(A) 26.5

(B) 27

(C) 27.5

(D) 28

(E) None of the above.

Solution. First way. Just cut into triangles and count their areas separately. Second way. Use Picks formula: the area of a polygon with vertices that have integral coordinates is given by the formula B A = I + 1, 2 where I is the number of integral points in the interior and B is the number of integral points on the boundary, including the vertices. We get: 14 A = 22 + 1 = 28. 2

Problem 2. The Fibonacci numbers 1, 1, 2, 3, 5, 8, 13, 21, 34, . . . have the property that every number of this sequence, starting with the third, is the sum of two previous numbers (for example, 8 = 5 + 3). What is the greatest common divisor of the 2004th and 2005th Fibonacci numbers? (A) 1 (B) 2 (C) 3 (D) 5 (E) None of the above

Solution. Let (a, b) denote the greatest common divisor of a and b. We have: (F2005 , F2004 ) = (F2004 + F2003 , F2004 ) = (F2003 , F2004 ) Therefore, (F2005 , F2004 ) = (F2004 , F2003 ) = (F2003 , F2002 ) = = (F2 , F1 ) = (1, 1) = 1

Problem 3. As has been recently discovered, there are three types of amoebas on Mars: types A, B and C. It is also known that if two amoebas of

dierent types fuse together, they form an amoeba of the third type (for example, a type B amoeba and a type C amoeba fuse to form a type A amoeba). After a certain time, there remains only one amoeba. If originally there were 20 type A, 21 type B and 22 type C amoebas, what type is the last remaining amoeba? (A) A (B) B (C) C (D) The answer is not uniquely determined. (E) More than one amoeba must remain at the end (for example, if two type A amoebas remain, no more fusion can occur) if one begins with the specied numbers. Solution. If all of the type A amoeba fuses with all but one of the type B amoebas, there remains one type B amoeba and 40 type C amoebas. Now, the type C amoebas can alternatingly fuse with type B and type A amoebas until only one amoeba remains, of type B. The arguments below demonstrate that the answer is uniquely determined. Second proof. However the amoebas fuse, the parity (even/oddness) of the number of type A amoebas plus the number of type B amoebas remains constant. We can argue similarly for types B and C, and C and A. Thus, in the end, the remaining amoeba must be of type B. This argument also demonstrates uniqueness. Third proof. Consider the Klein-four abelian group V4 = {0, a, b, c} with the following addition rules: 0+a=a a+a=0 a+b=c 0+b=b b+b=0 b+c=a 0+c=c c+c=0 c+a=b

We notice that because of this last property, we need simply to simplify 20a + 21b + 22c in V4 ; but 20a = 20b = 22c = 0, so 20a + 21b + 22c = b.

Problem 4. x + (A) 7

1 1 = 3. What is x4 + 4 ? x x (C) 47 (D) 81 (E) None of the above

(B) 9

Solution. x2 +
4

1 = x2

x+
2

1 x

2 = 32 2 = 7
2

1 x + 4 = x

1 x + 2 x

2 = 72 2 = 47

Problem 5. Let f (n) = n3 and dene the function g (n) by the formula g (n) = f (n + 1) f (n) What is the average of the 10 numbers g (0), g (1), . . . , g (9)? (A) 64 Solution. g (0) + g (1) + + g (9) = (f (1) f (0)) + (f (2) f (1)) + + (f (10) f (9)) = f (10) f (0) = 103 03 = 1000, so the average is 1000/10 = 100. (B) 81 (C) 95 (D) 105 (E) None of the above

Problem 6. Let P (x) be a polynomial such that P (x) What is |P (1)|? (A) 0 (B) 1 (C) 2 (D) 3 (E) 4
2

= 1 2 x + 5 x2 4 x3 + 4 x4

Solution. Do not try to nd P (x)! Instead, note that P (1)

2

= 1 2 + 5 4 + 4 = 4,

so |P (1)| =

4 = 2.

(However, if you do try to compute P (x), you should nd that P (x) = (2x2 x + 1).)

Problem 7. On the picture below, the diameters of the three semicircles are sides of the right triangle ABC . The angles A and C are 45 degrees each. B 1 A Find the shaded area. (A) 1 Solution. B 1 A 1 O 1 C (B) 1 2 (C) 4 (D) 2 (E) 3 1 2 1 1 C

The lengths of the diameters AC and AB are 2 and 2 respectively. Hence, the area of the half-circle with diameter AC equals twice the area of the half-circle with diameter AB . The left half-circle and the left quarter-circle have the white region in common. The same is true for the right side of the picture. Therefore, the light-shaded area is the same as the dark-shaded area, and the latter obviously is 1.

Problem 8. A circumscribed hexagon has sides 2, 3, 5, 7, 9 and x in clockwise order. What is x?

(A) 2

(B) 4

(C) 6

(D) 8

(E) None of the above

Solution. We claim that the sum of the 1st, 3rd and 5th sides equals the sum of the 2nd, 4th and 6th. Indeed, at every vertex of the hexagon there are two equal intervals from this vertex to the points of tangency, one of them appears in the rst sum and the other in the second sum. So, 2 + 5 + 9 = 3 + 7 + x and x = 6.

Problem 9. What is the last digit of 77

77

(A) 1

(B) 3

(C) 5

(D) 7

(E) 9

Solution. The last digits of powers 70 , 71 , 72 , . . . are 1, 7, 9, 3, 1, 7, 9, 3, . . . . Therefore, to nd it, we only need to determine 77
7

mod 4

But 70 , 71 , 72, . . . modulo 4 are 1, 3, 1, 3, . . . . Since N = 77 is odd, 7N = 73 mod 10 = 3 mod 10.

Problem 10. There are 8 empty chairs in a row. In how many ways can one seat 3 people so that no two of them sit next to one another? (A) 20 (B) 24 (C) 56 (D) 720 (E) None of the above

Solution. There will be 5 empty chairs. Between them and at the ends = 20 (so, in 6 possible positions) one can sit one person. So, there are 6 3 possibilities. P.S. The way the problem is written, 6 20 = 120 is also a correct answer, if one takes into account the 6 = 3! dierent orders in which 3 people can sit.

Medium Problems

Problem 11. What is (1 + i)11 ? (A) 16 + 16i (B) 16 + 16i (E) None of the above Solution. (1 + i)11 = (1 + i)2
5

(C) 32 + 32i

(D) 32 + 32i

(1 + i) = (2i)5 (1 + i) = 32i(1 + i) = 32 + 32i

Problem 12. In a mythical country people have only two kinds of coins: 7 and 9 cents. What is the largest amount that cannot be made using these

coins? (A) 38 (B) 40 (C) 47 (D) 48 (E) None of the above

Solution. For two coins with relatively prime values a and b the minimal impossible amount is abab = (a1)(b1) 1, and this is called Sylvesters theorem. The proof is as follows. It works for any relatively prime a and b but we will only write it for 7 and 9 for simplicity. Write all the nonnegative integers 0, 1, 2, etc., in rows, 7 in each row: 0 1 2 3 4 5 6 7 8 9 10 11 12 13 ... Since 0 is divisible by 9, it and all numbers below it can be obtained with our coins, so cross out all this column out. Next, cross 9 and all numbers below it, 18 and all numbers below it, etc. Now notice that the rst 7 numbers: 0, 9, 18, . . . , 9(7 1) are all in dierent columns because 7 and 9 are relatively prime. Therefore, the largest number not crossed out will be right above 9(7 1); in other words, it will be 9(7 1) 7 = 9 7 9 7 = ab a b.

Problem 13. The Fibonacci numbers f1 , f2 , . . . are 1, 1, 2, 3, 5, 8, 13, . . . (every number is the sum of the previous two). Find
n=1

fn 2n

(A) 1

(B) 2

(C) 3

(D) 4

(E) None of the above

Solution. Let the sum be S and set f0 = 0. Then

S=
n=1

fn

1 2

1 fn + 2 n=2

1 2

1 = + (fn1 + fn2 ) 2 n=2 =

1 2

1 1 1 1 3 + (S 0) + S = + S 2 2 4 2 4 Solving for S gives S = 2. Second proof. The generating function for the Fibonacci sequence is x fn xn = 1 x x2 Plugging in x = 1/2 we get 1/2 =2 1 1/2 1/4

Problem 14. How many times during a day (24 hours) do the hour hand and the minute hand on the clock point in opposite directions? (A) 2 (B) 22 (C) 24 (D) 20 (E) None of the above

Solution. We will nd the number for the period of 12 hours and then multiply the answer by two to get the answer for the 24-hour day. Let 0 x < 12 represent the hours (it need not be integral, f.e. 1 hour 25 minutes means that x = 1 + 25/60). Then the minute hand points at y = 12x mod 12. Our condition says that the following condition must be satised: y = x + 6 mod 12, 11x = 6 mod 12 i.e., 12x = x + 6 mod 12

This equation has 11 solutions: 6/11, (6 + 12)/11, . . . , (6 + 10 12)/11. For the 24-hour day, we obtain 2 11 = 22 solutions. Alternative solution. Evident solution at 6:00. We get another solution 12 1 12 12 12 before or after (since = 1+ ); and after that, etc.; 11 either 11 11 12 11 11 solutions in all.

Problem 15. Take a random irrational number such as = 3.1415926535 , and add up the rst k digits after the decimal point. For example, with k = 5, 1 + 4 + 1 + 5 + 9 = 20. What is the probability that, for some k , this sum is 2005? The answer is closest to: (A) 0 (B) 1/10 (C) 1/9 (D) 1/5 (E) 2/9

Solution. Every time you add a nonzero digit, it is one of the digits 19. As a result, the average step of the partial sums is 5. Thus, the density of the numbers which occur as partial sums is 1/5. Notice that we must ignore the digit 0, as otherwise we would be doublecounting in the density argument.

Problem 16. Which of the following numbers can not be written as a difference of two perfect squares? (A) 20,000,002 (B) 20,000,003 these (E) More than one of these (C) 20,000,004 (D) None of

Solution. A number that is equal to 2 mod 4 cannot be written as a dierence of two perfect squares. Indeed, every perfect square equals 0 or 1 mod 4, so the dierences can be 0 and 1 mod 4. For an odd number n = 2k + 1, we have 2k + 1 = (k + 1)2 k 2 . For a multiple of 4, n = 4k , we have 4k = (k + 1)2 (k 1)2 . The three numbers above are equal to 2, 3 and 0 respectively mod 4; so

only 20000002 is not a dierence of squares. Second Proof. Notice that n = x2 y 2 = (x + y )(x y ) and that the numbers x + y and x y have the same parity, i.e., both odd or both even. Vice versa, if n = pq and p, q have the same parity then p = x + y and q = x y , if we take x = (p + q )/2 and y = (p q )/2. Any odd number can be written as a product of two odd numbers, f.e. n = 1 n. Any number divisible by 4 can be written as a product of two even numbers, f.e. 4k = 2 2k . A number that equals 2 mod 4 obviously cannot be written as a product of two odd numbers, or of two even numbers.

Problem 17. Compute 1 1! + 2 2! + 3 3! + + 7 7!

(A) 40,019 of the above

(B) 40,119

(C) 40,329

(D) 3,528,799

(E) None

Solution. Notice that (n + 1)! n! = (n + 1)n! n! = n n! Therefore, the sum above is (2! 1!) + (3! 2!) + (8! 7!) = 8! 1! = 40320 1 = 40319 since 2!, 3!, . . . , 7! cancel. (Sums like these are called telescoping sums.)

Problem 18. How many numbers between 1 and 2004 are relatively prime to 2005 (i.e., the two numbers have greatest common divisor 1)? (A) 800 (B) 805 (C) 1604 (D) 2000 (E) None of the above

Solution. The function in question is called Eulers function (n) and its main properties (prove them!) are 1. (ab) = (a)(b) if a and b are relatively prime, 2. (p) = p 1 if p is a prime number 3. (we dont need this one) (pk ) = pk pk1 if p is a prime number. Now, 2005 = 5 401, and both 5 and 401 are prime. So, (2005) = (5)(401) = 4 400 = 1600

Problem 19. When you divide the polynomial x2005 + x + 2 by x2 1, what will be the remainder? (A) 2x 2 the above (B) 2x 2 (C) 2x 2 (D) 2 (E) None of

Solution. x2005 x2003 is divisible by x2 1, and so is (x2005 x2003 ) + (x2003 x2001 ) + (x3 x) = x2005 x Hence, remainder will be x2005 + x + 2 (x2005 x) = 2x + 2 Alternative solution. x2005 + x + 2 = q (x)(x2 1) + (ax + b) for some a, b R. Substituting x = 1 and x = 1, 0 = a + b, Solving, we obtain ax + b = 2x + 2. 4=a+b

Problem 20. Two ships move with constant speeds and directions. At noon, 2 p.m., and 3 p.m. respectively the distance between them was respectively 5, 7, and 2 miles. What was the distance between them at 1 p.m.? (A) 6 (B) 10 (C) 50 (D) 56 (E) None of the above

Solution. Note the following: since x- and y - coordinates of the ships are linear functions of time t, the square of the distance between them by the distance formula is a quadratic function of t: d(t)2 = at2 + bt + c Substituting t = 0, 2, 3, we obtain t = 0 = c = 25 t = 2 = 4a + 2b + 25 = 49 t = 3 = 9a + 3b + 25 = 4

Solving, we obtain a = 19 and b = 50. Therefore, d(1)2 = 56 and d = 56. P.S. It was pointed out to us that a = 19 is impossible, since this says that for t 0 the distance is going to be . Therefore, we also accepted None of the above as correct answer.

Hard Problems

Problem 21. Five points are placed on a sphere of radius 1 such that the sum of the squares of the pairwise distances between them are maximized. (There are 10 terms in this sum.) What is this sum? (A) 20 (B) 21 (C) 24 (D) 30 (E) None of the above

Solution. Place the points at the ends of unit vectors v1 , . . . , v5 . We need to maximize |v1 v2 |2 + + |v4 v5 |2 =
i<j

|vi vj |2 .

= 10 terms in the sum here.) But remember that (Note that there are 5 2 2 2 |v w | = |v | 2v w + |w |2, so |v1 + +v5 |2 +|v1 v2 |2 + +|v4 v5 |2 = 5 |v1 |2 +|v2 |2 + +|v5 |2 = 55 = 25. Thus, our sum is maximized when |v1 + + v5 |2 is minimized. This occurs when v1 + + v5 = 0, and so our sum has maximum value 25. (Note that we can arrange the points at the vertices of a regular pentagon, or, alternatively, with one point at the north pole, one at the south pole, and the remaining three at the vertices of an equilateral triangle on the equator.)

Problem 22. What is the 100th smallest positive integer that can be written as the sum of distinct powers of 3, i.e., 1, 3, 9, 27, . . . ? (A) 969 (B) 973 (C) 974 (D) 981 (E) None of the above

Solution. In base three, there are just the numbers that can be written using only 0 and 1. The 100th number can be found as follows: 100 = 64 + 32 + 4 = (1100100)2, and (1100100)3 = 729 + 243 + 9 = 981

Problem 23. Find cos 20 cos 40 cos 60 cos 80 .

(A) 1/16 above

(B)

2/24

(C) 1/12

(D) 1/8

(E) None of the

Solution. First of all, cos 60 = 1/2. Multiply the rest by sin 20 and use the formula sin x cos x = (sin 2x)/2. We get: sin 20 cos 20 cos 40 cos 80 = sin 40 cos 40 cos 80 /2 = sin 80 cos 80 /4 = sin 160 /8 = sin 20 /8

Hence, the product is (1/8)(1/2) = 1/16

Problem 24. Ten people are standing in line to buy movie tickets that cost $5. Five of them have only $5 bills and the other ve have only $10 bills. The cashier has absolutely no change, so a person with a $5 bill must come before a person with a $10 bill or else the sale will not happen. What is the probability that they will happen to stand in line just right so that all ten will be able to buy tickets? (A) 1/10 (B) 1/6 (C) 1/5 (D) 1/2 (E) None of the above

Solution. The number of possible ways to put n + n people the right way is called the n-th Catalan number Cn . Richard Stanley gives 130 interpretations for Catalan numbers in his Catalan addendum at http://math.mit.edu/ ~rstan/ec/catadd.pdf. The formula for the n-th number is Cn =
2n n

n+1

and the total number of ways to put n + n people with $5 and $10 bills in n line is 2n . So the probability of getting it right is 1/(n + 1), which for n = 5 gives 1/6. To prove that the formula for the n-th Catalan number is given by the above formula, consider the following interpretation: to each person, associate either +1 or 1. People with $5 bills receive a +1 and people with $10 bills receive a 1; we wish to arrange n (+1)s and n (1)s so that all partial sums are nonnegative. In other words, we wish to calculate the number of lattice paths beginning at (0, 0) and ending at (2n, 0) with steps of 1 (such a path is shown below using solid lines) that never dips below the line n y = 0. Clearly, this is simply the total number of lattice paths, 2n , minus the number of paths that touch or cross the line y = 1. It remains to count the number of such bad paths. n We claim that there are exactly n2 bad paths; to show this, we demon1 strate a correspondence between them and lattice paths of the 1 sort that

n because one must choose end at (2n, 2) (the number of which is n2 1 n 1 positions for 1s among 2n total 1s). Consider the rst time such a path (shown below using dotted lines) touches the line y = 1 and right of it, reect across the line y = 1; you obtain a one-to-one correspondence with paths from (0, 0) to (2n, 0) that touch or cross the line y = 1. n n n 2n 2n n 1 Thus, the n-th Catalan number is 2n n2 = 2n n+1 = n+1 . 1 n n

y = 1

Problem 25. Let (n) denote Eulers function, the number of integers 1 i < n that are relatively prime to n. (For example, (9) = 6 and (10) = 4.) What is the last digit of the sum (d )
d|2005

which goes over all (positive integral) divisors d of 2005 including 1 and 2005. (A) 0 or 1 (B) 2 or 3 (C) 4 or 5 (D) 6 or 7 (E) 8 or 9

Solution. Using the Gauss identity d|n (d) = n, the answer is obviously 5. Here is how to prove the Gauss identity. If n = pk is a power of a prime then (d) = (pk ) + (pk1) + + (p) + (1)
d|n

= (pk pk1 ) + (pk1 pk2 ) + + (p 1) + (1) = pk = n One of the main properties of (n) is that it is multiplicative: (nm) = (n)(m) if n and m are relatively prime. Now, note that the function

 (n) = d|n (d) is also multiplicative. So, once we have proved the identity (n) = (n) for powers of primes, we have also proved it for their products, i.e., for arbitrary positive integers.

Authors. Written by Valery Alexeev and Boris Alexeev c 2005, with assistance by Ted Shifrin and Mo Hendon. Some problems were taken from N.B. Alfutova, A.B. Ustinov Algebra and number theory for mathematical schools published by Moscow Center for Continuing Mathematical Education, 2002.