Let $ p \geq 2$ be a prime number. Eduardo and Fernando play the following game making moves alternately: in each move, the current player chooses an index $i$ in the set $\{0,1,2,\ldots, p-1 \}$ that was not chosen before by either of the two players and then chooses an element $a_i$ from the set $\{0,1,2,3,4,5,6,7,8,9\}$. Eduardo has the first move. The game ends after all the indices have been chosen .Then the following number is computed: $$M=a_0+a_110+a_210^2+\cdots+a_{p-1}10^{p-1}= \sum_{i=0}^{p-1}a_i.10^i$$. The goal of Eduardo is to make $M$ divisible by $p$, and the goal of Fernando is to prevent this. Prove that Eduardo has a winning strategy. [i]Proposed by Amine Natik, Morocco[/i]

$ a \minus{} )$ Find all prime $ p$ such that $ \dfrac{7^{p \minus{} 1} \minus{} 1}{p}$ is a perfect square $ b \minus{} )$ Find all prime $ p$ such that $ \dfrac{11^{p \minus{} 1} \minus{} 1}{p}$ is a perfect square

Determine, with proof, if there exists an odd prime $p$ such that the following equation holds: $$\sum_{n = 1}^{\frac{p-1}{2}} \cot\left(\frac{\pi n^2}{p}\right) = 69\sqrt{p}$$ [i]Proposed by Chris Bao[/i]

Let $m, n, a, k$ be positive integers and $k>1$ such that the equality $$5^m+63n+49=a^k$$ holds. Find the minimum value of $k$.

Find all triplets of positive integers $ (a,m,n)$ such that $ a^m \plus{} 1 \mid (a \plus{} 1)^n$.

We call a positive integer $n$ is $good$ , if there exist integers $a,b,c,x,y$ such that $n=ax^2+bxy+cy^2$ and $b^2-4ac=-20$. Prove that the product of any two good numbers is also a good number.

Find the smallest $x \in\mathbb{N}$ for which $\frac{7x^{25}-10}{83}$ is an integer.

S is the set of all ($a$, $b$, $c$, $d$, $e$, $f$) where $a$, $b$, $c$, $d$, $e$, $f$ are integers such that $a^2 + b^2 + c^2 + d^2 + e^2 = f^2$. Find the largest $k$ which divides abcdef for all members of $S$.

Find the total number of primes $p<100$ such that $\lfloor (2+\sqrt{5})^p \rfloor-2^{p+1}$ is divisible by $p$. Here $\lfloor x \rfloor$ denotes the greatest integer less than or equal to $x$.

Let $p$ and $q$ be prime numbers of the form $4k+3$. Suppose that there exist integers $x$ and $y$ such that $x^2-pqy^2=1$. Prove that there exist positive integers $a$ and $b$ such that $|pa^2-qb^2|=1$.

Determine all pairs $(x, y)$ of integers such that \[1+2^{x}+2^{2x+1}= y^{2}.\]

Let $a, b$ be integers, and let $P(x) = ax^3+bx.$ For any positive integer $n$ we say that the pair $(a,b)$ is $n$-good if $n | P(m)-P(k)$ implies $n | m - k$ for all integers $m, k.$ We say that $(a,b)$ is $very \ good$ if $(a,b)$ is $n$-good for infinitely many positive integers $n.$ [list][*][b](a)[/b] Find a pair $(a,b)$ which is 51-good, but not very good. [*][b](b)[/b] Show that all 2010-good pairs are very good.[/list] [i]Proposed by Okan Tekman, Turkey[/i]

Find all natural integers $n$ such that $(n^3 + 39n - 2)n! + 17\cdot 21^n + 5$ is a square.

Let $b \geqslant 2$ be a positive integer. Anu has an infinite collection of notes with exactly $b-1$ copies of a note worth $b^k-1$ rupees, for every integer $k\geqslant 1$. A positive integer $n$ is called payable if Anu can pay exactly $n^2+1$ rupees by using some collection of her notes. Prove that if there is a payable number, there are infinitely many payable numbers. [i]Proposed by Shantanu Nene[/i]