Find all non-negative integer solutions of the equation \[ 2^x\plus{}2009\equal{}3^y5^z.\]

The Fibonacci numbers are defined by $ F_0 \equal{} 1, F_1 \equal{} 1, F_{n\plus{}2} \equal{} F_{n\plus{}1} \plus{} F_n$. The positive integers $ A, B$ are such that $ A^{19}$ divides $ B^{93}$ and $ B^{19}$ divides $ A^{93}$. Show that if $ h < k$ are consecutive Fibonacci numbers then $ (AB)^h$ divides $ (A^4 \plus{} B^8)^k$

Let $p$ be a prime number. Find all triples $(a, b, c)$ of integers (not necessarily positive) such that $a^bb^cc^a = p$.

Prove that there are infinitely natural numbers $n$ such that $n$ can't be written as a sum of two positive integers with prime factors less than $1394$.

[u]Round 1[/u] [b]p1.[/b] What is the remainder when $2021$ is divided by $102$? [b]p2.[/b] Brian has $2$ left shoes and $2$ right shoes. Given that he randomly picks $2$ of the $4$ shoes, the probability he will get a left shoe and a right shoe is $\frac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. Compute $p + q$. [b]p3.[/b] In how many ways can $59$ be written as a sum of two perfect squares? (The order of the two perfect squares does not matter.) [u]Round 2 [/u] [b]p4.[/b] Two positive integers have a sum of $60$. Their least common multiple is $273$. What is the positive diffeerence between the two numbers? [b]p5.[/b] How many ways are there to distribute $13$ identical apples among $4$ identical boxes so that no two boxes receive the same number of apples? A box may receive zero apples. [b]p6.[/b] In square $ABCD$ with side length $5$, $P$ lies on segment $AB$ so that $AP = 3$ and $Q$ lies on segment $AD$ so that $AQ = 4$. Given that the area of triangle $CPQ$ is $x$, compute $2x$. [u]Round 3 [/u] [b]p7.[/b] Find the number of ordered triples $(a, b, c)$ of nonnegative integers such that $2a+3b+5c = 15$. [b]p8.[/b] What is the greatest integer $n \le 15$ such that $n + 1$ and $n^2 + 3$ are both prime? [b]p9.[/b] For positive integers $a, b$, and $c$, suppose that $gcd \,\,(a, b) = 21$, $gcd \,\,(a, c) = 10$, and $gcd \,\,(b,c) = 11$. Find $\frac{abc}{lcm \,\,(a,b,c)}$ . (Note: $gcd$ is the greatest common divisor function and $lcm$ is the least common multiple function.) [u]Round 4[/u] [b]p10.[/b] The vertices of a square in the coordinate plane are at $(0, 0)$, $(0, 6)$, $(6, 0)$, and $(6, 6)$. Line $\ell$ intersects the square at exactly two lattice points (that is, points with integer coordinates). How many such lines $\ell$ are there that divide the square into two regions, one of them having an area of $12$? [b]p11.[/b] Let $f(n)$ be defined as follows for positive integers $n$: $f(1) = 0$, $f(n) = 1$ if $n$ is prime, and $f(n) = f(n - 1) + 1$ otherwise. What is the maximum value of $f(n)$ for $n \le 120$? [b]p12.[/b] The graph of the equation $y = x^3 + ax^2 + bx + c$ passes through the points $(2,4)$, $(3, 9)$, and $(4, 16)$. What is $b$? PS. You should use hide for answers. Rounds 5- 8 have been posted [url=https://artofproblemsolving.com/community/c3h2949415p26408227]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $N$ be a positive integer such that the sum of the squares of all positive divisors of $N$ is equal to the product $N(N+3)$. Prove that there exist two indices $i$ and $j$ such that $N=F_iF_j$ where $(F_i)_{n=1}^{\infty}$ is the Fibonacci sequence defined as $F_1=F_2=1$ and $F_n=F_{n-1}+F_{n-2}$ for $n\geq 3$. [i]Proposed by Alain Rossier, Switzerland[/i]

Find all integers $k \ge 5$ for which there is a positive integer $n$ with exactly $k$ positive divisors $1 = d_1 <d_2 < ... <d_k = n$ and $d_2d_3 + d_3d_5 + d_5d_2 = n$.

Find all positive integers $n$ such that there exists a prime number $p$, such that $p^n-(p-1)^n$ is a power of $3$. Note. A power of $3$ is a number of the form $3^a$ where $a$ is a positive integer.

Find all integers $ n\ge 2$ with the following property: There exists three distinct primes $p,q,r$ such that whenever $ a_1,a_2,a_3,\cdots,a_n$ are $ n$ distinct positive integers with the property that at least one of $ p,q,r$ divides $ a_j - a_k \ \forall 1\le j\le k\le n$, one of $ p,q,r$ divides all of these differences.

A schoolgirl forgot to write a multiplication sign between two $3$-digit numbers and wrote them as one number. This $6$-digit result proved to be $3$ times greater than the product (obtained by multiplication). Find these numbers. (A Kovaldzhi,

Show that for all positive integers $n\geq 2$ the last digit of the number $2^{2^n}+1$ is $7$ .

See all the problems from 5-th Kyiv math festival [url=http://www.mathlinks.ro/Forum/viewtopic.php?p=506789#p506789]here[/url] Let $a, b, c, d$ be positive integers and $p$ be prime number such that $a^2+b^2=p$ and $c^2+d^2$ is divisible by $p.$ Prove that there exist positive integers $e$ and $f$ such that $e^2+f^2=\frac{c^2+d^2}{p}.$

Let $a$ be a positive real number. Prove that a) There exists $n\in \mathbb{N}$ with $\frac{\sigma(\varphi(n))}{\varphi(\sigma(n))} > a$. b) There exists $n\in \mathbb{N}$ with $\frac{\sigma(\varphi(n))}{\varphi(\sigma(n))} < a$. (As usual, $\sigma(n) = \sum_{d\mid n} d$ and $\varphi(n)$ is the number of integers $1\le m\le n$ which are coprime with $n$.) Proposed by [i]Deniz Can Karaçelebi[/i]

Find all positive integers $k$ that can be expressed as the sum of $50$ fractions such that the numerators are the $50$ natural numbers from $1$ to $50$ and the denominators are positive integers, that is, $k = \dfrac{1}{a_1} + \dfrac{2}{a_2} + \ldots + \dfrac{50}{a_{50}}$ with a$_1 , a_2 , \ldots , a_n$ positive integers.

On semicircle, with diameter $|AB|=d$, are given points $C$ and $D$ such that: $|BC|=|CD|=a$ and $|DA|=b$ where $a, b, d$ are different positive integers. Find minimum possible value of $d$

Let $p>5$ be a prime. Suppose that there exist integer $k$ such that $ k^2 + 5 $ is divisible by $p$. Prove that there exist two positive integers $m,n$ satisfying $ p^2 = m^2 + 5n^2 $.

Let $f : Z_{>0} \to Z_{>0}$ be a function which satisfies $k|f^k(x)-x$ for all $k, x \in Z_{>0}$ and $f(x)-x \le 2023$. If $f(1) = 2000$, what can $f$ be? [i]Remark[/i]: Here, $f^k (x)$ denotes the $k$-fold application of $f$ to $x$.

Let $1000 \leq n = \text{ABCD}_{10} \leq 9999$ be a positive integer whose digits $\text{ABCD}$ satisfy the divisibility condition: $$1111 | (\text{ABCD} + \text{AB} \times \text{CD}).$$ Determine the smallest possible value of $n$.

Let $n\ge 2$ be an integer. Determine the number of positive integers $m$ such that $m\le n$ and $m^2+1$ is divisible by $n$.

Find how many are the numbers of $2013$ digits $d_1d_2…d_{2013}$ with odd digits $d_1,d_2,…,d_{2013}$ such that the sum of $1809$ terms $$d_1 \cdot d_2+d_2\cdot d_3+…+d_{1809}\cdot d_{1810}$$ has remainder $1$ when divided by $4$ and the sum of $203$ terms $$d_{1810}\cdot d_{1811}+d_{1811}\cdot d_{1812}+…+d_{2012}\cdot d_{2013}$$ has remainder $1$ when dividing by $4$.

Find all integers of the form $\frac{m-6n}{m+2n}$ where $m,n$ are nonzero rational numbers satisfying $m^3=(27n^2+1)(m+2n)$.

Let $m$ be the least positive integer divisible by $17$ whose digits sum to $17$. Find $m$.

Let $x$ and $y$ be integers with $x + y \ne 0$. Find all pairs $(x, y)$ such that $$\frac{x^2 + y^2}{x + y}= 10.$$ (Walther Janous)

Determine the maximum value of $m^2+n^2$, where $m$ and $n$ are integers in the range $1,2,\ldots,1981$ satisfying $(n^2-mn-m^2)^2=1$.

Let $a_1=1$, $a_2=2^{a_1}$, $a_3=3^{a_2}$, $a_4=4^{a_3}$, $\dots$, $a_9 = 9^{a_8}$. Find the last two digits of $a_9$.