$P$ is an monic integer coefficient polynomial which has no integer roots. deg$P=n$ and define $A$ $:=${$v_2(P(m))|m\in Z, v_2(P(m)) \ge 1$}. If $|A|=n$, show that all of the elements of $A$ is smaller than $\frac{3}{2}n^2$.

Find all positive integers $(a,b,c)$ such that $$ab-c,\quad bc-a,\quad ca-b$$ are all powers of $2$. [i]Proposed by Serbia[/i]

Find all primes $p$ such that $4p^2+1$ and $6p^2+1$ are both primes.

[i]The Game.[/i] Eric and Greg are watching their new favorite TV show, [i]The Price is Right[/i]. Bob Barker recently raised the intellectual level of his program, and he begins the latest installment with bidding on following question: How many Carmichael numbers are there less than $100,000$? Each team is to list one nonnegative integer not greater than $100,000$. Let $X$ denote the answer to Bob’s question. The teams listing $N$, a maximal bid (of those submitted) not greater than $X$, will receive $N$ points, and all other teams will neither receive nor lose points. (A Carmichael number is an odd composite integer $n$ such that $n$ divides $a^{n-1}-1$ for all integers $a$ relatively prime to $n$ with $1<a<n$.)

Find all triplets of nonnegative integers $(x,y,z)$ and $x\leq y$ such that $x^2+y^2=3 \cdot 2016^z+77$

$a_1,a_2,\dots,a_{14}$ are different positive integers. All 196 numbers of the form $a_k+a_l$ with $1\leq k,l\leq 14$ are written on a board. Is it possible that for any two-digit combination, there exists a number among all 196 that ends with that combination (i.e., there exist numbers ending with $00, 01, \dots, 99$)? (Author: P. Kozhevnikov)

Ten positive integers are arranged around a circle. Each number is one more than the greatest common divisor of its two neighbors. What is the sum of the ten numbers?

Prove that for all integers $n > 1$, $$\frac{1}{n}+\frac{1}{n + 1}+ ...+\frac{1}{n^2- 1}+\frac{1}{n^2} > 1$$

Given a natural number $n$. Prove that you can choose $ \phi (n)+1 $ (not necessarily different) divisors $n$ with the sum $n$. Here $ \phi (n)$ denotes the number of natural numbers less than $n$ that are coprime with $n$. (Fedir Yudin)

Let $p$ be a fixed prime. Determine all the integers $m$, as function of $p$, such that there exist $a_1, a_2, \ldots, a_p \in \mathbb{Z}$ satisfying \[m \mid a_1^p + a_2^p + \cdots + a_p^p - (p+1).\]

Let $ \mathbb{N}_0$ denote the set of nonnegative integers. Find all functions $ f$ from $ \mathbb{N}_0$ to itself such that \[ f(m \plus{} f(n)) \equal{} f(f(m)) \plus{} f(n)\qquad \text{for all} \; m, n \in \mathbb{N}_0. \]

Find the least positive integer $n$ greater than $1$ such that $n^3 -n^2$ is divisible by $7^2 \times 11$. [i]Proposed by Jacob Xu[/i]

Let $n$ be a positive integer not divisible by $2$ or $3$. Prove that for all integers $k$, the number $(k+1)^n-k^n-1$ is divisible by $k^2+k+1$.

Find all prime numbers $p$, for which the number $p + 1$ is equal to the product of all the prime numbers which are smaller than $p$.

Oleksii chose $11$ pairwise distinct positive integer numbers not exceeding $2025$. Prove that among them, it is possible to choose two numbers \(a < b\) such that the number \(b\) gives an even remainder when divided by the number \(a\). [i]Proposed by Anton Trygub[/i]

Let $x_1, x_2,\cdots, x_n$ be $n$ integers. Let $n = p + q$, where $p$ and $q$ are positive integers. For $i = 1, 2, \cdots, n$, put \[S_i = x_i + x_{i+1} +\cdots + x_{i+p-1} \text{ and } T_i = x_{i+p} + x_{i+p+1} +\cdots + x_{i+n-1}\] (it is assumed that $x_{i+n }= x_i$ for all $i$). Next, let $m(a, b)$ be the number of indices $i$ for which $S_i$ leaves the remainder $a$ and $T_i$ leaves the remainder $b$ on division by $3$, where $a, b \in \{0, 1, 2\}$. Show that $m(1, 2)$ and $m(2, 1)$ leave the same remainder when divided by $3.$

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 $

Find all integers $n \geqslant 0$ such that $20n+2$ divides $2023n+210$.

[b]p29.[/b] Consider pentagon $ABCDE$. How many paths are there from vertex $A$ to vertex $E$ where no edge is repeated and does not go through $E$. [b]p30.[/b] Let $a_1, a_2, ...$ be a sequence of positive real numbers such that $\sum^{\infty}_{n=1} a_n = 4$. Compute the maximum possible value of $\sum^{\infty}_{n=1}\frac{\sqrt{a_n}}{2^n}$ (assume this always converges). [b]p31.[/b] Define function $f(x) = x^4 + 4$. Let $$P =\prod^{2021}_{k=1} \frac{f(4k - 1)}{f(4k - 3)}.$$ Find the remainder when $P$ is divided by $1000$. [b]p32.[/b] Reduce the following expression to a simplified rational: $\cos^7 \frac{\pi}{9} + \cos^7 \frac{5\pi}{9}+ \cos^7 \frac{7\pi}{9}$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

What is the smallest positive integer $n$ such that $2016n$ is a perfect cube?

$a$ and $b$ are rationals. Show that if $ax^2 + by^2 = 1$ has a rational solution (in $x$ and $y$), then it must have infinitely many.

If you roll six fair dice, let $\mathsf{ p}$ be the probability that exactly five different numbers appear on the upper faces of the six dice. If $\mathsf{p} = \frac{m}{n}$ where $ m $ and $n$ are relatively prime positive integers, find $m+n.$

Let $p$ be a prime number. For each $k$, $1\le k\le p-1$, there exists a unique integer denoted by $k^{-1}$ such that $1\le k^{-1}\le p-1$ and $k^{-1}\cdot k=1\pmod{p}$. Prove that the sequence \[1^{-1},\quad 1^{-1}+2^{-1},\quad 1^{-1}+2^{-1}+3^{-1},\quad \ldots ,\quad 1^{-1}+2^{-1}+\ldots +(p-1)^{-1} \] (addition modulo $p$) contains at most $\frac{p+1}{2}$ distinct elements.

Find all positive integers $m$ for which there exist three positive integers $a,b,c$ such that $abcm=1+a^2+b^2+c^2$.

Find all all positive integers x,y,and z satisfying the equation $x^3=3^y7^z+8$