Let $m,n$ be natural numbers and let $d = gcd(m,n)$. Let $x = 2^{m} -1$ and $y= 2^n +1$ (a) If $\frac{m}{d}$ is odd, prove that $gcd(x,y) = 1$ (b) If $\frac{m}{d}$ is even, Find $gcd(x,y)$

(a) Prove that the number of all digits in the sequence $1, 2, 3,... , 10^8$ is equal to the number of all zeros in the sequence $1, 2, 3, ... , 10^9$. (b) Prove that the number of all digits in the sequence $1, 2, 3, ... , 10^k$ is equal to the number of all zeros in the sequence $1, 2, 3, ... , 10^{k+1}$.

Prove by the method of induction that: [b]a)[/b] $ a!b! $ divides $ (a+b)! , $ for any natural numbers $ a,b. $ [b]b)[/b] $ p $ divides $ (-1)^{k+1} +\binom{p-1}{k} , $ for any odd primes $ p $ and $ k\in\{ 0,1,\ldots ,p-1\} . $

For every positive integer$ n$, let $P(n)$ be the greatest prime divisor of $n^2+1$. Show that there are infinitely many quadruples $(a, b, c, d)$ of positive integers that satisfy $a < b < c < d$ and $P(a) = P(b) = P(c) = P(d)$.

Compute the sum of all positive integers whose positive divisors sum to $186.$

Given a prime $p$, show that \[\left(1+p\sum_{k=1}^{p-1}k^{-1}\right)^2 \equiv 1-p^2\sum_{k=1}^{p-1}k^{-2} \pmod{p^4}.\] [i]Timothy Chu.[/i]

Find all positive integers $(x,y)$ such that $x^2+y^2=2017(x-y)$

Let $x_n=2^{2^{n}}+1$ and let $m$ be the least common multiple of $x_2, x_3, \ldots, x_{1971}.$ Find the last digit of $m.$

For a given number $ n $, let us denote by $ p_n $ the probability that when randomly selecting a pair of integers $ k, m $ satisfying the conditions $ 0 \leq k \leq m \leq 2^n $ (the selection of each pair is equally probable) the number $\binom{m}{k}$ will be even. Calculate $ \lim_{n\to \infty} p_n $.

You are initially given the number $n=1$. Each turn, you may choose any positive divisor $d\mid n$, and multiply $n$ by $d+1$. For instance, on the first turn, you must select $d=1$, giving $n=1\cdot(1+1)=2$ as your new value of $n$. On the next turn, you can select either $d=1$ or $2$, giving $n=2\cdot(1+1)=4$ or $n=2\cdot(2+1)=6$, respectively, and so on. Find an algorithm that, in at most $k$ steps, results in $n$ being divisible by the number $2021^{2021^{2021}} - 1$. An algorithm that completes in at most $k$ steps will be awarded: 1 pt for $k>2021^{2021^{2021}}$ 20 pts for $k=2021^{2021^{2021}}$ 50 pts for $k=10^{10^4}$ 75 pts for $k=10^{10}$ 90 pts for $k=10^5$ 95 pts for $k=6\cdot10^4$ 100 pts for $k=5\cdot10^4$

Twenty distinct points are marked on a circle and labeled $1$ through $20$ in clockwise order. A line segment is drawn between every pair of points whose labels differ by a prime number. Find the number of triangles formed whose vertices are among the original $20$ points.

[b]p1.[/b] For what integers $x$ is it possible to find an integer $y$ such that $$x(x + 1) (x + 2) (x + 3) + 1 = y^2 ?$$ [b]p2.[/b] Two tangents to a circle are parallel and touch the circle at points $A$ and $B$, respectively. A tangent to the circle at any point $X$, other than $A$ or $B$, meets the first tangent at $Y$ and the second tangent at $Z$. Prove $AY \cdot BZ$ is independent of the position of $X$. [b]p3.[/b] If $a, b, c$ are positive real numbers, prove that $$8abc \le (b + c) (c + a) (a + b)$$ by first verifying the relation in the special case when $c = b$. [b]p4.[/b] Solve the equation $$\frac{x^2}{3}+\frac{48}{x^2}=10 \left( \frac{x}{3}-\frac{4}{x}\right)$$ [b]p5.[/b] Tom and Bill live on the same street. Each boy has a package to deliver to the other boy’s house. The two boys start simultaneously from their own homes and meet $600$ yards from Bill's house. The boys continue on their errand and they meet again $700$ yards from Tom's house. How far apart do the boy's live? [b]p6.[/b] A standard set of dominoes consists of $28$ blocks of size $1$ by $2$. Each block contains two numbers from the set $0,1,2,...,6$. We can denote the block containing $2$ and $3$ by $[2, 3]$, which is the same block as $[3, 2]$. The blocks $[0, 0]$, $[1, 1]$,..., $[6, 6]$ are in the set but there are no duplicate blocks. a) Show that it is possible to arrange the twenty-eight dominoes in a line, end-to-end, with adjacent ends matching, e. g., $... [3, 1]$ $[1, 1]$ $[1, 0]$ $[0, 6] ...$ . b) Consider the set of dominoes which do not contain $0$. Show that it is impossible to arrange this set in such a line. c) Generalize the problem and prove your generalization. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $N$ be a ten digit positive integer divisible by $7$. Suppose the first and the last digit of $N$ are interchanged and the resulting number (not necessarily ten digit) is also divisible by $7$ then we say that $N$ is a good integer. How many ten digit good integers are there?

Prove that for all positive integers $n$, there exists a sequence of positive integers $a_1,a_2,\dots,a_n$ and $d_1,d_2,\dots,d_n$ satisfying all of the following three conditions. [list] [*] $\binom{2a_i}{a_i}$ is divisible by $d_i$ for all $i=1,2,\dots,n$ [*] $d_{i+1}=d_i+1$ for all $i=1,2,\dots, n-1$ [*] $d_i\neq m^k$ for all $i=1,2,\dots, n$ and positive integers $m$ and $k$ such that $k\geq 2$ [/list]

Let $a,b,c$ be positive integers. Prove that it is impossible to have all of the three numbers $a^2+b+c,b^2+c+a,c^2+a+b$ to be perfect squares.

A set of distinct positive integers is called [i]singular [/i] if, for each of its elements, after crossing out that element, the remaining ones can be grouped into two sets with no common elements such that the sum of the elements in the two groups is the same. Find the smallest positive integer $n>1$ such that there exists a singular set $A$ with $n$ items.

Suppose $k>3$ is a divisor of $2^p+1$, where $p$ is prime. Prove that $k\ge2p+1$.

A positive integer $n$ is "[i]olympic[/i]" if there are $n$ non-negative integers $x_1, x_2, ..., x_n$ that satisfy that: $\bullet$ There is at least one positive integer $j$: $1 \le j \le n$ such that $x_j \ne 0$. $\bullet$ For any way of choosing $n$ numbers $c_1, c_2, ..., c_n$ from the set $\{-1, 0, 1\}$, where not all $c_i$ are equal to zero, it is true that the sum $c_1x_1 + c_2x_2 +... + c_nx_n$ is not divisible by $n^3$. Find the largest positive "olympic" integer.

Let $n>1$ be an integer. Call a number beautiful if its square leaves an odd remainder upon divison by $n$. Prove that the number of consecutive beautiful numbers is less or equal to $1+\lfloor \sqrt{3n} \rfloor$.

Let $n>1$ be a natural number and $x_k{}$ be the residue of $n^2$ modulo $\lfloor n^2/k\rfloor+1$ for all natural $k{}$. Compute the sum \[\bigg\lfloor\frac{x_2}{1}\bigg\rfloor+\bigg\lfloor\frac{x_3}{2}\bigg\rfloor+\cdots+\left\lfloor\frac{x_n}{n-1}\right\rfloor.\]

Let there be given two sequences of integers $f_i(1), f_i(2), \cdots (i = 1, 2)$ satisfying: $(i) f_i(nm) = f_i(n)f_i(m)$ if $\gcd(n,m) = 1$; $(ii)$ for every prime $P$ and all $k = 2, 3, 4, \cdots$, $f_i(P^k) = f_i(P)f_i(P^{k-1}) - P^2f(P^{k-2}).$ Moreover, for every prime $P$: $(iii) f_1(P) = 2P,$ $(iv) f_2(P) < 2P.$ Prove that $|f_2(n)| < f_1(n)$ for all $n$.

How many prime numbers $ p $ the number $ p ^ 3-4 p + 9 $ is a perfect square

Determine all four-digit numbers $\overline{abcd}$ which are perfect squares and for which the equality holds: $\overline{ab}=3 \cdot \overline{cd} + 1$.

An odd positive integer $n$ can be expressed as the sum of two or more consecutive integers in exactly $2023$ ways. Find the greatest possible nonnegative integer $k$ such that $3^k$ is a factor of the least possible value of $n$.

Let $ \{m_1,m_2,\dots\}$ be a (finite or infinite) set of positive integers. Consider the system of congruences (1) $ x\equiv 2m_i^2 \pmod{2m_i\minus{}1}$ ($ i\equal{}1,2,...$ ). Give a necessary and sufficient condition for the system (1) to be solvable.