Positive integers $a$, $b$ and $c$ are positive integers with greatest common divisor equal to $1$ (i.e. they have no common divisors greater than $1$), and $$\frac{ab}{a-b}=c$$ Prove that $a -b$ is a perfect square. (SL Berlov)

Find all triples $(p, x, y)$ consisting of a prime number $p$ and two positive integers $x$ and $y$ such that $x^{p -1} + y$ and $x + y^ {p -1}$ are both powers of $p$. [i]Proposed by Belgium[/i]

Determine if there is a non-natural natural number $n$ with the property that $\sqrt{n + 1} + \sqrt{n - 1}$ is rational.

Solve the following equation in the set of positive integers $x + y^2 + (GCD(x, y))^2 = xy \cdot GCD(x, y)$.

A football league has $n$ teams. Each team plays one game with every other team. Each win is awarded $2$ points, each tie $1$ point, and each loss $0$ points. After the league is over, the following statement is true: for every subset $S$ of teams in the league, there is a team (which may or may not be in $S$) such that the total points the team obtained by playing all the teams in $S$ is odd. Prove that $n$ is even.

For every sequence $p_1<p_2<\cdots<p_8$ of eight prime numbers, determine the largest integer $N$ for which the following equation has no solution in positive integers $x_1,\ldots,x_8$: $$p_1\, p_2\, \cdots\, p_8 \left( \frac{x_1}{p_1}+ \frac{x_2}{p_2}+ ~\cdots~ +\frac{x_8}{p_8} \right) ~~=~~ N $$ [i]Proposed by Gerhard Woeginger, Austria[/i]

A combination lock has a $3$ number combination, with each number an integer between $0$ and $39$ inclusive. Call the numbers $n_1$, $n_2$, and $n_3$. If you know that $n_1$ and $n_3$ leave the same remainder when divided by $4$, and $n_2$ and $n_1 + 2$ leave the same remainder when divided by $4$, how many possible combinations are there?

p1. A set of cards contains $100$ cards, each of which is written with a number from $1$ up to $100$. On each of the two sides of the card the same number is written, side one is red and the other is green. First of all Leny arranges all the cards with red writing face up. Then Leny did the following three steps: I. Turn over all cards whose numbers are divisible by $2$ II. Turn over all the cards whose numbers are divisible by $3$ III. Turning over all the cards whose numbers are divisible by $5$, but didn't turn over all cards whose numbers are divisible by $5$ and $2$. Find the number of Leny cards now numbered in red and face up, p2. Find the area of ​​three intersecting semicircles as shown in the following image. [img]https://cdn.artofproblemsolving.com/attachments/f/b/470c4d2b84435843975a0664fad5fee4a088d5.png[/img] p3. It is known that $x+\frac{1}{x}=7$ . Determine the value of $A$ so that $\frac{Ax}{x^4+x^2+1}=\frac56$. p4. There are $13$ different gifts that will all be distributed to Ami, Ima, Mai,and Mia. If Ami gets at least $4$ gifts, Ima and Mai respectively got at least $3$ gifts, and Mia got at least $2$ gifts, how many possible gift arrangements are there? p5. A natural number is called a [i]quaprimal [/i] number if it satisfies all four following conditions: i. Does not contain zeros. ii. The digits compiling the number are different. iii. The first number and the last number are prime numbers or squares of an integer. iv. Each pair of consecutive numbers forms a prime number or square of an integer. For example, we check the number $971643$. (i) $971643$ does not contain zeros. (ii) The digits who compile $971643$ are different. (iii) One first number and one last number of $971643$, namely $9$ and $3$ is a prime number or a square of an integer. (iv) Each pair of consecutive numbers, namely $97, 71, 16, 64$, and $43$ form prime number or square of an integer. So $971643$ is a quadratic number. Find the largest $6$-digit quaprimal number. Find the smallest $6$-digit quaprimal number. Which digit is never contained in any arbitrary quaprimal number? Explain.

Find all positive integers $n$ such that \[2n = \varphi(n)^{\frac{2}{3}}(\varphi(n)^{\frac{2}{3}}+1)\]

[b]p1.[/b] How many primes $p < 100$ satisfy $p = a^2 + b^2$ for some positive integers $a$ and $b$? [b]p2. [/b] For $a < b < c$, there exists exactly one Pythagorean triple such that $a + b + c = 2000$. Find $a + c - b$. [b]p3.[/b] Five points lie on the surface of a sphere of radius $ 1$ such that the distance between any two points is at least $\sqrt2$. Find the maximum volume enclosed by these five points. [b]p4.[/b] $ABCDEF$ is a convex hexagon with $AB = BC = CD = DE = EF = FA = 5$ and $AC = CE = EA = 6$. Find the area of $ABCDEF$. [b]p5.[/b] Joe and Wanda are playing a game of chance. Each player rolls a fair $11$-sided die, whose sides are labeled with numbers $1, 2, ... , 11$. Let the result of the Joe’s roll be $X$, and the result of Wanda’s roll be $Y$ . Joe wins if $XY$ has remainder $ 1$ when divided by $11$, and Wanda wins otherwise. What is the probability that Joe wins? [b]p6.[/b] Vivek picks a number and then plays a game. At each step of the game, he takes the current number and replaces it with a new number according to the following rule: if the current number $n$ is divisible by $3$, he replaces $n$ with $\frac{n}{3} + 2$, and otherwise he replaces $n$ with $\lfloor 3 \log_3 n \rfloor$. If he starts with the number $3^{2011}$, what number will he have after $2011$ steps? Note that $\lfloor x\rfloor$ denotes the largest integer less than or equal to $x$. [b]p7.[/b] Define a sequence an of positive real numbers with a$_1 = 1$, and $$a_{n+1} =\frac{4a^2_n - 1}{-2 + \frac{4a^2_n -1}{-2+ \frac{4a^2_n -1}{-2+...}}}.$$ What is $a_{2011}$? [b]p8.[/b] A set $S$ of positive integers is called good if for any $x, y \in S$ either $x = y$ or $|x - y| \ge 3$. How many subsets of $\{1, 2, 3, ..., 13\}$ are good? Include the empty set in your count. [b]p9.[/b] Find all pairs of positive integers $(a, b)$ with $a \le b$ such that $10 \cdot lcm \, (a, b) = a^2 + b^2$. Note that $lcm \,(m, n)$ denotes the least common multiple of $m$ and $n$. [b]p10.[/b] For a natural number $n$, $g(n)$ denotes the largest odd divisor of $n$. Find $$g(1) + g(2) + g(3) + ... + g(2^{2011})$$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Does there exist a natural number $n$ in whose decimal representation each digit occurs at least $2006$ times and which has the property that you can find two different digits in its decimal representation such that the number obtained from $n$ by interchanging these two digits is different from $n$ and has the same set of prime divisors as $n$ ?

For positive integers $n \ge 3$ and $r \ge 1$, define $$P(n, r) = (n - 2)\frac{r^2}{2} - (n - 4) \frac{r}{2}$$ We call a triple $(a, b, c)$ of natural numbers, with $a \le b \le c$, an $n$-gonal Pythagorean triple if $P(n, a)+P(n, b) = P(n, c)$. (For $n = 4$, we get the usual Pythagorean triple.) (a) Find an $n$-gonal Pythagorean triple for each $n \ge 3$. (b) Consider all triangles $ABC$ whose sides are $n$-gonal Pythagorean triples for some $n \ge 3$. Find the maximum and the minimum possible values of angle $C$.

Determine all three integers $(x, y, z)$ that are solutions of the system $$x + y -z = 6$$ $$x^3 + y^3 -z^3 = 414$$

Find all odd postive integers less than $2007$ such that the sum of all of its positive divisors is odd.

Let $m$ be a positive integer. Show that there exists a positive integer $n$ such that each of the $2m+1$ integers $$ 2^{n}-m,2^{n}-(m-1),\ldots,2^{n}+(m-1),2^{n}+m$$ is positive and composite.

Is it true that for $\forall$ prime number $p$, there exist non-constant polynomials $P$ and $Q$ with $P,Q\in \mathbb{Z} [x]$ for which the remainder modulo $p$ of the coefficient in front of $x^n$ in the product $PQ$ is 1 for $n=0$ and $n=4$; $p-2$ for $n=2$ and is 0 for all other $n\geq 0$?

Prove that for any natural numbers $a , b , c$ that $b>a>1$ and $gcd(c,ab)=1$ , there exist a natural number $n$ such that : $$c | \binom{b^n}{a^n}$$ [i]Proposed by Navid Safaei[/i]

Consider $70$-digit numbers with the property that each of the digits $1,2,3,...,7$ appear $10$ times in the decimal expansion of $n$ (and $8,9,0$ do not appear). Show that no number of this form can divide another number of this form.

Gary purchased a large beverage, but drank only $m/n$ of this beverage, where $m$ and $n$ are relatively prime positive integers. If Gary had purchased only half as much and drunk twice as much, he would have wasted only $\frac{2}{9}$ as much beverage. Find $m+n$.

Let $p \equiv 2 \pmod 3$ be a prime, $k$ a positive integer and $P(x) = 3x^{\frac{2p-1}{3}}+3x^{\frac{p+1}{3}}+x+1$. For any integer $n$, let $R(n)$ denote the remainder when $n$ is divided by $p$ and let $S = \{0,1,\cdots,p-1\}$. At each step, you can either (a) replaced every element $i$ of $S$ with $R(P(i))$ or (b) replaced every element $i$ of $S$ with $R(i^k)$. Determine all $k$ such that there exists a finite sequence of steps that reduces $S$ to $\{0\}$. [i]Proposed by fattypiggy123[/i]

Let $k$ be a positive integer. A ring $(A,+,\cdot)$ has property $P_k$ if for any $a,b\in A$ there exists $c\in A$ such that $a^k=b^k+c^k.$[list=a] [*]Give an example of a finite ring $(A,+,\cdot)$ which [i]does not[/i] have $P_k$ for any $k\geqslant 2.$ [*]Let $n\geqslant 3$ be an integer and $M_n=\{m\in\mathbb{N}:(\mathbb{Z}_n,+,\cdot)\text{ has }P_m\}.$ Prove that all the elements of $M_n$ are odd integers and that $(M_n,\cdot)$ is a monoid. [/list]

On the board are written $100$ mutually different positive real numbers, such that for any three different numbers $a, b, c$ is $a^2 + bc$ is an integer. Prove that for any two numbers $x, y$ from the board , number $\frac{x}{y}$ is rational.

Integer $n>2$ is given. Find the biggest integer $d$, for which holds, that from any set $S$ consisting of $n$ integers, we can find three different (but not necesarilly disjoint) nonempty subsets, such that sum of elements of each of them is divisible by $d$.

Both roots of the quadratic equation $ x^2 \minus{} 63x \plus{} k \equal{} 0$ are prime numbers. The number of possible values of $ k$ is $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 3 \qquad \textbf{(E)}\ \textbf{more than four}$

Find all the positive integers less than 1000 such that the cube of the sum of its digits is equal to the square of such integer.