Find all integers \( n > 1 \) such that all prime divisors of \( n^6 - 1 \) divide \( (n^2 - 1)(n^3 - 1) \).

Find all positive integers $a, b, c, d$ with $a \le b$ and $c \le d$ such that $\begin{cases} a + b = cd \\ c + d = ab \end{cases}$ .

For every positive integer $n$ with prime factorization $n = \prod_{i = 1}^{k} p_i^{\alpha_i}$, define \[\mho(n) = \sum_{i: \; p_i > 10^{100}} \alpha_i.\] That is, $\mho(n)$ is the number of prime factors of $n$ greater than $10^{100}$, counted with multiplicity. Find all strictly increasing functions $f: \mathbb{Z} \to \mathbb{Z}$ such that \[\mho(f(a) - f(b)) \le \mho(a - b) \quad \text{for all integers } a \text{ and } b \text{ with } a > b.\] [i]Proposed by Rodrigo Sanches Angelo, Brazil[/i]

Let $F_1, F_2, F_3 \cdots$ be the Fibonacci sequence, the sequence of positive integers satisfying $$F_1 =F_2=1$$ and $$F_{n+2} = F_{n+1} + F_n$$ for all $n \ge 1$. Does there exist an $n \ge 1$ such that $F_n$ is divisible by $2014$? Prove your answer.

Let $a > b$ be relatively prime positive integers. A grashopper stands at point $0$ in a number line. Each minute, the grashopper jumps according to the following rules: [list] [*] If the current minute is a multiple of $a$ and not a multiple of $b$, it jumps $a$ units forward. [*] If the current minute is a multiple of $b$ and not a multiple of $a$, it jumps $b$ units backward. [*] If the current minute is both a multiple of $b$ and a multiple of $a$, it jumps $a - b$ units forward. [*] If the current minute is neither a multiple of $a$ nor a multiple of $b$, it doesn't move. [/list] Find all positions on the number line that the grasshopper will eventually reach.

Some positive integer $n$ is written on the board. Andrey and Petya is playing the following game. Andrey finds all the different representations of the number n as a product of powers of prime numbers (values degrees greater than 1), in which each factor is greater than all previous or equal to the previous one. Petya finds all different representations of the number $n$ as a product of integers greater than $1$, in which each factor is divisible by all the previous factors. The one who finds more performances wins, if everyone finds the same number of representations, the game ends in a draw. Find all positive integers $n$ for which the game will end in a draw. Note. The representation of the number $n$ as a product is also considered a representation consisting of a single factor $n$.

A number with $2016$ zeros that is written as $101010 \dots 0101$ is given, in which the zeros and ones alternate. Prove that this number is not prime.

Prove that if for a real number $a $ , $a+\frac {1}{a} $is integer then $a^n+\frac {1}{a^n} $ is also integer where $n$ is positive integer.

The digits $1, 4, 9$ and $2$ are each used exactly once to form some $4$-digit number $N$. What is the sum of all possible values of $N$?

A [i]super-integer[/i] triangle is defined to be a triangle whose lengths of all sides and at least one height are positive integers. We will deem certain positive integer numbers to be [i]good[/i] with the condition that if the lengths of two sides of a super-integer triangle are two (not necessarily different) good numbers, then the length of the remaining side is also a good number. Let $5$ be a good number. Prove that all integers larger than $2$ are good numbers.

[u]Round 5[/u] [b]5.1[/b] A circle with a radius of $1$ is inscribed in a regular hexagon. This hexagon is inscribed in a larger circle. If the area that is outside the hexagon but inside the larger circle can be expressed as $\frac{a\pi}{b} - c\sqrt{d}$, where $a, b, c, d$ are positive integers, $a, b$ are relatively prime, and no prime perfect square divides into $d$. find the value of $a + b + c + d$. [b]5.2[/b] At a dinner party, $10$ people are to be seated at a round table. If person A cannot be seated next to person $B$ and person $C$ must be next to person $D$, how many ways can the 10 people be seated? Consider rotations of a configuration identical. [b]5.3[/b] Let $N$ be the sum of all the positive integers that are less than $2022$ and relatively prime to $1011$. Find $\frac{N}{2022}$. [u]Round 6[/u] [b]6.1[/b] The line $y = m(x - 6)$ passes through the point $ A$ $(6, 0)$, and the line $y = 8 -\frac{x}{m}$ pass through point $B$ $(0,8)$. The two lines intersect at point $C$. What is the largest possible area of triangle $ABC$? [b]6.2[/b] Let $N$ be the number of ways there are to arrange the letters of the word MATHEMATICAL such that no two As can be adjacent. Find the last $3$ digits of $\frac{N}{100}$. [b]6.3[/b] Find the number of ordered triples of integers $(a, b, c)$ such that $|a|, |b|, |c| \le 100$ and $3abc = a^3 + b^3 + c^3$. [u]Round 7[/u] [b]7.1[/b] In a given plane, let $A, B$ be points such that $AB = 6$. Let $S$ be the set of points such that for any point $C$ in $S$, the circumradius of $\vartriangle ABC$ is at most $6$. Find $a + b + c$ if the area of $S$ can be expressed as $a\pi + b\sqrt{c}$ where $a, b, c$ are positive integers, and $c$ is not divisible by the square of any prime. [b]7.2[/b] Compute $\sum_{1\le a<b<c\le 7} abc$. [b]7.3[/b] Three identical circles are centered at points $A, B$, and $C$ respectively and are drawn inside a unit circle. The circles are internally tangent to the unit circle and externally tangent to each other. A circle centered at point $D$ is externally tangent to circles $A, B$, and $C$. If a circle centered at point $E$ is externally tangent to circles $A, B$, and $D$, what is the radius of circle $E$? The radius of circle $E$ can be expressed as $\frac{a\sqrt{b}-c}{d}$ where $a, b, c$, and d are all positive integers, gcd(a, c, d) = 1, and b is not divisible by the square of any prime. What is the sum of $a + b + c + d$? [u]Round 8[/u] [b]8.[/b] Let $A$ be the number of unused Algebra problems in our problem bank. Let $B$ be the number of times the letter ’b’ appears in our problem bank. Let M be the median speed round score. Finally, let $C$ be the number of correct answers to Speed Round $1$. Estimate $$A \cdot B + M \cdot C.$$ 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.05 |I|}, 13 - \frac{|I-X|}{0.05 |I-2X|} \right\} \right\rceil \right\}$$ PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h2826128p24988676]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given a non-zero integer $y$ and a positive integer $n$. If $x_1, x_2, \ldots, x_n \in \mathbb{Z} - \{0, 1\}$ and $z \in \mathbb{Z}^+$ satisfy $(x_1x_2 \ldots x_n)^2y \le 2^{2(n+1)}$ and $x_1x_2 \ldots x_ny = z + 1$, prove that there is a prime among $x_1, x_2, \ldots, x_n, z$. [color=blue]It appears that the problem statement is incorrect; suppose $y = 5, n = 2$, then $x_1 = x_2 = -1$ and $z = 4$. They all satisfy the problem's conditions, but none of $x_1, x_2, z$ is a prime. What should the problem be, or did I misinterpret the problem badly?[/color]

Find all positive interger $ n$ so that $ n^3\minus{}5n^2\plus{}9n\minus{}6$ is perfect square number.

Find all functions $ f: N \rightarrow N $ such that: $\bullet$ $ f (m) = 1 \iff m = 1 $; $\bullet$ If $ d = \gcd (m, n) $, then $ f (mn) = \frac {f (m) f (n)} {f (d)} $; and $\bullet$ $ \forall m \in N $, we have $ f ^ {2012} (m) = m $. Clarification: $f^n (a) = f (f^{n-1} (a))$

Define sequence $(a_n):a_n=2^n+3^n+6^n+1(n\in\mathbb{Z}_+)$. Are there intenger $k\geq2$, satisfying that $\gcd(k,a_i)=1$ for all $k\in\mathbb{Z}_+$? If yes, find the smallest $k$. If not, prove this.

Find all the positive integers $x,y,z$ satisfiing : $x^{2}+y^{2}+z^{2}=2xyz$

A sequence $a_0,a_1,a_2,...,a_n,...$ is such that $a_0=1$ and, for each $n\ge 0$ , $a_{n+1}=m \cdot a_n$ , where $m$ is an integer between $2$ and $9$ inclusive. Also, every integer between $2$ and $9$ has even been used at least once to get $a_{n+1} $ from $a_n$ . Let $Sn$ the sum of the digits of $a_n$ , $n=0,1,2,...$ . Prove that $S_n \ge S_{n+1}$ for infinite values ​​of $n$.

Beter Pai wants to tell you his fastest $40$-line clear time in Tetris, but since he does not want Qep to realize she is better at Tetris than he is, he does not tell you the time directly. Instead, he gives you the following requirements, given that the correct time is t seconds: $\bullet$ $t < 100$. $\bullet$ $t$ is prime. $\bullet$ $t -1$ has 5 proper factors. $\bullet$ all prime factors of $t +1$ are single digits. $\bullet$ $t -2$ is a multiple of $3$. $\bullet$ $t +2$ has $2$ factors. Find t.

p1. Nurbaya's rectangular courtyard will be covered by a number of paving blocks in the form of a regular hexagon or its pieces like the picture below. The length of the side of the hexagon is $ 12$ cm. [img]https://cdn.artofproblemsolving.com/attachments/6/1/281345c8ee5b1e80167cc21ad39b825c1d8f7b.png[/img] Installation of other paving blocks or pieces thereof so that all fully covered page surface. To cover the entire surface The courtyard of the house required $603$ paving blocks. How many paving blocks must be cut into models $A, B, C$, and $D$ for the purposes of closing. If $17$ pieces of model $A$ paving blocks are needed, how many the length and width of Nurbaya's yard? Count how much how many pieces of each model $B, C$, and $D$ paving blocks are used. p2. Given the square $PQRS$. If one side lies on the line $y = 2x - 17$ and its two vertices lie on the parabola $y = x^2$, find the maximum area of possible squares $PQRS$ . p3. In the triangular pyramid $T.ABC$, the points $E, F, G$, and $H$ lie at , respectively $AB$, $AC$, $TC$, and $TB$ so that $EA : EB = FA : FC = HB : HT = GC : GT = 2:1$. Determine the ratio of the volumes of the two halves of the divided triangular pyramid by the plane $EFGH$. p4. We know that $x$ is a non-negative integer and $y$ is an integer. Define all pair $(x, y)$ that satisfy $1 + 2^x + 2^{2x + 1} = y^2$. p5. The coach of the Indonesian basketball national team will select the players for become a member of the core team. The coach will judge five players $A, B, C, D$ and $E$ in one simulation (or trial) match with total time $80$ minute match. At any time there is only one in five players that is playing. There is no limit to the number of substitutions during the match. Total playing time for each player $A, B$, and $C$ are multiples of $5$ minutes, while the total playing time of each players $D$ and $E$ are multiples of $7$ minutes. How many ways each player on the field based on total playing time?

A positive integer $N$ is [i]interoceanic[/i] if its prime factorization $$N=p_1^{x_1}p_2^{x_2}\cdots p_k^{x_k}$$ satisfies $$x_1+x_2+\dots +x_k=p_1+p_2+\cdots +p_k.$$ Find all interoceanic numbers less than 2020.

For a positive integer $n$, let $A_n$ be the set of all positive numbers greater than $1$ and less than $n$ which are coprime to $n$. Find all $n$ such that all the elements of $A_n$ are prime numbers.

Consider a sequence $\{a_i\}^\infty_{i\ge1}$ of positive integers. For all positvie integers $n$ prove that there exists infinitely many positive integers $k$ such that there is no pair $(m,t)$ of positive integers where $m>n$ and $$kn+a_n=tm(m+1)+a_m$$

Let $S$ be the set of all natural numbers with the property: the sum of the biggest three divisors of number $n$, different from $n$, is bigger than $n$. Determine the largest natural number $k$, which divides any number from $S$. (A natural number is a positive integer)

Five men and five women stand in a circle in random order. The probability that every man stands next to at least one woman is $\tfrac m n$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

Find the sum of all positive integers $x < 241$ such that both $x^{24} + x^{18} + x^{12} + x^6 + 1$ and $x^{20} + x^{10} + 1$ are multiples of $241$.