Subcontests
(11)At most k^2/2^n sequences
Let B be a set of k sequences each having n terms equal to 1 or −1. The product of two such sequences (a1,a2,…,an) and (b1,b2,…,bn) is defined as (a1b1,a2b2,…,anbn). Prove that there exists a sequence (c1,c2,…,cn) such that the intersection of B and the set containing all sequences from B multiplied by (c1,c2,…,cn) contains at most 2nk2 sequences. Prove that min(x1,x2,...,xn) = sqrt n
Let n be an integer greater than 1. Definex1=n,y1=1,xi+1=[2xi+yi],yi+1=[xi+1n],for i=1,2,… ,where [z] denotes the largest integer less than or equal to z. Prove that
min{x1,x2,…,xn}=[n] Find n such that there exist two polynomials f, g
For which positive integers n do there exist two polynomials f and g with integer coefficients of n variables x1,x2,…,xn such that the following equality is satisfied:i=1∑nxif(x1,x2,…,xn)=g(x12,x22,…,xn2) ? Prove that S4 is similar to S - ISL 1977
Let S be a convex quadrilateral ABCD and O a point inside it. The feet of the perpendiculars from O to AB,BC,CD,DA are A1,B1,C1,D1 respectively. The feet of the perpendiculars from O to the sides of Si, the quadrilateral AiBiCiDi, are Ai+1Bi+1Ci+1Di+1, where i=1,2,3. Prove that S4 is similar to S. Integer solutions of the system of inequalities
Let n be a positive integer. How many integer solutions (i,j,k,l), 1≤i,j,k,l≤n, does the following system of inequalities have:1≤−j+k+l≤n1≤i−k+l≤n1≤i−j+l≤n1≤i+j−k≤n ? 2^n words - ISL 1987
There are 2n words of length n over the alphabet {0,1}. Prove that the following algorithm generates the sequence w0,w1,…,w2n−1 of all these words such that any two consecutive words differ in exactly one digit.(1) w0=00…0 (n zeros).(2) Suppose w_{m-1} = a_1a_2 \ldots a_n, a_i \in \{0, 1\}. Let e(m) be the exponent of 2 in the representation of n as a product of primes, and let j=1+e(m). Replace the digit aj in the word wm−1 by 1−aj. The obtained word is wm.