Find all pairs of positive integers $(m,n)$ such that $\frac{m^5+n}{m^2+n^2}$ and $\frac{m+n^5}{m^2+n^2}$ are integers.

Find all natural numbers $n$ such that the equation $x^2 + y^2 + z^2 = nxyz$ has solutions in positive integers

For every positive integer $n$ write all its divisors in increasing order: $1=d_1<d_2<\ldots<d_k=n$. Find all $n$ such that $2025 \cdot n=d_{20} \cdot d_{25}$. [i]I. Voronovich[/i]

Solve the equation: $$ \frac{xy}{z}+\frac{yz}{x}+\frac{zx}{y}=3$$ where $x$, $y$ and $z$ are integers

The numbers $p$ and $q$ are prime and satisfy \[\frac{p}{{p + 1}} + \frac{{q + 1}}{q} = \frac{{2n}}{{n + 2}}\] for some positive integer $n$. Find all possible values of $q-p$. [i]Luxembourg (Pierre Haas)[/i]

Written on a blackboard are $n$ nonnegative integers whose greatest common divisor is $1$. A [i]move[/i] consists of erasing two numbers $x$ and $y$, where $x\ge y$, on the blackboard and replacing them with the numbers $x-y$ and $2y$. Determine for which original $n$-tuples of numbers on the blackboard is it possible to reach a point, after some number of moves, where $n-1$ of the numbers of the blackboard are zeroes.

Call a lattice point [i]visible[/i] if the line segment connecting the point and the origin does not pass through another lattice point. Given a positive integer $k$, denote by $S_k$ the set of all visible lattice points $(x, y)$ such that $x^2 + y^2 = k^2$. Let $D$ denote the set of all positive divisors of $2021 \cdot 2025$. Compute the sum \[ \sum_{d \in D} |S_d| \] Here, a lattice point is a point $(x, y)$ on the plane where both $x$ and $y$ are integers, and $|A|$ denotes the number of elements of the set $A$.

Find all pairs of natural numbers n and prime numbers p such that $\sqrt{n+\frac{p}{n}}$ is a natural number.

Call a scalene triangle K [i]disguisable[/i] if there exists a triangle K′ similar to K with two shorter sides precisely as long as the two longer sides of K, respectively. Call a disguisable triangle [i]integral[/i] if the lengths of all its sides are integers. (a) Find the side lengths of the integral disguisable triangle with the smallest possible perimeter. (b) Let K be an arbitrary integral disguisable triangle for which no smaller integral disguisable triangle similar to it exists. Prove that at least two side lengths of K are perfect squares.

A sequence $a_0,a_1,a_2,\ldots ,a_n,\ldots$ of positive integers is constructed as follows: [list][*]if the last digit of $a_n$ is less than or equal to $5$ then this digit is deleted and $a_{n+1}$ is the number consisting of the remaining digits. (If $a_{n+1}$ contains no digits the process stops.) [*]otherwise $a_{n+1}=9a_n$.[/list] Can one choose $a_0$ so that an infinite sequence is obtained?

Let $a_1,\ldots ,a_{10}$ be distinct positive integers, all at least $3$ and with sum $678$. Does there exist a positive integer $n$ such that the sum of the $20$ remainders of $n$ after division by $a_1,a_2,\ldots ,a_{10},2a_1,2a_2,\ldots ,2a_{10}$ is $2012$?

Consider a directed graph $G$ with $n$ vertices, where $1$-cycles and $2$-cycles are permitted. For any set $S$ of vertices, let $N^{+}(S)$ denote the out-neighborhood of $S$ (i.e. set of successors of $S$), and define $(N^{+})^k(S)=N^{+}((N^{+})^{k-1}(S))$ for $k\ge2$. For fixed $n$, let $f(n)$ denote the maximum possible number of distinct sets of vertices in $\{(N^{+})^k(X)\}_{k=1}^{\infty}$, where $X$ is some subset of $V(G)$. Show that there exists $n>2012$ such that $f(n)<1.0001^n$. [i]Linus Hamilton.[/i]

[b]p1.[/b] There is a string of numbers $1234567891023...910134 ...91012...$ that concatenates the numbers $1$, $2$, $3$, $4$, $5$, $6$, $7$, $8$, $9$, $10$, then $2$, $3$, $4$, $5$, $6$, $7$, $8$, $9$, $10$, $1$, then $3$, $4$, $5$, $6$, $7$, $8$, $9$, $10$, $1$, $2$, and so on. After $10$, $1$, $2$, $3$, $4$, $5$, $6$, $7$, $8$, $9$, the string will be concatenated with $1$, $2$, $3$, $4$, $5$, $6$, $7$, $8$, $9$, $10$ again. What is the $2021$st digit? [b]p2.[/b] Bob really likes eating rice. Bob starts eating at the rate of $1$ bowl of rice per minute. Every minute, the number of bowls of rice Bob eats per minute increases by $1$. Given there are $78$ bowls of rice, find number of minutes Bob needs to finish all the rice. [b]p3.[/b] Suppose John has $4$ fair coins, one red, one blue, one yellow, one green. If John flips all $4$ coins at once, the probability he will land exactly $3$ heads and land heads on both the blue and red coins can be expressed as $\frac{a}{b}$ for relatively prime positive integers $a$, $b$, Find $a + b$. [b]p4.[/b] Three of the sides of an isosceles trapezoid have lengths $1$, $10$, $20$ Find the sum of all possible values of the fourth side. [b]p5.[/b] An number two-three-delightful if and only if it can be expressed as the product of $2$ consecutive integers larger than $1$ and as the product of $3$ consecutive integers larger than $1$. What is the smallest two-three-delightful number? [b]p6.[/b] There are $3$ students total in Justin's online chemistry class. On a $100$ point test, Justin's two classmates scored $4$ and $7$ points. The teacher notices that the class median score is equal to $gcd(x, 42)$, where the positive integer $x$ is Justin's score. Find the sum of all possible values of Justin's score. [b]p7.[/b] Eddie's gym class of $10$ students decides to play ping pong. However, there are only $4$ tables and only $2$ people can play at a table. If $8$ students are randomly selected to play and randomly assigned a partner to play against at a table, the probability that Eddie plays against Allen is $\frac{a}{b}$ for relatively prime positive integers $a$, $b$, Find $a + b$. [b]p8.[/b] Let $S$ be the set of integers $k$ consisting of nonzero digits, such that $300 < k < 400$ and $k - 300$ is not divisible by $11$. For each $k$ in $S$, let $A(k)$ denote the set of integers in $S$ not equal to $k$ that can be formed by permuting the digits of $k$. Find the number of integers $k$ in $S$ such that $k$ is relatively prime to all elements of $A(k)$. [b]p9.[/b] In $\vartriangle ABC$, $AB = 6$ and $BC = 5$. Point $D$ is on side $AC$ such that $BD$ bisects angle $\angle ABC$. Let $E$ be the foot of the altitude from $D$ to $AB$. Given $BE = 4$, find $AC^2$. [b]p10.[/b] For each integer $1 \le n \le 10$, Abe writes the number $2^n + 1$ on a blackboard. Each minute, he takes two numbers $a$ and $b$, erases them, and writes $\frac{ab-1}{a+b-2}$ instead. After $9$ minutes, there is one number $C$ left on the board. The minimum possible value of $C$ can be expressed as $\frac{p}{q}$ for relatively prime positive integers $p, q$. Find $p + q$. [b]p11.[/b] Estimation (Tiebreaker) Let $A$ and $B$ be the proportions of contestants that correctly answered Questions $9$ and $10$ of this round, respectively. Estimate $\left \lfloor \dfrac{1}{(AB)^2} \right \rfloor$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $ (a_{n})_{n\ge 1}$ be a sequence of positive integers satisfying $ (a_{m},a_{n}) = a_{(m,n)}$ (for all $ m,n\in N^ +$). Prove that for any $ n\in N^ + ,\prod_{d|n}{a_{d}^{\mu (\frac {n}{d})}}$ is an integer. where $ d|n$ denotes $ d$ take all positive divisors of $ n.$ Function $ \mu (n)$ is defined as follows: if $ n$ can be divided by square of certain prime number, then $ \mu (1) = 1;\mu (n) = 0$; if $ n$ can be expressed as product of $ k$ different prime numbers, then $ \mu (n) = ( - 1)^k.$

Find all natural integers $n$ such that $(n^3 + 39n - 2)n! + 17\cdot 21^n + 5$ is a square.

There are exactly $77,000$ ordered quadruples $(a,b,c,d)$ such that $\gcd(a,b,c,d)=77$ and $\operatorname{lcm}(a,b,c,d)=n$. What is the smallest possible value of $n$? $\textbf{(A)}\ 13,860 \qquad \textbf{(B)}\ 20,790 \qquad \textbf{(C)}\ 21,560 \qquad \textbf{(D)}\ 27,720 \qquad \textbf{(E)}\ 41,580$

Find all positive integers $n$ with the following property: the $k$ positive divisors of $n$ have a permutation $(d_1,d_2,\ldots,d_k)$ such that for $i=1,2,\ldots,k$, the number $d_1+d_2+\cdots+d_i$ is a perfect square.

Let $Q$ be a set of prime numbers, not necessarily finite. For a positive integer $n$ consider its prime factorization: define $p(n)$ to be the sum of all the exponents and $q(n)$ to be the sum of the exponents corresponding only to primes in $Q$. A positive integer $n$ is called [i]special[/i] if $p(n)+p(n+1)$ and $q(n)+q(n+1)$ are both even integers. Prove that there is a constant $c>0$ independent of the set $Q$ such that for any positive integer $N>100$, the number of special integers in $[1,N]$ is at least $cN$. (For example, if $Q=\{3,7\}$, then $p(42)=3$, $q(42)=2$, $p(63)=3$, $q(63)=3$, $p(2022)=3$, $q(2022)=1$.)

Let $p \equiv 3 \,(\textrm{mod}\, 4)$ be a prime and $\theta$ some angle such that $\tan(\theta)$ is rational. Prove that $\tan((p+1)\theta)$ is a rational number with numerator divisible by $p$, that is, $\tan((p+1)\theta) = \frac{u}{v}$ with $u, v \in \mathbb{Z}, v >0, \textrm{mdc}(u, v) = 1$ and $u \equiv 0 \,(\textrm{mod}\,p) $.

Find some natural number $a$ such that $2a$ is a perfect square, $3a$ is a perfect cube, $5a$ is the fifth power of some natural number.

[i]20 problems for 25 minutes.[/i] [b]p1.[/b] Compute $\frac{2024}{2 + 0 \times 2 - 4}.$ [b]p2.[/b] Find the smallest integer that can be written as the product of three distinct positive odd integers. [b]p3.[/b] Bryan’s physics test score is a two-digit number. When Bryan reverses its digits and adds the tens digit of his test score, he once again obtains his test score. Determine Bryan’s physics test score. [b]p4.[/b] Grant took four classes today. He spent $70$ minutes in math class. Had his math class been $40$ minutes instead, he would have spent $15\%$ less total time in class today. Find how many minutes he spent in his other classes combined. [b]p5.[/b] Albert’s favorite number is a nonnegative integer. The square of Albert’s favorite number has $9$ digits. Find the number of digits in Albert’s favorite number. [b]p6.[/b] Two semicircular arcs are drawn in a rectangle, splitting it into four regions as shown below. Given the areas of two of the regions, find the area of the entire rectangle. [img]https://cdn.artofproblemsolving.com/attachments/1/a/22109b346c7bdadeaf901d62155de4c506b33c.png[/img] [b]p7.[/b] Daria is buying a tomato and a banana. She has a $20\%$-off coupon which she may use on one of the two items. If she uses it on the tomato, she will spend $\$1.21$ total, and if she uses it on the banana, she will spend $\$1.31$ total. In cents, find the absolute difference between the price of a tomato and the price of a banana. [b]p8.[/b] Celine takes an $8\times 8$ checkerboard of alternating black and white unit squares and cuts it along a line, creating two rectangles with integer side lengths, each of which contains at least $9$ black squares. Find the number of ways Celine can do this. (Rotations and reflections of the cut are considered distinct.) [b]p9.[/b] Each of the nine panes of glass in the circular window shown below has an area of $\pi$, eight of which are congruent. Find the perimeter of one of the non-circular panes. [img]https://cdn.artofproblemsolving.com/attachments/b/c/0d3644dde33b68f186ba1ff0602e08ce7996f5.png[/img] [b]p10.[/b] In Alan’s favorite book, pages are numbered with consecutive integers starting with $1$. The average of the page numbers in Chapter Five is $95$ and the average of the page numbers in Chapter Six is $114$. Find the number of pages in Chapters Five and Six combined. [b]p11.[/b] Find the number of ordered pairs $(a, b)$ of positive integers such that $a + b = 2024$ and $$\frac{a}{b}>\frac{1000}{1025}.$$ [b]p12.[/b] A square is split into three smaller rectangles $A$, $B$, and $C$. The area of $A$ is $80$, $B$ is a square, and the area of $C$ is $30$. Compute the area of $B$. [img]https://cdn.artofproblemsolving.com/attachments/d/5/43109b964eacaddefd410ddb8bf4e4354a068b.png[/img] [b]p13.[/b] A knight on a chessboard moves two spaces horizontally and one space vertically, or two spaces vertically and one space horizontally. Two knights attack each other if each knight can move onto the other knight’s square. Find the number of ways to place a white knight and a black knight on an $8 \times 8$ chessboard so that the two knights attack each other. One such possible configuration is shown below. [img]https://cdn.artofproblemsolving.com/attachments/2/2/b4a83fbbab7e54dda81ac5805728d268b6db9f.png[/img] [b]p14.[/b] Find the sum of all positive integers $N$ for which the median of the positive divisors of $N$ is $9$. [b]p15.[/b] Let $x$, $y$, and $z$ be nonzero real numbers such that $$\begin{cases} 20x + 24y = yz \\ 20y + 24x = xz \end{cases}$$ Find the sum of all possible values of $z$. [b]p16.[/b] Ava glues together $9$ standard six-sided dice in a $3 \times 3$ grid so that any two touching faces have the same number of dots. Find the number of dots visible on the surface of the resulting shape. (On a standard six-sided die, opposite faces sum to $7$.) [img]https://cdn.artofproblemsolving.com/attachments/5/5/bc71dac9b8ae52a4456154000afde2c89fd83a.png[/img] [b]p17.[/b] Harini has a regular octahedron of volume $1$. She cuts off its $6$ vertices, turning the triangular faces into regular hexagons. Find the volume of the resulting solid. [b]p18.[/b] Each second, Oron types either $O$ or $P$ with equal probability, forming a growing sequence of letters. Find the probability he types out $POP$ before $OOP$. [b]p19.[/b] For an integer $n \ge 10$, define $f(n)$ to be the number formed after removing the first digit from $n$ (and removing any leading zeros) and define $g(n)$ to be the number formed after removing the last digit from $n$. Find the sum of the solutions to the equation $f(n) + g(n) = 2024$. [b]p20.[/b] In convex trapezoid $ABCD$ with $\overline{AB} \parallel \overline{CD}$ and $AD = BC$, let $M$ be the midpoint of $\overline{BC}$. If $\angle AMB = 24^o$ and $\angle CMD = 66^o$, find $\angle ABC$, in degrees. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given natural $n,m,k$. It is known that $m^n$ is divisible by $n^m$, and $n^k$ is divisible by $k^n$. Prove that $m^k$ is divisible by $k^m$.

Let $\ell = 1$, $M = 23$, $N = 45$, and $u = 67$. Compute the number of ordered pairs of nonnegative integers $(X, Y)$ with $X \leq M - \ell$ and $Y \leq N + u$ such that the sum \[ \sum_{k=\ell}^{u} \binom{X + k}{M}\cdot\binom{Y - k}{N} \] is divisible by $89$ (for integers $a$ and $b$, define the binomial coefficient $\tbinom{a}{b}$ to be the number of $b$-element subsets of any given $a$-element set, which is $0$ when $a < 0$, $b < 0$, or $b > a$).

Let $n$ be a positive integer. Find the greatest possible integer $m$, in terms of $n$, with the following property: a table with $m$ rows and $n$ columns can be filled with real numbers in such a manner that for any two different rows $\left[ {{a_1},{a_2},\ldots,{a_n}}\right]$ and $\left[ {{b_1},{b_2},\ldots,{b_n}} \right]$ the following holds: \[\max\left( {\left| {{a_1} - {b_1}} \right|,\left| {{a_2} - {b_2}} \right|,...,\left| {{a_n} - {b_n}} \right|} \right) = 1\] [i]Poland (Tomasz Kobos)[/i]

Let $M(n)=\{n,n+1,n+2,n+3,n+4,n+5\}$ be a set of 6 consecutive integers. Let's take all values of the form \[\frac{a}{b}+\frac{c}{d}+\frac{e}{f}\] with the set $\{a,b,c,d,e,f\}=M(n)$. Let \[\frac{x}{u}+\frac{y}{v}+\frac{z}{w}=\frac{xvw+yuw+zuv}{uvw}\] be the greatest of all these values. a) show: for all odd $n$ hold: $\gcd (xvw+yuw+zuv, uvw)=1$ iff $\gcd (x,u)=\gcd (y,v)=\gcd (z,w)=1$. b) for which positive integers $n$ hold $\gcd (xvw+yuw+zuv, uvw)=1$?