Olympiad 8 - Test 6

Questions
9. ABCD is rectangle whose diagonals intersect at point O. E
Maths is a point on AB such that CE bisects ∠BCD. If ∠ACE = 15°.
1. If N is the biggest three-digit number in base 11, when If ∠BOE = x°, then x
expressed in base 9, has its digits reversed. Find the sum
of digits of N when expressed in base 10.

2. Given any 4 – digit positive integer not ending in ‘0’ we can

reverse the digit to obtain another 4 -digit integer y. For
example if x is 1234 then y is 4321. How many possible 4-
digit integers are there if y – x = 3177?

3. Let M = 1! × 2! × 3! × 4! × 5! × 6! × 7! × 8! × 9!. If “n” be the

factors of M are perfect squares. Find sum of digits of n.
10. Number of ordered pairs (x, y, z) satisfy the following
4. If equations
n
1 2
∞
1 xy + yz + zx = 12
Sn = ∑ t r = n (2n + 9n + 13) , then ∑ equals
r=1
6
r=1
r.√tr xyz = 2 + x + y + z
In positive real number x, y, z
5. 1 1

Evaluate (350 + 90√15) 11.

3 3

+ (350 − 90√15) .

In equilateral ΔABC, let points D and E trisect BC . Then

¯¯¯¯¯¯¯¯

a √b
6. Circles of radius 3 and 6 are externally tangent to each sin(DAE) can be expressed in the form c
, where a and c
other and are internally tangent to a circle of radius 9. The are relatively prime positive integers, and b is an integer
circle of radius 9 has a chord that is a common external that is not divisible by the square of any prime. Find a + b
tangent of the other two circles. If x be the length of this + c.
chord, find x2/8.

12. Find the greatest value of a real number k so that for any
positive numbers a, b, c with abc = 1 the following
inequality holds
1 1 1
+ + + 3k ⩾ (k + 1) (a + b + c)
2 2 2
a b c

13. If n be the number of non – negative integral solutions of

x1 + x2 + x3 + 4x4 = 20, find the sum of digits of n.

14. If m be the smallest root of the equation 4x4 + 27x3 + 63x2

+ 61x + 21 = 0. Find -4m.

7. If the remainder is 2013 when a polynomial with 15. let x1, x2, ……, x5 non-negative integers such that
coefficients from the set {0, 1, 2, 3, 4, 5} is divided by x – 6, x1 + x2 + ….. + x5 = 6
what is the least possible value of the coefficient of x in x1 + 2x2 + …. + 5x5 = 10.
this polynomial?
Find the minimum of the sum
5

8. Number of integers a ≠ 0 with the property aa = a for n =

n

F (x1 , . . . . . . . , x5 ) = ∑ kxk (12 − k) .

1, 2,…… k=1

16. Two teams A and B participate in a table tennis

tournament. There are 7 players of each team to engage
in this tournament in a determined order. Firstly, 1st player
of A team plays against 1st player of B team and the loser
is eliminated. Afterward, the winner plays against 2nd
player of another team. On subsequent steps, the play is
similar. Thus the game does not end until all players of
some team are eliminated, and another team wins. If n be
the number of the distinct processes of game, find sum of
digits of n.
17. If N be number of perfect squares which are the divisors 25. If N be the number of positive integers n less than
of the product 1!. 2!. 3!......8!. Find sum of digits of N. 1000000 for which the sum
is
1 1 1 1
+ + + .... +
2×⌊3⌋+1
18. How many non-negative integer triples (m, n, k) are there
2×⌊√n⌋+1
2×⌊√1⌋+1 2×⌊√2⌋+1

such that m3 – n3 = 18k + 123? an integer. Find [N/100]

(Note that ⌊x⌋denotes the largest integer that is less than
19. The six sides of convex hexagon A1A2A3A4A5A6 are or equal to x.
colored red. Each of the diagonals of the hexagon is
colored either red or blue. If n be the number of colorings 26. Ms. Math's kindergarten class has 16 registered students.
such that every triangle AiAjAk has at least one red side. The classroom has N number of play blocks which satisfies
Find sum of digits of n. the conditions:
(a) If 16,15 or 14 students are present in the class, then in
20. Length of smallest and largest diagonal of a regular each case all the blocks can be distributed in equal
numbers to each student, and
octagon are 2√2 and 2 respectively. If the area of octagon
(b) There are three integers 0 < x < y < z < 14 such that
is A, find A2. when x, y or z students are present and the blocks are
distributed in equal numbers to each student, there are
21. Let ABCD be a parallelogram with ∠ ABC obtuse. Let BE
¯¯¯¯¯¯¯¯
exactly three blocks left over.
be the altitude to side AD
¯
¯¯¯
¯¯¯
¯¯
Find the number of distinct prime divisors of the least
¯¯¯¯¯¯¯¯ ¯¯¯¯¯¯¯¯ possible value of N satisfying the above conditions.
of ∆ ABD. Let X be the point of intersection of AC and BE
, and let F be the point of
←−
→
27. The incircle ω of triangle ABC is tangent to BC at X. Let Y
¯¯¯¯¯¯¯¯

¯¯¯¯¯¯¯¯
intersection of AB and DX. If BC = 30. CD = 13, and BE =
≠ X be the other intersection of AX with ω . Points P and
¯¯
¯¯¯
¯¯¯¯

12. If the ratio find m – 15n. Here m and n are

AC m
= ,
Q lie on AB and AC , respectively, so that P Q is tangent
n ¯¯¯¯¯¯¯¯ ¯¯¯¯¯¯¯¯ ¯¯¯¯¯¯¯¯
AF

coprime.
to ω at Y. Assume that AP = 3, PB = 4, AC = 8, and AQ = ,
m

where m and n are relatively prime positive integers. Find

22. If n be the number of ways to colour the cells of a 3 x 3
3n - m.
grid red, green or blue such that each colour appears in at
least two cells and no cells that share an edge have the
28. Let f(x) = x2 − 45x + 2.
same colour. Note that reflections and rotations of a grid
are considered distinct. Find [n/10]. Here [ ] represents Find number of integers n ≥ 2 such that exactly one of the
greatest integer function. number f(1), f(2),….f(n) is divisible by n.

23. Let a1, a2, …, an be any permutation of 1, 2, …, n and let 29. A triangle is inscribed in a circle. The vertices of the
ƒ(n) denote the number of the permutations satisfying the triangle divide the circle into three arcs of lengths 3, 4,
following conditions: and 5. If area of the triangle = , here a, b and
a
(√b + c)
2
π
(1) a1 = 1;
c are integers and b does not contain square of any prime.
(2) |ai – ai + 1| ≤ 2, for i = 1, 2, … , n – 1 Find the remainder Find a + b + c.
when ƒ(2003) is divided by 3.
30. In triangle ABC the medians AD and CE have lengths 18
¯
¯¯¯
¯¯¯
¯¯ ¯¯¯¯¯¯¯¯

24. Nine trucks follow one another, in a line on a highway. At

and 27, respectively, and AB = 24. Extend CE to intersect
¯¯¯¯¯¯¯¯

the end of a day ride it turned out that each driver disliked
the style of the driving of the one in front of him. They the circumcircle of ABC at F. The area of triangle AFB is
m√n, where m and n are positive integers and n is not
wish to rearrange themselves so that, next day, no truck
would follow the same truck that it followed on the first divisible by the square of any prime. Find m + n.
day. If N be the number of such rearrangements, find sum
of digits of N.
Answer Key

1 2 3 4 5

13.00 48.00 15.00 1.00 10.00

6 7 8 9 10

28.00 5.00 2.00 75.00 1.00

11 12 13 14 15

20.00 1.00 14.00 12.00 90.00

16 17 18 19 20

12.00 9.00 1.00 14.00 32.00

21 22 23 24 25

27.00 18.00 2.00 27.00 9.00

26 27 28 29 30

5.00 9.00 1.00 15.00 63.00

Solutions

1.

2. ¯¯¯¯¯¯¯¯¯¯ ¯¯¯¯¯¯¯¯¯¯
Let x = abcd and y = dcba where a,d ≠ 0. Then
y –x = 1000 × d – d + 100 × 10 –10 × c + 10 × b –100 × b + a – 100 × a
=999 (d–a) + 90 (c–b) = 9 (111(d–a) + 10 (c–b))
So we have 111 (d–a) + 10 (c–b) = 353. Consider the remainder modulo 10, we obtain
d–a = 3, which implies that c –b = 2. Thus the value of a and b determines the values of d and c respectively. a can take on any
value from 1 to 6, and b can take any value from 0 to 7, giving 6 × 8 = 48 choices

3. M = 1! × 2! × 3! × 4! ×5! × 6! × 7! × 8! × 9!
= 28 × 37 × 46 × 55 × 64 ×73 ×82 × 9
= 230 × 313 × 55 × 73
A perfect square factor of M must be of the form 22x × 32y × 52z × 72w, where x, y, z, w are whole numbers such that 2x ≤ 30,
2y ≤13, 2z ≤ 5, 2w ≤ 3. Hence the number of perfect square factors of M is 16 × 7 × 3 × 2 = 672

4.
(2n2 + 9n + 13) − {2(n – 1)2 + 9(n – 1) + 13}
(n−1)
tn = Sn – S n – 1 =
n

6 6

[2n3 + 9n2 + 13n – 2(n – 1)3 – 9 (n – 1)2 – 13 (n – 1)] = (n + 1)2

1
=
6
∞ ∞ ∞
1 1 1 1
∑ = ∑ = ∑ ( − ) = 1
r.(r+1) r r+1
r.√tr
r=1 r=1 r=1

5.
6. We label the points as following: the centers of the circles of radii 3, 6, 9 are O3, O6, O9 respectively, and the endpoints of the
chord are P, Q. Let A3, A6, A9 be the feet of the perpendiculars from O3, O6, O9 to P Q (so A3, A6 are the points of tangency).
¯¯¯¯¯¯¯¯

Then we note that O3 A3 and

¯¯
¯¯¯
¯¯¯
¯¯¯
¯¯ ¯¯
¯¯¯
¯¯¯
¯¯¯
¯¯ ¯¯
¯¯¯
¯¯¯
¯¯¯
¯¯
∥ O6 A6 ∥ O9 A9

O6O9 : O9O3 = 3 : 6 = 1 : 2.
2⋅O6 A6 +1⋅O3 A3
Thus, O9A9 = = 5 (consider similar triangles).
3

Applying the Pythagorean Theorem to ∆ O9A9P, we find that

PQ2 = 4(A9P)2 = 4[(O9P)2 – (O9A9)2] = 4[92 – 52] = 224.

x2/8 = 224/8 = 28

7.
n

Let P (x) = ∑ ak x
k
be the polynomial. We have P(6) = 2013. Since 3|P(6) and 2 does not divide P(6). we have a0 = 3 Again,
k=0

P(6) = 6a1 + 3 ≡ 33 (mod 36) we must have a1 = 5.

8. There are only two such integers, namely a = 1 and a = –1. We easily check that both these numbers satisfy the desired
condition. From this condition for n = 1 it follows that aa = a. Thus, if a was an integer ≥ 2, we would have aa ≥ a2 > a, which is
impossible. If we had a ≤ –2, we would also have |aa| = 1/|a||a| < 1, which again is impossible since aa = a and a ≤ –2 imply
|aa| = |a| > 2.

9. Since CE bisects ∠ BCD, ∠ BCE = 45°. Thus ∠ CEB = 45° also and ∆CBE is isosceles.
Therefore BC = BE
Now ∠ BCO = 45° + 15° = 60°. As CO = BO, we conclude that ∆COB is equilateral. Thus BC = BO = BE giving us an isosceles
triangle OBE. Since ∠ OBE = 30°, thus ∠ BOE = 75°

10. Let √xyz = a. From the AM-GM inequality

3

12 = xy + yz + zx ≥ 3a2
And
a3 = 2 + x + y + z ≥ 2 +3a
Therefore a2 ≤ 4 and a3 – 3a –2 = (a–2) (a+1)2 ≥ 0. Hence ll equalities hold, a =2, and x = y = [Link] (x,y,z) = (2,2,2) is the only
solution
11.

Without loss of generality, assume the triangle sides have length 3. Then the trisected side is partitioned into segments of
length 1, making your computation easier.
Let M be the midpoint of . Then ∆ MCA is a 30-60-90 triangle with MC = , AC = 3 and AM = . Since triangle ∆ AME is right, then
we can find the length of by Pythagorean theorem, AE = √ 7. Therefore, since ∆ AME is a right triangle, we can easily find
Sin(∠ EAM) = and
cos(∠ EAM) = So we can use the double angle formula for sine,
sin(∠ EAD) = 2 sin(∠ EAM) cos(∠ EAM) = .
Therefore, a + b + c = 20.

12. Substituting a =
1
,b = c = α ≠ 0 into the inequality we have
2
α

4 2 1
α + + 3k ⩾ (k + 1) ( + 2α)
2 2
α α

3 2 6 3
⇔ (2α − 3α + 1)k ⩽ α − 2α + 1

Notice that k £ 1 as α ® 0. So we show that k = 1 is the desired value, that is for any positive number a, b, c with abc = 1 we
have to prove that

(1)
1 1 1
+ + + 3 ⩾ 2 (a + b + c)
2 2 2
a b c

Indeed, since abc = 1, there are two numbers say a, b such that either a, b ³ 1 or a, b £ 1. In this case

1 2 2 1
= c, a b =
2
ab c

The inequality (1) is equivalent to

2
1 1 2
( − ) + (a − 1) (b − 1) + (ab − 1) ⩾ 0
a b

which is obviously true.

13. x1+ x2 + x3 + 4x4 = 20
x4 can have 5 values [0, 1, 2, 3, 4, 5]
i) x1 + x2 + x3 ± 20 (x4 = 0)
Non – negative solution
= 22C2
ii) x1 + x2 + x3 ± 16 (x4 = 1)
Non-negative solution
= 18C2
iii) x1 + x2 + x3 = 12 (x4 = 2)
Non – negative solution
= 14C2
iv) x1 + x2 + x3 = 8 (x4 = 3)
Non – negative solution
= 10C2
v) x1 + x2 + x3 = 4 (x4 = 4)
Non negative solution
= 6 C2
vi) x1 + x2 + x = 0 (x4 = 5)
Solution = 2C2
Total number of solution
= 22C2 + 18C2 + 14C2 + 10C2 + 6C2 + 2C2
= 536

14. By hit and trial we get x = -1 and x = -3 are the roots of the equation.
4x4 + 27x3 + 63x2 + 61x + 21 = (x2 + 4x + 3)(4x2 + 11x + 7) = 0
4x2 + 11x + 7 = 0
(4x + 7)(x + 1) = 0
x = -7/4, -1
Roots are -1, –7/4, –1, –3
Minimum root is -3.
-4m = 12

15. The desired sum can be written as 12 x 10 − ∑ 5k=1 k2 xk .

Now note
5 5 5
2
∑ k xk = ∑ xk + (k − 1) (k + 1) xk ⩽ 6 + 6 ∑ (k − 1) xk = 6 + 6 (10 − 6) = 30.

k=1 k=1 k=1

Hence the quantity in question is at most 120 – 30 = 90, with equality for x1 = 5, x2 = …. = x4 = 0, x5 = 1.

16. Firstly, we find the number of distinct processes of the game A wins. Assume that ith player of A wins xi times (i = 1, 2, ......., 7),
then x1 + x2 + …..+ x7 = 7. Thus, the number of distinct processes of game A wins equals the number of nonnegative integer
7 + 7 − 1 13
solutions of the indefinite equation x1 + x2 + …… + x7 = 7, and it is ( ) = ( ) . Similarly, the number of distinct
7 − 1 6

13 13
processes of the game B wins also equals ( ) . So, the number of distinct processes of the game equals 2 ( ) = 3432.
6 6

17. We first do the prime factorization of the product by finding the powers of the prime factors in all
the factorials
Powers of 2 : 2! = 1, 3! = 1, 4! = 3, 5! = 3,6! = 4, 7! = 4, 8! = 7 Total = 23
Powers of 3 : 3! = 1, 4! = 1, 5! = 1, 6! = 2,7! = 2, 8! = [Link] = 9
Powers of 5: 5! = 1, 6! = 1, 7! = 3, 8! = 1 = 1. Total = 4
Therefore, the product = 223 × 39 × 54 × 7
2

Number of divisors that are perfect square = (number of even powers of 2) × (number of even powers of 3) × (number of even
powers of 5) × (number of even powers of 7) = 12 x 5 x 3 x 2 = 360

18. It's very well known that x3 ≡ 1, 0, -1 (mod 9).

However, 123 ≡ -3 (mod 9)
If k ≥ 1, this is impossible thus k = 0 and the equation becomes m3 – n3 = 124 which has the unique solution (m, n) = (5, 1).
19.

20. Let the side length = a

1

Length of smallest diagonal =

2
2
d1 = (√2a (√2 + 1))

Length of largest diagonal =

2
2
d2 = (2√2a (√2 + 1))

Area = 2a
2
(√2 + 1) = d1 . d2 = 4√2 square unit

21.

22.

23. The permutation a1, a2, …., an is called a good permutation satisfying the conditions (1) and (2). Since a1 = 1, then a2 = 2 or 3.
(i) If a2 = 2, then a2 – 1, a3 – 1, …, an – 1 is also a good permutation, and the number of these permutations is ƒ (n - 1).
(ii) If a2 = 3, a3 = 2, then a4 = 4, and a4 – 3, a5 – 3, …, an – 3 is also a good permutation, and the number of these permutation
is ƒ(n - 3)
(iii) If a2 = 3, a3 ≥ 4, let ak + 1 be the first even in this permutation (from the left to right), then a1, a2, … ak must be 1, 3, 5, …,
2k – 1 and ak + 1 = 2k or 2k – 2. Hence ak and ak + 1 are two adjacent positive integers. From the condition (2), we obtain that
all the numbers behind ak + 1 are large or less than ak+1. Since 2 is behind ak + 1, ak + 2, ak + 3, …, an are all less than ak + 1.
Therefore this permutation is unique, i.e. all positive odds less than or equal to n are arranged in an increasing order and
then all positive even less than or equal to n are arranged in a decreasing order.
Summarizing what we have described above, we obtain the following recurrence relation:
f(n) = f(n - 1) + f(n - 3) + 1 (n ≥ 4).
Using the method of enumeration, we obtain f(1) = 1, f(2) = 1, f(3) = 2, and with the above recurrence relation , we may count
the remainder with modulo 3 of this sequence, in the order of 1, 1, 2, 1, 0, 0, 2, 0, 1, 1, 2, 1, 0, 0, 2, 0, …
Thus the period of this sequence is 8 (this conclusion can be proved easily by the mathematical induction). and 2003 = 250 × 8
+ 3, and f(2003) = 2(mod 3).
24. Translated into mathematical terms, the problem is to calculate the number of permutations of the set {1,2,…., 9} in which no
one of the succesions 12,23,34,45,56,67,78,89 appears.
Let F(n) be the number of permutations of {1,2,…,n} with analogous property (call them feasible). We are going to derive a
recurrence formula. Clearly, F(1) = F(2) = 1.
A permutation of {1,2,….,n,n+1}
Arises from a permutation of π of
{1,2,….,n}
By inserting the element “n+1” to one of n + 1 positions (n–1 sockets between successive between successive entries, plus two
outer positions, one at the beginning and one at the end). The arising permutations will be feasible if either π is a feasible
permutation and the element “n + 1” is placed on any position except the one immediately after “n” or π is a non feasible
permutation, feasibility violated by a single for bidden pair k, k + 1 in direct succession, and the element “n + 1’’ is placed just
so as to disconnect that pair.
In the first case there are n possibilities of inserting the element “n+1” into one of F(n) feasible permutations π of {1,2,….,n}.
This yields the first summand in the recurrence formula (1) (below). In the second case the address of “n+1” is determined
(between ”k” and “k+1”), while k can be any number out of 1,2,…..,n–1; the permutation π with the only non-separated pair k,
k + 1 can be identified with a feasible permutation of an (n–1)- element set, since we can regard at “brick”(k,k+1) as a single
entity. This yields the second summand in the formula we arrive at:
F(n+1) = nF(n) + (n–1) F(n–1) ………….(1)
Using (1) and knowing the initial data F(1) =F(2) = 1 we easily compute F(9) = 148329.

25. Observe that each term of the sequence is of the form

1
for some positive integer m and that the terms form a non-
2m + 1

increasing sequence. The terms equal to are

1

2m + 1

.
1 1 1 1
, , ,. . . . ,
2⌊√m +1⌋+1 2⌊√m +2⌋+1
2 2 2
2⌊√m ⌋+1 2
2⌊√(m+1) −1⌋+1

In particular, there are (m + 1)2 −m2 = 2m + 1 terms equal to . So the first 3 terms are equal to , the nest 5 terms are
1 1

2m + 1 3

equal to , the next 7 terms are equal to , and so on. It follows that the sum of the series is an integer if and only if
1 1

5 7

n = 3 + 5 + 7 + …..+ (2m + 1) = (m + 1)2 −1,

for some positive integer m. Since 10002 −1 is less than one million while 10012 −1 is more than one million, we deduce that
the answer is 1000 − 1 = 999.

26. Note that the number of play blocks is a multiple of the LCM of 16,15, and 14 The value of this can be found to be (16) (15) (7)
= 1680 . This number is also divisible by 1,2,3,4,5,6,7,8,9,10 and 12, thus, the three numbers x, y, z are 9,11,[Link], 1680k ≡
3 when taken mod 9,11,13. Since 1680 is congruent to 6 mod 9 and 3 mod 13, and congruent to 8 mod 11, the
number k must be a number that is congruent to 1 mod 13, 2 mod 3 (because 6 is a multiple of 3, which is a factor of 9 that
can be divided out).Looking at the last condition shows that k ≡ 10 mod 11
Listing out the numbers congruent to 10 mod 11 and 1 mod 13 yield the following lists:
10 mod 11: 21,32,43,54,65,76,87,98,109,120,131…
1 mod 13: 14,27,40,53,66,79,92,105,118,131,144,157,170….
Least k = 131 and thus the answer is 1680(131) = 24 x 3 x 5 x7 x 131.

Number of distinct primes = 5

27.

Let the sides AB and AC be tangent to ω at Z and W, respectively. Let α = ∠ BAX and β = ∠ AXC. Because P Q and BC are
¯¯¯¯¯¯¯¯ ¯¯¯¯¯¯¯¯ ¯¯¯¯¯¯¯¯ ¯¯¯¯¯¯¯¯

both tangent to ω and ∠ YXC and ∠ QYX subtend the same arc of ω , it follows that ∠ AYP = ∠ QYX = ∠ YXC = β . By equal
tangents, PZ = PY. Applying the Law of Sines to ∆ APY yields
AZ ZP PY sin α
= 1 + = 1 + = 1 + .
AP AP AP sin β

Similarly, applying the law of Sines to ∆ ABX gives

AZ BP BX sin α
= 1 − = 1 − = 1 + .
AB AB AB sin β

It follows that
AZ AZ AZ AZ
2 = + = + ,
AP AB 3 7

Implying AZ = 21/5, Applying the same argument to ∆ AQY yields

,
AW AW AZ AZ 21 1 1
2 = + = + = ( + )
AQ AC AQ AC 5 AQ 8

From which AQ = 168/59.

3n – m = 9

28. The only answer is n = 2017.

Note that if x ≡y (mod n), then it follows f(x) ≡f(y) (mod n). Therefore, we are seeking all n such that f(x) ≡ 0 (mod n) has
unique solution modulo n.
Suppose that f(a) = kn for some integer k. Using the quadratic formula, we find that
45±√2017+4kn
a = (1)
2

Hence, 2017 + 4kn is an odd perfect square. So If one root of the quadratic is an integer, then so is the other. By the condition
of the problem, this implies that
45+√2017+4kn 45−√2017+4kn
≡ (mod n) ⇒ 2017 ≡0 (mod n).
2 2

Since 2017 is prime and n ≥ 2, it follows that n = 2017.

Conversely, if n = 2017, then the quadratic formula (1) tells us that for a to be an integer, we require 1 + 4k = 2017j2 for some
odd integer j = 2i + 1. Substituting this into the equation yield a = 1031 + 2017i or a = −986 − 2017i. So the only such value of
a in the required range is a 1031, which corresponds to i = 0, j = 1 and k = 504.

29.

Let It be the radius of the circle. Then the circumference of the circle is 2π R = 3 + 4 + 5 so R = 6/π . The central angle
subtended by the arc of length 5 measures 5/(6/π ) = 5π /6 radians. Likewise, the angles subtended by the arcs of length 4
and 3 have measures 2π /3 and π /2 radians, respectively. The area of the given triangle is the stun of the areas of the three
triangles into which it is partitioned by the radii to its vertices. A formula for the area of an isosceles triangle with two sides of
length R adjacent to an angle of measure 9 is (1/2)R2 sin θ , so the answer
is
2
1 5π 2π π 1 6 1 √3
2
R (sin + sin + sin ) = ( ) ( + + 1)
2 6 3 2 2 π 2 2

1 36 3+√3
= ( )( )
2
2 π 2

.
9
= (3 + √3)
2
π
30.

Applying stewart's Theorem to median AD, CE, we have:

BC2 + 4. 182 = 2(242 + AC2)
242 + 4. 272 = 2(AC2 + BC2)
Substituting the first equation into the sencod and simplification yields
242 = 2 (3AC2 + 2. 242 – 4 . 182) – 4 . 272
√ 5 5 4 3 7
⇒ AC = 2 . 3 + 2. 3 + 2 . 3 − 2 .3 = 3√70
2
12 16
By the powder of a point Theorem on E, we get EF =
27
=
3
. The Law of Consines on ΔACE gives
2 2
12 +27 −9.70 3
cos ∠AEC = ( ) =
2 .12 . 27 8

Hence sin ∠AEC Because ΔAEF, BEF have the same height and equal bases, the have the
55
2
= √1 − cos ∠AEC = √ .
8

same area, and

16 55
and the answer is 8 + 55 = 063.
1
[ABF ] = 2 [AEF ] = 2. . AE. EF sin ∠AEF = 12. .√ = 8√55,
2 3 8