Find all primes $p,q,r$ and natural numbers $n$ such that $\frac{1}{p}+\frac{1}{q}+\frac{1}{r}=\frac{1}{n}$.

Sergei chooses two different natural numbers $a$ and $b$. He writes four numbers in a notebook: $a$, $a+2$, $b$ and $b+2$. He then writes all six pairwise products of the numbers of notebook on the blackboard. Let $S$ be the number of perfect squares on the blackboard. Find the maximum value of $S$. [i]S. Berlov[/i]

What is the total number of natural numbes divisible by 9 the number of digits of which does not exceed 2008 and at least two of the digits are 9s?

[b]p1.[/b] A bus leaves San Mateo with $n$ fairies on board. When it stops in San Francisco, each fairy gets off, but for each fairy that gets off, $n$ fairies get on. Next it stops in Oakland where $6$ times as many fairies get off as there were in San Mateo. Finally the bus arrives at Berkeley, where the remaining $391$ fairies get off. How many fairies were on the bus in San Mateo? [b]p2.[/b] Let $a$ and $b$ be two real solutions to the equation $x^2 + 8x - 209 = 0$. Find $\frac{ab}{a+b}$ . Express your answer as a decimal or a fraction in lowest terms. [b]p3.[/b] Let $a$, $b$, and $c$ be positive integers such that the least common multiple of $a$ and $b$ is $25$ and the least common multiple of $b$ and $c$ is $27$. Find $abc$. [b]p4.[/b] It takes Justin $15$ minutes to finish the Speed Test alone, and it takes James $30$ minutes to finish the Speed Test alone. If Justin works alone on the Speed Test for $3$ minutes, then how many minutes will it take Justin and James to finish the rest of the test working together? Assume each problem on the Speed Test takes the same amount of time. [b]p5.[/b] Angela has $128$ coins. $127$ of them have the same weight, but the one remaining coin is heavier than the others. Angela has a balance that she can use to compare the weight of two collections of coins against each other (that is, the balance will not tell Angela the weight of a collection of coins, but it will say which of two collections is heavier). What is the minumum number of weighings Angela must perform to guarantee she can determine which coin is heavier? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The numbers in the sequence 101, 104, 109, 116, $\dots$ are of the form $a_n = 100 + n^2$, where $n = 1$, 2, 3, $\dots$. For each $n$, let $d_n$ be the greatest common divisor of $a_n$ and $a_{n + 1}$. Find the maximum value of $d_n$ as $n$ ranges through the positive integers.

The radius $r$ of a circle with center at the origin is an odd integer. There is a point ($p^m, q^n$) on the circle, with $p,q$ prime numbers and $m,n$ positive integers. Determine $r$.

[b]p1.[/b] In the picture below, the two parallel cuts divide the square into three pieces of equal area. The distance between the two parallel cuts is $d$. The square has length $s$. Find and prove a formula that expresses $s$ as a function of $d$. [img]https://cdn.artofproblemsolving.com/attachments/c/b/666074d28de50cdbf338a2c667f88feba6b20c.png[/img] [b]p2.[/b] Let $S$ be a subset of $\{1, 2, 3, . . . 10, 11\}$. We say that $S$ is lucky if no two elements of $S$ differ by $4$ or $7$. (a) Give an example of a lucky set with five elements. (b) Is it possible to find a lucky set with six elements? Explain why or why not.[/quote] [b]p3.[/b] Find polynomials $p(x)$ and $q(x)$ with real coefficients such that (a) $p(x) - q(x) = x^3 + x^2 - x - 1$ for all real $x$, (b) $p(x) > 0$ for all real $x$, (c) $q(x) > 0$ for all real $x$. [b]p4.[/b] A permutation on $\{1, 2, 3, …, n\}$ is a rearrangement of the symbols. For example $32154$ is a permutation on $\{1, 2, 3, 4, 5\}$. Given a permutation $a_1a_2a_3…a_n$, an inversion is a pair of $a_i$ and $a_j$ such that $a_i > a_j$ but $i < j$. For example, $32154$ has $4$ inversions. Suppose you are only allowed to exchange adjacent symbols. For any permutation, show that the minimum number of exchanges required to put all the symbols in their natural positions (that is, $123 …n$) is the number of inversions. [b]p5.[/b] We say a number $N$ is a nontrivial sum of consecutive positive integers if it can be written as the sum of $2$ or more consecutive positive integers. What is the set of numbers from $1000$ to $2000$ that are NOT nontrivial sums of consecutive positive integers? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Define the sequence $a_1, a_2, a_3, ...$ by $a_1 = 1$, $a_n = a_{n-1} + a_{[n/2]}$. Does the sequence contain infinitely many multiples of $7$?

A natural number is called $nice$ if it doesn't contain 0 and if we add the product of its digit to the number, we obtain number with the same product of its digits. Prove that there is a nice 2015-digit number.

For every positive integer $n$ there exist unambiguously determined non-negative integers $a(n)$ and $b(n)$ such that $$n = 2^{a(n)}(2b(n)+1),$$ For positive integer $k$ we define $S(k)$ by: $$a(1) + a(2) + ... + a(2^k) = S(k)$$ Express $S(k)$ in terms of $k$.

Find all positive integers $n$ such that there exist a permutation $\sigma$ on the set $\{1,2,3, \ldots, n\}$ for which \[\sqrt{\sigma(1)+\sqrt{\sigma(2)+\sqrt{\ldots+\sqrt{\sigma(n-1)+\sqrt{\sigma(n)}}}}}\] is a rational number.

Find, with proof, all solutions of the equation $\frac 1x +\frac 2y- \frac 3z = 1$ in positive integers $x, y, z.$

One day Mnemosyne decided to colour all natural numbers in increasing order. She coloured $0$, $1$ and $2$ in brown, and her favourite number, $3$, in gold. From then on, for any number whose sum of digits (in the decimal system) was a golden number less than the number itself, she coloured it gold, but coloured the rest of the numbers brown. How many four-digit numbers were coloured gold by Mnemosyne? [i]The set of natural numbers includes[/i] $0$.

Let $ q \equal{} 2p\plus{}1$, $ p, q > 0$ primes. Prove that there exists a multiple of $ q$ whose digits sum in decimal base is positive and at most $ 3$.

For each positive integer $n$, define $A(n)$ to be the sum of its divisors, and $B(n)$ to be the sum of products of pairs of its divisors. For example, \[A(10)=1+2+5+10=18\] \[B(10)=1\cdot 2+1\cdot 5+1\cdot 10+2\cdot 5+2\cdot 10+5\cdot 10=97\] Find all positive integers $n$ for which $A(n)$ divides $B(n)$.

Find all positive integers $n$ such that there exists a sequence of positive integers $a_1$, $a_2$,$\ldots$, $a_n$ satisfying: \[a_{k+1}=\frac{a_k^2+1}{a_{k-1}+1}-1\] for every $k$ with $2\leq k\leq n-1$. [i]Proposed by North Korea[/i]

Find all pairs $(a,b)$ of positive integers such that $a!+b$ and $b!+a$ are both powers of $5$. [i]Nikola Velov, North Macedonia[/i]

Let $b \geq 2$ be a positive integer. (a) Show that for an integer $N$, written in base $b$, to be equal to the sum of the squares of its digits, it is necessary either that $N = 1$ or that $N$ have only two digits. (b) Give a complete list of all integers not exceeding $50$ that, relative to some base $b$, are equal to the sum of the squares of their digits. (c) Show that for any base b the number of two-digit integers that are equal to the sum of the squares of their digits is even. (d) Show that for any odd base $b$ there is an integer other than $1$ that is equal to the sum of the squares of its digits.

Seven teams play a soccer tournament in which each team plays every other team exactly once. No ties occur, each team has a $50\%$ chance of winning each game it plays, and the outcomes of the games are independent. In each game, the winner is awarded a point and the loser gets 0 points. The total points are accumilated to decide the ranks of the teams. In the first game of the tournament, team $A$ beats team $B$. The probability that team $A$ finishes with more points than team $B$ is $m/n$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Let $p$ be a prime number, $p> 5$. Determine the non-zero natural numbers $x$ with the property that $5p + x$ divides $5p ^ n + x ^ n$, whatever $n \in N ^ {*} $.

The given integers are $ a_1, a_2, \ldots , a_{11} $ . Prove that there exists a non-zero sequence $ x_1, x_2, \ldots, x_{11} $ with terms from the set $ \{-1,0,1\} $ such that the number $ x_1a_1 + \ldots x_{11}a_{ 11}$ is divisible by 1989.

Let $p,q$ be prime numbers ($q$ is odd). Prove that there exists an integer $x$ such that: $$q |(x+1)^p-x^p$$ If and only if $$q \equiv 1 \pmod p$$

[u]Round 1[/u] [b]1.1.[/b] Suppose a certain menu has $3$ sandwiches and $5$ drinks. How many ways are there to pick a meal so that you have exactly a drink and a sandwich? [b]1.2.[/b] If $a + b = 4$ and $a + 3b = 222222$, find $10a + b$. [b]1.3.[/b] Compute $$\left\lfloor \frac{2019 \cdot 2017}{2018} \right\rfloor $$ where $\lfloor x \rfloor$ is the greatest integer less than or equal to $x$. [u]Round 2[/u] [b]2.1.[/b] Andrew has $10$ water bottles, each of which can hold at most $10$ cups of water. Three bottles are thirty percent filled, five are twenty-four percent filled, and the rest are empty. What is the average amount of water, in cups, contained in the ten water bottles? [b]2.2.[/b] How many positive integers divide $195$ evenly? [b]2.3.[/b] Square $A$ has side length $\ell$ and area $128$. Square $B$ has side length $\ell/2$. Find the length of the diagonal of Square $B$. [u]Round 3[/u] [b]3.1.[/b] A right triangle with area $96$ is inscribed in a circle. If all the side lengths are positive integers, what is the area of the circle? Express your answer in terms of $\pi$. [b]3.2.[/b] A circular spinner has four regions labeled $3, 5, 6, 10$. The region labeled $3$ is $1/3$ of the spinner, $5$ is $1/6$ of the spinner, $6$ is $1/10$ of the spinner, and the region labeled $10$ is $2/5$ of the spinner. If the spinner is spun once randomly, what is the expected value of the number on which it lands? [b]3.3.[/b] Find the integer k such that $k^3 = 8353070389$ [u]Round 4[/u] [b]4.1.[/b] How many ways are there to arrange the letters in the word [b]zugzwang [/b] such that the two z’s are not consecutive? [b]4.2.[/b] If $O$ is the circumcenter of $\vartriangle ABC$, $AD$ is the altitude from $A$ to $BC$, $\angle CAB = 66^o$ and $\angle ABC = 44^o$, then what is the measure of $\angle OAD$ ? [b]4.3.[/b] If $x > 0$ satisfies $x^3 +\frac{1}{x^3} = 18$, find $x^5 +\frac{1}{x^5}$ [u]Round 5[/u] [b]5.1.[/b] Let $C$ be the answer to Question $3$. Neethen decides to run for school president! To be entered onto the ballot, however, Neethen needs $C + 1$ signatures. Since no one else will support him, Neethen gets the remaining $C$ other signatures through bribery. The situation can be modeled by $k \cdot N = 495$, where $k$ is the number of dollars he gives each person, and $N$ is the number of signatures he will get. How many dollars does Neethen have to bribe each person with to get exactly C signatures? [b]5.2.[/b] Let $A$ be the answer to Question $1$. With $3A - 1$ total votes, Neethen still comes short in the election, losing to Serena by just $1$ vote. Darn! Neethen sneaks into the ballot room, knowing that if he destroys just two ballots that voted for Serena, he will win the election. How many ways can Neethen choose two ballots to destroy? [b]5.3.[/b] Let $B$ be the answer to Question $2$. Oh no! Neethen is caught rigging the election by the principal! For his punishment, Neethen needs to run the perimeter of his school three times. The school is modeled by a square of side length $k$ furlongs, where $k$ is an integer. If Neethen runs $B$ feet in total, what is $k + 1$? (Note: one furlong is $1/8$ of a mile). [u]Round 6[/u] [b]6.1.[/b] Find the unique real positive solution to the equation $x =\sqrt{6 + 2\sqrt6 + 2x}- \sqrt{6 - 2\sqrt6 - 2x} -\sqrt6$. [b]6.2.[/b] Consider triangle ABC with $AB = 13$ and $AC = 14$. Point $D$ lies on $BC$, and the lengths of the perpendiculars from $D$ to $AB$ and $AC$ are both $\frac{56}{9}$. Find the largest possible length of $BD$. [b]6.3.[/b] Let $f(x, y) = \frac{m}{n}$, where $m$ is the smallest positive integer such that $x$ and $y$ divide $m$, and $n$ is the largest positive integer such that $n$ divides both $x$ and $y$. If $S = \{1, 2, 3, 4, 5, 6, 7, 8, 9, 10\}$, what is the median of the distinct values that $f(a, b)$ can take, where $a, b \in S$? [u]Round 7[/u] [b]7.1.[/b] The polynomial $y = x^4 - 22x^2 - 48x - 23$ can be written in the form $$y = (x - \sqrt{a} - \sqrt{b} - \sqrt{c})(x - \sqrt{a} +\sqrt{b} +\sqrt{c})(x +\sqrt{a} -\sqrt{b} +\sqrt{c})(x +\sqrt{a} +\sqrt{b} -\sqrt{c})$$ for positive integers $a, b, c$ with $a \le b \le c$. Find $(a + b)\cdot c$. [b]7.2.[/b] Varun is grounded for getting an $F$ in every class. However, because his parents don’t like him, rather than making him stay at home they toss him onto a number line at the number $3$. A wall is placed at $0$ and a door to freedom is placed at $10$. To escape the number line, Varun must reach 10, at which point he walks through the door to freedom. Every $5$ minutes a bell rings, and Varun may walk to a different number, and he may not walk to a different number except when the bell rings. Being an $F$ student, rather than walking straight to the door to freedom, whenever the bell rings Varun just randomly chooses an adjacent integer with equal chance and walks towards it. Whenever he is at $0$ he walks to $ 1$ with a $100$ percent chance. What is the expected number of times Varun will visit $0$ before he escapes through the door to freedom? [b]7.3.[/b] Let $\{a_1, a_2, a_3, a_4, a_5, a_6\}$ be a set of positive integers such that every element divides $36$ under the condition that $a_1 < a_2 <... < a_6$. Find the probability that one of these chosen sets also satisfies the condition that every $a_i| a_j$ if $i|j$. [u]Round 8[/u] [b]8.[/b] How many numbers between $1$ and $100, 000$ can be expressed as the product of at most $3$ distinct primes? Your answer will be scored according to the following formula, where $X$ is the correct answer and $I$ is your input. $$max \left\{ 0, \left\lceil min \left\{13 - \frac{|I-X|}{0.1 |I|}, 13 - \frac{|I-X|}{0.1 |I-2X|} \right\} \right\rceil \right\}$$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

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]

Find set of positive integers divisible with $8$ which sum of digits is $7$ and product is $6$