Subcontests
(8)inequalities with 3-element subsets of {1,2,...,n}
Let n,m be positive integers. Let A1,A2,A3,...,Am be sets such that Ai⊆{1,2,3,...,n} and ∣Ai∣=3 for all i (i.e. Ai consists of three different positive integers each at most n). Suppose for all i<j we have ∣Ai∩Aj∣≤1 (i.e. Ai and Aj have at most one element in common).
(a) Prove that m≤6n(n−1) .
(b) Show that for all n≥3 it is possible to have m≥6(n−1)(n−2) . f(m) = f(m + 1), where f(n) is number of subsets of {1,...,n}
For any positive integer n, let f(n) be the number of subsets of {1,2,...,n} whose sum is equal to n. Does there exist infinitely many positive integers m such that f(m)=f(m+1)?
(Note that each element in a subset must be distinct.) at least one of a,b,c >17/10 if a,b,c>0 with a+b+c = abc
Let a,b and c be positive real numbers such that a+b+c=abc. Prove that at least one of a,b or c is greater than 1017 .