Let’s note the set of all integers $n>1$ which are not divisible by a square of a prime number. We define the number $f(n)$ as the greatest amount of divisors of $n$ which could be chosen in such way so that for each two chosen $a$ and $b$, not necessarily different, the number $a^2+ab+b^2+n$ is not a square. Find all $m$ for which there exists $n$ so that $f(n)=m$.

Do there exist infinitely many quadruples $(a,b,c,d)$ of positive integers such that the number $a^{a!} + b^{b!} - c^{c!} - d^{d!}$ is prime and $2 \leq d \leq c \leq b \leq a \leq d^{2024}$?

Find all nonnegative integers $x, y, z$ satisfying the equation $$2^x+31^y=z^2.$$

Let $n$ be a positive integer and consider the system \begin{align*} S(n):\begin{cases} x^2+ny^2=z^2\\ nx^2+y^2=t^2 \end{cases}, \end{align*} where $x,y,z$, and $t$ are naturals. If [list] [*] $M_1=\{n\in\mathbb N:$ system $S(n)$ has infinitely many solutions$\}$, and [*] $M_1=\{n\in\mathbb N:$ system $S(n)$ has no solutions$\}$, [/list] prove that [list] [*] $7 \in M_1$ and $10 \in M_2$. [*] sets $M_1$ and $M_2$ are infinite. [/list]

Let $A$ be a finite set of positive numbers , $B=\{\frac{a+b}{c+d} |a,b,c,d \in A \}$. Show that: $\left | B \right | \ge 2\left | A \right |^2-1 $, where $|X| $ be the number of elements of the finite set $X$. (High School Affiliated to Nanjing Normal University )

[u]Round 1[/u] [b]p1.[/b] Tom and Jerry stole a chain of $7$ sausages and are now trying to divide the bounty. They take turns biting the sausages at one of the connections. When one of them breaks a connection, he may eat any single sausages that may fall out. Tom takes the first bite. Each of them is trying his best to eat more sausages than his opponent. Who will succeed? [b]p2. [/b]The King of the Mountain Dwarves wants to light his underground throne room by placing several torches so that the whole room is lit. The king, being very miserly, wants to use as few torches as possible. What is the least number of torches he could use? (You should show why he can't do it with a smaller number of torches.) This is the shape of the throne room: [img]https://cdn.artofproblemsolving.com/attachments/b/2/719daafd91fc9a11b8e147bb24cb66b7a684e9.png[/img] Also, the walls in all rooms are lined with velvet and do not reflect the light. For example, the picture on the right shows how another room in the castle is partially lit. [img]https://cdn.artofproblemsolving.com/attachments/5/1/0f6971274e8c2ff3f2d0fa484b567ff3d631fb.png[/img] [b]p3.[/b] In the Hundred Acre Wood, all the animals are either knights or liars. Knights always tell the truth and liars always lie. One day in the Wood, Winnie-the-Pooh, a knight, decides to visit his friend Rabbit, also a noble knight. Upon arrival, Pooh finds his friend sitting at a round table with $5$ other guests. One-by-one, Pooh asks each person at the table how many of his two neighbors are knights. Surprisingly, he gets the same answer from everybody! "Oh bother!" proclaims Pooh. "I still don't have enough information to figure out how many knights are at this table." "But it's my birthday," adds one of the guests. "Yes, it's his birthday!" agrees his neighbor. Now Pooh can tell how many knights are at the table. Can you? [b]p4.[/b] Several girls participate in a tennis tournament in which each player plays each other player exactly once. At the end of the tournament, it turns out that each player has lost at least one of her games. Prove that it is possible to find three players $A$, $B$, and $C$ such that $A$ defeated $B$, $B$ defeated $C$, and $C$ defeated $A$. [b]p5.[/b] There are $40$ piles of stones with an equal number of stones in each. Two players, Ann and Bob, can select any two piles of stones and combine them into one bigger pile, as long as this pile would not contain more than half of all the stones on the table. A player who can’t make a move loses. Ann goes first. Who wins? [u]Round 2[/u] [b]p6.[/b] In a galaxy far, far away, there is a United Galactic Senate with $100$ Senators. Each Senator has no more than three enemies. Tired of their arguments, the Senators want to split into two parties so that each Senator has no more than one enemy in his own party. Prove that they can do this. (Note: If $A$ is an enemy of $B$, then $B$ is an enemy of $A$.) [b]p7.[/b] Harry has a $2012$ by $2012$ chessboard and checkers numbered from $1$ to $2012 \times 2012$. Can he place all the checkers on the chessboard in such a way that whatever row and column Professor Snape picks, Harry will be able to choose three checkers from this row and this column such that the product of the numbers on two of the checkers will be equal to the number on the third? [img]https://cdn.artofproblemsolving.com/attachments/b/3/a87d559b340ceefee485f41c8fe44ae9a59113.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $ n$ be a natural number, and $ n \equal{} 2^{2007}k\plus{}1$, such that $ k$ is an odd number. Prove that \[ n\not|2^{n\minus{}1}\plus{}1\]

What is the smallest positive integer with exactly $7$ distinct proper divisors?

Show that a triangle whose side lengths are prime numbers cannot have integer area.

A test has twenty questions. Seven points are awarded for each correct answer, two points are deducted for each incorrect answer and no points are awarded or deducted for each unanswered question. Joana obtained $87$ points. How many questions did she not answer?

Let $\, a,b \,$ be odd positive integers. Define the sequence $\, (f_n ) \,$ by putting $\, f_1 = a,$ $f_2 = b, \,$ and by letting $\, f_n \,$ for $\, n \geq 3 \,$ be the greatest odd divisor of $\, f_{n-1} + f_{n-2}$. Show that $\, f_n \,$ is constant for $\, n \,$ sufficiently large and determine the eventual value as a function of $\, a \,$ and $\, b$.

Let $ a>0$, and let $ P(x)$ be a polynomial with integer coefficients such that \[ P(1)\equal{}P(3)\equal{}P(5)\equal{}P(7)\equal{}a\text{, and}\] \[ P(2)\equal{}P(4)\equal{}P(6)\equal{}P(8)\equal{}\minus{}a\text{.}\] What is the smallest possible value of $ a$? $ \textbf{(A)}\ 105 \qquad \textbf{(B)}\ 315 \qquad \textbf{(C)}\ 945 \qquad \textbf{(D)}\ 7! \qquad \textbf{(E)}\ 8!$

Let $\mathbb{Z} _{>0}$ be the set of positive integers. Find all functions $f: \mathbb{Z} _{>0}\rightarrow \mathbb{Z} _{>0}$ such that \[ m^2 + f(n) \mid mf(m) +n \] for all positive integers $m$ and $n$.

Find a necessary and sufficient condition of $a,b,n\in\mathbb{N^*}$ such that for $S=\{a+bt\mid t=0,1,2,\cdots,n-1\}$, there exists a one-to-one mapping $f: S\to S$ such that for all $x\in S$, $\gcd(x,f(x))=1$.

There are $n \ge 2$ numbers on the blackboard: $1, 2,..., n$. It is permitted to erase two of those numbers $x,y$ and write $2x - y$ instead. Find all values of $n$ such that it is possible to leave number $0$ on the blackboard after $n - 1$ such procedures.

It is given that the number $4^{11}+1$ is divisible by some prime greater than $1000$. Determine this prime. [i] Proposed by David Altizio [/i]

Find all functions $f$ from positive integers to themselves, such that the followings hold. $1)$.for each positive integer $n$ we have $f(n)<f(n+1)<f(n)+2020$. $2)$.for each positive integer $n$ we have $S(f(n))=f(S(n))$ where $S(n)$ is the sum of digits of $n$ in base $10$ representation.

Given an arbitrary prime $p>2011$. Prove that there exist positive integers $a, b, c$ not all divisible by $p$ such that for all positive integers $n$ that $p\mid n^4- 2n^2+ 9$, we have $p\mid 24an^2 + 5bn + 2011c$.

Consider $2$ positive integers $a,b$ such that $a+2b=2020$. (a) Determine the largest possible value of the greatest common divisor of $a$ and $b$. (b) Determine the smallest possible value of the least common multiple of $a$ and $b$.

For any odd prime $p$ and any integer $n,$ let $d_p (n) \in \{ 0,1, \dots, p-1 \}$ denote the remainder when $n$ is divided by $p.$ We say that $(a_0, a_1, a_2, \dots)$ is a [i]p-sequence[/i], if $a_0$ is a positive integer coprime to $p,$ and $a_{n+1} =a_n + d_p (a_n)$ for $n \geqslant 0.$ (a) Do there exist infinitely many primes $p$ for which there exist $p$-sequences $(a_0, a_1, a_2, \dots)$ and $(b_0, b_1, b_2, \dots)$ such that $a_n >b_n$ for infinitely many $n,$ and $b_n > a_n$ for infinitely many $n?$ (b) Do there exist infinitely many primes $p$ for which there exist $p$-sequences $(a_0, a_1, a_2, \dots)$ and $(b_0, b_1, b_2, \dots)$ such that $a_0 <b_0,$ but $a_n >b_n$ for all $n \geqslant 1?$ [I]United Kingdom[/i]

Find all quadruple $ (m,n,p,q) \in \mathbb{Z}^4$ such that \[ p^m q^n \equal{} (p\plus{}q)^2 \plus{} 1.\]

There are $101$ positive integers $a_1, a_2, \ldots, a_{101}$ such that for every index $i$, with $1 \leqslant i \leqslant 101$, $a_i+1$ is a multiple of $a_{i+1}$. Determine the greatest possible value of the largest of the $101$ numbers.

Prove that the arithmetic sequence $5, 11, 17, 23, 29, \ldots$ contains infinitely many primes.

Find all pairs of positive integers \(a, b\) such that the numbers \(a+1\), \(b+1\), \(2a+1\), \(2b+1\), \(a+3b\), and \(b+3a\) are all prime numbers.

[u]Round 1[/u] [b]p1.[/b] Compute $(1 - 2(3 - 4(5 - 6)))(7 - (8 - 9))$. [b]p2.[/b] How many numbers are in the set $\{20, 21, 22, ..., 88, 89\}$? [b]p3.[/b] Three times the complement of the supplement of an angle is equal to $60$ degrees less than the angle itself. Find the measure of the angle in degrees. [u]Round 2[/u] [b]p4.[/b] A positive number is decreased by $10\%$, then decreased by $20\%$, and finally increased by $30\%$. By what percent has this number changed from the original? Give a positive answer for a percent increase and a negative answer for a percent decrease. [b]p5.[/b] What is the area of the triangle with vertices at $(2, 3)$, $(8, 11)$, and $(13, 3)$? [b]p6.[/b] There are three bins, each containing red, green, and/or blue pens. The first bin has $0$ red, $0$ green, and $3$ blue pens, the second bin has $0$ red, $2$ green, and $4$ blue pens, and the final bin has $1$ red, $5$ green, and $6$ blue pens. What is the probability that if one pen is drawn from each bin at random, one of each color pen will be drawn? [u]Round 3[/u] [b]p7.[/b] If a and b are positive integers and $a^2 - b^2 = 23$, what is the value of $a$? [b]p8.[/b] Find the prime factorization of the greatest common divisor of $2^3\cdot 3^2\cdot 5^5\cdot 7^4$ and $2^4\cdot 3^1\cdot 5^2\cdot 7^6$. [b]p9.[/b] Given that $$a + 2b + 3c = 5$$ $$2a + 3b + c = -2$$ $$3a + b + 2c = 3,$$ find $3a + 3b + 3c$. [u]Round 4[/u] [b]p10.[/b] How many positive integer divisors does $11^{20}$ have? [b]p11.[/b] Let $\alpha$ be the answer to problem $10$. Find the real value of $x$ such that $2^{x-5} = 64^{x/\alpha}$. [b]p12.[/b] Let $\beta$ be the answer to problem $11$. Triangle $LMT$ has a right angle at $M$, $LM = \beta$, and $LT = 4\beta - 3$. If $Z$ is the midpoint of $LT$, what is the length$ MZ$? PS. You should use hide for answers. Rounds 5-8 are [url=https://artofproblemsolving.com/community/c3h3133709p28395558]here[/url] and 9-12 [url=https://artofproblemsolving.com/community/c3h3134133p28400917]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].