Find all integers $ n\ge 2$ having the following property: for any $ k$ integers $ a_{1},a_{2},\cdots,a_{k}$ which aren't congruent to each other (modulo $ n$), there exists an integer polynomial $ f(x)$ such that congruence equation $ f(x)\equiv 0 (mod n)$ exactly has $ k$ roots $ x\equiv a_{1},a_{2},\cdots,a_{k} (mod n).$

Let $n$ be a natural number and $f_1$, $f_2$, ..., $f_n$ be polynomials with integers coeffcients. Show that there exists a polynomial $g(x)$ which can be factored (with at least two terms of degree at least $1$) over the integers such that $f_i(x)+g(x)$ cannot be factored (with at least two terms of degree at least $1$) over the integers for every $i$.

Find the number of $n$ that follow the following: $ \bigstar $ The number of integers $ (x,y,z) $ following this equation is not a multiple of 4. $ 2n=x^2+2y^2+2x^2+2xy+2yz $

Show that if the last digit of the number $x^2+xy+y^2$ is $0$ (where $x,y\in\mathbb{N}$ ) then last two digits are zero.

To [i]clip[/i] a convex $n$-gon means to choose a pair of consecutive sides $AB, BC$ and to replace them by the three segments $AM, MN$, and $NC$, where $M$ is the midpoint of $AB$ and $N$ is the midpoint of $BC$. In other words, one cuts off the triangle $MBN$ to obtain a convex $(n+1)$-gon. A regular hexagon ${\cal P}_6$ of area 1 is clipped to obtain a heptagon ${\cal P}_7$. Then ${\cal P}_7$ is clipped (in one of the seven possible ways) to obtain an octagon ${\cal P}_8$, and so on. Prove that no matter how the clippings are done, the area of ${\cal P}_n$ is greater than $\frac 13$, for all $n \geq 6$.

Prove that for every positive integer $n$ there exists an $n$-digit number divisible by $5^n$ all of whose digits are odd.

Let $p \neq 13$ be a prime number of the form $8k+5$ such that $39$ is a quadratic non-residue modulo $p$. Prove that the equation $$x_1^4+x_2^4+x_3^4+x_4^4 \equiv 0 \pmod p$$ has a solution in integers such that $p\nmid x_1x_2x_3x_4$.

For any natural number, let $S(n)$ denote sum of digits of $n$. Find the number of $3$ digit numbers for which $S(S(n)) = 2$.

[i][b]a)[/b][/i] Determine if there are matrices $A,B,C\in\mathrm{SL}_{2}(\mathbb{Z})$ such that $A^2+B^2=C^2$. [b][i]b)[/i][/b] Determine if there are matrices $A,B,C\in\mathrm{SL}_{2}(\mathbb{Z})$ such that $A^4+B^4=C^4$. [b]Note[/b]: The notation $A\in \mathrm{SL}_{2}(\mathbb{Z})$ means that $A$ is a $2\times 2$ matrix with integer entries and $\det A=1$.

Let $P(x)$ denote the polynomial \[3\sum_{k=0}^{9}x^k + 2\sum_{k=10}^{1209}x^k + \sum_{k=1210}^{146409}x^k.\]Find the smallest positive integer $n$ for which there exist polynomials $f,g$ with integer coefficients satisfying $x^n - 1 = (x^{16} + 1)P(x) f(x) + 11\cdot g(x)$. [i]Victor Wang.[/i]

A cryptographic code is designed as follows. The first time a letter appears in a given message it is replaced by the letter that is $ 1$ place to its right in the alphabet (assuming that the letter $ A$ is one place to the right of the letter $ Z$). The second time this same letter appears in the given message, it is replaced by the letter that is $ 1\plus{}2$ places to the right, the third time it is replaced by the letter that is $ 1 \plus{} 2 \plus{} 3$ places to the right, and so on. For example, with this code the word "banana" becomes "cbodqg". What letter will replace the last letter $ \text{s}$ in the message "Lee's sis is a Mississippi miss, Chriss!"? $ \textbf{(A)}\ \text{g}\qquad \textbf{(B)}\ \text{h}\qquad \textbf{(C)}\ \text{o}\qquad \textbf{(D)}\ \text{s}\qquad \textbf{(E)}\ \text{t}$

Let $\ell$ be a positive integer, and let $m,n$ be positive integers with $m\geq n$, such that $A_1,A_2,\cdots,A_m,B_1,\cdots,B_m$ are $m+n$ pairwise distinct subsets of the set $\{1,2,\cdots,\ell\}$. It is known that $A_i\Delta B_j$ are pairwise distinct, $1\leq i\leq m, 1\leq j\leq n$, and runs over all nonempty subsets of $\{1,2,\cdots,\ell\}$. Find all possible values of $m,n$.

Let $p$ be a prime number. Prove that there is no number divisible by $p$ in the $n-th$ row of Pascal's triangle if and only if $n$ can be represented in the form $n = p^sq - 1$, where $s$ and $q$ are integers with $s \geq 0, 0 < q < p$.

Let $a_1,a_2,a_3,\ldots$ be a sequence of integers, with the property that every consecutive group of $a_i$'s averages to a perfect square. More precisely, for every positive integers $n$ and $k$, the quantity \[\frac{a_n+a_{n+1}+\cdots+a_{n+k-1}}{k}\] is always the square of an integer. Prove that the sequence must be constant (all $a_i$ are equal to the same perfect square). [i]Evan O'Dorney and Victor Wang[/i]

Let $S$ be a finite set, and let $F$ be a family of subsets of $S$ such that a) If $A\subseteq S$, then $A\in F$ if and only if $S\setminus A\notin F$; b) If $A\subseteq B\subseteq S$ and $B\in F$, then $A\in F$. Determine if there must exist a function $f:S\to\mathbb{R}$ such that for every $A\subseteq S$, $A\in F$ if and only if \[\sum_{s\in A}f(s)<\sum_{s\in S\setminus A}f(s).\] [i]Evan O'Dorney.[/i]

Find the remainder when $A=3^3\cdot 33^{33}\cdot 333^{333}\cdot 3333^{3333}$ is divided by $100$.

Let be a group $ G $ of order $ 1+p, $ where $ p $ is and odd prime. Show that if $ p $ divides the number of automorphisms of $ G, $ then $ p\equiv 3\pmod 4. $

Let $n$ be a positive integer. Let $T_n$ be a set of positive integers such that: \[{T_n={ \{11(k+h)+10(n^k+n^h)| (1 \leq k,h \leq 10)}}\}\] Find all $n$ for which there don't exist two distinct positive integers $a, b \in T_n$ such that $a\equiv b \pmod{110}$

Determine which integers $n > 1$ have the property that there exists an infinite sequence $a_1, a_2, a_3, \ldots$ of nonzero integers such that the equality \[a_k+2a_{2k}+\ldots+na_{nk}=0\]holds for every positive integer $k$.

Find all positive integers $n$ such that $4^{n}+2007$ is a perfect square.

Find the last digit of \[7^1\times 7^2\times 7^3\times \cdots \times 7^{2009}\times 7^{2010}.\]

$ (a)$ Prove that every multiple of $ 6$ can be written as a sum of four cubes. $ (b)$ Prove that every integer can be written as a sum of five cubes.

Alice and Bob play the following game. They alternate selecting distinct nonzero digits (from $1$ to $9$) until they have chosen seven such digits, and then consider the resulting seven-digit number by concatenating the digits in the order selected, with the seventh digit appearing last (i.e. $\overline{A_1B_2A_3B_4A_6B_6A_7}$). Alice wins if and only if the resulting number is the last seven decimal digits of some perfect seventh power. Please determine which player has the winning strategy.

Determine all positive integers $n$ for which there exists a polynomial $f(x)$ with real coefficients, with the following properties: (1) for each integer $k$, the number $f(k)$ is an integer if and only if $k$ is not divisible by $n$; (2) the degree of $f$ is less than $n$. [i](Hungary) Géza Kós[/i]

Check if there exists positive integers $ a, b$ and prime number $p$ such that $a^3-b^3=4p^2$