Answers & Solutions: For For For For For PRMO - 2018

You might also like

Download as pdf or txt
Download as pdf or txt
You are on page 1of 9

Date: August 19, 2018 Time: 10 AM to 1 PM

Number of Questions: 30 Max Marks: 102

Regd. Office : Aakash Tower, 8, Pusa Road, New Delhi-110005


Ph.: 011-47623456

Answers & Solutions


for
PRMO - 2018
INSTRUCTIONS
1. Use of mobile phones, smartphones, ipads, calculators, programmable wrist watches is STRICTLY PROHIBITED.
Only ordinary pens and pencils are allowed inside the examination hall.
2. The correction is done by machines through scanning. On the OMR sheet, darken bubbles completely with a black
pencil or a black or blue ball pen. Darken the bubbles completely only after you are sure of your answer; else,
erasing may lead to the OMR sheet getting damaged and the machine may not be able to read the answer.
3. The name, email address, and date of birth entered on the OMR sheet will be your login credentials for accessing
your PRMO score.
4. Incomplete/Incorrectly and carelessly filled information may disqualify your candidature.
5. Each question has a one or two digit number as answer. The first diagram below shows improper and proper way
of darkening the bubbles with detailed instructions. The second diagram shows how to mark a 2-digit number and
a 1-digit number.
Q. 1 Q. 2
INSTRUCTIONS
1. "Think before your ink". 47 05
2. Marking should be done with Blue/Black Ball Point Pen only. 0 0 0 0

3. Darken only one circle for each question as shown in 1 1 1 1

Example Below. 2 2 2 2

WRONG METHODS CORRECT METHOD 3 3 3 3

4 4 4 4

D A C D 5 5 5 5

4. If more than one circle is darkened or if the response is 6 6 6 6

marked in any other way as shown "WRONG" above, it shall 7 7 7 7

be treated as wrong way of marking. 8 8 8 8

5. Make the marks only in the spaces provided. 9 9 9 9

6. Carefully tear off the duplicate copy of the OMR without


tampering the Original.
7. Please do not make any stray marks on the answer sheet.
6. The answer you write on OMR sheet is irrelevant. The darkened bubble will be considered as your final answer.
7. Questions 1 to 6 carry 2 marks each; questions 7 to 21 carry 3 marks each; questions 22 to 30 carry 5 marks each.
8. All questions are compulsory.
9. There are no negative marks.
10. Do all rough work in the space provided below for it. You also have blank pages at the end of the question paper
to continue with rough work.
11. After the exam, you may take away the Candidate's copy of the OMR sheet.
12. Preserve your copy of OMR sheet till the end of current olympiad season. You will need it later for verification purposes.
13. You may take away the question paper after the examination.

1
PRMO-2018

1. A book is published in three volumes, the pages ABCD is a kite.


being numbered from 1 onwards. The page numbers
So, AC  BD
are continued from the first volume to the second
volume to the third. The number of pages in the So, BO = OD = 12 cm
second volume is 50 more than that in the first
volume and the number pages in the third volume is AO  13 2 – 122  5 cm
one and a half times that in the second. The sum of
the page numbers on the first pages of the three OC  20 2 – 122  16 cm
volumes is 1709. If n is the last page number, what
is the largest prime factor of n? 1
ar ABCD    AC  BD
Answer (17) 2

Sol. Let number of pages in book 1 = x 1


  21 24
Let number of pages in book 2 = x + 50 2
= 252 cm2
3
Let number of pages in book 3 = ( x  50)
2  252
r    7.63 cm
3 S 33
Total number of pages = x + x + 50 + x + 75
2 Closest integer = 8
7
= x  125 3. Consider all 6-digit numbers of the form abccba
2 where b is odd. Determine the number of all such
Now, 6-digit numbers that are divisible by 7.

As per the question, Answer (70)

1 + x + 1 + 2x + 51 = 1709 Sol. (abc cba) mod(7) = 0


3x + 53 = 1709  (1 × a + 3 × b + 2 × c + 6 × c + 4 × b + 5 × a)
mod (7) = 0
3x = 1709 – 53 = 1656
x = 552 (6a + 7b + 8c) mod (7) = 0

7 (7(a + b + c) + (c – a)) mod (7) = 0


Now, last page number = × 552 + 125 = 2057
2 (c – a) mod (7) = 0
= 11 × 11 × 17
 c – a = 0 or c – a = 7 or c – a = –7
Hence answer is 17.
Case-I : a = c {1, 2, 3, 4, 5, 6, 7, 8, 9},
2. In a quadrilateral ABCD, it is given that AB = AD = 13,
BC = CD = 20, BD = 24. If r is the radius of the circle b {1, 3, 5, 7, 9}
inscribable in the quadrilateral, then what is the integer  Numbers = 9 × 5 = 45
closest to r?
Case-II : c – a = 7  a = 1, c = 8,
Answer (08)
b {1, 3, 5, 7, 9}
Sol. A
a = 2, c = 9, b {1, 3, 5, 7, 9}
13 cm 13 cm
Numbers = 5 + 5 = 10
B 12 cm O 12 cm D Case-III : a – c = 7  c = 0, a = 7, or c = 1, a = 8

or c = 2, a = 9 and b {1, 3, 5, 7, 9}
20 cm 20 cm
Numbers = 5 + 5 + 5 = 15

 Required 6-digit numbers = 45 + 10 + 15 = 70


C

2
PRMO-2018

4. The equation 166 × 56 = 8590 is valid in some base  ab = a + b [∵ a + b – c = 1]


b  10 (that is 1, 6, 5, 8, 9, 0 are digits in base b
 ab – a – b + 1 = + 1
in the above equation). Find the sum of all possible
values of b  10 satisfying the equation.  a(b – 1) –1 (b – 1) = 1

Answer (12)  (a – 1) (b – 1) = 1

Sol. (166)a × (56)a = (8950)a ∵ a, b = 2


 a – 1 = 1 or b – 1 = 1 and a – 1 = – 1 or b – 1
 [a3 + 6a2 + 6] [5a + 6] = 8a3 + 9a2 + 5a
= –1
 3a3 – 31a2 – 57a – 36 = 0
 a = 2; b = 2 and a = 0 or b = 0
 (a – 12) (3a2 + 5a + 3) = 0
 c=3 and c = – 1
a = 12, only possible value of a.  Possible sum of a2 + b2 + c2 is 18.
5. Let ABCD be a trapezium in which AB || CD and 7. A point P in the interior of a regular hexagon is at
AD  AB. Suppose ABCD has an incircle which distances 8, 8, 16 units from three consecutive
touches AB at Q and CD at P. Given that PC = 36 vertices of the hexagon, respectively. If r is radius of
and QB = 49, find PQ. the circumscribed circle of the hexagon, what is the
Answer (84) integer closest to r ?

Sol. ∵ PQ is a diameter. Answer (14)

Draw CR || PQ, through C. Sol.


36
D P C r
P C
16
0
8 8
85
A Q B

PO = 162 – r 2
A Q R 13 B
49 3
PQ = r
 CB = 49 + 36 = 85 2

3
In BRC, CR  852 – 132 OQ = r – 162 – r 2
2
 98  72 In OBQ

= 84 OQ2 + QB2 = OB2


22
6. Integers a, b, c satisfy a + b – c = 1 and a2 + b2 ⎛ 3 ⎞ ⎛r ⎞
⎜⎜ r – 16 2
– r 2
⎟⎟  ⎜2⎟  8
2
– c2 = –1. What is the sum of all possible values of 2 ⎝ ⎠
⎝ ⎠
a2 + b2 + c2?
3 2 r2
Answer (18) = r  162 – r 2  – 3r 162 – r 2  82
4 4
Sol. a + b – c = 1 = r 4 – 256r 2 – 642 × 3 = 0
 a+b=1+c r2 = 192 or r2 = 64
 a2 + b2 + 2ab = 1 + c2 + 2c
r= 192 or r = 64
 a2 + b2 – c2 + 2ab = 1 + 2c
r  14 r  8 discarded
 – 1 + 2ab = 1 + 2c [∵ a2 + b2 – c2 = – 1]
 2ab = 2(1 + c)  r  14

3
PRMO-2018

8. Let AB be a chord of a circle with centre O. Let C Answer (24)


be a point on the circle such that ABC = 30° and A
O lies inside the triangle ABC. Let D be a point on Sol.
AB such that DCO = OCB = 20°. Find the
measure of CDO in degrees.
Q P
Answer (80)
Sol. ° C G
20°
40
20°

B R C
Given that, AR = 30
O
60° and G is centroid.
A 10° 0°
7 So, GR = 10
20

D 10°30
Since, BGC is right angled.
°

°
B So, BR = RC = GR = 10
By Appoloneous Theorem,
 ABC = 30°
⎛ 1 2⎞
AB2 + AC2 = 2 ⎜ AR  BC ⎟
2
 AOC = 60° 4
⎝ ⎠
Hence, AOC is an equilateral triangle. 1
⎡ 2⎤
= 2 ⎢ 30     20  ⎥
2

CAD is an isoscelestriangle. ⎣ 4 ⎦
OC = CA = CD = 2(900 + 100)
 In OCD., (OC = CD) AB2 + AC2 = 2000
ODC = 80° [By using A.S.P. of triangle] So, AB2 + AC2 + BC2 = 2000 + 400 = 2400

9. Suppose a, b are integers and a + b is a root of AB 2  AC 2  BC 2


  24
x2 + ax + b = 0. What is the maximum possible 100
value of b2? 11. There are several tea cups in the kitchen, some with
Answer (81) handles and the others without handles. The number
of ways of selecting two cups without a handle and
Sol. (a + b)2 + a(a + b) + b = 0 three with a handle is exactly 1200. What is the
 b2 + (3a + 1)b + 2a2 = 0 maximum possible number of cups in the kitchen?
Answer (29)
–  3a  1   3a  1
2
– 8a 2
b = Sol. x  number of cups without handle
2
y  number of cups with handle
–  3a  1  a 2  6a  1
b = x  x  1 y  y  1 y  2 
2   1200
2 6
As a, b I, a2 + 6a + 1 must be a perfect square
x(x – 1) y (y – 1) (y – 2) = 12 × 12 × 100
a(a + 6) + 1 must be a perfect square
= 2 × 3 × 4 × 24 × 25
Possible values of a are a = 0 or a = –6
 y = 4, x = 25
If a = 0, b = –1 or 0
or 16 × 15 × 5 × 4 × 3
If a = –6, b = 9 or 8
x = 16, y = 5
Maxmimum possible value of b2 = 81 or 10 × 9 × 8 × 5 × 4
10. In a triangle ABC, the median from B to CA is y = 10, x = 5
perpendicular to the median from C to AB. If the
Hence for x = 25, y = 4
median from A to BC is 30, determine (BC2 + CA2
+ AB2)/100. (x + y) maximum = 29

4
PRMO-2018

12. Determine the number of 8-tuples (1, 2, …8) such 14. If x = cos1°cos2°cos3° … cos89° and y = cos2°cos6°
that 1, 2, … 8  {1, –1} and 1+ 22 + 33 + … + 88 cos10° … cos86°, then what is the integer nearest to
is a multiple of 3. 2 ⎛y⎞
log2 ⎜ ⎟ ?
Answer (88) 7 ⎝x⎠

Sol. 1 + 22 + 33 + 44 + 55 + 67 + 77 + 88 Answer (19)
 1 + 22 + 4 + 25 + 7 + 28 (mod 3) Sol. x = cos1° cos2° cos3° ... cos89°

Hence no. of choices of 3 and 6 are 2 respectively. = cos1° sin1° cos2° sin2° ... cos44° sin44° cos45°
1 1
Also, for (1+4 +7) + 2(2+5 +8) we have =  · sin2° · sin4° ... sin88°
2 244
following cases
1 1
(1) Either each of 1+ 4 + 7 and 2+ 5 + 8 be =  · sin2° cos2° · sin4°cos4°... sin44 · cos44°
2 244
divisible by 3.1
1
(2) Remainder of (1+4 +7 ) + Remainder of 2(2+ = 66.5 sin4° sin8° ... sin88°
2
5 +8) be divisible by 3
1
Total cases  2  2[(2  2)  (3)2  2] = cos2° cos6° ... cos86°
266.5
= 88 y
=
266.5
13. In a triangle ABC, right-angled at A, the altitude
through A and the internal bisector of A have lengths 2 ⎛y⎞ 2
 log2 ⎜ ⎟   66.5  19
3 and 4, respectively. Find the length of the median 7 ⎝x⎠ 7
through A. 15. Let a and b be natural numbers such that 2a – b,
Answer (24) a – 2b, and a + b are all distinct squares. What is the
smallest possible value of b?
Sol. BAN = NAC = 45°
Answer (21)
7 Sol. Let
and tan  
3 2a – b = n2 …(i)
In AMC
a – 2b = p2 …(ii)
MC a + b = k2 …(iii)
tan ( + 45°) =
3 Adding (ii) and (iii) we get
tan   1 MC 2a – b = p2 – k2
 
1  tan  3
p2 + k2 = n2 (p < k as a + b < a – 2b)
⎛3 7 ⎞ For b to be smallest, k2 and p2 is also small and
 MC  3 ⎜
⎜ 3  7 ⎟⎟ must be multiple of 3 (as 3b = k2 – p2)
⎝ ⎠
For smallest b, the least value of k and p be 12 and
Similarly, in ABM,
9 resp.
BM  Least value of b = 21
tan ( – 45°) =
3
16. What is the value of
⎛3 7 ⎞
 BM  3 ⎜
⎜ 3  7 ⎟⎟

1 i  j 10
(i  j )  ∑
1 i  j 10
(i  j )?
⎝ ⎠ i  j  odd i  j  even

 BC = BM + MC Answer (55)
Sol. i = 1 1 + (2 + 4 + 6 + 8 + 10 – 3 – 5 – 7 – 9)
32
= 3  48
2 = 1 – 4 + 10 = 7

1 i = 2 0 × 2 + (3 + 5 + 7 + 9 – 4 – 6 – 8 – 10)
 Median = BC = 24
2 =–4
5
PRMO-2018

i = 3 1 × 3 + (4 + 6 + 8 + 10 – 5 – 7 – 9) Sol. Let a, b, c > 4


= 3 – 3 + 10 = 10
⎛ 3 ⎞⎛ 3 ⎞⎛ 3 ⎞
i = 4 0 × 4 + (5 + 7 + 9 – 6 – 8 – 10) = – 3 For ⎜ 1  ⎟⎜ 1  ⎟⎜ 1  ⎟ to be maximum.
⎝ a ⎠⎝ b ⎠⎝ c ⎠
i = 5 1 × 5 + (6 + 8 + 10 – 7 – 9) = 5 – 2 + 10
= 13 If possible a = b = 5, c = 6 (all are not equal)
i = 6 0 × 6 + (7 + 9 – 8 – 10) = – 2
⎛ 3 ⎞⎛ 3 ⎞⎛ 3 ⎞
i = 7 1 × 7 + (8 + 10 – 9) = 7 – 1 + 10 = 16 ⎜ 1  5 ⎟⎜ 1  5 ⎟⎜ 1  6 ⎟  4
⎝ ⎠⎝ ⎠⎝ ⎠
i = 8 0 × 8 + (9 – 10) = – 1
 One of a, b, c must be 4
i = 9 1 × 9 + (10) = 19
 S = (7 + 10 + 13 + 16 + 19) – (4 – 3 – 2 – 1) Let a = 4

= 55 4 × 4 × bc = (7) (3 + b) (3 + c)
17. Triangles ABC and DEF are such that A = D, AB 16 × bc = 7 (3 + b) (3 + c)
= DE = 17, BC = EF = 10 and AC – DF = 12.
What is AC + DF? One of b, c must be 7 let b = 7

Answer (30) 16 × 7 × c = 7 × 10 × (3 + c)
Sol. A D  c=5
x
Possible (a, b, c) = (4, 7, 5) and its arrange
M 17 x
17 also it is unique
10
P 12
8  a + b + c = 16
B
10 C E 10 F
19. Let N = 6 + 66 + 666 + ... + 666 ... 66, where there
AC – DF = 12 are hundred 6's in the last term in the sum. How
many times does the digit 7 occur in the number N?
Let DF = x
AC = 12 + x Answer (33)

Mark AM = x Sol. N = 6 + 66 + 666 + ..... + 666.....6


 MC = 12 100 times
Now BAM  EDF(SAS) 6⎡
= (10  1)  (102  1)  .....  (10100  1)⎤⎦
 BM = EF = 10 (CPCT) 9⎣
Draw BP  MC 6 ⎡10 ⎤
= (10100  1)  100 ⎥
 MP = PC = 6  BP = 8 (Using Pythagorus 9 ⎢⎣ 9 ⎦
Theorem)
2 ⎡ 999.....90 ⎤
In R  BAP =  100 ⎥ (9 is repeated 100 times)
3 ⎢⎣ 9 ⎦
(17)2 = (x + 6)2 + (8)2
2
(x + 6)2 = 289 – 64 = 225 = [111.....10 – 100] (1 is repeated 100 times)
3
x + c = 15
2
x=9 = × 111.....1010
3
Now, AC + DF = 2x + 12 98 times
= 18 + 12 1
= × 222.....2020
= 30 3
98 times
18. If a, b, c  4 are integers, not all equal, and 4 abc
= (a + 3) (b + 3) (c + 3), then what is the value of 740740.....7407340
=
a + b + c? 96 digits
Answer (16)  33 sevens
6
PRMO-2018

20. Determine the sum of all possible positive integers So, G1G2G3 ~ DEF
n, the product of whose digits equals n2 – 15n – 27 2 2
ar( G1G2G3 ) ⎛ G1G2 ⎞ ⎛2⎞
Answer (17) So, ⎜ ⎟ ⎜ ⎟
ar( DEF ) ⎝ DE ⎠ ⎝3⎠
Sol. Product of digits = n2 – 15n – 27
= n(n – 15) – 27 9
 ar(DEF)   ar(G1G2 G3 )
Note that if n is a more than 2-digit number, say 4
3-digit number, then product has to be  9 × 9 × 9 9
= 729 but (n(n – 15) – 27) is more than 729 (in fact ar(DEF)  7
4
it a more than 3-digit numbers for any 3-digit n).
97
Hence, n can be either one-digit or 2-digit. ar(ABC) = 4 × ar(DEF)  4   63
4
If n is 1-digit then n2 – 15n – 27 = n
22. A positive integer k is said to be good if there exists
 n = not an integer a partition of {1, 2, 3, ..., 20} into disjoint proper
 n is a two-digit number. subsets such that the sum of the numbers in each
As product is +ve so n(n – 15) – 27 > 0 subset of the partition is k. How many good numbers
 n  17 are there?
As 2-digit product is less than equal to 81. Answer (06)
So n(n – 15) – 27  81 Sol. Possible sum of partition of set {1, 2, 3,.... 20} are
 n(n – 15)  108 (1) 105, 105
 n  20
{1, 2, 3, 4, 5, 6, .... 14}, {15, 16, 17, 18, 19, 20}
So, n can be 17, 18, 19 or 20.
(2) 70, 70, 70
If n = 17, then n(n – 15) – 27 = 17 × 2 – 27 = 7 = 1 × 7
{20, 19, 15, 16}, {11, 10, 17, 18, 14}, {1, 2, 3,
If n = 18, then n(n – 15) – 27 = 18 × 3 – 27 = 27  1 × 8
4, 5, 6, 7, 8, 9, 12, 13}
If n = 19, then n(n – 15) – 27 = 19 × 4 – 27  1 × 9
(3) 42, 42, 42, 42, 42
If n = 20, then 20(20 – 15) – 27  0
 Only possible n is 17 (4) 35, 35, 35, 35, 35, 35
21. Let ABC be an acute-angled triangle and let H be its (5) 30, 30, 30, 30, 30, 30, 30
orthocenter. Let G1, G2 and G3 be the centroids of (6) 21, 21, 21, 21, 21, 21, 21, 21, 21, 21
the triangles HBC, HCA and HAB respectively. If the
area of triangle G1, G2, G3 is 7 units, what is the 23. What is the largest positive integer n such that
area of triangle ABC? a2 b2 c2
   n (a  b  c )
Answer (63) b c c a a b
  
Sol. A 29 31 29 31 29 31
holds for all positive real numbers a, b, c.
Answer (14)
G3
F E
H
G2 ∑a 2
i
∑ a i
2

Sol. By Titu's Lemma . 


G1 xi ∑ x  i

B C
D
 ∑a
2
a2
Let D, E and F are the mid-points of BC, AC and ∑b c

⎛ 1 1⎞ 
899
(a + b + c) 
AB respectively.
29 31
  a  b  c ⎜  ⎟ 60
⎝ 29 31⎠
HG1 2 HG2 2 14(a + b + c)
In HDE,  and 
G1D 1 G2 E 1 n = 14
HG1 HG2
  24. If N is the number of triangles of different shapes
G1D G2 E (i.e., not similar) whose angles are all integers (in
 G1G2 || DE [By BPT] degrees), what is N/100?
Similarly, G3G1 || FD and G3G2 || FE Answer (27)

7
PRMO-2018

 k = 31
z
 T = 470
Sol. Case-III: If T = 15k + 6
x y  T  (2k + 6) (mod 13) and T  (4k + 6) (mod 11)
(1) x  1 y31  k = 31
x + y + z = 180  T = 470
= 179C = 15931  Smallest T = 184
2

(2) When two angles are same  Sum of squares of digits of T = 1 + 64 + 16 = 81


26. What is the number of ways in which one can
2x + y = 180
choose 60 unit squares from a 11 × 11 chessboard
1, 1, 178 such that no two chosen squares have a side in
2, 2, 176 common?
Answer (62)
 
89, 89, 2 Sol. Total no. of squares = 121
Out of these, 61 squares can be placed diagonally.
But we have one case 60°, 60°, 60°
From these any 60 can be selected in 61C60 ways
Total = 89 – 1 = 88 = 61
Such type of triangle = 3(88) From the remaining 60 squares 60 can be chosen in
When 3 angles are same = 1 (60, 60, 60) any one way
 Total no of ways = 61 + 1 = 62
So all distinct angles's triangles
• - 61 squares
= 15931 – (3 × 88) – 1 × - 60 squares
 3!
= 2611
Now, distinct triangle = 2611 + 88 + 1
= 2700
N = 2700

N
 27
100
25. Let T be the smallest positive integer which, when 27. What is the number of ways in which one can colour
divided by 11, 13, 15 leaves remainders in the sets the squares of a 4 × 4 chessboard with colours red
{7, 8, 9}, {1, 2, 3}, {4, 5, 6} respectively. What is the and blue such that each row as well as each column
sum of the squares of the digits of T? has exactly two red squares and two blue squares?
Answer (81) Answer (90)
Sol. T is any of the number 15k + 4, 15k + 5 or 15k + 6
R R B B
Case-I: If T = 15k + 4 Sol.

T  (2k + 4) (mod 13) and T  (4k + 4) (mod 11)


 2k + 4  1 or 2 or 3 (mod 13) and 4k + 4  7
or 8 or 9 (mod 11)
 k = 12
Number of ways of arranging 2R and 2B in 1st row
 T = 184
4!
Case-II: If T = 15k + 5 
(2!)2
 T  (2k + 5) (mod 13) and T  (4k + 5) (mod 11)
 (2k + 5)  1 or 2 or 3 (mod 13) and 4k + 5  7 In the first column the remaining entries can be filled
or 8 or 9 (mod 11) in 3 ways.

8
PRMO-2018

In the column in which the element in (1, 1) position Answer (30)


repeats in first row, we can fill in 3 way (1 + 2) A
Sol.
Case-I: R R B B

R R
I2
B B I1
B
 C
2
60° 2
B C
B B 2 2
B E D F C
In this case only one choice is possible 1! A
EAD + FAD = EAF =
2
Case-II: R R B B B
AED  60 
R B 2! possible way 2
 (2! × 2)
R C
B AFD   
2 way 2
B B R R
A B C
This position has ∵ In AEF :  60      180
one choice 2 2 2
90° + 60° +  = 180°
4!
Total ways   3  1  2! 2
(2!)2   = 30°

= 90 30. Let P(x) = a 0 + a 1 x + a 2 x 2 + ....+ a n x n be a


polynomial in which ai is a non-negative integer for
28. Let N be the number of ways of distributing 8 each i{0, 1, 2, 3,..., n}. If P(1) = 4 and P(5) = 136,
chocolates of different brands among 3 children such what is the value of P(3)?
that each child gets at least one chocolate, and no
Answer (34)
two children get the same number of chocolates.
Find the sum of the digits of N. Sol. 136 = P(5)  an5n  5n
Answer (24) n3

+4 If n = 2, P(x) = a2x2 + a1x + a0


1+3
Sol. 8 1+5+2 Given, a0 + a1 + a2 = P(1) = 4
P(5)  4.52 = 100.
8! 8!
Required number of ways =  3!   3! Hence n = 3
4! 3! 5! 2!
= 1680 + 1008 P(x) a3x3 + a2x + a1x + a0
P(5) = 136 = a3125 + a2 25 + 5a1 + a0
= 2688
a3 = 1, a2 = 0  a0 + a1 + 0 + 1 = 4
Sum of digits = 24
11 = 5a1 + a0 a0 + a1 = 3
29. Let D be an interior point of the side BC of a triangle
ABC. Let I1 and I2 be the incentres of triangles ABD
and ACD respectively. Let AI1 and AI2 meet BC in a0 = 1 a1 = 2
E and F respectively. If BI1 E = 60°, what is the P(4) = x3 + 2x + 1
measure of CI2F in degrees?  P(3) = 33 + 2.3 + 1 = 34

  

You might also like