Subcontests
(20)Sets of numbers called balanced sets
A subset S of 1,2,...,n is called balanced if for every a from S there exists some bfrom S, b=a, such that 2(a+b) is in S as well.
(a) Let k>1be an integer and let n=2k. Show that every subset S of 1,2,...,n with ∣S∣>43n is balanced.
(b) Does there exist an n=2k, with k>1 an integer, for which every subset S of 1,2,...,n with ∣S∣>32n is balanced? Polynomial
Let f(x)=xn+an−1xn−1+...+a0 be a polynomial of degree n≥1 with n (not necessarily distinct) integer roots. Assume that there exist distinct primes p0,p1,..,pn−1 such that ai>1 is a power of pi, for all i=0,1,..,n−1. Find all possible values of n. Combinatorics.
Let n>2 be an integer. A deck contains 2n(n−1) cards,numbered 1,2,3,⋯,2n(n−1) Two cards form a magic pair if their numbers are consecutive , or if their numbers are 1 and 2n(n+1). For which n is it possible to distribute the cards into n stacks in such a manner that, among the cards in any two stacks , there is exactly one magic pair? Algebra .Inequality
Let n be a positive integer and let a1,⋯,an be real numbers satisfying 0≤ai≤1 for i=1,⋯,n. Prove the inequality (1−ain)(1−a2n)⋯(1−ann)≤(1−a1a2⋯an)n. Triangle Sides
Three pairwairs distinct positive integers a,b,c, with gcd(a,b,c)=1, satisfy a∣(b−c)2,b∣(a−c)2,c∣(a−b)2 Prove that there doesnt exist a non-degenerate triangle with side lengths a,b,c.