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$.)

For $ x \in (0, 1)$ let $ y \in (0, 1)$ be the number whose $ n$-th digit after the decimal point is the $ 2^{n}$-th digit after the decimal point of $ x$. Show that if $ x$ is rational then so is $ y$. [i]Proposed by J.P. Grossman, Canada[/i]

There are relatively prime positive integers $m$ and $n$ so that \[\dfrac{\dfrac{1}{2}}{\dfrac{\dfrac{1}{3}}{\dfrac{1}{4}+\dfrac{1}{4}+\dfrac{1}{4}}+\dfrac{\dfrac{1}{3}}{\dfrac{1}{4}+\dfrac{1}{4}+\dfrac{1}{4}}}=\dfrac{m}{n}.\]Find $m+2n$.

[u]Round 9[/u] [b]p25.[/b] A positive integer is called spicy if it is divisible by the sum if its digits. Find the number of spicy integers between $100$ and $200$ inclusive. [b]p26.[/b] Rectangle $ABCD$ has points $E$ and $F$ on sides $AB$ and $BC$, respectively. Given that $\frac{AE}{BE} = \frac{BF}{FC} =\frac12$, $\angle ADE = 30^o$, and $[DEF] = 25$, find the area of rectangle $ABCD$. [b]p27.[/b] Find the largest value of $n$ for which $3^n$ divides ${100 \choose 33}$. [u]Round 10[/u] [b]p28.[/b] Isosceles trapezoid $ABCD$ is inscribed in a circle such that $AB \parallel CD$, $AB = 2$, $CD = 4$, and $AC = 9$. What is the radius of the circle? [b]p29.[/b] Find the product of all possible positive integers $n$ less than $11$ such that in a group of $n$ people, it is possible for every person to be friends with exactly $3$ other people within the group. Assume that friendship is amutual relationship. [b]p30.[/b] Compute the infinite product $$\left( 1+ \frac{1}{2^1} \right) \left( 1+ \frac{1}{2^2} \right) \left( 1+ \frac{1}{2^4} \right) \left( 1+ \frac{1}{2^8} \right) \left( 1+ \frac{1}{2^{16}} \right) ...$$ [u]Round 11[/u] [b]p31.[/b] Find the sum of all possible values of $x y$ if $x +\frac{1}{y}= 12$ and $\frac{1}{x}+ y = 8$. [b]p32.[/b] Find the number of ordered pairs $(a,b)$, where $0 < a,b < 1999$, that satisfy $a^2 +b^2 \equiv ab$ (mod $1999$) [b]p33.[/b] Let $f :N\to Q$ be a function such that $f(1) =0$, $f (2) = 1$ and $f (n) = \frac{f(n-1)+f (n-2)}{2}$ . Evaluate $$\lim_{n\to \infty} f (n).$$ [u]Round 12[/u] [b]p34.[/b] Estimate the sumof the digits of $2018^{2018}$. The number of points you will receive is calculated using the formula $\max \,(0,15-\log_{10}(A-E))$, where $A$ is the true value and $E$ is your estimate. [b]p35.[/b] Let $C(m,n)$ denote the number of ways to tile an $m$ by $n$ rectangle with $1\times 2$ tiles. Estimate $\log_{10}(C(100, 2))$. The number of points you will recieve is calculated using the formula $\max \,(0,15- \log_{10}(A-E))$, where $A$ is the true value and $E$ is your estimate. [b]p36.[/b] Estimate $\log_2 {1000 \choose 500}$. The number of points you earn is equal to $\max \,(0,15-|A-E|)$, where $A$ is the true value and $E$ is your estimate. PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h3165983p28809209]here [/url] and 5-8 [url=https://artofproblemsolving.com/community/c3h3165992p28809294]here[/url].. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Prove that every $1000$-element subset $M$ of the set $\{0,1,...,2001\}$ contains either a power of two or two distinct numbers whose sum is a power of two.

Given a prime number $p{}$ and integers $x{}$ and $y$, find the remainder of the sum $x^0y^{p-1}+x^1y^{p-2}+\ldots+x^{p-2}y^1+x^{p-1}y^0$ upon division by $p{}$.

Let $a, b, c$ be distinct positive integers with sum $547$ and let $d$ be the greatest common divisor of the three numbers $ab+1, bc+1, ca+1$. Find the maximal possible value of $d$.

Find all pairs $(x, y)$ of rational numbers such that $$xy^2=x^2+2x-3$$

Let $p$, $q$ be two distinct prime numbers and $n$ be a natural number, such that $pq$ divides $n^{pq}+1$. Prove that, if $p^3 q^3$ divides $n^{pq}+1$, then $p^2$ or $q^2$ divides $n+1$.

Supoose $A$ is a set of integers which contains all integers that can be written as $2^a-2^b$, $a,b\in \mathbb{Z}_{\ge 1}$ and also has the property that $a+b\in A$ whenever $a,b\in A$. Prove that if $A$ contains at least an odd number, then $A=\mathbb{Z}$. [i] (Andrei Bâra)[/i]

Consider the set of solutions of the equation $$x^2+y^3=z^2.$$ in positive integers. Is it finite or infinite? (Folklore)

Find the largest integer $d$ divides all three numbers $abc, bca$ and $cab$ with $a, b$ and $c$ being some nonzero and mutually different digits. Czech Republic

Prove that the number $1\underbrace{\hbox{0...0}}_{\hbox{49}}5\underbrace{\hbox{0...0}}_{\hbox{99}}1$ is not the cube of any integer.

Find the positive integer $n{}$ if $$\left(1-\frac{1}{1+2}\right)\cdot\left(1-\frac{1}{1+2+3}\right)\cdot\ldots\cdot\left(1-\frac{1}{1+2+\ldots+n}\right)=\frac{2021}{6057}.$$

A paper equilateral triangle $ABC$ has side length $12$. The paper triangle is folded so that vertex $A$ touches a point on side $\overline{BC}$ a distance $9$ from point $B$. The length of the line segment along which the triangle is folded can be written as $\frac{m\sqrt{p}}{n}$, where $m$, $n$, and $p$ are positive integers, $m$ and $n$ are relatively prime, and $p$ is not divisible by the square of any prime. Find $m+n+p$. [asy] import cse5; size(12cm); pen tpen = defaultpen + 1.337; real a = 39/5.0; real b = 39/7.0; pair B = MP("B", (0,0), dir(200)); pair A = MP("A", (9,0), dir(-80)); pair C = MP("C", (12,0), dir(-20)); pair K = (6,10.392); pair M = (a*B+(12-a)*K) / 12; pair N = (b*C+(12-b)*K) / 12; draw(B--M--N--C--cycle, tpen); draw(M--A--N--cycle); fill(M--A--N--cycle, mediumgrey); pair shift = (-20.13, 0); pair B1 = MP("B", B+shift, dir(200)); pair A1 = MP("A", K+shift, dir(90)); pair C1 = MP("C", C+shift, dir(-20)); draw(A1--B1--C1--cycle, tpen);[/asy]

Show that for any integer $a\ge 5$ there exist integers $b$ and $c$, $c\ge b\ge a$, such that $a,b,c$ are the lengths of the sides of a right-angled triangle.

Let $a_n = 6^n + 8^n$. Determine the remainder on dividing $a_{83}$ by 49.

$p, q, r$ are distinct prime numbers which satisfy $$2pqr + 50pq = 7pqr + 55pr = 8pqr + 12qr = A$$ for natural number $A$. Find all values of $A$.

Define the sequence $a_0,a_1,a_2,\hdots$ by $a_n=2^n+2^{\lfloor n/2\rfloor}$. Prove that there are infinitely many terms of the sequence which can be expressed as a sum of (two or more) distinct terms of the sequence, as well as infinitely many of those which cannot be expressed in such a way.

Decide whether exists function $f: \mathbb{N} \rightarrow \mathbb{N}$, such that for each $n \in \mathbb{N}$ is $f(f(n) )= 2n$.

Three mutually tangent spheres each with radius $5$ sit on a horizontal plane. A triangular pyramid has a base that is an equilateral triangle with side length $6$, has three congruent isosceles triangles for vertical faces, and has height $12$. The base of the pyramid is parallel to the plane, and the vertex of the pyramid is pointing downward so that it is between the base and the plane. Each of the three vertical faces of the pyramid is tangent to one of the spheres at a point on the triangular face along its altitude from the vertex of the pyramid to the side of length $6$. The distance that these points of tangency are from the base of the pyramid is $\tfrac mn$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$. [asy] size(200); defaultpen(linewidth(0.8)); pair X=(-.6,.4),A=(-.4,2),B=(-.7,1.85),C=(-1.1,2.05); picture spherex; filldraw(spherex,unitcircle,white); draw(spherex,(-1,0)..(-.2,-.2)..(1,0)^^(0,1)..(-.2,-.2)..(0,-1)); add(shift(-0.5,0.6)*spherex); filldraw(X--A--C--cycle,gray); draw(A--B--C^^X--B); add(shift(-1.5,0.2)*spherex); add(spherex); [/asy]

Define $S_r(n)$: digit sum of $n$ in base $r$. For example, $38=(1102)_3,S_3(38)=1+1+0+2=4$. Prove: [b](a)[/b] For any $r>2$, there exists prime $p$, for any positive intenger $n$, $S_{r}(n)\equiv n\mod p$. [b](b)[/b] For any $r>1$ and prime $p$, there exists infinitely many $n$, $S_{r}(n)\equiv n\mod p$.

[b]p1.[/b] Is there an integer such that the product of all whose digits equals $99$ ? [b]p2.[/b] An elevator in a $100$ store building has only two buttons: UP and DOWN. The UP button makes the elevator go $13$ floors up, and the DOWN button makes it go $8$ floors down. Is it possible to go from the $13$th floor to the $8$th floor? [b]p3.[/b] Cut the triangle shown in the picture into three pieces and rearrange them into a rectangle. (Pieces can not overlap.) [img]https://cdn.artofproblemsolving.com/attachments/9/f/359d3b987012de1f3318c3f06710daabe66f28.png[/img] [b]p4.[/b] Two players Tom and Sid play the following game. There are two piles of rocks, $5$ rocks in the first pile and $6$ rocks in the second pile. Each of the players in his turn can take either any amount of rocks from one pile or the same amount of rocks from both piles. The winner is the player who takes the last rock. Who does win in this game if Tom starts the game? [b]p5.[/b] In the next long multiplication example each letter encodes its own digit. Find these digits. $\begin{tabular}{ccccc} & & & a & b \\ * & & & c & d \\ \hline & & c & e & f \\ + & & a & b & \\ \hline & c & f & d & f \\ \end{tabular}$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Prove that none of the numbers $11, 111, 1111, ...$ is a square number, cube number or higher power of a natural number.

Let $\overline{abc}$ be a three digit number with nonzero digits such that $a^2 + b^2 = c^2$. What is the largest possible prime factor of $\overline{abc}$