Subcontests
(18)Show that there exists a permutation
Let n be a positive integer having at least two different prime factors. Show that there exists a permutation a1,a2,…,an of the integers 1,2,…,n such that
k=1∑nk⋅cosn2πak=0. Polynomial of degree 990
Let (Fn)n≥1 be the Fibonacci sequence F1=F2=1,Fn+2=Fn+1+Fn(n≥1), and P(x) the polynomial of degree 990 satisfying
P(k)=Fk, for k=992,...,1982.
Prove that P(1983)=F1983−1. Distance of points
Let P1,P2,…,Pn be distinct points of the plane, n≥2. Prove that
1≤i<j≤nmaxPiPj>23(n−1)1≤i<j≤nminPiPj Set of polynomials
Let F(n) be the set of polynomials P(x)=a0+a1x+⋯+anxn, with a0,a1,...,an∈R and 0≤a0=an≤a1=an−1≤⋯≤a[n/2]=a[(n+1)/2]. Prove that if f∈F(m) and g∈F(n), then fg∈F(m+n). Is there a set of positive integers ?
Decide whether there exists a set M of positive integers satisfying the following conditions:(i) For any natural number m>1 there exist a,b∈M such that a+b=m.(ii) If a,b,c,d∈M, a,b,c,d>10 and a+b=c+d, then a=c or a=d. Show that 0 < f(x)-x < c
Let f:[0,1]→R be continuous and satisfy:
\begin{cases}bf(2x) = f(x), &\mbox{ if } 0 \leq x \leq 1/2,\\ f(x) = b + (1 - b)f(2x - 1), &\mbox{ if } 1/2 \leq x \leq 1,\end{cases}
where b=2+c1+c, c>0. Show that 0<f(x)−x<c for every x,0<x<1. 3n students participate in a test
In a test, 3n students participate, who are located in three rows of n students in each. The students leave the test room one by one. If N1(t),N2(t),N3(t) denote the numbers of students in the first, second, and third row respectively at time t, find the probability that for each t during the test,
∣Ni(t)−Nj(t)∣<2,i=j,i,j=1,2,…. Existence of r
Suppose that x1,x2,…,xn are positive integers for which x1+x2+⋯+xn=2(n+1). Show that there exists an integer r with 0≤r≤n−1 for which the following n−1 inequalities hold:
xr+1+⋯+xr+i≤2i+1,∀i,1≤i≤n−r;
xr+1+⋯+xn+x1+⋯+xi≤2(n−r+i)+1,∀i,1≤i≤r−1.
Prove that if all the inequalities are strict, then r is unique and that otherwise there are exactly two such r. Superabundant Numbers
Let n be a positive integer. Let σ(n) be the sum of the natural divisors d of n (including 1 and n). We say that an integer m≥1 is superabundant (P.Erdos, 1944) if ∀k∈{1,2,…,m−1}, mσ(m)>kσ(k).
Prove that there exists an infinity of superabundant numbers. Airlines
The localities P1,P2,…,P1983 are served by ten international airlines A1,A2,…,A10. It is noticed that there is direct service (without stops) between any two of these localities and that all airline schedules offer round-trip flights. Prove that at least one of the airlines can offer a round trip with an odd number of landings.