Consider positive integers $2,3,\ldots,n-1,n$ where $n\ge96.$ Consider any partition in two (sub)sets. Show that at least one of these two sets always contains two numbers and their product. Show that the statement does not hold for $n=95,$ e.g. there is a partition without the mentioned property.

For any positive integer $k$, denote the sum of digits of $k$ in its decimal representation by $S(k)$. Find all polynomials $P(x)$ with integer coefficients such that for any positive integer $n \geq 2016$, the integer $P(n)$ is positive and $$S(P(n)) = P(S(n)).$$ [i]Proposed by Warut Suksompong, Thailand[/i]

The graph shows the price of five gallons of gasoline during the first ten months of the year. By what percent is the highest price more than the lowest price? [asy] import graph; size(12.5cm); real lsf=2; pathpen=linewidth(0.5); pointpen=black; pen fp = fontsize(10); pointfontpen=fp; real xmin=-1.33,xmax=11.05,ymin=-9.01,ymax=-0.44; pen ycycyc=rgb(0.55,0.55,0.55); pair A=(1,-6), B=(1,-2), D=(1,-5.8), E=(1,-5.6), F=(1,-5.4), G=(1,-5.2), H=(1,-5), J=(1,-4.8), K=(1,-4.6), L=(1,-4.4), M=(1,-4.2), N=(1,-4), P=(1,-3.8), Q=(1,-3.6), R=(1,-3.4), S=(1,-3.2), T=(1,-3), U=(1,-2.8), V=(1,-2.6), W=(1,-2.4), Z=(1,-2.2), E_1=(1.4,-2.6), F_1=(1.8,-2.6), O_1=(14,-6), P_1=(14,-5), Q_1=(14,-4), R_1=(14,-3), S_1=(14,-2), C_1=(1.4,-6), D_1=(1.8,-6), G_1=(2.4,-6), H_1=(2.8,-6), I_1=(3.4,-6), J_1=(3.8,-6), K_1=(4.4,-6), L_1=(4.8,-6), M_1=(5.4,-6), N_1=(5.8,-6), T_1=(6.4,-6), U_1=(6.8,-6), V_1=(7.4,-6), W_1=(7.8,-6), Z_1=(8.4,-6), A_2=(8.8,-6), B_2=(9.4,-6), C_2=(9.8,-6), D_2=(10.4,-6), E_2=(10.8,-6), L_2=(2.4,-3.2), M_2=(2.8,-3.2), N_2=(3.4,-4), O_2=(3.8,-4), P_2=(4.4,-3.6), Q_2=(4.8,-3.6), R_2=(5.4,-3.6), S_2=(5.8,-3.6), T_2=(6.4,-3.4), U_2=(6.8,-3.4), V_2=(7.4,-3.8), W_2=(7.8,-3.8), Z_2=(8.4,-2.8), A_3=(8.8,-2.8), B_3=(9.4,-3.2), C_3=(9.8,-3.2), D_3=(10.4,-3.8), E_3=(10.8,-3.8); filldraw(C_1--E_1--F_1--D_1--cycle,ycycyc); filldraw(G_1--L_2--M_2--H_1--cycle,ycycyc); filldraw(I_1--N_2--O_2--J_1--cycle,ycycyc); filldraw(K_1--P_2--Q_2--L_1--cycle,ycycyc); filldraw(M_1--R_2--S_2--N_1--cycle,ycycyc); filldraw(T_1--T_2--U_2--U_1--cycle,ycycyc); filldraw(V_1--V_2--W_2--W_1--cycle,ycycyc); filldraw(Z_1--Z_2--A_3--A_2--cycle,ycycyc); filldraw(B_2--B_3--C_3--C_2--cycle,ycycyc); filldraw(D_2--D_3--E_3--E_2--cycle,ycycyc); D(B--A,linewidth(0.4)); D(H--(8,-5),linewidth(0.4)); D(N--(8,-4),linewidth(0.4)); D(T--(8,-3),linewidth(0.4)); D(B--(8,-2),linewidth(0.4)); D(B--S_1); D(T--R_1); D(N--Q_1); D(H--P_1); D(A--O_1); D(C_1--E_1); D(E_1--F_1); D(F_1--D_1); D(D_1--C_1); D(G_1--L_2); D(L_2--M_2); D(M_2--H_1); D(H_1--G_1); D(I_1--N_2); D(N_2--O_2); D(O_2--J_1); D(J_1--I_1); D(K_1--P_2); D(P_2--Q_2); D(Q_2--L_1); D(L_1--K_1); D(M_1--R_2); D(R_2--S_2); D(S_2--N_1); D(N_1--M_1); D(T_1--T_2); D(T_2--U_2); D(U_2--U_1); D(U_1--T_1); D(V_1--V_2); D(V_2--W_2); D(W_2--W_1); D(W_1--V_1); D(Z_1--Z_2); D(Z_2--A_3); D(A_3--A_2); D(A_2--Z_1); D(B_2--B_3); D(B_3--C_3); D(C_3--C_2); D(C_2--B_2); D(D_2--D_3); D(D_3--E_3); D(E_3--E_2); D(E_2--D_2); label("0",(0.52,-5.77),SE*lsf,fp); label("\$ 5",(0.3,-4.84),SE*lsf,fp); label("\$ 10",(0.2,-3.84),SE*lsf,fp); label("\$ 15",(0.2,-2.85),SE*lsf,fp); label("\$ 20",(0.2,-1.85),SE*lsf,fp); label("$\mathrm{Price}$",(-.65,-3.84),SE*lsf,fp); label("$1$",(1.45,-5.95),SE*lsf,fp); label("$2$",(2.44,-5.95),SE*lsf,fp); label("$3$",(3.44,-5.95),SE*lsf,fp); label("$4$",(4.46,-5.95),SE*lsf,fp); label("$5$",(5.43,-5.95),SE*lsf,fp); label("$6$",(6.42,-5.95),SE*lsf,fp); label("$7$",(7.44,-5.95),SE*lsf,fp); label("$8$",(8.43,-5.95),SE*lsf,fp); label("$9$",(9.44,-5.95),SE*lsf,fp); label("$10$",(10.37,-5.95),SE*lsf,fp); label("Month",(5.67,-6.43),SE*lsf,fp); D(A,linewidth(1pt)); D(B,linewidth(1pt)); D(D,linewidth(1pt)); D(E,linewidth(1pt)); D(F,linewidth(1pt)); D(G,linewidth(1pt)); D(H,linewidth(1pt)); D(J,linewidth(1pt)); D(K,linewidth(1pt)); D(L,linewidth(1pt)); D(M,linewidth(1pt)); D(N,linewidth(1pt)); D(P,linewidth(1pt)); D(Q,linewidth(1pt)); D(R,linewidth(1pt)); D(S,linewidth(1pt)); D(T,linewidth(1pt)); D(U,linewidth(1pt)); D(V,linewidth(1pt)); D(W,linewidth(1pt)); D(Z,linewidth(1pt)); D(E_1,linewidth(1pt)); D(F_1,linewidth(1pt)); D(O_1,linewidth(1pt)); D(P_1,linewidth(1pt)); D(Q_1,linewidth(1pt)); D(R_1,linewidth(1pt)); D(S_1,linewidth(1pt)); D(C_1,linewidth(1pt)); D(D_1,linewidth(1pt)); D(G_1,linewidth(1pt)); D(H_1,linewidth(1pt)); D(I_1,linewidth(1pt)); D(J_1,linewidth(1pt)); D(K_1,linewidth(1pt)); D(L_1,linewidth(1pt)); D(M_1,linewidth(1pt)); D(N_1,linewidth(1pt)); D(T_1,linewidth(1pt)); D(U_1,linewidth(1pt)); D(V_1,linewidth(1pt)); D(W_1,linewidth(1pt)); D(Z_1,linewidth(1pt)); D(A_2,linewidth(1pt)); D(B_2,linewidth(1pt)); D(C_2,linewidth(1pt)); D(D_2,linewidth(1pt)); D(E_2,linewidth(1pt)); D(L_2,linewidth(1pt)); D(M_2,linewidth(1pt)); D(N_2,linewidth(1pt)); D(O_2,linewidth(1pt)); D(P_2,linewidth(1pt)); D(Q_2,linewidth(1pt)); D(R_2,linewidth(1pt)); D(S_2,linewidth(1pt)); D(T_2,linewidth(1pt)); D(U_2,linewidth(1pt)); D(V_2,linewidth(1pt)); D(W_2,linewidth(1pt)); D(Z_2,linewidth(1pt)); D(A_3,linewidth(1pt)); D(B_3,linewidth(1pt)); D(C_3,linewidth(1pt)); D(D_3,linewidth(1pt)); D(E_3,linewidth(1pt)); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle);[/asy] $\textbf{(A)}\ 50 \qquad \textbf{(B)}\ 62 \qquad \textbf{(C)}\ 70 \qquad \textbf{(D)}\ 89 \qquad \textbf{(E)}\ 100$

For $f(x)=\frac{1}{x}\ (x>0)$, prove the following inequality. \[f\left(t+\frac 12 \right)\leq \int_t^{t+1} f(x)\ dx\leq \frac 16\left\{f(t)+4f\left(t+\frac 12\right)+f(t+1)\right\}\]

Let $S$ be a finite set and let $\mathcal{P}(S)$ be its power set, i.e., the set of all subsets of $S$, the empty set and $S$, inclusive. If $\mathcal{A}$ and $\mathcal{B}$ are non-empty subsets of $\mathcal{P}(S),$ let \[\mathcal{A}\vee \mathcal{B}=\{X:X\subseteq A\cup B,A\in\mathcal{A},B\in\mathcal{B}\}.\] Given a non-negative integer $n\leqslant |S|,$ determine the minimal size $\mathcal{A}\vee \mathcal{B}$ may have, where $\mathcal{A}$ and $\mathcal{B}$ are non-empty subsets of $\mathcal{P}(S)$ such that $|\mathcal{A}|+|\mathcal{B}|>2^n$. [i]Amer. Math. Monthly[/i]

The natural numbers from $1$ up to $300$ are evenly located around a circle. We say that such an ordering is [i]alternate [/i ]if each number is less than its two neighbors or is greater than its two neighbors. We will call a pair of neighboring numbers a [i]good [/i] pair if, by removing that pair from the circumference, the remaining numbers form an alternate ordering. Determine the least possible number of good pairs in which there can be an alternate ordering of the numbers from $1$ at $300$ inclusive.

How many zeros does $100!$ have at its end in the usual decimal representation?

Find all surjective functions $ f: \mathbb{N} \to \mathbb{N}$ such that for every $ m,n \in \mathbb{N}$ and every prime $ p,$ the number $ f(m + n)$ is divisible by $ p$ if and only if $ f(m) + f(n)$ is divisible by $ p$. [i]Author: Mohsen Jamaali and Nima Ahmadi Pour Anari, Iran[/i]

The faces of a box with integer edge lengths are painted green. The box is partitioned into unit cubes. Find the dimensions of the box if the number of unit cubes with no green face is one third of the total number of cubes.

Given positive numbers $a,b,c,d$. Prove that the set of inequalities $$a+b<c+d$$ $$(a+b)(c+d)<ab+cd$$ $$(a+b)cd<ab(c+d)$$ contain at least one wrong.

Let $H$ be a regular hexagon with side length $1$. The sum of the areas of all triangles whose vertices are all vertices of $H$ can be expressed as $A\sqrt{B}$ for positive integers $A$ and $B$ such that $B$ is square-free. What is $1000A +B$?

A planar polygon $A_1A_2A_3 . . .A_{n-1}A_n$ ($n > 4$) is made of rigid rods that are connected by hinges. Is it possible to bend the polygon (at hinges only!) into a triangle?

Let $a_1, a_2, \dots, a_{2020}$ and $b_1, b_2, \dots, b_{2020}$ be real numbers(not necessarily distinct). Suppose that the set of positive integers $n$ for which the following equation: $|a_1|x-b_1|+a_2|x-b_2|+\dots+a_{2020}|x-b_{2020}||=n$ (1) has exactly two real solutions, is a finite set. Prove that the set of positive integers $n$ for which the equation (1) has at least one real solution, is also a finite set.

The sum of positive real numbers $ a,b,c,d$ is $ 1$. Prove that: $ \frac{a^2}{a\plus{}b}\plus{}\frac{b^2}{b\plus{}c}\plus{}\frac{c^2}{c\plus{}d}\plus{}\frac{d^2}{d\plus{}a} \ge \frac{1}{2},$ with equality if and only if $ a\equal{}b\equal{}c\equal{}d\equal{}\frac{1}{4}$.

Find all elements $n \in A = \{2,3,...,2016\} \subset \mathbb{N}$ such that: every number $m \in A$ smaller than $n$, and coprime with $n$, must be a prime number

Let $S$ be a set of in $3-$ space such that each of the points in $S$ has integer coordinates $(x,y,z)$ with $1 \le x,y,z \le n $. Suppose the pairwise distances between these points are all distinct. Prove that $$|S| \le min \{(n+2)\sqrt{\frac{n}{3}},n\sqrt{6} \}$$