(1) Let $a,b$ be coprime positive integers. Prove that there exists constants $\lambda$ and $\beta$ such that for all integers $m$, $$\left| \sum\limits_{k=1}^{m-1} \left\{ \frac{ak}{m} \right\}\left\{ \frac{bk}{m} \right\} - \lambda m \right| \le \beta$$ (2) Prove that there exists $N$ such that for all $p>N$ (where $p$ is a prime number), and any positive integers $a,b,c$ positive integers satisfying $p\nmid (a+b)(b+c)(c+a)$, there are at least $\lfloor \frac{p}{12} \rfloor$ solutions $k\in \{1,\cdots,p-1\}$ such that $$ \left\{\frac{ak}{p}\right\} + \left\{\frac{bk}{p}\right\} + \left\{\frac{ck}{p}\right\} \le 1 $$

How many natural numbers $n$ satisfy the following conditions: i) $219<=n<=2019$, ii) there exist integers $x, y$, so that $1<=x<n<y$, and $y$ is divisible by all natural numbers from $1$ to $n$ with the exception of the numbers $x$ and $x + 1$ with which $y$ is not divisible by.

The number $1000$ can be written as the sum of $16$ consecutive natural numbers: $$1000 = 55 + 56 + ... + 70.$$ Determines all natural numbers that cannot be written as the sum of two or more consecutive natural numbers .

A function $f$ is defined on the complex numbers by $f(z)=(a+bi)z,$ where $a$ and $b$ are positive numbers. This function has the property that the image of each point in the complex plane is equidistant from that point and the origin. Given that $|a+bi|=8$ and that $b^2=m/n,$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$

Let $p,q$ be two consecutive odd prime numbers. Prove that $p+q$ is a product of at least $3$ natural numbers greater than $1$ (not necessarily different).

When Andris entered the room, there were the numbers $3$ and $24$ on the board. In one step, if there are the (not necessarily different) numbers $k$ and $n$ on the board already, then Andris can write the number$ kn + k + n$ on the board, too. a) Can Andris write the number $9999999$ on the board after a few moves? b) What if he wants to get $99999999$? c) And what about $48999999$?

Find all functions $f: \mathbb N \cup \{0\} \to \mathbb N\cup \{0\}$ such that $f(1)>0$ and \[f(m^2+3n^2)=(f(m))^2 + 3(f(n))^2 \quad \forall m,n \in \mathbb N\cup \{0\}.\]

Find all $n\in \mathbb{N} $ so that 7 divides $5^n + 1$

Let $a > 3$ be an odd integer. Show that for every positive integer $n$ the number $a^{2^n}- 1$ has at least $n + 1$ distinct prime divisors.

The notation $\phi (n)$ is the number of positive integers smaller than $n$ and coprime with $n$, $\pi (n)$ is the number of primes that do not exceed $n$. Prove that for any natural number $n > 1$, we have $$\phi (n) \ge \frac{\pi (n)}{2}$$

An infinite sequence of integers, $a_0,a_1,a_2,\dots,$ with $a_0>0$, has the property that for $n\ge 0$, $a_{n+1}=a_n-b_n$, where $b_n$ is the number having the same sign as $a_n$, but having the digits written in the reverse order. For example if $a_0=1210,a_1=1089$ and $a_2=-8712$, etc. Find the smallest value of $a_0$ so that $a_n\neq 0$ for all $n\ge 1$.

Let $(m,n)$ be a pair of positive integers. (a) Prove that the set of all positive integers can be partitioned into four pairwise disjoint nonempty subsets such that none of them has two numbers with absolute value of their difference equal to either $m$, $n$, or $m+n$. (b) Find all pairs $(m,n)$ such that the set of all positive integers can not be partitioned into three pairwise disjoint nonempty subsets satisfying the above condition.

Compute the number of ordered pairs of positive integers $(a, b)$ satisfying the equation $$gcd(a, b) \cdot a + b^2 = 10000.$$

Determine all positive integers $M$ such that the sequence $a_0, a_1, a_2, \cdots$ defined by \[ a_0 = M + \frac{1}{2} \qquad \textrm{and} \qquad a_{k+1} = a_k\lfloor a_k \rfloor \quad \textrm{for} \, k = 0, 1, 2, \cdots \] contains at least one integer term.

Find all positive integers $x, y, z$ such that $2^x + 2^y + 2^z = 2336$.

For every positive integer $n$, let $p(n)$ denote the number of sets $\{x_1, x_2, \dots, x_k\}$ of integers with $x_1 > x_2 > \dots > x_k > 0$ and $n = x_1 + x_3 + x_5 + \dots$ (the right hand side here means the sum of all odd-indexed elements). As an example, $p(6) = 11$ because all satisfying sets are as follows: $$\{6\}, \{6, 5\}, \{6, 4\}, \{6, 3\}, \{6, 2\}, \{6, 1\}, \{5, 4, 1\}, \{5, 3, 1\}, \{5, 2, 1\}, \{4, 3, 2\}, \{4, 3, 2, 1\}.$$ Show that $p(n)$ equals to the number of partitions of $n$ for every positive integer $n$.

The sequence $\{x_n\}_{n\ge1}$ is defined by $x_1 = 7$, $x_{n+1} = 2x^2_n - 1$, for all positive integers $n$. Prove that for all positive integers $n$ the number $x_n$ cannot be divisible by $2003$.

Find all natural numbers $n$ for which $7^n -1$ is divisible by $6^n -1$

$$problem2$$:Determine the number of 100-digit numbers whose all digits are odd, and in which every two consecutive digits differ by 2

Determine all pairs $(x,y)$ of integers satisfying \[(x+2)^4-x^4=y^3.\]

Find all pairs $(x, y)$ of positive integers satisfying the equation $(x + y)^x = x^y$.

a palindromic number is a number which is unchanged when order of its digits is reversed. prove that the arithmetic progression 18, 37,.. contains infinitely many palindromic numbers.

[b]p1.[/b] In a given tetrahedron the sum of the measures of the three face angles at each of the vertices is $180$ degrees. Prove that all faces of the tetrahedron are congruent triangles. [img]https://cdn.artofproblemsolving.com/attachments/c/c/40f03324fd19f6a5e0a5e541153a2b38faac79.png[/img] [b]p2.[/b] The digital sum $D(n)$ of a positive integer $n$ is defined recursively by: $D(n) = n$ if $1 \le n \le 9$ $D(n) = D(a_0 + a_1 + ... + a_m)$ if $n>9$ where $a_0 , a_1 ,..,a_m$ are all the digits of $n$ expressed in base ten. (For example, $D(959) = D(26) = D(8) = 8$.) Prove that $D(n \times 1234)= D(n)$ fcr all positive integers $n$ . [b]p3.[/b] A right triangle has area $A$ and perimeter $P$ . Find the largest possible value for the positive constant $k$ such that for every such triangle, $P^2 \ge kA$ . [b]p4.[/b] In the accompanying diagram, $\overline{AB}$ is tangent at $A$ to a circle of radius $1$ centered at $O$ . The segment $\overline{AP}$ is equal in length to the arc $AB$ . Let $C$ be the point of intersection of the lines $AO$ and $PB$ . Determine the length of segment $\overline{AC}$ in terms of $a$ , where $a$ is the measure of $\angle AOB$ in radians. [img]https://cdn.artofproblemsolving.com/attachments/e/0/596e269a89a896365b405af7bc6ca47a1f7c57.png[/img] [b]p5.[/b] Let $a_1 = a > 0$ and $a_2 = b >a$. Consider the sequence $\{a_1,a_2,a_3,...\}$ of positive numbers defined by: $a_3=\sqrt{a_1a_2}$, $a_4=\sqrt{a_2a_3}$, $...$ and in general, $a_n=\sqrt{a_{n-2}a_{n-1}}$, for $n\ge 3$ . Develop a formula $a_n$ expressing in terms of $a$, $b$ and $n$ , and determine $\lim_{n \to \infty} a_n$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

1. Find all primes of the form $n^3-1$ .

If $n$ is a positive integer, let $A = \{n,n+1,...,n+17 \}$. Does there exist some values of $n$ for which we can divide $A$ into two disjoints subsets $B$ and $C$ such that the product of the elements of $B$ is equal to the product of the elements of $C$?