A Collecfion of Methematical Olympiad Problems : PART 2 Nine Mothematical Olympiad Problems Konclantine Zelator University of Wisconsin, Marinette Compus UW- Moyinette Dept. Mothemotecs 150 W. Bay Shove Street Marinette, WI 54143 USA Also. Konstontine published by ; Yhe Canadian Mathematical Souiely 3 and which specializes in problem — Sdving . The nine problems in this documents are designated OPL through OP2. Cris document is 25 pages long (not counting the cove? page)oPh Moech 2014 Issue of Crux Mathenalicorum 87 Hence, 5 ie take £12k — 2,k € Z and, therefore, the smallest positive integer satisfying this equation is m= 10. So, a necessary condition isn > 10. et 2 = cos % 4 isin F and m= 10 then 29 con OF 4. nin 0% = 00s SF 4 isin fF = 3-8. = et sin € 3 t+isin= 3 3° ou ie Fy 2% = cos BE + isin Wt = Ei and Vie"! = $- MBp =a 4 3 - fe “Phas, the Jeast positive intoger m such that /B2™* root with [2] = 1 is 10. O has a complex 5. Let py denote the k"* prime number. Find the remainder when yo is is divided by 2550. Solved by Konstantine Zelalor, University of Pittsburgh, Pittsburgh, PA, USA rst we factor 2550 into prime powers: 2550 = (255)-(10) = 5-51-10 = 5+8-17+2-5, So, we easily soe that 2550 = 2-3-5? +17. a) First, note that pa = 8, pa = 5, and pr = 17, We will rst find the congruence classes the three integers pi, pRE™?, and p¥"~7s belong, to modulo 2550. We start with pi?" at . tently 3® = 0 (mod 3) and 3° = 1 (mod 2) @) By Fermat's Little Theorem, 3¥ (3) Consider 38° modulo 5? = 25. First 1 (mod 17); and so 3 1 (mod 17). @) 1 (mod 25). So that, 22) 20)" sary = Gay = (4 (4-4) = (258)(-4) = 6-(-4) 1, (mod 25) 4)@ Mach 20H Issue 88 Altogether we have, from (2), (3), (4), that { 38 = 1 (mod 2), 389 = 1 (mod 17), } 6 3% = 1 (mod 5%) and 3®° = 0 (mod 3) : Since 2,17,5? are pairwise relatively prime; (5)_ shows that 38° — 1" = 0 (mod 2-57-17) = 1 (mod 2-5?-17). ‘Thus, 3° = 2.52.17. #41, for some positive integer k. Since k = 3+ k’ +r where + € {0,12} and k’ € Z+, and since 3° = 0 (mod 3) and 42-52-17 = 2-1-2545 1 (mod 3) we soe that 2 = 2eastaree pace ater bt | = r+1 = 0 (mod 3) sor =2. Thus, | 38 = 2.365717 k $2.57. 17- 241 | 2550+ £! + 170041 = 2550-k! +1701 wwe have shown that 38 = 1701 (mod 2550) Pa = 3 pF? = 1701 (mod 2650). © Next, consider pi 5024 = g(57-2)(07 1) 52620, Clearly 5 = 1 (mod 8) (since 5? = 1 (mod 3); 5% = 0 (mod 5*); 5° = 1 (mod 2); and gt gata ge2sas _ (61687 = 199 = 4 (mod 17) by Fermat's Theorem. We see that 56% = 1 (mod 3), 5° = 1 (mod 2), 5° = 1 (mod 17) which implies that 59% = 1 (mod 2+3+17) so 5% = 2.3. 17- 1+ 1 for some positive integer L. Observe that 2+ 3+ 17 = 6(—8) = —48 = —(~2) (mod 26). And so, 5° = 2-3-17-L-+1= 21-41 (mod 25). But 5° = 0 (mod 25); and s0 we must have 2+ 1 = 0 (mod 25) <1 = 12 (mod 25); T= 25-1412; for some E € Z*. Thus, 50M 2.3.17. (25L-412) +1 171241. And 90, 59 = 2-3- 17-12-41 = 1225 (mod 2850) ps = 5, pei"? = 1225 (mod 2550) @ Next consider py = 17. We have, PT 2 yt yar 41) 71018200,March 2044 Issue 80 And y7i638290 = 1 (mod 2) and 1716-18-200 1 (mod 3) (since 17? = 1 (mod 3)) And also, 17278290 = 9 (mod 17) Consider 171698200 modulo 5? = 25. Observe that, 17? = 280 = 275-4145 14 (mod 25); or equivalently, 17? = —11 (mod 25) a6 = (a’)® = (-11)* = ((-1)"]* = (21)* (-4)* = 286 = 1 (mod 25). [(a7)9p220 = 118200 = 1 (mod 25). We have {e480 = 1 (mod 2), 17163820 = 1 (mod 8), and 1768290 = 1 ‘mod 52), which implies that a7!0482H = (mod 23-52); and so 173618200 — 2.3.52. m +1; for some m € Zt. And since 2+ 3+ 263-25 = 2-3-8 = 2-3-8 = 48 = —3 (mod 17). We soe that we must have 2+ 3+ 5?+m-+ 1 = 0 (mod 17); —3m +1 = 0 (mod 17); 3m = 1 (mod 17); m = 6 (mod 17). So that ms = 6 +17 - Mj for some M © 2+ Altogether, And. thus 1768-200 pres 9.3.52. (6- 417M) +1 2:3-07.17-M +2-3-57-641 = 2550M +901 asso baaly We have shown that, pr = 17, — ph?! = 901 (mod 2550) (8) ‘We now come to the Inst part of the problem by considering py ke > Band -¥ 2,3,7, In other words, pe ¥ 8,5, 175 and py > 2 Since pris odd we have p= 1 (mod 8); from which it follows ph = 8+ 1; aind square both sides) that pk = (mod 16). © By Fermat's Little Theorem, we also have (since Pe # 5), pf = 1 (mod 5). (10) From (9) sind (10) it follows that 0 (mod 16-5); = 80%, for some positive integer t. ay ‘rns, BE? = ps whieh implien { pio = 1 (mod 2), pt = 1 (mod 3), ) and (by Bermat’s Little Theorem since 80 is divisible by 16) } (12) { arn: }Movdh 2014 Issue - Now, consider pi modulo 25. Since py is not Pa = 5-4 + 7; where g is a positive integer Pk = (5q-+1)®, Since both 20 and 59 are di binomial expansion (8g + r)?° every tori, 25; thus pi? = (Sq +r) = +2 mod 2h Whea r= (mod 25) 27 = (29). 23 = (G4)8. 92 Aivisible by 5; we have and 7 = 1,2,3, or 4. Consider visible by 5; it is clear that in the except for the last one; is divisible by 11) 27 (-16)(-11) (81) (22)(11) - (~6) (-6)5 = (—6)? . (6)? PF (36)(36) - (~6) = '121)(—6) = (—4)(—6) (mod 25), When r= 4; 720 in all eases; r?° ='31 (mod 25). (mod 25). And so, 1 (mod 25). We see that (59 + r)?0 = 20 Therefore 230 Pi = (41) = 1 (mod 25) (a3) pi = 1 (mod 28). trom (13) and (12), itis clear that for ke 3 2,37 Pee = pi" = 2 (mod 2-3-52- 17) wT PN 2 1 bined 2500) 2) om ‘Thus, in the sum D422? aE", every term with is # 2,3,7; is congruent to 1 modulo 2550 by (14). ‘Phere are (2550 ~ 2) +1 — 3 2550 — 4 such torms. We have 2580 Dove = pl 4, pe Ss + PFO" + (2550-4) 1 0 (mod 2580) 1701 ++ 1225 + 901 4 ( 3550 ) +1 by (6), (7), and (8) 9823 = 25504 1273 1273 (mod 2850) Conehision: ‘The remainder is 1273, 7. A vriangle has perimeter 2s, inradius 7, and the dist the vertices ‘anee from its ineenter to BF Ha, 8p and 8. ProveMor, 20 Issue Solved by Oliver Ceupel, Brill, NRW, Germany; and Titu Zvonaru, Coménesti, Romania. We give Geupel’s solution. ZBAD and tan gy and Without loss of generality let AD = 1. Lot denote yr 2 = £CAD, where pryea € [0,4/2). It holds BD = BE DE = 2singy, Hence Sapp = i tang, and BD-BE___sovitewer 1 /1__,) + BD+BB)~ sing, + tang) 2 \cosps 4 an ge and ra = 3 ( |—2— ~ —1_|. since tan 2 and — are prove iat an tan al> est ~ soral = oth increasing for 0 < a < 1/2, the terms tan y;—tan ye and aa a have the same sign. It therefore suffices to prove tang; — tango This plies (1) and the proof is complete. oP2 OP2 8. Let n be a natural munbes, w 32. Prove that if oie postive intogerB thon ns prime oT is a prime power for Solved by Konstantine Zelator, University of Pittsburgh, Pittsburgh, PA, USA. Assume that, [f ph bv = 1 = pk. (b—1) { where p is a prime number, @ 1b, k positive integers such that m > 2 and b> 2 J First, we will treat the case in which p equals 2. This is done in Case 1. In Case 2, p > 3; the proof splits into three subeases. Case 1. p = 2. ‘We have, by (1), 2; or equivalent) > pyar } @) va { wr Pot EL Te follows from (2) that b nmust be odd and m even; since there are n terms, with each term being an odd number; in the sim O°! 4 O-2 40.45 +1, Thus n=a ; where Lisa positive integer 5) { tive integer. } 2)