Prove that there exists an infinite sequence of positive integers $ a_1, a_2, ... $ such that for all positive integers $ i $, \\ i) $ a_{i + 1} $ is divisible by $ a_{i} $.\\ ii) $ a_i $ is not divisible by $ 3 $.\\ iii) $ a_i $ is divisible by $ 2^{i + 2} $ but not $ 2^{i + 3} $.\\ iv) $ 6a_i + 1 $ is a prime power.\\ v) $ a_i $ can be written as the sum of the two perfect squares.

Find all pairs of nonnegative integers $(x, p)$, where $p$ is prime, that verify $$x(x+1)(x+2)(x+3)=1679^{p-1}+1680^{p-1}+1681^{p-1}.$$

Pablo says: “I add $2$ to my birthday and multiply the result by $2$. I add to the number obtained $4$ and multiply the result by $5$. To the new number obtained I add the number of the month of my birthday (for example, if it's June, I add $6$) and I get $342$. " What is Pablo's birthday date? Give all the possibilities

Prove that all the positive integer numbers , except for the powers of $2$, can be written as the sum of (at least two) consecutive natural numbers .

Compute the number of ordered pairs of positive integers $(a, b)$ satisfying the equation $$gcd(a, b) \cdot a + b^2 = 10000.$$

Let $a_1, a_2, \ldots, a_{2024}$ be positive integers such that $a_{i+1}+1$ is a multiple of $a_i$ for all $i = 1, 2, \ldots , 2024$, with indices taken modulo $2024$. Find the maximum possible value of $a_1 + a_2 + \ldots + a_{2024}$. [i](Proposed by Ivan Chan Guan Yu)[/i]

The natural numbers are colored green or blue so that: $\bullet$ The sum of a green and a blue is blue; $\bullet$ The product of a green and a blue is green. How many ways are there to color the natural numbers with these rules, so that $462$ are blue and $2016$ are green?

Determine all integers $ k\ge 2$ such that for all pairs $ (m$, $ n)$ of different positive integers not greater than $ k$, the number $ n^{n\minus{}1}\minus{}m^{m\minus{}1}$ is not divisible by $ k$.

João calculated the product of the non zero digits of each integer from $1$ to $10^{2009}$ and then he summed these $10^{2009}$ products. Which number did he obtain?

Let $d$ be a natural number. Given two natural numbers $M$ and $N$ with $d$ digits, $M$ is a friend of $N$ if and only if the $d$ numbers obtained substituting each one of the digits of $M$ by the digit of $N$ which is on the same position are all multiples of $7$. Find all the values of $d$ for which the following condition is valid: For any two numbers $M$ and $N$ with $d$ digits, $M$ is a friend of $N$ if and only if $N$ is a friend of $M$.

Determine all integers $ n\geq 2$ having the following property: for any integers $a_1,a_2,\ldots, a_n$ whose sum is not divisible by $n$, there exists an index $1 \leq i \leq n$ such that none of the numbers $$a_i,a_i+a_{i+1},\ldots,a_i+a_{i+1}+\ldots+a_{i+n-1}$$ is divisible by $n$. Here, we let $a_i=a_{i-n}$ when $i >n$. [i]Proposed by Warut Suksompong, Thailand[/i]

Let $n,m$ be positive integers. Let $A_1,A_2,A_3, ... ,A_m$ be sets such that $A_i \subseteq \{1, 2, 3, . . . , n\}$ and $|A_i| = 3$ for all $i$ (i.e. $A_i$ consists of three different positive integers each at most $n$). Suppose for all $i < j$ we have $|A_i \cap A_j | \le 1$ (i.e. $A_i$ and $A_j$ have at most one element in common). (a) Prove that $m \le \frac{n(n-1)}{ 6}$ . (b) Show that for all $n \ge3$ it is possible to have $m \ge \frac{(n-1)(n-2)}{ 6}$ .

For some positive integer $n$, the number $110n^3$ has $110$ positive integer divisors, including $1$ and the number $110n^3$. How many positive integer divisors does the number $81n^4$ have? $\textbf{(A) }110 \qquad \textbf{(B) } 191 \qquad \textbf{(C) } 261 \qquad \textbf{(D) } 325 \qquad \textbf{(E) } 425$

Let $S$ be a finite set of positive integers which has the following property:if $x$ is a member of $S$,then so are all positive divisors of $x$. A non-empty subset $T$ of $S$ is [i]good[/i] if whenever $x,y\in T$ and $x<y$, the ratio $y/x$ is a power of a prime number. A non-empty subset $T$ of $S$ is [i]bad[/i] if whenever $x,y\in T$ and $x<y$, the ratio $y/x$ is not a power of a prime number. A set of an element is considered both [i]good[/i] and [i]bad[/i]. Let $k$ be the largest possible size of a [i]good[/i] subset of $S$. Prove that $k$ is also the smallest number of pairwise-disjoint [i]bad[/i] subsets whose union is $S$.

Let \( p \geq 7 \) be a prime number and \( m \in \mathbb{N} \). Prove that \[\left| p^m - (p - 2)! \right| > p^2.\] [i]Proposed by Miloš Milićev[/i]

For a positive integer $n$ we denote $D_2(n)$ to the number of divisors of $n$ which are perfect squares and $D_3(n)$ to the number of divisors of $n$ which are perfect cubes. Prove that there exists such that $D_2(n)=999D_3(n).$ Note. The perfect squares are $1^2,2^2,3^2,4^2,…$ , the perfect cubes are $1^3,2^3,3^3,4^3,…$ .

[u]Round 1[/u] [b]p1.[/b] A $\$100$ TV has its price increased by $10\%$. The new price is then decreased by $10\%$. What is the current price of the TV? [b]p2.[/b] If $9w + 8x + 7y = 42$ and $w + 2x + 3y = 8$, then what is the value of $100w + 101x + 102y$? [b]p3.[/b] Find the number of positive factors of $37^3 \cdot 41^3$. [u]Round 2[/u] [b]p4.[/b] Three hoses work together to fill up a pool, and each hose expels water at a constant rate. If it takes the first, second, and third hoses 4, 6, and 12 hours, respectively, to fill up the pool alone, then how long will it take to fill up the pool if all three hoses work together? [b]p5.[/b] A semicircle has radius $1$. A smaller semicircle is inscribed in the larger one such that the two bases are parallel and the arc of the smaller is tangent to the base of the larger. An even smaller semicircle is inscribed in the same manner inside the smaller of the two semicircles, and this procedure continues indefinitely. What is the sum of all of the areas of the semicircles? [b]p6.[/b] Given that $P(x)$ is a quadratic polynomial with $P(1) = 0$, $P(2) = 0$, and $P(0) = 2012$, find $P(-1)$. [u]Round 3[/u] [b]p7.[/b] Darwin has a paper circle. He labels one point on the circumference as $A$. He folds $A$ to every point on the circumference on the circle and undoes it. When he folds $A$ to any point $P$, he makes a blue mark on the point where $\overline{AP}$ and the made crease intersect. If the area of Darwin paper circle is 80, then what is the area of the region surrounded by blue? [b]p8.[/b] Α rectangular wheel of dimensions $6$ feet by $8$ feet rolls for $28$ feet without sliding. What is the total distance traveled by any corner on the rectangle during this roll? [b]p9[/b]. How many times in a $24$-hour period do the minute hand and hour hand of a $12$-hour clock form a right angle? [u]Round 4[/u] The answers in this section all depend on each other. Find smallest possible solution set. [b]p10.[/b] Let B be the answer to problem $11$. Right triangle $ACD$ has a right angle at $C$. Squares $ACEF$ and $ADGH$ are drawn such that points $D$ and $E$ do not coincide and points $E$ and $H$ do not coincide. The midpoints of the sides of $ADGH$ are connected to form a smaller square with area $B.$ If the area of $ACEF$ is also $B$, then find the length $CD$ rounded up to the nearest integer. [b]p11.[/b] Let $C$ be the answer to problem $12$. Find the sum of the digits of $C$. [b]p12.[/b] Let $A$ be the answer to problem $10$. Given that $a_0 = 1$, $a_1 = 2$, and that $a_n = 3a_{n-1 }-a_{n-2}$ for $n \ge 2$, find $a_A$. PS. You should use hide for answers.Rounds 5-8 are [url=https://artofproblemsolving.com/community/c3h3134466p28406321]here [/url] and 9-12 [url=https://artofproblemsolving.com/community/c3h3134489p28406583]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all positive integers $N$ having only prime divisors $2,5$ such that $N+25$ is a perfect square.

Real numbers $a$ and $b$ are chosen so that each of two quadratic trinomials $x^2+ax+b$ and $x^2+bx+a$ has two distinct real roots,and the product of these trinomials has exactly three distinct real roots.Determine all possible values of the sum of these three roots. [i](S.Berlov)[/i]

For $n$positive integers $ x_1,x2,...,x_n$, $a_n$ is their arithmetic and $g_n$ the geometric mean. Consider the statement $S_n$: If $a_n/g_n$ is a positive integer, then $x_1 = x_2 = ··· = x_n$. Prove $S_2$ and disprove $S_n$ for all even $n > 2$.

Find all pairs $(x, y)$ of natural numbers such that $$x + y = a^n, x^2 + y^2 = a^m$$ for some natural $a, n, m$.

Find the remainder when \[\sum_{k=1}^{2^{16}}\binom{2k}{k}(3\cdot 2^{14}+1)^k (k-1)^{2^{16}-1}\]is divided by $2^{16}+1$. ([i]Note:[/i] It is well-known that $2^{16}+1=65537$ is prime.) [i]Victor Wang.[/i]

Let $A$ be a set of positive integers satisfying the following properties: (i) if $m$ and $n$ belong to $A$, then $m+n$ belong to $A$; (ii) there is no prime number that divides all elements of $A$. (a) Suppose $n_1$ and $n_2$ are two integers belonging to $A$ such that $n_2-n_1 >1$. Show that you can find two integers $m_1$ and $m_2$ in $A$ such that $0< m_2-m_1 < n_2-n_1$ (b) Hence show that there are two consecutive integers belonging to $A$. (c) Let $n_0$ and $n_0+1$ be two consecutive integers belonging to $A$. Show that if $n\geq n_0^2$ then $n$ belongs to $A$.

Determine the last two digits of the product of the squares of all positive odd integers less than $2014$.

Determine all pairs $(a, b)$ of integers that satisfy both: 1. $5 \leq b < a$ 2. There exists a natural number $n$ such that the numbers $\frac{a}{b}$ and $a-b$ are consecutive divisors of $n$, in that order. [b]Note:[/b] Two positive integers $x, y$ are consecutive divisors of $m$, in that order, if there is no divisor $d$ of $m$ such that $x < d < y$.