Let $a$ and $b$ be positive integers such that the prime number $a+b+1$ divides the integer $4ab-1$. Prove that $a=b$.

Let $A$ be a subset of $\{2,3, \ldots, 28 \}$ such that if $a \in A$, then the residue obtained when we divide $a^2$ by $29$ also belongs to $A$. Find the minimum possible value of $|A|$.

For every positive integer $n$ we take the greatest divisor $d$ of $n$ such that $d\leq \sqrt{n}$ and we define $a_n=\frac{n}{d}-d$. Prove that in the sequence $a_1,a_2,a_3,...$, any non negative integer $k$ its in the sequence infinitely many times.

[u]Round 1[/u] [b]p1.[/b] Alice and Bob played $25$ games of rock-paper-scissors. Alice played rock $12$ times, scissors $6$ times, and paper $7$ times. Bob played rock $13$ times, scissors $9$ times, and paper $3$ times. If there were no ties, who won the most games? (Remember, in each game each player picks one of rock, paper, or scissors. Rock beats scissors, scissors beat paper, and paper beats rock. If they choose the same object, the result is a tie.) [b]p2.[/b] On the planet Vulcan there are eight big volcanoes and six small volcanoes. Big volcanoes erupt every three years and small volcanoes erupt every two years. In the past five years, there were $30$ eruptions. How many volcanoes could erupt this year? [b]p3.[/b] A tangle is a sequence of digits constructed by picking a number $N\ge 0$ and writing the integers from $0$ to $N$ in some order, with no spaces. For example, $010123459876$ is a tangle with $N = 10$. A palindromic sequence reads the same forward or backward, such as $878$ or $6226$. The shortest palindromic tangle is $0$. How long is the second-shortest palindromic tangle? [b]p4.[/b] Balls numbered $1$ to $N$ have been randomly arranged in a long input tube that feeds into the upper left square of an $8 \times 8$ board. An empty exit tube leads out of the lower right square of the board. Your goal is to arrange the balls in order from $1$ to $N$ in the exit tube. As a move, you may 1. move the next ball in line from the input tube into the upper left square of the board, 2. move a ball already on the board to an adjacent square to its right or below, or 3. move a ball from the lower right square into the exit tube. No square may ever hold more than one ball. What is the largest number $N$ for which you can achieve your goal, no matter how the balls are initially arranged? You can see the order of the balls in the input tube before you start. [img]https://cdn.artofproblemsolving.com/attachments/1/8/bbce92750b01052db82d58b96584a36fb5ca5b.png[/img] [b]p5.[/b] A $2018 \times 2018$ board is covered by non-overlapping $2 \times 1$ dominoes, with each domino covering two squares of the board. From a given square, a robot takes one step to the other square of the domino it is on and then takes one more step in the same direction. Could the robot continue moving this way forever without falling off the board? [img]https://cdn.artofproblemsolving.com/attachments/9/c/da86ca4ff0300eca8e625dff891ed1769d44a8.png[/img] [u]Round 2[/u] [b]p6.[/b] Seventeen teams participated in a soccer tournament where a win is worth $1$ point, a tie is worth $0$ points, and a loss is worth $-1$ point. Each team played each other team exactly once. At least $\frac34$ of all games ended in a tie. Show that there must be two teams with the same number of points at the end of the tournament. [b]p7.[/b] The city of Old Haven is known for having a large number of secret societies. Any person may be a member of multiple societies. A secret society is called influential if its membership includes at least half the population of Old Haven. Today, there are $2018$ influential secret societies. Show that it is possible to form a council of at most $11$ people such that each influential secret society has at least one member on the council. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The set of numbers $(p, a, b, c)$ of positive integers is called [i]Sozopolian[/i] when: [b]* [/b]p is an odd prime number [b]*[/b] $a$, $b$ and $c$ are different and [b]*[/b] $ab + 1$, $bc + 1$ and $ca + 1$ are a multiple of $p$. a) Prove that each [i]Sozopolian[/i] set satisfies the inequality $p+2 \leq \frac{a+b+c}{3}$ b) Find all numbers $p$ for which there exist a [i]Sozopolian[/i] set for which the equality of the upper inequation is met.

[b]6.1 [/b] Three people with one double seater motorbike simultaneously headed from city A to city B . How should they act so that time, for which the last of them will get to , was the smallest? Determine this time. Pedestrian speed - 5 km/h, motorcycle speed - 45 km/h, distance from A to B is equal to 60 kilometers . [b]6.2 / 7.2[/b] The numbers $A$ and $B$ are relatively prime. What common divisors can have the numbers $A+B$ and $A-B$? [b]6.3.[/b] A person's age in $1962$ was one more than the sum of digits of the year of his birth. How old is he? [b]6.4. / 7.3[/b] $15$ magazines lie on the table, completely covering it. Prove that it is possible to remove eight of them so that the remaining magz cover at least $7/15$ of the table area. [b]6.5.[/b] Prove that a $201 \times 201$ chessboard can be bypassed by moving a chess knight, visiting each square exactly once. [b]6.6.[/b] Can an integer whose last two digits are odd be the square of another integer? PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3983459_1962_leningrad_math_olympiad]here[/url].

[b]p1.[/b] Find the sum of all $3$-digit positive integers $\overline{abc}$ that satisfy $$\overline{abc} = {n \choose a}+{n \choose b}+ {n \choose c}$$ for some $n \le 10$. [b]p2.[/b] Feng and Trung play a game. Feng chooses an integer $p$ from $1$ to $90$, and Trung tries to guess it. In each round, Trung asks Feng two yes-or-no questions about $p$. Feng must answer one question truthfully and one question untruthfully. After $15$ rounds, Trung concludes there are n possible values for $p$. What is the least possible value of $n$, assuming Feng chooses the best strategy to prevent Trung from guessing correctly? [b]p3.[/b] A hypercube $H_n$ is an $n$-dimensional analogue of a cube. Its vertices are all the points $(x_1, .., x_n)$ that satisfy $x_i = 0$ or $1$ for all $1 \le i \le n$ and its edges are all segments that connect two adjacent vertices. (Two vertices are adjacent if their coordinates differ at exactly one $x_i$ . For example, $(0,0,0,0)$ and $(0,0,0,1)$ are adjacent on $H_4$.) Let $\phi (H_n)$ be the number of cubes formed by the edges and vertices of $H_n$. Find $\phi (H_4) + \phi (H_5)$. [b]p4.[/b] Denote the legs of a right triangle as $a$ and $b$, the radius of the circumscribed circle as $R$ and the radius of the inscribed circle as $r$. Find $\frac{a+b}{R+r}$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In the coordinate plane the points with both coordinates being rational numbers are called rational points. For any positive integer $n$, is there a way to use $n$ colours to colour all rational points, every point is coloured one colour, such that any line segment with both endpoints being rational points contains the rational points of every colour?

Find the sum of the numbers written with two digits $\overline{ab}$ for which the equation $3^{x + y} =3^x + 3^y + \overline{ab}$ has at least one solution $(x, y)$ in natural numbers.

For integers $a,b$ we define $f((a,b))=(2a,b-a)$ if $a<b$ and $f((a,b))=(a-b,2b)$ if $a\geq b$. Given a natural number $n>1$ show that there exist natural numbers $m,k$ with $m<n$ such that $f^{k}((n,m))=(m,n)$,where $f^{k}(x)=f(f(f(...f(x))))$,$f$ being composed with itself $k$ times.

Let $ x$, $ y$ be two integers with $ 2\le x, y\le 100$. Prove that $ x^{2^n} \plus{} y^{2^n}$ is not a prime for some positive integer $ n$.

If $n$ is composite, prove that $\phi(n) \le n- \sqrt{n}$.

Find all ordered triples of non-negative integers $(a,b,c)$ such that $a^2+2b+c$, $b^2+2c+a$, and $c^2+2a+b$ are all perfect squares. [i]Proposed by Matthew Babbitt[/i]

prove that if $p$ is a prime number such that $p=12k+\{2,3,5,7,8,11\}$($k \in \mathbb N \cup \{0\}$), there exist a field with $p^2$ elements.($\frac{100}{6}$ points)

Let $a_{i}$ and $b_{i}$ ($i=1,2, \cdots, n$) be rational numbers such that for any real number $x$ there is: \[x^{2}+x+4=\sum_{i=1}^{n}(a_{i}x+b)^{2}\] Find the least possible value of $n$.

Let $\mathbb{Z}_{>0}$ denote the set of positive integers. Consider a function $f: \mathbb{Z}_{>0} \to \mathbb{Z}_{>0}$. For any $m, n \in \mathbb{Z}_{>0}$ we write $f^n(m) = \underbrace{f(f(\ldots f}_{n}(m)\ldots))$. Suppose that $f$ has the following two properties: (i) if $m, n \in \mathbb{Z}_{>0}$, then $\frac{f^n(m) - m}{n} \in \mathbb{Z}_{>0}$; (ii) The set $\mathbb{Z}_{>0} \setminus \{f(n) \mid n\in \mathbb{Z}_{>0}\}$ is finite. Prove that the sequence $f(1) - 1, f(2) - 2, f(3) - 3, \ldots$ is periodic. [i]Proposed by Ang Jie Jun, Singapore[/i]

Find all positive integers $n$ such that: $$n = a^2 + b^2 + c^2 + d^2,$$ where $a < b < c < d$ are the smallest divisors of $n$.

Positive integers $ a<b$ are given. Prove that among every $ b$ consecutive positive integers there are two numbers whose product is divisible by $ ab$.

In $\triangle PQR$, $PQ=8$, $QR=13$, and $RP=15$. Prove that there is a point $S$ on line segment $\overline{PR}$, but not at its endpoints, such that $PS$ and $QS$ are also integers. [asy] size(200); defaultpen(linewidth(0.8)); pair P=origin,Q=(8,0),R=(7,10),S=(3/2,15/7); draw(P--Q--R--cycle); label("$P$",P,W); label("$Q$",Q,E); label("$R$",R,NE); draw(Q--S,linetype("4 4")); label("$S$",S,NW); [/asy]

Let $N$ be the number of positive integers $x$ less than $210 \cdot 2023$ such that $$ lcm(gcd(x, 1734), gcd(x + 17, x + 1732))$$ divides $2023$. Compute the sum of the prime factors of $N$ with multiplicity. (For example, if $S = 75 = 3^1 \cdot 5^2$, then the answer is $1\cdot 3 + 2 \cdot 5 = 13$).

Let $D_n$ be the set of divisors of $n$. Find all natural $n$ such that it is possible to split $D_n$ into two disjoint sets $A$ and $G$, both containing at least three elements each, such that the elements in $A$ form an arithmetic progression while the elements in $G$ form a geometric progression.

p1. Among the numbers $\frac15$ and $\frac14$ there are infinitely many fractional numbers. Find $999$ decimal numbers between $\frac15$ and $\frac14$ so that the difference between the next fractional number with the previous fraction constant. (i.e. If $x_1, x_2, x_3, x_4,..., x_{999}$ is a fraction that meant, then $x_2 - x_1= x_3 - x_3= ...= x_n - x_{n-1}=...=x_{999}-x_{998}$) p2. The pattern in the image below is: "Next image obtained by adding an image of a black equilateral triangle connecting midpoints of the sides of each white triangle that is left in the previous image." The pattern is continuous to infinity. [img]https://cdn.artofproblemsolving.com/attachments/e/f/81a6b4d20607c7508169c00391541248b8f31e.png[/img] It is known that the area of ​​the triangle in Figure $ 1$ is $ 1$ unit area. Find the total area of ​​the area formed by the black triangles in figure $5$. Also find the total area of the area formed by the black triangles in the $20$th figure. p3. For each pair of natural numbers $a$ and $b$, we define $a*b = ab + a - b$. The natural number $x$ is said to be the [i]constituent [/i] of the natural number $n$ if there is a natural number $y$ that satisfies $x*y = n$. For example, $2$ is a constituent of $6$ because there is a natural number 4 so that $2*4 = 2\cdot 4 + 2 - 4 = 8 + 2 - 4 = 6$. Find all constituent of $2005$. p4. Three people want to eat at a restaurant. To find who pays them to make a game. Each tossing one coin at a time. If the result is all heads or all tails, then they toss again. If not, then "odd person" (i.e. the person whose coin appears different from the two other's coins) who pay. Determine the number of all possible outcomes, if the game ends in tossing: a. First. b. Second. c. Third. d. Tenth. p5. Given the equation $x^2 + 3y^2 = n$, where $x$ and $y$ are integers. If $n < 20$ what number is $n$, and which is the respective pair $(x,y)$ ? Show that it is impossible to solve $x^2 + 3y^2 = 8$ in integers.

On the table there are $N$ cards. Each card has an integer number written on it. Beto performs the following operation several times: he chooses two cards from the table, calculates the difference between the numbers written on them, writes the result on his notebook and removes those two cards from the table. He can perform this operation as many times as he wants, as long as there are at least two cards on the table. After this, Beto multiplies all the numbers that he wrote on his notebook. Beto's goal is that the result of this multiplication is a multiple of $7^{100}$. Find the minimum value of $N$ such that Beto can always achieve his goal, no matter what the numbers on the cards are.

Find, as a function of $\, n, \,$ the sum of the digits of \[ 9 \times 99 \times 9999 \times \cdots \times \left( 10^{2^n} - 1 \right), \] where each factor has twice as many digits as the previous one.

Find all positive integers $(m,n)$ such that \[n^{n^{n}}=m^{m}.\]