In the subtraction PURPLE $-$ COMET $=$ MEET each distinct letter represents a distinct decimal digit, and no leading digit is $0$. Find the greatest possible number represented by PURPLE.

Let $a_1,a_2,\ldots$ be a sequence of integers with infinitely many positive and negative terms. Suppose that for every positive integer $n$ the numbers $a_1,a_2,\ldots,a_n$ leave $n$ different remainders upon division by $n$. Prove that every integer occurs exactly once in the sequence $a_1,a_2,\ldots$.

What is the maximum value of $n$ for which there is a set of distinct positive integers $k_1,k_2,\ldots,k_n$ for which \[k_1^2+k_2^2+\ldots+k_n^2=2002?\] $\textbf{(A) }14\qquad\textbf{(B) }15\qquad\textbf{(C) }16\qquad\textbf{(D) }17\qquad\textbf{(E) }18$

Let $a$, $b$, and $c$ be non-zero real number such that $\tfrac{ab}{a+b}=3$, $\tfrac{bc}{b+c}=4$, and $\tfrac{ca}{c+a}=5$. There are relatively prime positive integers $m$ and $n$ so that $\tfrac{abc}{ab+bc+ca}=\tfrac{m}{n}$. Find $m+n$.

The three-digit prime number $p$ is written in base $2$ as $p_2$ and in base $5$ as $p_5$, and the two representations share the same last $2$ digits. If the ratio of the number of digits in $p_2$ to the number of digits in $p_5$ is $5$ to $2$, find all possible values of $p$.

Determine all natural numbers $x$, $y$ and $z$, such that $x\leq y\leq z$ and \[\left(1+\frac1x\right)\left(1+\frac1y\right)\left(1+\frac1z\right) = 3\text{.}\]

Let $ n > 1$ be an integer, and $ n$ can divide $ 2^{\phi(n)} \plus{} 3^{\phi(n)} \plus{} \cdots \plus{} n^{\phi(n)},$ let $ p_{1},p_{2},\cdots,p_{k}$ be all distinct prime divisors of $ n$. Show that $ \frac {1}{p_{1}} \plus{} \frac {1}{p_{2}} \plus{} \cdots \plus{} \frac {1}{p_{k}} \plus{} \frac {1}{p_{1}p_{2}\cdots p_{k}}$ is an integer. ( where $ \phi(n)$ is defined as the number of positive integers $ \leq n$ that are relatively prime to $ n$.)

We examine the following two sequences: The Fibonacci sequence: $F_{0}= 0, F_{1}= 1, F_{n}= F_{n-1}+F_{n-2 }$ for $n \geq 2$; The Lucas sequence: $L_{0}= 2, L_{1}= 1, L_{n}= L_{n-1}+L_{n-2}$ for $n \geq 2$. It is known that for all $n \geq 0$ \[F_{n}=\frac{\alpha^{n}-\beta^{n}}{\sqrt{5}},L_{n}=\alpha^{n}+\beta^{n}, \] where $\alpha=\frac{1+\sqrt{5}}{2},\beta=\frac{1-\sqrt{5}}{2}$. These formulae can be used without proof. Show that $L_{2n+1}+(-1)^{n+1}(n \geq 1)$ can be written as a product of three (not necessarily distinct) Fibonacci numbers.

For a positive integer $n$, $S(n)$ denotes the sum of its digits and $U(n)$ its unit digit. Determine all positive integers $n$ with the property that \[n = S(n) + U(n)^2.\]

Find all positive integers $k$ such that there exist two positive integers $m$ and $n$ satisfying \[m(m + k) = n(n + 1).\]

For positive integer $n$, let $f(n)$ be the largest integer $k$ such that $k!\leq n$, let $g(n)=n-(f(n))!$, and for $j\geq 1$ let $$g^j(n)=\underbrace{g(\dots(g(n))\dots)}_{\text{$j$ times}}.$$ Find the smallest positive integer $n$ such that $g^{j}(n)> 0$ for all $j<30$ and $g^{30}(n)=0$. [i]Proposed by Connor Gordon[/i]

Find all positive integers $k$ such that $k^k +1$ is divisible by $30$. Justify your answer.

Find all pairs $(m, n)$ of positive integers such that $m^2 + 2n^2 = 3(m + 2n)$

We have two lists of numbers: One initially containing 1,6,11,...,96, and the other initially containing 4,9,14,...,99. In every turn, we erase two numbers from one of the lists, and write $\frac{1}{3}$ of their sum (not necessarily an integer) in the other list. We continue this process until there are no possible moves. [list=a] [*] Prove that at the end of the process, there is exactly one number in each list. [*] Prove that those two numbers are [u]not[/u] equal. [/list]

Let $(b_n)_{n \ge 0}=\sum_{k=0}^{n} (a_0+kd)$ for positive integers $a_0$ and $d$. We consider all such sequences containing an element $b_i$ which equals $2010$. Determine the greatest possible value of $i$ and for this value the integers $a_0$ and $d$. [i](41th Austrian Mathematical Olympiad, regional competition, problem 4)[/i]

p1. $A$ is a set of numbers. The set $A$ is closed to subtraction, meaning that the result of subtracting two numbers in $A$ will be returns a number in $A$ as well. If it is known that two members of $A$ are $4$ and $9$, show that: a. $0\in A$ b. $13 \in A$ c. $74 \in A$ d. Next, list all the members of the set $A$ . p2. $(2, 0, 4, 1)$ is one of the solutions/answers of $x_1+x_2+x_3+x_4=7$. If all solutions belong on the set of not negative integers , specify as many possible solutions/answers from $x_1+x_2+x_3+x_4=7$ p3. Adi is an employee at a textile company on duty save data. One time Adi was asked by the company leadership to prepare data on production increases over five periods. After searched by Adi only found four data on the increase, namely $4\%$, $9\%$, $7\%$, and $5\%$. One more data, namely the $5$th data, was not found. Investigate increase of 5th data production, if Adi only remembers that the arithmetic mean and median of the five data are the same. p4. Find all pairs of integers $(x,y)$ that satisfy the system of the following equations: $$\left\{\begin{array}{l} x(y+1)=y^2-1 \\ y(x+1)=x^2-1 \end{array} \right. $$ p5. Given the following image. $ABCD$ is square, and $E$ is any point outside the square $ABCD$. Investigate whether the relationship $AE^2 + CE^2 = BE^2 +DE^2$ holds in the picture below. [img]https://cdn.artofproblemsolving.com/attachments/2/5/a339b0e4df8407f97a4df9d7e1aa47283553c1.png[/img]

Let $a$ be a positive integer such that $\gcd(an+1, 2n+1) = 1$ for all integer $n$. a) Prove that $\gcd(a-2, 2n+1) = 1$ for all integer $n$. b) Find all possible $a$.

Uri has $99$ empty bags and an unlimited number of balls. The weight of each ball is a number of the form $3^n$ where $n$ is an integer that can vary from ball to ball (negative integer exponents are allowed, such as $3^{-4}=\dfrac{1}{81}$, and the exponent $0$, where $3^0=1$). Uri chose a finite number of balls and distributed them into the bags so that all the bags had the same total weight and there were no balls left over. It is known that Uri chose at most $k$ balls of the same weight. Determine the smallest possible value of $k$.

Let $a$ and $b$ be positive integers with $\gcd(a, b)=1$. Show that every integer greater than $ab-a-b$ can be expressed in the form $ax+by$, where $x, y \in \mathbb{N}_{0}$.

$16$ different natural numbers are written on the board, none of which exceeds $30$. Prove that there must be two coprime numbers among the written numbers.

What is the last digit of $4^{3^{2019}}$? [b]A.[/b] $0$ [b]B.[/b] $2$ [b]C.[/b] $4$ [b]D.[/b] $6$ [b]E.[/b] $8$

Let $p_1, p_2, p_3$, and $p$ be prime numbers. Prove that there exist $x,y\in \mathbb{Z}$ such that $y^2\equiv p_1 x^4-p_1 p_2^2 p_3^2\, (mod\, p)$.

Let $u_{jk}$ be a real number for each $j=1,2,3$ and each $k=1,2$ and let $N$ be an integer such that \[\max_{1\le k \le 2} \sum_{j=1}^3 |u_{jk}| \leq N\] Let $M$ and $l$ be positive integers such that $l^2 <(M+1)^3$. Prove that there exist integers $\xi_1,\xi_2,\xi_3$ not all zero, such that \[\max_{1\le j \le 3}\xi_j \le M\ \ \ \ \text{and} \ \ \ \left|\sum_{j=1}^3 u_{jk}\xi_k\right| \le \frac{MN}{l} \ \ \ \ \text{for k=1,2}\]

Find the number of positive integers $n < 2018$ such that $25^n + 9^n$ is divisible by $13$.

Given positive integers $k$ and $m$, show that $m$ and $\binom{n}{k}$ are coprime for infinitely many integers $n\geq k$.