Find all triplets of nonnegative integers $(x, y, z)$ that satisfy: $x^2-3y^2=y^2-3z^2=22$.

A pair $(a,b)$ of positive integers is good if $\gcd(a,b)=1$ and for each pair of sets $A,B$ of positive integers such that $A,B$ are, respectively, complete residues system modulo $a,b$, there are $x \in A, y \in B$ such that $\gcd(x+y,ab)=1$. For each pair of positive integers $a,k$, let $f(N)$ the number of $b \leq N$ such $b$ has $k$ distinct prime factors and $(a,b)$ is good. Prove that \[\liminf_{n \to \infty} f(n)/\frac{n}{(\log n)^k}\ge e^{k}\]

The numbers $1, 2, ..., 2012$ are written on a blackboard, in some order, each of them exactly once. Between every two neighboring numbers the absolute value of their difference is written and the original numbers are deleted. This process is repeated until only a number remains on the board. What is the largest number that can stay on the board?

Find all natural integers $m, n$ such that $m, 2+m, 2^n+m, 2+2^n+m$ are all prime numbers

Find all pairs of positive integers $(n,k)$ for which the number $m=1^{2k+1}+2^{2k+1}+\cdots+n^{2k+1}$ is divisible by $n+2.$

[b]p1.[/b] Fun facts! We know that $1008^2-1007^2 = 1008+1007$ and $1009^2-1008^2 = 1009+1008$. Now compute the following: $$1010^2 - 1009^2 - 1.$$ [b]p2.[/b] Let $m$ be the smallest positive multiple of $2018$ such that the fraction $m/2019$ can be simplified. What is the number $m$? [b]p3.[/b] Given that $n$ satisfies the following equation $$n + 3n + 5n + 7n + 9n = 200,$$ find $n$. [b]p4.[/b] Grace and Somya each have a collection of coins worth a dollar. Both Grace and Somya have quarters, dimes, nickels and pennies. Serena then observes that Grace has the least number of coins possible to make one dollar and Somya has the most number of coins possible. If Grace has $G$ coins and Somya has $S$ coins, what is $G + S$? [b]p5.[/b] What is the ones digit of $2018^{2018}$? [b]p6.[/b] Kaitlyn plays a number game. Each time when Kaitlyn has a number, if it is even, she divides it by $2$, and if it is odd, she multiplies it by $5$ and adds $1$. Kaitlyn then takes the resulting number and continues the process until she reaches $1$. For example, if she begins with $3$, she finds the sequence of $6$ numbers to be $$3, 3 \cdot 5 + 1 = 16, 16/2 = 8, 8/2 = 4, 4/2 = 2, 2/2 = 1.$$ If Kaitlyn's starting number is $51$, how many numbers are in her sequence, including the starting number and the number $1$? [b]p7.[/b] Andrew likes both geometry and piano. His piano has $88$ keys, $x$ of which are white and $y$ of which are black. Each white key has area $3$ and each black key has area $11$. If the keys of his piano have combined area $880$, how many black keys does he have? [b]p8.[/b] A six-sided die contains the numbers $1$, $2$, $3$, $4$, $5$, and $6$ on its faces. If numbers on opposite faces of a die always sum to $7$, how many distinct dice are possible? (Two dice are considered the same if one can be rotated to obtain the other.) [b]p9.[/b] In $\vartriangle ABC$, $AB$ is $12$ and $AC$ is $15$. Alex draws the angle bisector of $BAC$, $AD$, such that $D$ is on $BC$. If $CD$ is $10$, then the area of $\vartriangle ABC$ can be expressed in the form $\frac{m \sqrt{n}}{p}$ where $m, p$ are relatively prime and $n$ is not divisible by the square of any prime. Find $m + n + p$. [b]p10.[/b] Find the smallest positive integer that leaves a remainder of $2$ when divided by $5$, a remainder of $3$ when divided by $6$, a remainder of $4$ when divided by $7$, and a remainder of $5$ when divided by $8$. [b]p11.[/b] Chris has a bag with $4$ marbles. Each minute, Chris randomly selects a marble out of the bag and flips a coin. If the coin comes up heads, Chris puts the marble back in the bag, while if the coin comes up tails, Chris sets the marble aside. What is the expected number of seconds it will take Chris to empty the bag? [b]p12.[/b] A real fixed point $x$ of a function $f(x)$ is a real number such that $f(x) = x$. Find the absolute value of the product of the real fixed points of the function $f(x) = x^4 + x - 16$. [b]p13.[/b] A triangle with angles $30^o$, $75^o$, $75^o$ is inscribed in a circle with radius $1$. The area of the triangle can be expressed as $\frac{a+\sqrt{b}}{c}$ where $b$ is not divisible by the square of any prime. Find $a + b + c$. [b]p14.[/b] Dora and Charlotte are playing a game involving flipping coins. On a player's turn, she first chooses a probability of the coin landing heads between $\frac14$ and $\frac34$ , and the coin magically flips heads with that probability. The player then flips this coin until the coin lands heads, at which point her turn ends. The game ends the first time someone flips heads on an odd-numbered flip. The last player to flip the coin wins. If both players are playing optimally and Dora goes first, let the probability that Charlotte win the game be $\frac{a}{b}$ . Find $a \cdot b$. [b]p15.[/b] Jonny is trying to sort a list of numbers in ascending order by swapping pairs of numbers. For example, if he has the list $1$, $4$, $3$, $2$, Jonny would swap $2$ and $4$ to obtain $1$, $2$, $3$, $4$. If Jonny is given a random list of $400$ distinct numbers, let $x$ be the expected minimum number of swaps he needs. Compute $\left \lfloor \frac{x}{20} \right \rfloor$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all positive integers $n$ for which $n^8+n+1$ is a prime number.

[b]p1.[/b] A rectangle $ABCD$ is cut from a piece of paper and folded along a straight line so that the diagonally opposite vertices $A$ and $C$ coincide. Find the length of the resulting crease in terms of the length ($\ell$) and width ($w$) of the rectangle. (Justify your answer.) [b]p2.[/b] The residents of Andromeda use only bills of denominations $\$3 $and $\$5$ . All payments are made exactly, with no change given. What whole-dollar payments are not possible? (Justify your answer.) [b]p3.[/b] A set consists of $21$ objects with (positive) weights $w_1, w_2, w_3, ..., w_{21}$ . Whenever any subset of $10$ objects is selected, then there is a subset consisting of either $10$ or $11$ of the remaining objects such that the two subsets have equal fotal weights. Find all possible weights for the objects. (Justify your answer.) [b]p4.[/b] Let $P(x) = x^3 + x^2 - 1$ and $Q(x) = x^3 - x - 1$ . Given that $r$ and $s$ are two distinct solutions of $P(x) = 0$ , prove that $rs$ is a solution of $Q(x) = 0$ [b]p5.[/b] Given: $\vartriangle ABC$ with points $A_1$ and $A_2$ on $BC$ , $B_1$ and $B_2$ on $CA$, and $C_1$ and $C_2$ on $AB$. $A_1 , A_2, B_1 , B_2$ are on a circle, $B_1 , B_2, C_1 , C_2$ are on a circle, and $C_1 , C_2, A_1 , A_2$ are on a circle. The centers of these circles lie in the interior of the triangle. Prove: All six points $A_1$ , $A_2$, $B_1$, $B_2$, $C_1$, $C_2$ are on a circle. [img]https://cdn.artofproblemsolving.com/attachments/7/2/2b99ddf4f258232c910c062e4190d8617af6fa.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A positive integer $n$ is said to be a [i]perfect power[/i] if $n=a^b$ for some integers $a,b$ with $b>1$. $(\text{a})$ Find $2004$ perfect powers in arithmetic progression. $(\text{b})$ Prove that perfect powers cannot form an infinite arithmetic progression.

Let $p$ be a prime where $p \ge 5$. Prove that $\exists n$ such that $1+ (\sum_{i=2}^n \frac{1}{i^2})(\prod_{i=2}^n i^2) \equiv 0 \pmod p$

Is the following statement true? For each positive integer $n$, we can find eight nonnegative integers $a$, $b$, $c$, $d$, $e$, $f$, $g$, $h$ such that $n=\frac{2^a-2^b}{2^c-2^d}\cdot\frac{2^e-2^f}{2^g-2^h}$.

Prove that there exist infinitely many positive integers $n$ such that the largest prime divisor of $n^4 + n^2 + 1$ is equal to the largest prime divisor of $(n+1)^4 + (n+1)^2 +1$.

Let $ P$ be a polynomial with integer coefficients such that there are two distinct integers at which $ P$ takes coprime values. Show that there exists an infinite set of integers, such that the values $ P$ takes at them are pairwise coprime.

A test has twenty questions. Seven points are awarded for each correct answer, two points are deducted for each incorrect answer and no points are awarded or deducted for each unanswered question. Joana obtained $87$ points. How many questions did she not answer?

Let $m$ and $n$ be positive integers where $m$ has $d$ digits in base ten and $d\leq n$. Find the sum of all the digits (in base ten) of the product $(10^n-1)m$.

Let $x$ be the smallest positive integer for which $2x$ is the square of an integer, $3x$ is the third power of an integer, and $5x$ is the fifth power of an integer. Find the prime factorization of $x$. (St. Wagner, Stellenbosch University)

Find all integer solutions of the equation \[\frac {x^{7} \minus{} 1}{x \minus{} 1} \equal{} y^{5} \minus{} 1.\]

Let $n$ be a natural number. An integer $a>2$ is called $n$-decomposable, if $a^n-2^n$ is divisible by all the numbers of the form $a^d+2^d$, where $d\neq n$ is a natural divisor of $n$. Find all composite $n\in \mathbb{N}$, for which there's an $n$-decomposable number.

2016 digits are written on a circle. Reading these digits counterclockwise, starting from a certain number, you get a number divisible by 81. Prove that by reading these digits clockwise, we obtain a number divisible by 81 for every starting number.

Find all natural numbers of $90$ digits that are multiples of $13$ and have the first $43$ digits equal to each other and nonzero, the last $43$ digits equal to each other, and the middle $4$ digits are $2, 0, 1, 0$, in that order.

Juanita wrote the numbers from $1$ to $13$ , calculated the sum of all the digits he had written and obtained $$1+2+3+4+5+6+7+8+9+(1+0)+(1+1)+(1+2)+(1+3)=55.$$ His brother Ariel wrote the numbers from $1$ to $100$ and calculated the sum of all the digits written. Find the value of Ariel's sum.

For positive integers $a$ and $b$, if the expression $\frac{a^2+b^2}{(a-b)^2}$ is an integer, prove that the expression $\frac{a^3+b^3}{(a-b)^3}$ is an integer as well.

$f_{1},f_{2},\dots,f_{n}$ are polynomials with integer coefficients. Prove there exist a reducible $g(x)$ with integer coefficients that $f_{1}+g,f_{2}+g,\dots,f_{n}+g$ are irreducible.

Find all surjective functions $f: \mathbb{N}\to \mathbb{N}$ such that for all $m,n\in \mathbb{N}$: \[m \vert n \Longleftrightarrow f(m) \vert f(n).\]

Let $p,q$ be two distinct odd primes. Calculate $\displaystyle \sum_{j=1}^{\frac{p-1}{2}}\left \lfloor \frac{qj}{p}\right \rfloor +\sum_{j=1}^{\frac{q-1}{2}}\left \lfloor \frac{pj}{q}\right\rfloor$.