Subcontests
(11)2n integers arbitrarily assigned to 2n numbered boxes
Integers 1,2,...,2n are arbitrarily assigned to boxes labeled with numbers 1,2,...,2n. Now, we add the number assigned to the box to the number on the box label. Show that two such sums give the same remainder modulo 2n. a_{n+1} = a_n+s(a_n), whereas s(a)=sum of digits of a
Let s(a) denote the sum of digits of a given positive integer a. The sequence a1,a2,...,an,... of positive integers is such that an+1=an+s(an) for each positive integer n. Find the greatest possible n for which it is possible to have an=2008. 1/x+4/y+9/z=3, x+y+z<=12, x,y,z >0
Find all triples (x,y,z) of real positive numbers, which satisfy the system {x1+y4+z9=3x+y+z≤12 1^1, 2^2,..., 2008^{2008} rearrangement for perfect square
Is it possible to arrange the numbers 11,22,...,20082008 one after the other, in such a way that the obtained number is a perfect square? (Explain your answer.) 0<a,b,c,d<1 => 1 + ab + bc + cd + da + ac + bd > a+b+c+d
If the real numbers a,b,c,d are such that 0<a,b,c,d<1, show that 1+ab+bc+cd+da+ac+bd>a+b+c+d. 2008 JBMO Shortlist G8
The side lengths of a parallelogram are a,b and diagonals have lengths x and y. Knowing that ab=2xy, show that (a,b)=(2x,2y) or (a,b)=(2y,2x).
1 square is sum of 3 squares in 2 different ways
Let a,b,c,d,e,f are nonzero digits such that the natural numbers abc,def and abcdef are squares.
a) Prove that abcdef can be represented in two different ways as a sum of three squares of natural numbers.
b) Give an example of such a number. 1-1024, deleting 4k+3 numbers, successively for 5 times
Consider an integer n≥4 and a sequence of real numbers x1,x2,x3,...,xn. An operation consists in eliminating all numbers not having the rank of the form 4k+3, thus leaving only the numbers x3.x7.x11,...(for example, the sequence 4,5,9,3,6,6,1,8 produces the sequence 9,1). Upon the sequence 1,2,3,...,1024 the operation is performed successively for 5 times. Show that at the end only one number remains and find this number.