olymmath

KURSCHAK 1990

Kürschák Competition 1990.

Other problems

Problem 1

Let p>2p>2 be a prime number and nn a positive integer. Prove that pn2pn^2 has at most one positive divisor dd for which n2+dn^2+d is a square number.

Problem 2

The incenter of △A1A2A3\triangle A_1A_2A_3 is II , and the center of the AiA_i -excircle is JiJ_i ( i=1,2,3i=1,2,3 ). Let BiB_i be the intersection point of side Ai+1Ai+2A_{i+1}A_{i+2} and the bisector of ∠Ai+1IAi+2\angle A_{i+1}IA_{i+2} ( Ai+3:=AiA_{i+3}:=A_i ∀i\forall i ). Prove that the three lines BiJiB_iJ_i are concurrent.

Problem 3

We would like to give a present to one of 100100 children. We do this by throwing a biased coin kk times, after predetermining who wins in each possible outcome of this lottery.

Prove that we can choose the probability pp of throwing heads, and the value of kk such that, by distributing the 2k2^k different outcomes between the children in the right way, we can guarantee that each child has the same probability of winning.