Determine, with proof, whether $22!6! + 1$ is prime.

Initially, a positive integer is written on the blackboard. Every second, one adds to the number on the board the product of all its nonzero digits, writes down the results on the board, and erases the previous number. Prove that there exists a positive integer which will be added inifinitely many times.

For integers $x$, $y$, and $z$, we have $(x-y)(y-z)(z-x)=x+y+z$. Prove that $27|x+y+z$.

$x,y,z,a,b,c$ are positive integers that satisfy $xy \equiv a \pmod z$, $yz \equiv b \pmod x$, $zx \equiv c \pmod y$. Prove that $\min{\{x,y,z\}} \le ab+bc+ca$.

Find all positive integers $n$ such that number $n^4-4n^3+22n^2-36n+18$ is perfect square of positive integer

Let $n$ be a positive integer. Prove that the numbers $$1^1, 3^3, 5^5, ..., (2n-1)^{2n-1}$$ all give different remainders when divided by $2^n$.

A positive integer $n$ is called an untouchable number if there is no positive integer $m$ for which the sum of the factors of $m$ (including $m$ itself) is $n + m$. Find the sum of all of the untouchable numbers between $1$ and $10$ (inclusive)

p1. Given the set $H = \{(x, y)|(x -y)^2 + x^2 - 15x + 50 = 0$ where x and y are natural numbers $\}$. Find the number of subsets of $H$. p2. A magician claims to be an expert at guessing minds with following show. One of the viewers was initially asked to hidden write a five-digit number, then subtract it with the sum of the digits that make up the number, then name four of the five digits that make up the resulting number (in order of any). Then the magician can guess the numbers hidden. For example, if the audience mentions four numbers result: $0, 1, 2, 3$, then the magician will know that the hidden number is $3$. a. Give an example of your own from the above process. b. Explain mathematically the general form of the process. p3. In a fruit basket there are $20$ apples, $18$ oranges, $16$ mangoes, $10$ pineapples and $6$ papayas. If someone wants to take $10$ pieces from the basket. After that, how many possible compositions of fruit are drawn? p4. Inside the Equator Park, a pyramid-shaped building will be made with base of an equilateral triangle made of translucent material with a side length of the base $8\sqrt3$ m long and $8$ m high. A globe will be placed in a pyramid the. Ignoring the thickness of the pyramidal material, determine the greatest possible length of the radius of the globe that can be made. p5. What is the remainder of $2012^{2012} + 2014^{2012}$ divided by $2013^2$?

Prove that for an arbitrary prime $p \ge 3$ the number of positive integers $n$, for which $p | n! +1$ does not exceed $cp^{2/3}$, where c is a constant that does not depend on $p$.

With $\sigma (n)$ we denote the sum of natural divisors of the natural number $n$. Prove that, if $n$ is the product of different prime numbers of the form $2^k-1$ for $k \in \mathbb{N}$($Mersenne's$ prime numbers) , than $\sigma (n)=2^m$, for some $m \in \mathbb{N}$. Is the inverse statement true?

How many seven-digit numbers are multiples of $388$ and end in $388$?

Prove that for every natural number $k$, at least one of the integers \[ 2k-1, \quad 5k-1 \quad \text{and} \quad 13k-1\] is not a perfect square.

Positive integer $m$ is such that the sum of decimal digits of $2^m$ equals 8. Can the last digit of $2^m$ be equal 6? (Author: V. Senderov)

For prime $p\equiv 1\pmod{7} $, prove that there exists some positive integer $m$ such that $m^3+m^2-2m-1$ is a multiple of $p$.

An integer which is the area of a right-angled triangle with integer sides is called [i]Pythagorean[/i]. Prove that for every positive integer $n > 12$ there exists a Pythagorean number between $n$ and $2n.$

Fawzi cuts a spherical cheese completely into (at least three) slices of equal thickness. He starts at one end, making successive parallel cuts, working through the cheese until the slicing is complete. The discs exposed by the first two cuts have integral areas. [list](i) Prove that all the discs that he cuts have integral areas. (ii) Prove that the original sphere had integral surface area if, and only if, the area of the second disc that he exposes is even.[/list]

[u]Round 5[/u] [b]p13.[/b] Mandy is baking cookies. Her recipe calls for $N$ grams of flour, where $N$ is the number of perfect square divisors of $20! + 24!$. Find $N$. [b]p14.[/b] Consider a circular table with center $R$. Beef-loving Bryan places a steak at point $I$ on the circumference of the table. Then he places a bowl of rice at points $C$ and $E$ on the circumference of the table such that $CE \parallel IR$ and $\angle ICE = 25^o$. Find $\angle CIE$. [b]p15.[/b] Enya writes the $4$-letter words $LEEK$, $BEAN$, $SOUP$, $PEAS$, $HAMS$, and $TACO$ on the board. She then thinks of one of these words and gives Daria, Ava, Harini, and Tiffany a slip of paper containing exactly one letter from that word such that if they ordered the letters on their slips correctly, they would form the word. Each person announces at the same time whether they know the word or not. Ava, Harini, and Tiffany all say they do not know the word, while Daria says she knows the word. After hearing this, Ava, Harini, and Tiffany all know the word. Assuming all four girls are perfect logicians and they all thought of the same correct word, determine Daria’s letter. [u]Round 6[/u] [b]p16.[/b] Michael receives a cheese cube and a chocolate octahedron for his 5th birthday. On every day after, he slices off each corner of his cheese and chocolate with a knife. Each slice cuts off exactly one corner. He then eats each corner sliced off. Find the difference between the total number of cheese and chocolate pieces he has eaten by the end of his $6$th birthday. (Michael’s $5$th and $6$th birthdays do not occur on leap years.) [b]p17.[/b] Let $D$ be the average of all positive integers n satisfying $$lcm (gcd (n, 2000), gcd (n, 24)) = gcd (lcm (n, 2000), lcm (n, 24)).$$ Find $3D$. [b]p18.[/b] The base $\vartriangle ABC$ of the triangular pyramid $PABC$ is an equilateral triangle with a side length of $3$. Given that $PA = 3$, $PB = 4$, and $PC = 5$, find the circumradius of $PABC$. [u]Round 7[/u] [b]p19.[/b] $2049300$ points are arranged in an equilateral triangle point grid, a smaller version of which is shown below, such that the sides contain $2024$ points each. Peter starts at the topmost point of the grid. At $9:00$ am each day, he moves to an adjacent point in the row below him. Derrick wants to prevent Peter from reaching the bottom row, so at $12:00$ pm each day, he selects a point on the bottom row and places a rock at that point. Peter stops moving as soon as he is guaranteed to end up at a point with a rock on it. At least how many moves will Peter complete, no matter how Derrick places the rocks? [img]https://cdn.artofproblemsolving.com/attachments/f/a/346d25a5d7bb7a5fbefae7edad727965312b25.png[/img] [b]p20.[/b] There are $N$ stones in a pile, where $N$ is a positive integer. Ava and Anika take turns playing a game, with Ava moving first. If there are n stones in the pile, a move consists of removing $x$ stones, where $1 < gcd(x, n) \le x < n$. Whoever first has no possible moves on their turn wins. Both Ava and Anika play optimally. Find the $2024$th smallest value of $N$ for which Ava wins. [b]p21.[/b] Alan is bored and alone, so he plays a fun game with himself. He writes down all quadratic polynomials with leading coefficient $1$ whose coefficients are integers between $-10$ and $10$, inclusive, on a blackboard. He then erases all polynomials which have a non-integer root. Alan defines the size of a polynomial $P(x)$ to be $P(1)$ and spends an hour adding up the sizes of all the polynomials remaining on the blackboard. Assuming Alan does computation perfectly, find the sum Alan obtains. [u]Round 8[/u] [b]p22.[/b] A prime number is a positive integer with exactly two distinct divisors. You must submit a prime number for this problem. If you do not submit a prime number, you gain $0$ points, and your submission will not be considered valid. The median of all valid submitted numbers is $M$ (duplicates are counted). Estimate $2M$. If your team’s absolute difference between $2M$ and your submission is the $i$th smallest absolute difference among all teams, you gain max$(23 - 2i, 0)$ points. All teams who did not submit any number gain $0$ points. (In the case of a tie, all teams that tied gain the same amount of points.) [b]p23.[/b] Ribbotson the Frog is at the point $(0, 0)$ and wants to reach the point $(18, 18)$ in $36$ steps. Each step, he either moves one unit in the $+x$ direction or one unit in the $+y$ direction. However, Ribbotson hates turning, so he must make at least two steps in any direction before switching directions. If $m$ is the number of different paths Ribbotson the Frog can make, estimate $m$. If $N$ is your team’s submitted number, your team earns points equal to the closest integer to $21\left(1 -\left|\log_{10}\frac{N}{m} \right|^2\right)$. [b]p24.[/b] Let $M = \pi^{\pi^{\pi^{\pi}}}$. Estimate $k$, where $M = 10^{10^{k}}$. If $N$ is your team’s submitted number, your team earns points equal to the closest integer to $21 \cdot 1.01^{(-|N-k|^3)}$. PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h3248729p29808138]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all triples $(p, x, y)$ consisting of a prime number $p$ and two positive integers $x$ and $y$ such that $x^{p -1} + y$ and $x + y^ {p -1}$ are both powers of $p$. [i]Proposed by Belgium[/i]

Determine all functions $f : \mathbb {N} \rightarrow \mathbb {N}$ such that $f$ is increasing (not necessarily strictly) and the numbers $f(n)+n+1$ and $f(f(n))-f(n)$ are both perfect squares for every positive integer $n$.

Find the sum of all $4$-digit numbers using the digits $2,3,4,5,6$ without a repetition of any of those digits.

The sequence $(a_n)$ is defined with the recursion $a_{n + 1} = 5a^6_n + 3a^3_{n-1} + a^2_{n-2}$ for $n\ge 2$ and the set of initial values $\{a_0, a_1, a_2\} = \{2013, 2014, 2015\}$. (That is, the initial values are these three numbers in any order.) Show that the sequence contains no sixth power of a natural number.

Is it true that for every $n\ge 2021$ there exist $n$ integer numbers such that the square of each number is equal to the sum of all other numbers, and not all the numbers are equal? (O. Rudenko)

A set $ S$ of points in space satisfies the property that all pairwise distances between points in $ S$ are distinct. Given that all points in $ S$ have integer coordinates $ (x,y,z)$ where $ 1 \leq x,y, z \leq n,$ show that the number of points in $ S$ is less than $ \min \Big((n \plus{} 2)\sqrt {\frac {n}{3}}, n \sqrt {6}\Big).$ [i]Dan Schwarz, Romania[/i]

Nils has a telephone number with eight different digits. He has made $28$ cards with statements of the type “The digit $a$ occurs earlier than the digit $b$ in my telephone number” – one for each pair of digits appearing in his number. How many cards can Nils show you without revealing his number?

Four lighthouses are located at points $ A$, $ B$, $ C$, and $ D$. The lighthouse at $ A$ is $ 5$ kilometers from the lighthouse at $ B$, the lighthouse at $ B$ is $ 12$ kilometers from the lighthouse at $ C$, and the lighthouse at $ A$ is $ 13$ kilometers from the lighthouse at $ C$. To an observer at $ A$, the angle determined by the lights at $ B$ and $ D$ and the angle determined by the lights at $ C$ and $ D$ are equal. To an observer at $ C$, the angle determined by the lights at $ A$ and $ B$ and the angle determined by the lights at $ D$ and $ B$ are equal. The number of kilometers from $ A$ to $ D$ is given by $ \displaystyle\frac{p\sqrt{r}}{q}$, where $ p$, $ q$, and $ r$ are relatively prime positive integers, and $ r$ is not divisible by the square of any prime. Find $ p\plus{}q\plus{}r$,