In Coinland, there are three types of coins, each worth $6,$ $10,$ and $15.$ What is the sum of the digits of the maximum amount of money that is impossible to have? $\textbf{(A) }11\qquad\textbf{(B) }6\qquad\textbf{(C) }8\qquad\textbf{(D) }9\qquad\textbf{(E) }10$ (I forgot the order)

Suppose that $ p$ is a prime number. Prove that the equation $ x^2\minus{}py^2\equal{}\minus{}1$ has a solution if and only if $ p\equiv1\pmod 4$.

Determine the smallest positive prime $p$ which satisfies the congruence \[p+p^{-1}\equiv 25\pmod{143}.\] Here, $p^{-1}$ as usual denotes multiplicative inverse.

If a is a natural number, show that the number of positive integral solutions of the indeterminate equation $$x_1 + 2x_2 + 3x_3 + ... + nx_n = a \ \ (1) $$ is equal to the number of non-negative integral solutions of $$y_1 + 2y_2 + 3y_3 + ... + ny_n = a - \frac{n(n + 1)}{2} \ \ (2)$$ [By a solution of equation (1), we mean a set of numbers $\{x_1, x_2,..., x_n\}$ which satisfies equation (1)].

Find all positive integer $ m$ if there exists prime number $ p$ such that $ n^m\minus{}m$ can not be divided by $ p$ for any integer $ n$.

Is there a 30-digit number such that any number formed by its five consecutive digits is divisible by 13?

How many positive integers less than $10,000$ have an even number of even digits and an odd number of odd digits ? (Assume no number starts with zero.)

Show that the equation $a^2+b^2+c^2+d^2=a^2\cdot b^2\cdot c^2\cdot d^2$ has no solution in positive integers.

A pile contains $2021^{2021}$ stones. In a move any pile can be divided into two piles so that the numbers of stones in them differ by a power of $2$ with non-negative integer exponent. After some move it turned out that the number of stones in each pile is a power of $2$ with non-negative integer exponent. Prove that the number of moves performed was even.

[u]Round 6 [/u] [b]p16.[/b] Triangle $ABC$ with $AB < AC$ is inscribed in a circle. Point $D$ lies on the circle and point $E$ lies on side $AC$ such that $ABDE$ is a rhombus. Given that $CD = 4$ and $CE = 3$, compute $AD^2$. [b]p17.[/b] Wam and Sang are walking on the coordinate plane. Both start at the origin. Sang walks to the right at a constant rate of $1$ m/s. At any positive time $t$ (in seconds),Wam walks with a speed of $1$ m/s with a direction of $t$ radians clockwise of the positive $x$-axis. Evaluate the square of the distance betweenWamand Sang in meters after exactly $5\pi$ seconds. [b]p18.[/b] Mawile is playing a game against Salamance. Every turn,Mawile chooses one of two moves: Sucker Punch or IronHead, and Salamance chooses one of two moves: Dragon Dance or Earthquake. Mawile wins if the moves used are Sucker Punch and Earthquake, or Iron Head and Dragon Dance. Salamance wins if the moves used are Iron Head and Earthquake. If the moves used are Sucker Punch and Dragon Dance, nothing happens and a new turn begins. Mawile can only use Sucker Punch up to $8$ times. All other moves can be used indefinitely. Assuming bothMawile and Salamance play optimally, find the probability thatMawile wins. [u]Round 7 [/u] [b]p19.[/b] Ephram is attempting to organize what rounds everyone is doing for the NEAML competition. There are $4$ rounds, of which everyone must attend exactly $2$. Additionally, of the 6 people on the team(Ephram,Wam, Billiam, Hacooba,Matata, and Derke), exactly $3$ must attend every round. In how many different ways can Ephram organize the teams like this? [b]p20.[/b] For some $4$th degree polynomial $f (x)$, the following is true: $\bullet$ $f (-1) = 1$. $\bullet$ $f (0) = 2$. $\bullet$ $f (1) = 4$. $\bullet$ $f (-2) = f (2) = f (3)$. Find $f (4)$. [b]p21.[/b] Find the minimum value of the expression $\sqrt{5x^2-16x +16}+\sqrt{5x^2-18x +29}$ over all real $x$. [u]Round 8 [/u] [b]p22.[/b] Let $O$ and $I$ be the circumcenter and incenter, respectively, of $\vartriangle ABC$ with $AB = 15$, $BC = 17$, and $C A = 16$. Let $X \ne A$ be the intersection of line $AI$ and the circumcircle of $\vartriangle ABC$. Find the area of $\vartriangle IOX$. [b]p23.[/b] Find the sum of all integers $x$ such that there exist integers $y$ and $z$ such that $$x^2 + y^2 = 3(2016^z )+77.$$ [b]p24.[/b] Evaluate $$ \left \lfloor \sum^{2022}_{i=1} \frac{1}{\sqrt{i}} \right \rfloor = \left \lfloor \frac{1}{\sqrt{1}} +\frac{1}{\sqrt{2}}+\frac{1}{\sqrt{3}}+...+ \frac{1}{\sqrt{2022}}\right \rfloor$$ [u]Round 9[/u] [b]p25.[/b]Either: 1. Submit $-2$ as your answer and you’ll be rewarded with two points OR 2. Estimate the number of teams that choose the first option. If your answer is within $1$ of the correct answer, you’ll be rewarded with three points, and if you are correct, you’ll receive ten points. [b]p26.[/b] Jeff is playing a turn-based game that starts with a positive integer $n$. Each turn, if the current number is $n$, Jeff must choose one of the following: 1. The number becomes the nearest perfect square to $n$ 2. The number becomes $n-a$, where $a$ is the largest digit in $n$ Let $S(k)$ be the least number of turns Jeff needs to get from the starting number $k$ to $0$. Estimate $$\sum^{2023}_{k=1}S(k).$$ If your estimation is $E$ and the actual answer is $A$, you will receive $\max \left( \left \lfloor 10 - \left| \frac{E-A}{6000} \right| \right \rfloor , 0 \right)$ points. [b]p27.[/b] Estimate the smallest positive integer n such that if $N$ is the area of the $n$-sided regular polygon with circumradius $100$, $10000\pi -N < 1$ is true. If your estimation is $E$ and the actual answer is $A$, you will receive $ \max \left \lfloor \left( 10 - \left| 10 \cdot \log_3 \left( \frac{A}{E}\right) \right|\right| ,0\right \rfloor.$ points. PS. You should use hide for answers. Rounds 1-5 have been posted [url=https://artofproblemsolving.com/community/c3h3167360p28825713]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

One of Landau’s four unsolved problems asks whether there are infinitely many primes $p$ such that $p- 1$ is a perfect square. How many such primes are there less than $100$?

Let $p$ be a prime satisfying $p^2\mid 2^{p-1}-1$, and let $n$ be a positive integer. Define \[ f(x) = \frac{(x-1)^{p^n}-(x^{p^n}-1)}{p(x-1)}. \] Find the largest positive integer $N$ such that there exist polynomials $g(x)$, $h(x)$ with integer coefficients and an integer $r$ satisfying $f(x) = (x-r)^N g(x) + p \cdot h(x)$. [i]Proposed by Victor Wang[/i]

A positive integer $c$ is given. The sequence $\{p_{k}\}$ is constructed by the following rule: $p_{1}$ is arbitrary prime and for $k\geq 1$ the number $p_{k+1}$ is any prime divisor of $p_{k}+c$ not present among the numbers $p_{1}$, $p_{2}$, $\dots$, $p_{k}$. Prove that the sequence $\{p_{k}\}$ cannot be infinite. [i]Proposed by A. Golovanov[/i]

For a positive integer $n$ we denote by $d(n)$ the number of positive divisors of $n$ and by $s(n)$ the sum of these divisors. For example, $d(2018)$ is equal to $4$ since $2018$ has four divisors $(1, 2, 1009, 2018)$ and $s(2018) = 1 + 2 + 1009 + 2018 = 3030$. Determine all positive integers $x$ such that $s(x) \cdot d(x) = 96$. (Richard Henner)

[b]p1.[/b] Can a number ending in $1999$ be the square of a natural number? [b]p2.[/b] The Three-Headed Snake Gorynych celebrated his birthday. His heads took turns feasting on birthday cakes and ate two identical cakes in $15$ minutes. It is known that each head ate as much time as it would take the other two to eat the same pie together. In how many minutes would the three heads of the Serpent Gorynych eat one pie together? [b]p3.[/b] Find the sum of the coefficients of the polynomial obtained after opening the brackets and bringing similar terms into the expression: a) $(7x - 6)^4 - 1$ b) $(7x - 6)^{1999}-1$ [b]p4.[/b] The general wants to arrange seven anti-aircraft installations so that among any three of them there are two installations, the distance between which is exactly $10$ kilometers. Help the general solve this problem. [b]p5.[/b] Gulliver, whose height is $999$ millimeters, is building a tower of cubes. The first cube has a height of $1/2$ a lilikilometer, the second - $1/4$ a lilikilometer, the third - $1/8$ a lilikilometer, etc. How many cubes will be in the tower when its height exceeds Gulliver's height. ($1$ lilikilometer is equal to $1000$ lilimeters). [b]p6.[/b] It is known that in any pentagon you can choose three diagonals from which you can form a triangle. Is there a pentagon in which such diagonals can be chosen in a unique way? [b]p7.[/b] It is known that for natural numbers $a$ and $b$ the equality $19a = 99b$ holds. Can $a + b$ be a prime number? [b]p8.[/b] Vitya thought of $5$ integers and told Vanya all their pairwise sums: $$0, 1, 5, 7, 11, 12, 18, 24, 25, 29.$$ Help Vanya guess the numbers he has in mind. [b]p9.[/b] In a $3 \times 3$ square, numbers are arranged so that the sum of the numbers in each row, in each column and on each major diagonal is equal to $0$. It is known that the sum of the squares of the numbers in the top row is $n$. What can be the sum of the squares of the numbers in the bottom line? [b]p10.[/b] $N$ points are marked on a circle. Two players play this game: the first player connects two of these points with a chord, from the end of which the second player draws a chord to one of the remaining points so as not to intersect the already drawn chord. Then the first player makes the same “move” - draws a new chord from the end of the second chord to one of the remaining points so that it does not intersect any of the already drawn ones. The one who cannot make such a “move” loses. Who wins when played correctly? (A chord is a segment whose ends lie on a given circle) PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c2416727_soros_olympiad_in_mathematics]here[/url].

Say a positive integer $n>1$ is $d$-coverable if for each non-empty subset $S\subseteq \{0, 1, \ldots, n-1\}$, there exists a polynomial $P$ with integer coefficients and degree at most $d$ such that $S$ is exactly the set of residues modulo $n$ that $P$ attains as it ranges over the integers. For each $n$, find the smallest $d$ such that $n$ is $d$-coverable, or prove no such $d$ exists. [i]Proposed by Carl Schildkraut[/i]

Suppose that $p|(2t^2-1)$ and $p^2|(2st+1)$. Prove that $p^2|(s^2+t^2-1)$

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$

We denote by gcd (...) the greatest common divisor of the numbers in (...). (For example, gcd$(4, 6, 8)=2$ and gcd $(12, 15)=3$.) Suppose that positive integers $a, b, c$ satisfy the following four conditions: $\bullet$ gcd $(a, b, c)=1$, $\bullet$ gcd $(a, b + c)>1$, $\bullet$ gcd $(b, c + a)>1$, $\bullet$ gcd $(c, a + b)>1$. a) Is it possible that $a + b + c = 2015$? b) Determine the minimum possible value that the sum $a+ b+ c$ can take.

What is the sum (in base $10$) of all the natural numbers less than $64$ which have exactly three ones in their base $2$ representation?

A diabolical combination lock has $n$ dials (each with $c$ possible states), where $n,c>1$. The dials are initially set to states $d_1, d_2, \ldots, d_n$, where $0\le d_i\le c-1$ for each $1\le i\le n$. Unfortunately, the actual states of the dials (the $d_i$'s) are concealed, and the initial settings of the dials are also unknown. On a given turn, one may advance each dial by an integer amount $c_i$ ($0\le c_i\le c-1$), so that every dial is now in a state $d_i '\equiv d_i+c_i \pmod{c}$ with $0\le d_i ' \le c-1$. After each turn, the lock opens if and only if all of the dials are set to the zero state; otherwise, the lock selects a random integer $k$ and cyclically shifts the $d_i$'s by $k$ (so that for every $i$, $d_i$ is replaced by $d_{i-k}$, where indices are taken modulo $n$). Show that the lock can always be opened, regardless of the choices of the initial configuration and the choices of $k$ (which may vary from turn to turn), if and only if $n$ and $c$ are powers of the same prime. [i]Bobby Shen.[/i]

Let $p$ be a prime number. Troy and Abed are playing a game. Troy writes a positive integer $X$ on the board, and gives a sequence $(a_n)_{n\in\mathbb{N}}$ of positive integers to Abed. Abed now makes a sequence of moves. The $n$-th move is the following: $$\text{ Replace } Y \text{ currently written on the board with either } Y + a_n \text{ or } Y \cdot a_n.$$ Abed wins if at some point the number on the board is a multiple of $p$. Determine whether Abed can win, regardless of Troy’s choices, if $a) p = 10^9 + 7$; $b) p = 10^9 + 9$. [i]Remark[/i]: Both $10^9 + 7$ and $10^9 + 9$ are prime. [i]Proposed by Ivan Novak[/i]

Determine the natural number $a =\frac{p+q}{r}+\frac{q+r}{p}+\frac{r+p}{q}$ where $p, q$ and $r$ are prime positive numbers.

We have that $(a+b)^3=216$, where $a$ and $b$ are positive integers such that $a>b$. What are the possible values of $a^2-b^2$?

Let $p \geq 5$ be a prime number. Prove that there exist at least 2 distinct primes $q_1, q_2$ satisfying $1 < q_i < p - 1$ and $q_i^{p-1} \not\equiv 1 \mbox{ (mod }p^2)$, for $i = 1, 2$.