Show that there are only finitely many triples $(a, b, c)$ of positive integers such that $\frac{1}{a} + \frac{1}{b} + \frac{1}{c} = \frac{1}{1000}$.

Determine the smallest number $n \in Z_+$, which can be written as $n = \Sigma_{a\in A}a^2$, where $A$ is a finite set of positive integers and $\Sigma_{a\in A}a= 2014$. In other words: what is the smallest positive number which can be written as a sum of squares of different positive integers summing to $2014$?

Prove that there are infinitely many positive integers $m$ for which there exists consecutive odd positive integers $p_m<q_m$ such that $p_m^2+p_mq_m+q_m^2$ and $p_m^2+m\cdot p_mq_m+q_m^2$ are both perfect squares. If $m_1, m_2$ are two positive integers satisfying this condition, then we have $p_{m_1}\neq p_{m_2}$

Determine all the sets of six consecutive positive integers such that the product of some two of them . added to the product of some other two of them is equal to the product of the remaining two numbers.

Let $D_n$ be the set of divisors of $n$. Find all natural $n$ such that it is possible to split $D_n$ into two disjoint sets $A$ and $G$, both containing at least three elements each, such that the elements in $A$ form an arithmetic progression while the elements in $G$ form a geometric progression.

$(GBR 1)$ The polynomial $P(x) = a_0x^k + a_1x^{k-1} + \cdots + a_k$, where $a_0,\cdots, a_k$ are integers, is said to be divisible by an integer $m$ if $P(x)$ is a multiple of $m$ for every integral value of $x$. Show that if $P(x)$ is divisible by $m$, then $a_0 \cdot k!$ is a multiple of $m$. Also prove that if $a, k,m$ are positive integers such that $ak!$ is a multiple of $m$, then a polynomial $P(x)$ with leading term $ax^k$can be found that is divisible by $m.$

The last four digits of a perfect square are equal. Prove that all of them are zeros.

We define the following sequences: • Sequence $A$ has $a_n = n$. • Sequence $B$ has $b_n = a_n$ when $a_n \not\equiv 0$ (mod 3) and $b_n = 0$ otherwise. • Sequence $C$ has $c_n =\sum_{i=1}^{n} b_i$ .• Sequence $D$ has $d_n = c_n$ when $c_n \not\equiv 0$ (mod 3) and $d_n = 0$ otherwise. • Sequence $E$ has $e_n =\sum_{i=1}^{n}d_i$ Prove that the terms of sequence E are exactly the perfect cubes.

Find some four different natural numbers with the following property: if you add to the product of any two of them the product of the two remaining numbers. you get a prime number.

Prove that for all primes $p>3$, $\binom{2p}{p}-2$ is divisible by $p^3$

I plotted the graphs $y=(x-0)^2, y=(x-5)^2, \ldots, y=(x-45)^2.$ I also draw a line $y=k,$ and notice that it intersects the parabolas at exactly $19$ distinct points. What is $k$?

Let $\,n>6\,$ be an integer and $\,a_{1},a_{2},\ldots,a_{k}\,$ be all the natural numbers less than $n$ and relatively prime to $n$. If \[a_{2}-a_{1}=a_{3}-a_{2}=\cdots =a_{k}-a_{k-1}>0,\] prove that $\,n\,$ must be either a prime number or a power of $\,2$.

Let $k$ be a positive integer such that $1 +\frac12+\frac13+ ... +\frac{1}{13}=\frac{k}{13!}$. Find the remainder when $k$ is divided by $7$.

Find all the odd positive integers $n$ such that there are $n$ odd integers $x_1, x_2,..., x_n$ such that $$x_1^2+x_2^2+...+x_n^2=n^4$$

For any odd prime $p$ and any integer $n,$ let $d_p (n) \in \{ 0,1, \dots, p-1 \}$ denote the remainder when $n$ is divided by $p.$ We say that $(a_0, a_1, a_2, \dots)$ is a [i]p-sequence[/i], if $a_0$ is a positive integer coprime to $p,$ and $a_{n+1} =a_n + d_p (a_n)$ for $n \geqslant 0.$ (a) Do there exist infinitely many primes $p$ for which there exist $p$-sequences $(a_0, a_1, a_2, \dots)$ and $(b_0, b_1, b_2, \dots)$ such that $a_n >b_n$ for infinitely many $n,$ and $b_n > a_n$ for infinitely many $n?$ (b) Do there exist infinitely many primes $p$ for which there exist $p$-sequences $(a_0, a_1, a_2, \dots)$ and $(b_0, b_1, b_2, \dots)$ such that $a_0 <b_0,$ but $a_n >b_n$ for all $n \geqslant 1?$ [I]United Kingdom[/i]

Prove that if $\frac{2^n- 2}{n} $ is an integer, then so is $\frac{2^{2^n-1}-2}{2^n - 1}$ .

Let $n, m \in \mathbb{N}$; $a_1,\ldots, a_m \in \mathbb{Z}^n$. Show that nonnegative integer linear combinations of these vectors give exactly the whole $\mathbb{Z}^n$ lattice, if $m \ge n$ and the following two statements are satisfied: [list] [*] The vectors do not fall into the half-space of $\mathbb{R}^n$ containing the origin (i.e. they do not fall on the same side of an $n-1$ dimensional subspace), [*] the largest common divisor (not pairwise, but together) of $n \times n$ minor determinants of the matrix $(a_1,\ldots, a_m)$ (which is of size $m \times n$ and the $i$-th column is $a_i$ as a column vector) is $1$. [/list]

Let $P_1,P_2,\ldots ,P_n$, be infinite arithmetic progressions of positive integers, of differences $d_1,d_2,\ldots ,d_n$, respectively. Prove that if every positive integer appears in at least one of the $n$ progressions then one of the differences $d_i$ divides the least common multiple of the remaining $n-1$ differences. Note: $P_i=\left \{ a_i,a_i+d_i,a_i+2d_i,a_i+3d_i,a_i+4d_i,\cdots \right \}$ with $ a_i$ and $d_i$ positive integers.

For what positive integer values of $x$ is $x^4 + 6x^3 + 11x^2 + 3x + 31$ a perfect square?

(a) Is $2005^{2004}$ the sum of two perfect squares? (b) Is $2004^{2005}$ the sum of two perfect squares?

Let $P(x)=x+1$ and $Q(x)=x^2+1.$ Consider all sequences $\langle(x_k,y_k)\rangle_{k\in\mathbb{N}}$ such that $(x_1,y_1)=(1,3)$ and $(x_{k+1},y_{k+1})$ is either $(P(x_k), Q(y_k))$ or $(Q(x_k),P(y_k))$ for each $k. $ We say that a positive integer $n$ is nice if $x_n=y_n$ holds in at least one of these sequences. Find all nice numbers.

Let $f(x)=x^2+4x+2$. Let $r$ be the difference between the largest and smallest real solutions of the equation $f(f(f(f(x))))=0$. Then $r=a^{\frac{p}{q}}$ for some positive integers $a$, $p$, $q$ so $a$ is square-free and $p,q$ are relatively prime positive integers. Compute $a+p+q$.

Problem. The sum of two consecutive squares can be a square; for instance $3^2 + 4^2 = 5^2$. (a) Prove that the sum of $m$ consecutive squares cannot be a square for $m \in \{3, 4, 5, 6\}$. (b) Find an example of eleven consecutive squares whose sum is a square. Can anyone help me with this? Thanks.

Prove that the equation \[ x^{2008}\plus{} 2008!\equal{} 21^{y}\] doesn't have solutions in integers.

Let sequence $\{a_1,a_2,\dots \}$ with integer terms satisfy the following conditions: 1) $a_{n+1}=3a_n-3a_{n-1}+a_{n-2}, n=2,3,\dots$ ; 2) $2a_1=a_0+a_2-2$ ; 3) for arbitrary natural number $m$, there exist $m$ consecutive terms $a_k, a_{k-1}, \dots ,a_{k+m-1}$ among the sequence such that all such $m$ terms are perfect squares. Prove that all terms of the sequence $\{a_1,a_2,\dots \}$ are perfect squares.