APMOPS 2019 (Invitation Round) Solution Answer: 16 Itis obvious that the integer has to be even. IF it were to be an odd integer, one way of writing the sum thas to be the sum of 2 and another prime. Then the other way can only be the sum of two other odd primes which gives an even sum, Smallest sum of two odd primes ~ 3 +5 = 8. There is no other ways of writing 8 into sum of two primes. Similarly test out 3+ 71 way), 5 +71 way), 3+ EL (I way), 3+ 13=5 4 11 (2 ways) Hence, the smallest positive integer is 16. Answer: 30 333 \ \ Since EF // BC, we han Bh 2pi ‘Thus triangle EBD is isosceles, 1 ~ =f Similarly, FD = FC ” Therefore, perimeter of triangle ‘. e = AE + EF +FA= AB +

303632 > 302 > 303 Answer: 749 Area of shaded region = Area of two semicircles ~ Area of triangle 4BC ~E(ar sae") 5142) Sh. \ otk P2156 \ » =109 = v r Morivies two-digit integers are 1 Wediit integers have to be separated by one-digit integers. ‘There are only 9 one-digit integers, and two-digit integers have to be placed in alternate pattem in a circle, A possible construction is as follows: 1, 18,2, 17,3, 164, F557 14, 6413. 7,12, 8419/9 10 in a circle. Answer: 20 Suppose 48= 6, BC= 10, BG = 12, ‘There are 3 possible paths. Path 1; Ifthe ant erawls via face ABGH and BCFG. By unfolding the 2 faces, we may get the figure on the right, where the shortest path is the straight line distancefiom A to F. Using Pythagoras theorem, distance =f(en0F +12° = 20 em. Path 2: If the ant crawls via faces ABCD and CDEF, Using similar method, the distance = 6" +(10+12)° = J520 em. Path 3: if the ant crawls via faces 4BCD and BCFG. Using similar method, = Therefore, the shortest dis we Answer: 6 and 2 ¢ &- ra. «Dx Efe xG = ¢ x (Case 1: When there areat least io even surgery +" Consider the first and last ev af, of these 10, chan; 24 em. 10 +(6+12)° = ah hich ‘ 20 cm: -F, ifthe « sign to the left of the first even number, if any, n the Left of + sign will be odd and the one com the right will be even, Similarly, the last even number, ifany, és changed to-+ ‘sign, the product on the right of + sign will be-odd and the one on the left will be even. In both situations, the sum will be odd. SINCE 1990 Hence, the even sum will only be obtained when the change happens to those x signs between the first and last even number since these two even numbers make their respective products and hence their sum even Since 5 even sums are obtained, the first and last even number has to differ by 5 positions, ¢.g. A and F, or D and L, and so on. Further, the numbers between the first and last even numbers do not affect the parity of the sum since ‘one even number is sufficient to make the product even. Hence, for case 1, there are maximum of 6 even numbers and minimum of ? numbers.‘Case 2: When there is only one even number For this case, no matter which xis changed, the sum of product will be odd as only the product that has the even number is even while the other product that contains all odd numbers will be odd. Therefore, there are no even sum obtained, which contradicts to the given condition of 5 even sums are obtained Case 3: When there is no even number Similarly, the sum of the product will always be even since odd + odd = even, no matter which « sign is changed. Therefore, there are 9 even sums obtained. which contradicts to the given condition of $ even ‘sums are obtained: In conclusion, there are 333° numbers and minimum of 2 even numbers. Ld > \= ' Answer: 225 e f Consider any 4 numbers a, 5, c, a selected nunlliths ‘ Since 9Ja+b+e and og, it as selected numbers, any two numbers gtiyst be clherien 9 d-cié %. eo also means among the Consider a+b+c again, a+b Meg af a=. sy 3a must be a multiple of 9, which forces a to be 9k 943, 9k +6 If all selected numbers ate ity the, frm. 9k, we ean select (9, 2016} , a total of 224 numbers, C I i ON 4 If all selected numbers are in the form 94 +3, we can select {3,12,21, +2019} , a total of 225 numbers. Ifall selected numbers ate in the form 9k+6, we can select (6,15,24,....2013} ,a total of 224 numbers. Therefore, we can select at most 225 numbers.10. Answer: 2,6,12,20, 30,42,56,72, 90,10 (this answer is not unique) By considering the telescoping sum We notice the 9 unit fi , vg up to ve just nd toad a to mike the sun 1 ‘Therefore the 10 int 12,20, 30,48 $6, 72.90,10 ees a Remark: this constraciimgjy not mean may com e 1 Answer: 18 ~, a AB AC=10+2=12, BC=2+3 Note that 2ACB=90" because ‘Take point O such that OACBisa rectangle.) 6 SINCE 199 OC= AB =12, OA=5, OB=12 Extend 04, OC, OB to meet the 3 smaller circles again at P, R, Q respectively ‘Note that OP= =15,OR =13 +2 =15, 00 =12+3=15. Therefore the radius of the largest circle is 15.12, 13(a), 13(b) Answer: 9 34225 7396 81 900 ‘Note that there are exactly 10 different letters representing digits 0, 1,2, . ‘Based on the given condition, consider 4 and ALE first, A can only be 1,4 or 9, while ALL can only be 100, 144, 400 or 900, Neat, consider XMAS, sinee 4 is 1,4 0 9, by listing out four-digit perfect squares with tens digit 1, 4 or 9, we notice that only one number 7396 satisfies the condition (its sum of digits is a perfect square), ‘Thus we have 4 = 9, XMAS = 7396, ALL = 900 so Ear, which implies 7O has to be 81 (not 36 because digit 6 has been used) Finally, for MERRY (3,3), weonty have digits 2, 4, ot 35924 or 4225, and obviously 35224 is not a perfect square left for , R, ¥ For the sum of digits to be a perfect square, we only 1 ‘Therefore the deciphdted message is 9 34225 7346 81 900. eC v Amweitaponiic) © e \ ‘Notice that whenever wg ncn Sn the unchanged if the total sum of the 9 gphers is@ivided ‘The initial total sun 2+ Ne 14 9 numbers the same, the final sum bea mod 3 is unchanged after each operation, ¢ ‘alu jed 3 times, the remainder is : 3 is Bivisivie by 3. But ifwe wish to make all at (in fact, a multiple of 9). Since the remainder given task Is not possible. Answer: Possible CIN, 25 16 35) (25 16 42) (25 16 42) (25 16 42) (25 42 42) (42 42 42 17 4b 34/>/17 & 34/>/25 16 42]—>]25 16 42)=>]25 42 42/—>] 42 42 42 2 0 26, 9 0 % 9 0 26 25 16 42, 25 42 42, 42 42 42,14 Answer: ID Method 1 Let the 3-digit number be abe ie, 1000+ 10b+e (1000 +10b+e)+11= Sar beS oe pee Since a.b.c are digits from 0 to 9 (with a +0), we have -8c=80-1 ‘one set ae abe Case 2: 0Sa-b+eS10 Mian Fre..s.6 Satb=atbse ¢ E ¢ \ acta ane queers a=len Case 3: sab + e< 18, i 4 9a+b+l=ashse =e=8a+l, which yields no solution because when a= llsa-b+e SINC 1990 ‘Therefore, we have altogether 11 such three-digit numbers, =9, it is not possible to have Method 2 ‘Note that the largest possible sum of digits is 94+9+9=27. Therefore, the 3-digit integer is at most 2711410 =307, which further lowers the stim of digit toa maximum of 2+9+9=20 Similarly, since 100=11x9+1, the least possible sum of digits = 9Next we carry out systematic listing by checking all possible sum of digits from 9 to 20. For each possible value of sum of digits, we multiple it by 11, add the remainder from 0 to 10 and check each of the 11 integers on their sum of digits. For example, For sum of digits = 9, by checking 1x9+0,11x9+1 1194211943, notice that only 11<9+9=108 has a sum oF digit equal to 9, Similarly, 11x9+9,11x9+10, we For sum of digits = 10, by checking, 11%10+8=118has a sum of digits equal to 10. For sum of digits = 11, by checking, 11x11+7=128 has a sum of digits equal to 11 For sum of digits ~ 12, by checking, 11x12-+6=138 has a sum of digits equal to 12. For sum of digits = 13, b Vw has a sum of digits equal to 13. For sum of digits = 14, Wiad 4158 harasun of its equal to 14 | el » ee" Perm INR For sum of digits = 18, by cheek hb parsons s Sts Gqual to 18. For sum of digits = 19 and oN no. Therefore, there are altogether 11 suc numt SINCE 1990