CRP - B - 2010

Please mail the solutions on or before 22-10-2010 to Prof. C.R. Pranesachar,

MO Cell, Department of Mathematics, Indian Institute of Science,
Bangalore - 560 012.

B-1 Let A, B, C, D be four distinct points in the plane such that the length of the
six line segments AB, AC, AD, BC, BD, CD form a 2-element set {a, b}. If a > b,
determine all the possible values of a/b.

B-2 Let a1 , a2 , · · · , an be real numbers lying in [−1, 1] such that a1 + a2 + · · · + an = 0.

Prove that there is a k ∈ {1, 2, · · · , n} such that |a1 + 2a2 + 3a3 + · · · + kak | ≤ 2k+1
4
.

B-3 Prove that a prime number p is expressible in the form a2 + 3b2 , a, b ∈ Z

if and only if it is expressible in the form x2 + xy + y 2 , x, y ∈ Z. Can p be
replaced by a natural number n?

B-4 Let C1 , C2 be two circles in the plane intersecting at two distinct points. Let
P be the midpoint of a variable chord AB of C2 with the property that the
circle on AB as diameter meets C1 at a point T such that P T is tangent to C1 .
Find the locus of P .

B-5 Prove that there exists a set of 2010 (distinct) natural numbers such that
the product of any 1006 numbers is divisible by the product of the remaining
1004 numbers.

B-6 Let n > 1 be an integer. A set S ⊆ {0, 1, 2, · · · , 4n − 1} is called ’sparse’ if for

any k ∈ {0, 1, 2, · · · , n − 1} the following two conditions are satisfied: (a) The
set S ∩ {4k − 2, 4k − 1, 4k, 4k + 1, 4k + 2} has at most two elements; (b) the set
S ∩{4k +1, 4k +2, 4k +3} has at most one element. Prove that there are exactly
8.7n−1 sparse subsets.

− − − − − ∗ ∗ − − − −−
Instructions : Write your answers on A4 size sheets neatly and legibly. Use a thick envelop
and send by Speedpost / Registered post. Draw diagrams on the left hand side of the page.
Answer different questions on separate sheets. Write your name and address at least at two
places. Inform change of address (residential or email), if any.