Find all polynomials $P$ with integer coefficients which satisfy the property that, for any relatively prime integers $a$ and $b$, the sequence $\{P (an + b) \}_{n \ge 1}$ contains an infinite number of terms, any two of which are relatively prime.

One pupil has $7$ cards of paper. He takes a few of them and tears each in $7$ pieces. Then, he choses a few of the pieces of paper that he has and tears it again in $7$ pieces. He continues the same procedure many times with the pieces he has every time. Will he be able to have sometime $2009$ pieces of paper?

A number is called lucky if computing the sum of the squares of its digits and repeating this operation sufficiently many times leads to number $1$. For example, $1900$ is lucky, as $1900 \to 82 \to 68 \to 100 \to 1$. Find infinitely many pairs of consecutive numbers each of which is lucky.

Let $r_1$, $r_2$, $\ldots$, $r_m$ be a given set of $m$ positive rational numbers such that $\sum_{k=1}^m r_k = 1$. Define the function $f$ by $f(n)= n-\sum_{k=1}^m \: [r_k n]$ for each positive integer $n$. Determine the minimum and maximum values of $f(n)$. Here ${\ [ x ]}$ denotes the greatest integer less than or equal to $x$.

Compute the unique positive integer $n$ such that $\frac{n^3-1989}{n}$ is a perfect square.

Let $a$ and $b$ be fixed positive integers. We say that a prime $p$ is [i]fun[/i] if there exists a positive integer $n$ satisfying the following conditions: [list] [*]$p$ divides $a^{n!} + b$. [*]$p$ divides $a^{(n + 1)!} + b$. [*]$p < 2n^2 + 1$. [/list] Show that there are finitely many fun primes.

Let $m$ and $n$ be positive integers such that $m>n$. Define $x_k=\frac{m+k}{n+k}$ for $k=1,2,\ldots,n+1$. Prove that if all the numbers $x_1,x_2,\ldots,x_{n+1}$ are integers, then $x_1x_2\ldots x_{n+1}-1$ is divisible by an odd prime.

Prove that for every natural number $k$, at least one of the integers \[ 2k-1, \quad 5k-1 \quad \text{and} \quad 13k-1\] is not a perfect square.

A deck of forty cards consists of four 1's, four 2's,..., and four 10's. A matching pair (two cards with the same number) is removed from the deck. Given that these cards are not returned to the deck, let $m/n$ be the probability that two randomly selected cards also form a pair, where $m$ and $n$ are relatively prime positive integers. Find $m+n.$

The sequence $p_1, p_2, p_3, ...$ is defined as follows. $p_1$ and $p_2$ are primes. $p_n$ is the greatest prime divisor of $p_{n-1} + p_{n-2} + 2000$. Show that the sequence is bounded.

Determine all the integer solutions of the equation $3x^4-2024y+1= 0$.

A [i]power[/i] is a positive integer of the form $a^k$, where $a$ and $k$ are positive integers with $k\geq 2$. Let $S$ be the set of positive integers which cannot be expressed as sum of two powers (for example, $4,\ 7,\ 15$ and $27$ are elements of $S$). Determine whether the set $S$ has a finite or infinite number of elements.

Let $ p$ be a prime number with $ p>5$. Consider the set $ X \equal{} \left\{p \minus{} n^2 \mid n\in \mathbb{N} ,\ n^2 < p\right\}$. Prove that the set $ X$ has two distinct elements $ x$ and $ y$ such that $ x\neq 1$ and $ x\mid y$. [i]Albania[/i]

We say that a number is [i]superstitious [/i] when it is equal to $13$ times the sum of its digits . Find all superstitious numbers.

For how many triples of positive integers $(a,b,c)$ with $1\leq a,b,c\leq 5$ is the quantity \[(a+b)(a+c)(b+c)\] not divisible by $4$?

[b]7.1.[/b] Prove that from the sides of an arbitrary quadrilateral you can fold a trapezoid. [b]7.2 / 6.2[/b] The numbers $A$ and $B$ are relatively prime. What common divisors can have the numbers $A+B$ and $A-B$? [b]7.3. / 6.4[/b] $15$ magazines lie on the table, completely covering it. Prove that it is possible to remove eight of them so that the remaining magz cover at least $7/15$ of the table area. [b]7.4[/b] In a six-digit number that is divisible by $7$, the last digit has been moved to the beginning. Prove that the resulting number is also divisible at $7$. [url=https://artofproblemsolving.com/community/c6h3391057p32066818]7.5*[/url] (asterisk problems in separate posts) [b]7.6 [/b] On sides $AB$ and $ BC$ of triangle $ABC$ , are constructed squares $ABDE$ and $BCKL$ with centers $O_1$ and $O_2$. $M_1$ and $M_2$ are midpoints of segments $DL$ and $AC$. Prove that $O_1M_1O_2M_2$ is a square. [img]https://cdn.artofproblemsolving.com/attachments/8/1/8aa816a84c5ac9de78b396096cf718063de390.png[/img] PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3983459_1962_leningrad_math_olympiad]here[/url].

Let $n \geq 2$ be a positive integer. The set $M$ consists of $2n^2-3n+2$ positive rational numbers. Prove that there exists a subset $A$ of $M$ with $n$ elements with the following property: $\forall$ $2 \leq k \leq n$ the sum of any $k$ (not necessarily distinct) numbers from $A$ is not in $A$.

Let $n$ be a positive integer. Beto writes a list of $n$ non-negative integers on the board. Then he performs a succession of moves (two steps) of the following type: First for each $i=1,2,...,n$, he counts how many numbers on the board are less than or equal to $i$. Let $a_i$ be the number obtained for each $i=1,2,...,n$. Next, he erases all the numbers from the board and writes the numbers $a_1,a_2,...,a_n$. For example, if $n=5$ and the initial numbers on the board are $0,7,2,6,2$, after the first move, the numbers on the board will bec$1,3,3,3,3$;after the second move they will be $1,1,5,5,5$, and so on. $a)$ Show that, for every $n$ and every initial configuration, there will come a time after which the numbers will no longer be modified when using this move. $b)$Find (as a function of $n$) the minimum value of $k$ such that, for any initial configuration, the moves made from move number $k$ will not change the numbers on the board.

Find all primes $p$ such that $(p-3)^p+p^2$ is a perfect square.

Find the probability such that when a polynomial in $\mathbb Z_{2027}[x]$ having degree at most $2026$ is chosen uniformly at random, $$x^{2027}-x | P^{k}(x) - x \iff 2021 | k $$ (note that $2027$ is prime). Here $P^k(x)$ denotes $P$ composed with itself $k$ times. [i]Proposed by Grant Yu[/i]

Let $n$ be a positive integer. Prove that there exists a poisitve integer $m$ such that $$7^n \mid 3^m+5^m-1$$

On Qingqing Grassland, there are 7 sheep numberd $1,2,3,4,5,6,7$ and 2017 wolves numberd $1,2,\cdots,2017$. We have such strange rules: (1) Define $P(n)$: the number of prime numbers that are smaller than $n$. Only when $P(i)\equiv j\pmod7$, wolf $i$ may eat sheep $j$ (he can also choose not to eat the sheep). (2) If wolf $i$ eat sheep $j$, he will immediately turn into sheep $j$. (3) If a wolf can make sure not to be eaten, he really wants to experience life as a sheep. Assume that all wolves are very smart, then how many wolves will remain in the end?

A positive integer $n$ is known as an [i]interesting[/i] number if $n$ satisfies \[{\ \{\frac{n}{10^k}} \} > \frac{n}{10^{10}} \] for all $k=1,2,\ldots 9$. Find the number of interesting numbers.

Prove that every positive integer can be represented in the form \[3^{u_1} \ldots 2^{v_1} + 3^{u_2} \ldots 2^{v_2} + \ldots + 3^{u_k} \ldots 2^{v_k}\] with integers $u_1, u_2, \ldots , u_k, v_1, \ldots, v_k$ such that $u_1 > u_2 >\ldots > u_k\ge 0$ and $0 \le v_1 < v_2 <\ldots < v_k$.

Find all pairs $(p, q)$ of prime numbers satisfying \[ p^3+7q=q^9+5p^2+18p. \]