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)Mocs 2041 Isrue 96 By (2) and (3) we have, baa = (6-1) & G-NUF) = 2-0-2). Since b is odd; the mmbers 6! — 1 and b +1 are consecutive even integers; their greatest. common divisor is 2: Waal) = 2 3) IfL= 1, then n = 2-1 = 2, which is a prime (and b = 2* — 1). 12 > 2 thon ve (b= 1)- (4? ++b+1). (8) By (A) and (6) we obtain, (b= 1) 4 UF ++ O41 - (HO +1) = A- 1); (WM 4 UH +1) (B41) = 2k, @ since b is greater than 2; in fact b > 8, sinew b is odds and > Ench of the Inctors on the lefthand side of (7) is greater implies that { a and Bf 1 se 235 with fy, he posit Also, bP EOF EET = WM -(D— 1). (9) Since ky > 2, kta > 2; (8) and (9) show that 4 nmist be a common divisor of BF 1 and 6! $1, contrary to (5) Case 2. p is an odd prime, p > 8. Recall from mumber theory that if p is an odd prime and @ an integer not divisible by p, then the order of a modulo p is the least positive integer K such that a = 1 (mod p). When a = 1 (mod p); then obviously the order of a modulo p equals 1. Otherwise the order of a is > 2. The following Lemma is ‘well-known inv nnmber theory and easily provable by using the division algorithnn Lemma 1. Let p be an odd prime; and b a positive integer not divisible by p, such that b # 1 (mod p). If m is a positive integer, such that 6™ = 1 (mod p), then ma is divisible by d, a | m, where dis the order of b modulo p: d > 2. Since by Fermat's (Little) Theorem, 0"! = 1 (mod p). We have the following corollary of Lemma 2. Lemma 2, Let p be an odd prime; b € Z+, b # 0,1 (mod p). ‘Then the order of b modulo p is a divisor d > 2 of p— 1 Back to the problem, Subease 2a, Assume that b (nod 7) | | t i i |March 20M We will prove that this case is impossible, it leads to a contradiction ‘regatdless of whether n is a prime or not, From b= 1 (mod p) and (1) we have { Pog bp tbl = ph = TS } and b = pot 1, for some positive integer t. (0) Since b = 1 (mod p); b"~ wwe have, i 1 (mod p). And so by (10) L+it +1 = 0 (mod p); any Glently, since n > 3 and b= p-t-+ 1, we have DFO DEDEL 2 EDEL (ptt1 P+ (ptt +) > Pp? which shows that we must have k > 3 in (11). Now, bh a1 = ph 1) (Pet M1 = PH) Expanding with the binomial expansion yields e +(," )oo+t T= phen (12) Let pf be the highest power of p dividing (see (11)); and p* be the highest power ‘of p dividing t. ‘Then n = my -p!, t= tr-p®, f 2 Lande 2 Oand n-th ZO (mod p). ‘The highest power p dividing the left hiand side of (12); is the highest power of p dividing the term (,",)p-t = m-p-t= ny +t, -p/*e42, The right hand side is ph? .t = p*¥4+¢ Thus, we must have 1+ f +e = k-+ 1+ e and 50 f = kj n= ny «pe, IC we look at the term (pt) (Jeft- hand side of (12); (pt) = p™-t™ = p™ *.gavp* > pitt, since t > 1 and naip* > p> k+l, in view of p > 3 and & > 3, We hiave a contradiction to (12) cor + (Soot + In subeases 2b and 2c below; we argue by contradiction. We assume that & £1 (mod p) and n to be a composite mumber > 4, and wo show that this leads to a contradiction. Observe that a composite number is either a prime power with exponent at least 2; or otherwise it has two distinet prime bases in its prime factorization, Subcase 2b. Assume that b # 1 (mod p); and n > 4 has at least two prime bases in its prime factorization into prime powers. ‘This then implies that we can write, ( m= nism > 4 (actually 6) } with L (b™ = 1 (mod p) and 6"? = 1 (mod p)). By Lemna 1, both ‘ny and ng must be divisible by the order p of b modulo p; since b # 1 (mod p); wwe have p > 2. And 2

2, where q is a prime number Since j > 2, b" — Lis d Indeod, ble by bf” ~ 1; and hence by b” — 1 as well oe a a we rye 1a" )e 1 = (of = 1), 52 -{ (OF 1) (OPP A f+) Ha, TF D3. } 0) In either (j = 2 or j > 8) case, from b" — 1 = p*. (b— 1); alter the cancelation of the factor b — 1 from both sides of the last equation; it follows that. b7- + orF + b+ 1 must be a power of p. Indeed, since oats NTH 1 = OGY +e EOE (=O be DE DONT bee $ OTE T,Movda 20 (seve thus, B94 +++ 4.641 = p> for some positive integer A. And hence bt 1 = pr-(b~1) + = 1 (mod p). (a9) By Lemma 1, (19) implies that the order dof b modulo p must divide q: 2 < d| q. But q is @ prime and therefore it follows that d= q. The order of b modulo p ‘must equal the prime q. Hence, by Lemma 2 it follows that 0 (mod 4). (20) Recall from (18) that 6%” — 1 is a factor of ” — 1. pol o” —1 = (6% —1)-N, N a positive integer and b"- 1 = p*(p—1) ‘Thus, (of =1)-N = ph (- 5 (7 =1).N = phe (b-1)5 (Ott) [OE OTE] = pt-(-1); eo toe) (OT $e OEIC 4 OTE LY = ph en) So each factor (on thie left: hand aide of (21) annst be a power of p: (YT ee OED py’, wl. (22) By (19) and (22) we deduce that LtL de +1 = 0 (mod p) > 9 (mod p); (23) and since p and q are both primes; (23) implies p = q. But (20) then implies p~1=0 (mod p), an impossibility. 4. In square ABCD the points E and F are chosen in the interior of sides BC and CD, respectively. ‘The line drawn from F perpendicular to AX passes through the in- tersection, point G of AZ and BD. A point IK is chosen on FG such that |AK| = [EF Find ZEKF. B Solved by Miguel Amengual Covas, Cala Figuera, Mallorca, Spain; Michel Bataille, Rouen, France; Geoffrey A. Kondall, Hamden, OT, USA; Bruce Shauyer, Memo- rial University of Newfoundland, St. Jolin’s, NL; Konstantine Zelator, University of Pitishurgh, Pillsburgh, PA, USA; and Titu Zeonaru, Coménest, Romania. We give the solution of Amengual Covas.OP3 April 200 Asse of Crux Mathematicoram 154 (a) m= 49-2, m4 1 = 4" 44; or (b) mp1 249, maa pL UF (a) holds then @ = 2y— 1 and z = 297-74 1. IF (b) holds then we obtain gtv-3 9220-1 oy ‘The solution of (8) is (24 y) = integer Hence the solution set in positive € 2} U{(k, 2k 1,27 2) which is inadmissible because z is not an tegers of this oquation is “ThA ke Zt}, {(2k = 1,6, 28 $1 where Z+ is the set of positive integers. 4. Find all pairs (ps4) of pres such that p? + g? + 1 is divisible by pa. Solved by Konstantine Zelator, University of Pittsburgh, Pittshuryh, PA, USA. Snppose that (p,q) is such a pair of primes. Then, ( prtat+1 = ka } { for some positive integer } a) p and g are primes. Since equation (1) is symmotrie with respect to p and gj and sinee p # @ (by inspection, p = q would imply p | 1). There is no loss of generality in assuming, p<@ @) ‘We distinguish between two cases: Case 1, in which p and g are both odd primes; and Case 2 wherein, p = 2 and q is an odd prime. Case 1.’ p and q are both odd primes. ‘Thus, by (2) we must have BS p 3 ‘Next, consider the case in which the order n (of q modulo p) is q or 2g. We know from Fermat's Little Theorem that @* = 1 (mod p). By Lomma I, the order n (= q or 2q) must divide p ~ 1. Since p — 1 is even and is q odd; we soe that in either case 2q must divide p: therefore P—1 = 2q-t, for some positive integer t p= %Wt+1 > a which contradicts (3). ‘There remains only one possibility to consider: the order m (of q modulo p) is equal to 2. 1 (mod p) « (a ~ 1)(a+ 1) = 0 (mod p) q= 41 (mod p)(since pis prime). (6) ‘The case q = 1 (mod p) has already been examined above (this was done in the case order n= 1). So, then suppose that q = —1 (mod p), q = pv, ve Dv22 G We go back to (1) and this time we work modulo ¢ pP = 1 (mod q) = p” = 1 (mod g) which implies by Lemma 1 that the order f of p modulo q must be a divisor of, 2p. Thus, f = 1,2,p, or 2p. Once again, by Fermat's Little ‘Theorem, we know that the order f mmst divide g — 1 by virtue of p?-* = 1 (mod q). Hence, q-l=feu g=f-utl, where f =2,p, or 2p. (8)Apeil QOul Issue 186 Note that the possibility f= 1 is ruled out: if f = 1 then p = 1 (mod g) which implies (since both p and q are positive and > 3) that p > 9; contrary to @), If f = p or 2p, then combining (7) with (8) y implies (since f = p or 2p) that p divides 2; an impossibi Finally suppose that f = 2. Then, lds p-v — f-u = 2, which ty since p > 3. 1 (mod q) + (P~ 1)(p +1) = 0 (mod a) ‘and since qis a prime, we must have either p = 1-4 9-19 or p= —1-+4-w for Some positive integer w vwhich again contradicts te conditions in (8); for either possibility implies p > 9 (note thot in either case, w > 2). It is now clear that there are no edd primes p and q which satisly (1). Caso 2, p = 2 an q is an odd prime. From (1) we have, 274+ 97+1 = 2kq; a: (2k - a"). } Equation (8) lenny shows that ¢ | 8; and since q i a prime: we must have q = md 2k — aff = Ls 2k = 5° 4 1, thus k= BF = 313, Conclusion: ‘Taking into account. symmetry, here exist exactly wo pairs with the problem's property: (p.a) = (2,5): (5,2). 5. For the vertex A of AABC, let A’ he the point of intersection of the angle binwetor at A with side BC, and let &4 be the distance between the feet of the perpendiculars from A’ 10 the lines AI and C, respectively. Define €m andl Ler similarly, and let € be the perimeter of AABC. Prove that Solved by Arkady Alt, San Jose, CA, USA; Michel Bataille, Rowen, France; Prilhwijit De, Homi Bhabha Centre Jor Science Education, Mumbei, India; Geoffrey A. Kandall, Hamden, CT, USA; and Titu Zvonarw, Coménesti, Romania. We give Bataille’ solution. We adopt the standard notations for the elements of AABC and denote the orthogonal projections of A’ onto AB, AC by H, KX, respectively. Since the line segment, HC is a chord subtending ZBAC of the circle with diameter AA’, we have £4 = HK = AA' sin A, As it is well-known, the length of the bisector is given by AA’ sos A/2) 0 we obtain 2besin(A/2) acayoy _ 2besin(A/2) ta = REAL) 9 costa 2) = EE (04 Ve ae follows that ba 2: a) sin(A/2) e7 b+eoPy OPy April 2o\ [sue and Area of ACPA 1 3 (Area of ACDA) Hen, Area of AAMC+Aren of QCPA = = (Area of AABC + Area of ACDA) that is, 1 Area of AMOP = 5 (Area of ABCD) and we are done. ‘3. The number 916238457 is an example of a nine-digit number which contains cach of the digits 1 to 9 exactly once. It also has the property that the digits 1 to 5 occur in their natural order, while the digits 1 to 6 do not. How many such ‘numbers are there? Solved by Konslantine Zelator, University of Pitisburgh, Pittsburgh, PA, USA. 2 2a Be 24 Wy Bo 7 Be Eo DO@OOGOOOO } = (1,2,3,4,5,6,7, 8,9) 2:3-4-5-6-7-8-9 ninedigit numbers {ay Note that there are exactly 91 = with distinet nonzero digits, Let $ be the set. of all vine-digit numbers with distinct. nonzero digits ancl such that the digits 1 to 5 occur in their natural order, and m = n(S) = cardinality of the set. S. 39 Bay B56 ry ay wii 2S_4 5 DOOOOOOOO 284 5.6 mh 4 DO@QOOOOOOD Let S; be the sot of all nine-digit numbers with distinct nonzero digits and such that the digits 1 to 6 occur in their natural order, and m, = (Sy) = cardinality of the set. Sy Let S2 be the set of all nine-digit numbers with distinct nonzero digits and such that. the digits 1 to 5 occur in their natural order; but the (sumbers) digits 1 to 6 do not occur in their natural order; and ma = n(Sa) = cardinality of the set Sp, "Then $= $3 U $2 and $19 $2 = 0. Therefore, n(S) (Si) + (S2)s my + mat m = m=m. GQ® Apel Qo\\ sue 160 ‘To calculate m, observe that any five of the pesitions D through ® may be chosen; for any such choiee, the numbers 1 to 8 are placed in their natural order fn those positions. Moreover, for ench such choice of ive pastions; there axe 4 ‘ways to place the reoiainingg numbers 6 to 9, on the remaining four positions Hence, 6-7-8-9. Similarly, = 7-8-0. Hence by (1) my = mom, = 6-7-8-9-7-8-9 = (7-8-9)(6~1) 7-8-9-5 = 2520 Conclusion: There are exnctly 2520 such wmbers, 4. ‘Two touching circles $ and T share a common tangent whieh mects S at A and T at B. let AP be a diameter of $ and jet the tangent. from P to T touch it at Q. Show thas AP = PQ. Solved by Miguel Amengual Cowas, Cala Piquer, Mallorca, Spain; Geoffrey A. Kandall, Hamden, CY, USA; Konstantine Zelator, Universily of Pittsburgh, T, respectively. P is the radius O'B to the point of oO (O’B are parallel and the alteruate | eee ipo eceaeros mien a 4 PA? = PD-PB a)Moy oll \ssueoP Crux Mathematdcor um Ops “ © «4. Determine all pairs (a, 6) of pusilive integers such that 2a +1 and 2b— 1 are relatively prime and a + b divides 4ab-+ 1 Solued by David B. Manes, SUNY at Oneonto, Onconto, NY, USA; Konstantine Zelator, University of Pittsburgh, Pittsburgh, PA, USA; and Titw Zoonar, Coménesti, Romania. We give Zelator's vite-rp ‘Suppose that @ and b are positive integers such that. a + b | dab +1 and ged(2a+1,2b~ 1) = 1 "Then dab +1 = ks (a+b), a) for some positive integer k. From (2a + 1)(2b-+ 1) = 4ab+ 2(a +b) +1 and (1), we obtain (2a +1)(2b4+1) = (k+2)-(a+b) (2) Observe that a + b is relatively prime to 2a + 1. Indeed, if d is the greatest common divisor of a + 6 an! 2a -F 4, then d must be a divisor of any linear combination (with inteyer coefficients) of a +b and 2a-+ 1. In particular, d must. divide 2( + 6) — (2a + 1) = 2b—1. Ths d | 2a-+ Land d | 26— 1 and so, by the coprimenesss condition in (1), it follows that We have shown that, ged(a-+b,2a+1) = @) Euctie’s lemina in mnnber theory postulates that ifan integer divides the product, Of two other integers, and it is relatively prime to one of those (two) intagers, then it must divide the other one Clearly then, by Euctid’s lemma, (3), and (2), it follows that a + b must divide 2b 4+ 1. ‘Thus there exists a positive integer, m, such that 241 = m-(a+b) “ ‘We rewrite (4) in the form, meat (m—2)-b = 1 (6) Clearly, if m > 2, the lefthand side of (6) is greater than 1, since @ and b are ositive integers. Therefore m = 1, which yields,a~b = Landa = b+1. We have proven uhat if two positive integers a and b satisfy conditions (2), then a = b+ 1. The converse is also true. Indeed if a = b +1, then dab +1 = (b+ 1)b-+1 = (26-41)? = (a +8), which shows that a + b divides 4ab + 1, Moreover, we have 2a +1 = 2(b+1) +1 = 2643, which is relatively prime to 2b ~ 1, since if D = ged(2b — 1,26-+ 3). ‘Then D | ((2b +3) = (2b = 1)] = 4. But D is odd, since 2b ~ 1 and 2b + 8 are. Thus D Conclusion: ‘The pairs (a,b) = (b + 1,0), where b can be any positive integer, are the solution to this problem. regesense septembey Zot Inue of &® Crux Mathematicorum 280 Now we turn to solutions from readers to problems of the Olympiade Suisse de mathématiques 2008, tour final, given at [2009 : 82-83). 8. Soint ABC un triangle aign. Soient M et N des points arbitraires sur les ebtés AB ct AC respectivement. Les carcles de diamétre BN et CM se coupent en Pet Q. Montrer que les points P, Q et Porthocentre du triangle ABC se trouvent sur une droite. Solved by Miguel Amengual Covas, Cala Piguera, Mallorea, Spain; and Michel Bataille, Rouen, France. We give the write-up of Amengual Covas. Let , M1, and Q% the circles on BC, BN, and CM as diameters, respectively. Since 9 ond Mp intersect at P and Q, the line PQ is the radical axis of % and . Lot H denote the orthocenter of AABC and let U and V be the fect of the altitudes from B and C respectively Since ZBUN = ZBUC = 90°, both the circles @ and My pass through U. Hence the line BU is the radical axis of Mand My, Similarly, the line CV is the radical axis of @ and Mp. Since BU and CV intersect at I, the orthocenter of AADC is the radical center of 2, My, and M2. Hence H lies on the radical axis of % and Ma, that is, lies on the line PQ. ‘This completes the proof of the collinearity of P, Q and the orthocenter of AABC. As shown in the proof, the condition AABC acute is not necessary. ee Next we finish up the solutions to problems of the 55° Czech and Slovak Mathematical Olympiad 2006 given at (2009: 81-82), 6. (3. Svreek, P. Ca bee) Solve in rea numbers the systemn of equations 1,) 1 Oo) 1 Solved by Arkady All, San Jose, CA, USA; Konstantine Zelator University of Pitishuryh, Pittsburgh, PA, USA; and Tilw Znara, Comdnesti, Romania. We gine Zelator's write-up. tan? a 4 2eot?2y = tan? y + 2eot? 22 tan? z + 2eot? 2aSeptember Row Issue 281 First note that the real numbers a = kw: %, y = mae 5 whore km, m ave (arbitrary) hntegos ae solutions of the syste (1) We see, by inspection, that any solutions must satisfy 0 < tan? =, tan? y, tan? 2 < Land 0 < cot? 2y, cot? 2x, cot? 2z < 2. However, in fact none of tan, tan y, tan can be 20, since if lane =O; then, and only then @ = tr, for some t € Z. But then 2a = 2t7; and so cot 2x would be undefined. Thus, nets in? an? Pz Oc tanta, tantys tants Say ® and0 < cot! 2y,cot® 22,cot? 22 < J Next, observe if one of tan? «, tan? y, tan? z is equal to 1; then all three of them are and the three cotangent terms are zero. Indeed, suppose that tan” = 1; then tan:e = 1 or ~1; which implies ae = kar; k € Z. But then from the frst equation in (1) we obtain cot 2y = 0; 2y = prt $, p GZ y = Sat Hs when p= oxen = 2d: y= et Hand when p= old = 2+ 1; pane 's ‘Phese two formulas, since wwe obtain cot 22 = net tne LZ tan? z = 1, which produces the nv a: %. Or alternatively, 0; and from which (vin a similar argument) we obtain 2 We conclude that either tan? 2 solutions a = kee y 0 < tan?e, tan?y, tan?z <1 - . tan?y } . and 0 < cot?2y, cot42e, eot?2z < 2 Below, we shall find all the real solutions to system (1) that satisfy the conditions: in (3). Suppose (2,414 #1) is a solution satisfying (3). We put ma = tan? yy, and ty = tan? 21. So that by (3 O SPY « pus >} or equivalently, Pod i) 2Seplembee 20M Issue 283 Next, cousider the cubie polynomial of degree three, FC) = (t= ma) ra) P9)s (12) F(t) =O = (ey tra tas) + (ara trans tse) rararas and by (8) and (10); f(t) = O-P+0P-t-P a3) Next, we make use of the following lemma. ‘The facts stated in the Lemma are ‘well-known, standatd material on cubic polynomial functions Lemma 1. Suppose that g(¢) is a cubic polynomial function of dogree 3 with leading cocficient a > 0; and let g’(t) be the derivative of g(t); g(t) being a ‘quadeatic trinomial. () I the discriminant of g(t) is negative; then the fimetion 9(E) has no critical mumbers in its domain, and therefore it has no points of local maximum or Tocal minimum. ‘The function 9(#) is inereasing throughout, R, and has only ‘one inflection point. Aud the fimetion g(t) has exactly ome real root, anel tao conjugate complex roots, (ji) IF the discriminant. of g/(t) is zero: then the function g(t) has exactly one critical number p in its domain R. ‘The point (9, 9(0)) is both an inflection point and a criticel point on the graph of g(t). ‘The finction g(t) inexeases throughout I, it has no points of local maximmunn or minimum. Furthermore {9(2) has the form, g(t) = a(t — p)® + 6, for some we € R. Thus, g(t) has a triple real root, the real number Consider the devivative of f(t) in (13): f(t) = 30? — 26+ 9P. The discriminant of f/(t) is D = 4— 4-3-9. P = 4(1 — 27P). By (11) it follows that D = 0 or D <0. The second possibility, D <0 is eliminated by Lemma, 1(), since according to (12), #4) has threo real roots, ‘Thus we must have D == 0 By Lemma. 1(ii), it follows that ry ‘2 = 73; and therefore from (8) we obtain ry = ra = rs = F. Back to (4): 1 tanta = 5 @ taney = & my = kw For some k € Z. Likewise, we obtain ths mrkt, formed, and 5 a snrkt, fornes @September om \srue 284 Conversely, one ean verify directly that if the triple (1, 91,21) has the above form; then it satisfies the system (1). Conclusion. The set of solutions S of system (1) is the union of two disjoint families or solution sets $y, S23 S = SUS, where Si = {(a,2) | esyy2 € Rand such that 2 = kw +k $, y= mat J 2 = nat Th: where m,n, k can be any integers and all eight combinations of Signe are allowed. And Sy = {(,¥s2) 12 y.2 € Rand such that x = ke, mma 2,2 = nm & 2}; where m, n, k can be any integers; and all eight ‘combinations of signs are allowed. 7 (4 Vronovieh) The point X (distnet from the ortocentre) Hs on the altitode Gy of the seats einngle ABC. Prove tht the fet of the porpeneiclary fom Gh wo the vewnents AC, BC, BK, soul AK tie on n eee, Sobution by Michel Bataille, Rowen, France We denote by D, U, V, B the feet of the perpendiculars from Cx to AG, AK, BK, BC, respectively, and by H the orthocentae of AABC. First, we show that ,U; Vj ave not collinear. Assuming the contrary, let BKK mect AC at By. Prom Simon's theorem, C1 lies on the civeumeirele of DAKB,. Since ZACK = 90°, it fol- lows that AK ix a diamoter of the circle (AKBy) and so ZICBYA = 90°. ‘Thus BBy is the altitude from B of AABC and Kis its orthoeentre, contradicting. the hypothesis, MGA = CB, since the line CC, is an axis of symmetry of the figure, DUV Bis am isosceles waperian and D,U, V, B are coneyclic. From ow on, we asnume that CA # CB. o4 X be the point of intersection ofthe fines DE ane AB. Since the circle with diameter CCy passes through D and B, we have XD- XE = XC}. On the other hand, since ZXEB = ZCED = ZCC,D = ZDAX, the triangle XBE and XDA are sini