The number $2024$ is written on a blackboard. Each second, if there exist positive integers $a,b,k$ such that $a^k+b^k$ is written on the blackboard, you may write $a^{k'}+b^{k'}$ on the blackboard for any positive integer $k'.$ Find all positive integers that you can eventually write on the blackboard. [i]Srinivas Arun[/i]

We have a set $M$ of real numbers with $|M|>1$ such that for any $x\in M$ we have either $3x-2\in M$ or $-4x+5\in M$. Show that $M$ is infinite.

Determine all the possible non-negative integer values that are able to satisfy the expression: $\frac{(m^2+mn+n^2)}{(mn-1)}$ if $m$ and $n$ are non-negative integers such that $mn \neq 1$.

Show that there is no function \(f:\mathbb{N}^* \rightarrow \mathbb{N}^*\) such that \(f^n(n)=n+1\) for all \(n\) (when \(f^n\) is the \(n\)th iteration of \(f\))

Suppose that \[ \prod_{n=1}^{\infty}\left(\frac{1+i\cot\left(\frac{n\pi}{2n+1}\right)}{1-i\cot\left(\frac{n\pi}{2n+1}\right)}\right)^{\frac{1}{n}} = \left(\frac{p}{q}\right)^{i \pi}, \] where $p$ and $q$ are relatively prime positive integers. Find $p+q$. [i]Note: for a complex number $z = re^{i \theta}$ for reals $r > 0, 0 \le \theta < 2\pi$, we define $z^{n} = r^{n} e^{i \theta n}$ for all positive reals $n$.[/i]

The velocities of a submerged and surfaced submarine are, respectively, $v$ and $kv$. It is situated at a point $P$ at $30$ miles from the center $O$ of a circle of $60$ mile radius. The surveillance of an enemy squadron forces him to navigate submerged while inside the circle. Discuss, according to the values of $k$, the fastest path to move to the opposite end of the diameter that passes through $P$ . (Consider the case particular $k =\sqrt5$.)

$(MON 3)$ Let $A_k (1 \le k \le h)$ be $n-$element sets such that each two of them have a nonempty intersection. Let $A$ be the union of all the sets $A_k,$ and let $B$ be a subset of $A$ such that for each $k (1\le k \le h)$ the intersection of $A_k$ and $B$ consists of exactly two different elements $a_k$ and $b_k$. Find all subsets $X$ of the set $A$ with $r$ elements satisfying the condition that for at least one index $k,$ both elements $a_k$ and $b_k$ belong to $X$.

For positive numbers $a, b, c$ define $A = \frac{(a + b + c)}{3}$, $G = \sqrt[3]{abc}$, $H = \frac{3}{(a^{-1} + b^{-1} + c^{-1})}.$ Prove that \[ \left( \frac AG \right)^3 \geq \frac 14 + \frac 34 \cdot \frac AH.\]

Let $a,b,c$ be real numbers. Consider the quadratic equation in $\cos{x}$ \[ a \cos^2{x}+b \cos{x}+c=0. \] Using the numbers $a,b,c$ form a quadratic equation in $\cos{2x}$ whose roots are the same as those of the original equation. Compare the equation in $\cos{x}$ and $\cos{2x}$ for $a=4$, $b=2$, $c=-1$.

You start with a number. Every second, you can add or subtract any number of the form $n!$ to your current number to get a new number. In how many ways can you get from $0$ to $100$ in $4$ seconds? ($n!$ is dened as $n\times (n -1)\times(n - 2) ... 2\times1$, so $1! = 1$, $2! = 2$, $3! = 6$, $4! = 24$, etc.)

a) We have a geometric sequence of $3$ terms. If the sum of these terms is $26$ , and their sum of squares is $364$ , find the terms of the sequence. b) Suppose that $a,b,c,u,v,w$ are positive real numbers , and each of $a,b,c$ and $u,v,w$ are geometric sequences. Suppose also that $a+u,b+v,c+w$ are an arithmetic sequence. Prove that $a=b=c$ and $u=v=w$ c) Let $a,b,c,d$ be real numbers (not all zero), and let $f(x,y,z)$ be the polynomial in three variables defined by$$f(x,y,z) = axyz + b(xy + yz + zx) + c(x+y+z) + d$$.Prove that $f(x,y,z)$ is reducible if and only if $a,b,c,d$ is a geometric sequence.

Find all functions $ f: \mathbb{R} \rightarrow \mathbb{R}$ satisfying \[ f(f(x \plus{} y)) \equal{} f(x \plus{} y) \plus{} f(x)f(y) \minus{} xy\] for all real numbers $x$ and $y$.

Sides of a triangle form an arithmetic sequence with common difference $2$, and its area is $6 \text{ cm }^2$. Find its sides.

Let $ X$ be the set of all positive integers greater than or equal to $ 8$ and let $ f: X\rightarrow X$ be a function such that $ f(x\plus{}y)\equal{}f(xy)$ for all $ x\ge 4, y\ge 4 .$ if $ f(8)\equal{}9$, determine $ f(9) .$

Let ${a_1,a_2,\dots,a_n}$ be positive real numbers, ${n>1}$. Denote by $g_n$ their geometric mean, and by $A_1,A_2,\dots,A_n$ the sequence of arithmetic means defined by \[ A_k=\frac{a_1+a_2+\cdots+a_k}{k},\qquad k=1,2,\dots,n. \] Let $G_n$ be the geometric mean of $A_1,A_2,\dots,A_n$. Prove the inequality \[ n \root n\of{\frac{G_n}{A_n}}+ \frac{g_n}{G_n}\le n+1 \] and establish the cases of equality. [i]Proposed by Finbarr Holland, Ireland[/i]

In a Martian civilization, all logarithms whose bases are not specified are assumed to be base $b$, for some fixed $b \geq 2$. A Martian student writes down \begin{align*}3 \log(\sqrt{x}\log x) &= 56\\\log_{\log (x)}(x) &= 54 \end{align*} and finds that this system of equations has a single real number solution $x > 1$. Find $b$.

Let $f$ be a function defined on the positive integers, taking positive integral values, such that $f(a)f(b) = f(ab)$ for all positive integers $a$ and $b$, $f(a) < f(b)$ if $a < b$, $f(3) \geq 7$. Find the smallest possible value of $f(3)$.

Find the roots of $6x^4+17x^3+7x^2-8x-4$

Given $n > 2$ nonnegative distinct integers $a_1,...,a_n$, find all nonnegative integers $y$ and $x_1,...,x_n$ satisfying $gcd(x_1,...,x_n) = 1$ and $$\begin{cases} a_1x_1 + a_2x_2 +...+ a_nx_n = yx_1 \\ a_2x_1 + a_3x_2 +...+ a_1x_n = yx_2 \\ ... \\ a_nx_1 + a_1x_2 +...+ a_{n-1}x_n = yx_n \end{cases}$$

For real positive numbers $a, b, c$, the equality $abc = 1$ holds. Prove that $$\frac{a^{2014}}{1 + 2 bc}+\frac{b^{2014}}{1 + 2ac}+\frac{c^{2014}}{1 + 2ab} \ge \frac{3}{ab+bc+ca}.$$

Let $f(x)$ be a polynomial with rational coefficients, and let $\alpha$ be a real number. If \[\alpha^3-2019\alpha=(f(\alpha))^3-2019f(\alpha)=2021,\] prove that $(f^n(\alpha))^3-2019f^n(\alpha)=2021$ for any positive integer $n$. (Here, we define $f^n(x)=\underbrace{f(f(f\cdots f}_{n\text{ times}}(x)\cdots ))$.)

[b]p1.[/b] If $a \diamond b = ab - a + b$, find $(3 \diamond 4) \diamond 5$ [b]p2.[/b] If $5$ chickens lay $5$ eggs in $5$ days, how many chickens are needed to lay $10$ eggs in $10$ days? [b]p3.[/b] As Alissa left her house to go to work one hour away, she noticed that her odometer read $16261$ miles. This number is a "special" number for Alissa because it is a palindrome and it contains exactly $1$ prime digit. When she got home that evening, it had changed to the next greatest "special" number. What was Alissa's average speed, in miles per hour, during her two hour trip? [b]p4.[/b] How many $1$ in by $3$ in by $8$ in blocks can be placed in a $4$ in by $4$ in by $9$ in box? [b]p5.[/b] Apple loves eating bananas, but she prefers unripe ones. There are $12$ bananas in each bunch sold. Given any bunch, if there is a $\frac13$ probability that there are $4$ ripe bananas, a $\frac16$ probability that there are $6$ ripe bananas, and a $\frac12$ probability that there are $10$ ripe bananas, what is the expected number of unripe bananas in $12$ bunches of bananas? [b]p6.[/b] The sum of the digits of a $3$-digit number $n$ is equal to the same number without the hundreds digit. What is the tens digit of $n$? [b]p7.[/b] How many ordered pairs of positive integers $(a, b)$ satisfy $a \le 20$, $b \le 20$, $ab > 15$? [b]p8.[/b] Let $z(n)$ represent the number of trailing zeroes of $n!$. What is $z(z(6!))?$ (Note: $n! = n\cdot (n-1) \cdot\cdot\cdot 2 \cdot 1$) [b]p9.[/b] On the Cartesian plane, points $A = (-1, 3)$, $B = (1, 8)$, and $C = (0, 10)$ are marked. $\vartriangle ABC$ is reflected over the line $y = 2x + 3$ to obtain $\vartriangle A'B'C'$. The sum of the $x$-coordinates of the vertices of $\vartriangle A'B'C'$ can be expressed as $\frac{a}{b}$ for relatively prime positive integers $a$, $b$. Compute $a + b$. [b]p10.[/b] How many ways can Bill pick three distinct points from the figure so that the points form a non-degenerate triangle? [img]https://cdn.artofproblemsolving.com/attachments/6/a/8b06f70d474a071b75556823f70a2535317944.png[/img] [b]p11.[/b] Say piece $A$ is attacking piece $B$ if the piece $B$ is on a square that piece $A$ can move to. How many ways are there to place a king and a rook on an $8\times 8$ chessboard such that the rook isn't attacking the king, and the king isn't attacking the rook? Consider rotations of the board to be indistinguishable. (Note: rooks move horizontally or vertically by any number of squares, while kings move $1$ square adjacent horizontally, vertically, or diagonally). [b]p12.[/b] Let the remainder when $P(x) = x^{2020} - x^{2017} - 1$ is divided by $S(x) = x^3 - 7$ be the polynomial $R(x) = ax^2 + bx + c$ for integers $a$, $b$, $c$. Find the remainder when $R(1)$ is divided by $1000$. [b]p13.[/b] Let $S(x) = \left \lfloor \frac{2020}{x} \right\rfloor + \left \lfloor \frac{2020}{x + 1} \right\rfloor$. Find the number of distinct values $S(x)$ achieves for integers $x$ in the interval $[1, 2020]$. [b]p14.[/b] Triangle $\vartriangle ABC$ is inscribed in a circle with center $O$ and has sides $AB = 24$, $BC = 25$, $CA = 26$. Let $M$ be the midpoint of $\overline{AB}$. Points $K$ and $L$ are chosen on sides $\overline{BC}$ and $\overline{CA}$, respectively such that $BK < KC$ and $CL < LA$. Given that $OM = OL = OK$, the area of triangle $\vartriangle MLK$ can be expressed as $\frac{a\sqrt{b}}{c}$ where $a, b, c$ are positive integers, $gcd(a, c) = 1$ and $b$ is not divisible by the square of any prime. Find $a + b + c$. [b]p15.[/b] Euler's totient function, $\phi (n)$, is defined as the number of positive integers less than $n$ that are relatively prime to $n$. Let $S(n)$ be the set of composite divisors of $n$. Evaluate $$\sum^{50}_{k=1}\left( k - \sum_{d\in S(k)} \phi (d) \right)$$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

If $x$, $y$, $z$ are real numbers satisfying \begin{align*} (x + 1)(y + 1)(z + 1) & = 3 \\ (x + 2)(y + 2)(z + 2) & = -2 \\ (x + 3)(y + 3)(z + 3) & = -1, \end{align*} find the value of $$ (x + 20)(y + 20)(z + 20). $$

Let $ p$ be a prime number and $ f$ an integer polynomial of degree $ d$ such that $ f(0) = 0,f(1) = 1$ and $ f(n)$ is congruent to $ 0$ or $ 1$ modulo $ p$ for every integer $ n$. Prove that $ d\geq p - 1$.

Eve and Martti have a whole number of euros. Martti said to Eve: ''If you give give me three euros, so I have $n$ times the money compared to you. '' Eve in turn said to Martti: ''If you give me $n$ euros then I have triple the amount of money compared to you'' . Suppose, that both claims are valid. What values can a positive integer $n$ get?