Find all natural numbers $ n > 1$ such that $ n^{2}$ does $ \text{not}$ divide $ (n \minus{} 2)!$.

Given a positive integer $n \geq 2$, whose canonical prime factorization is $n = p_1^{\alpha_1}p_2^{\alpha_2} \ldots p_k^{\alpha_k}$, we define the following functions: $$\varphi(n) = n\bigg(1 -\frac{1}{p_1}\bigg) \bigg(1 -\frac{1}{p_2}\bigg) \ldots \bigg(1 -\frac {1}{p_k}\bigg) ; \overline{\varphi}(n) = n\bigg(1 +\frac{1}{p_1}\bigg) \bigg(1 +\frac{1}{p_2}\bigg) \ldots \bigg(1 + \frac{1}{p_k}\bigg)$$ Consider all positive integers $n$ such that $\overline{\varphi}(n)$ is a multiple of $n + \varphi(n) $. (a) Prove that $n$ is even. (b) Determine all positive integers $n$ that satisfy this property.

Let's write p,q, and r as three distinct prime numbers, where 1 is not a prime. Which of the following is the smallest positive perfect cube leaving $ n \equal{} pq^2r^4$ as a divisor? $ \textbf{(A)}\ p^8q^8r^8\qquad \textbf{(B)}\ (pq^2r^2)^3\qquad \textbf{(C)}\ (p^2q^2r^2)^3\qquad \textbf{(D)}\ (pqr^2)^3\qquad \textbf{(E)}\ 4p^3q^3r^3$

Let $a,b$ be two natural numbers. When we divide $a^2+b^2$ by $a+b$, we the the remainder $r$ and the quotient $q.$ Determine all pairs $(a, b)$ for which $q^2 + r = 1977.$

We say that a prime $p$ is $n$-$\textit{rephinado}$ if $n | p - 1$ and all $1, 2, \ldots , \lfloor \sqrt[\delta]{p}\rfloor$ are $n$-th residuals modulo $p$, where $\delta = \varphi+1$. Are there infinitely many $n$ for which there are infinitely many $n$-$\textit{rephinado}$ primes? Notes: $\varphi =\frac{1+\sqrt{5}}{2}$. We say that an integer $a$ is a $n$-th residue modulo $p$ if there is an integer $x$ such that $$x^n \equiv a \text{ (mod } p\text{)}.$$

Given any integer $m>1$ prove that there exist infinitely many positive integers $n$ such that the last $m$ digits of $5^n$ are a sequence $a_m,a_{m-1},\ldots ,a_1=5\ (0\le a_j<10)$ in which each digit except the last is of opposite parity to its successor (i.e., if $a_i$ is even, then $a_{i-1}$ is odd, and if $a_i$ is odd, then $a_{i-1}$ is even).

Find all polynomials $P$ with integer coefficients such that $$s(x)=s(y) \implies s(|P(x)|)=s(|P(y)|).$$ for all $x,y\in \mathbb{N}$. Note: $s(x)$ denotes the sum of digits of $x$. [i]Proposed by Şevket Onur YILMAZ[/i]

[b]p1.[/b] $17.5\%$ of what number is $4.5\%$ of $28000$? [b]p2.[/b] Let $x$ and $y$ be two randomly selected real numbers between $-4$ and $4$. The probability that $(x - 1)(y - 1)$ is positive can be written in the form $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Compute $m + n$. [b]p3.[/b] In the $xy$-plane, Mallen is at $(-12, 7)$ and Anthony is at $(3,-14)$. Mallen runs in a straight line towards Anthony, and stops when she has traveled $\frac23$ of the distance to Anthony. What is the sum of the $x$ and $y$ coordinates of the point that Mallen stops at? [b]p4.[/b] What are the last two digits of the sum of the first $2021$ positive integers? [b]p5.[/b] A bag has $19$ blue and $11$ red balls. Druv draws balls from the bag one at a time, without replacement. The probability that the $8$th ball he draws is red can be written in the form $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Compute $m + n$. [b]p6.[/b] How many terms are in the arithmetic sequence $3$, $11$, $...$, $779$? [b]p7.[/b] Ochama has $21$ socks and $4$ drawers. She puts all of the socks into drawers randomly, making sure there is at least $1$ sock in each drawer. If $x$ is the maximum number of socks in a single drawer, what is the difference between the maximum and minimum possible values of $x$? [b]p8.[/b] What is the least positive integer $n$ such that $\sqrt{n + 1} - \sqrt{n} < \frac{1}{20}$? [b]p9.[/b] Triangle $\vartriangle ABC$ is an obtuse triangle such that $\angle ABC > 90^o$, $AB = 10$, $BC = 9$, and the area of $\vartriangle ABC$ is $36$. Compute the length of $AC$. [img]https://cdn.artofproblemsolving.com/attachments/a/c/b648d0d60c186d01493fcb4e21b5260c46606e.png[/img] [b]p10.[/b] If $x + y - xy = 4$, and $x$ and $y$ are integers, compute the sum of all possible values of$ x + y$. [b]p11.[/b] What is the largest number of circles of radius $1$ that can be drawn inside a circle of radius $2$ such that no two circles of radius $1$ overlap? [b]p12.[/b] $22.5\%$ of a positive integer $N$ is a positive integer ending in $7$. Compute the smallest possible value of $N$. [b]p13.[/b] Alice and Bob are comparing their ages. Alice recognizes that in five years, Bob's age will be twice her age. She chuckles, recalling that five years ago, Bob's age was four times her age. How old will Alice be in five years? [b]p14.[/b] Say there is $1$ rabbit on day $1$. After each day, the rabbit population doubles, and then a rabbit dies. How many rabbits are there on day $5$? [b]15.[/b] Ajit draws a picture of a regular $63$-sided polygon, a regular $91$-sided polygon, and a regular $105$-sided polygon. What is the maximum number of lines of symmetry Ajit's picture can have? [b]p16.[/b] Grace, a problem-writer, writes $9$ out of $15$ questions on a test. A tester randomly selects $3$ of the $15$ questions, without replacement, to solve. The probability that all $3$ of the questions were written by Grace can be written in the form $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Compute $m + n$. [b]p17.[/b] Compute the number of anagrams of the letters in $BMMTBMMT$ with no two $M$'s adjacent. [b]p18.[/b] From a $15$ inch by $15$ inch square piece of paper, Ava cuts out a heart such that the heart is a square with two semicircles attached, and the arcs of the semicircles are tangent to the edges of the piece of paper, as shown in the below diagram. The area (in square inches) of the remaining pieces of paper, after the heart is cut out and removed, can be written in the form $a-b\pi$, where $a$ and $b$ are positive integers. Compute $a + b$. [b]p19.[/b] Bayus has $2021$ marbles in a bag. He wants to place them one by one into $9$ different buckets numbered $1$ through $9$. He starts by putting the first marble in bucket $1$, the second marble in bucket $2$, the third marble in bucket $3$, etc. After placing a marble in bucket $9$, he starts back from bucket $1$ again and repeats the process. In which bucket will Bayus place the last marble in the bag? [img]https://cdn.artofproblemsolving.com/attachments/9/8/4c6b1bd07367101233385b3ffebc5e0abba596.png[/img] [b]p20.[/b] What is the remainder when $1^5 + 2^5 + 3^5 +...+ 2021^5$ is divided by $5$? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $a$ and $b$ be natural numbers with $a > b$ and having the same parity. Prove that the solutions of the equation \[ x^2 - (a^2 - a + 1)(x - b^2 - 1) - (b^2 + 1)^2 = 0 \] are natural numbers, none of which is a perfect square. [i]Albania[/i]

Prove that there are infinitely many primes $ p$ such that the total number of solutions mod $ p$ to the equation $ 3x^{3}\plus{}4y^{4}\plus{}5z^{3}\minus{}y^{4}z \equiv 0$ is $ p^2$

Let us consider a simle graph with vertex set $ V$. All ordered pair $ (a,b)$ of integers with $ gcd(a,b) \equal{} 1$, are elements of V. $ (a,b)$ is connected to $ (a,b \plus{} kab)$ by an edge and to $ (a \plus{} kab,b)$ by another edge for all integer k. Prove that for all $ (a,b)\in V$, there exists a path fromm $ (1,1)$ to $ (a,b)$.

(a) Let $a$ and $b$ be positive integers such that $M(a, b) = a - \frac1b +b(b + \frac3a)$ is an integer. Prove that $M(a,b)$ is a square. (b) Find nonzero integers $a$ and $b$ such that $M(a,b)$ is a positive integer, but not a square.

Let $n$ be a positive integer and $M = \{1, 2, 3, 4, 5, 6\}$. Two persons $A$ and $B$ play in the following Way: $A$ writes down a digit from $M$, $B$ appends a digit from $M$, and so it becomes alternately one digit from $M$ is appended until the $2n$-digit decimal representation of a number has been created. If this number is divisible by $9$, $B$ wins, otherwise $A$ wins. For which $n$ can $A$ and for which $n$ can $B$ force the win?

Find all natural numbers $n$ such that there exist $ x_1,x_2,\ldots,x_n,y\in\mathbb{Z}$ where $x_1,x_2,\ldots,x_n,y\neq 0$ satisfying: \[x_1 \plus{} x_2 \plus{} \ldots \plus{} x_n \equal{} 0\] \[ny^2 \equal{} x_1^2 \plus{} x_2^2 \plus{} \ldots \plus{} x_n^2\]

A point $ P$ is chosen at random in the interior of a unit square $ S$. Let $ d(P)$ denote the distance from $ P$ to the closest side of $ S$. The probability that $ \frac15\le d(P)\le\frac13$ is equal to $ \frac{m}{n}$, where $ m$ and $ n$ are relatively prime positive integers. Find $ m\plus{}n$.

Given is the sequence $(a_n)_{n\geq 0}$ which is defined as follows:$a_0=3$ and $a_{n+1}-a_n=n(a_n-1) \ , \ \forall n\geq 0$. Determine all positive integers $m$ such that $\gcd (m,a_n)=1 \ , \ \forall n\geq 0$.

Determine all positive real numbers $x$ and $y$ satisfying the equation \[x+y+\frac{1}{x}+\frac{1}{y}+4=2\cdot (\sqrt{2x+1}+\sqrt{2y+1})\]

The natural numbers $a > b$ are such that $a-b=5b^2-4a^2$. Prove that the number $8b + 1$ is composite.

If $x,y,z$ are positive integers and $z(xz+1)^2=(5z+2y)(2z+y)$, prove that $z$ is an odd perfect square.

What's the largest number of integers from $1$ to $2022$ that you can choose so that no sum of any two different chosen integers is divisible by any difference of two different chosen integers? [i](Proposed by Oleksii Masalitin)[/i]

Let the sequences $(a_n)_{n=1}^{\infty}$ and $(b_n)_{n=1}^{\infty}$ satisfy $a_0 = b_0 = 1, a_n = 9a_{n-1} -2b_{n-1}$ and $b_n = 2a_{n-1} + 4b_{n-1}$ for all positive integers $n$. Let $c_n = a_n + b_n$ for all positive integers $n$. Prove that there do not exist positive integers $k, r, m$ such that $c^2_r = c_kc_m$.

Is there a positive integer $m$ such that the equation \[ {1\over a}+{1\over b}+{1\over c}+{1\over abc}={m\over a+b+c} \] has infinitely many solutions in positive integers $a,b,c$?

Let $ n $ be a natural number. Find all integer numbers that can be written as $$ \frac{1}{a_1} +\frac{2}{a_2} +\cdots +\frac{n}{a_n} , $$ where $ a_1,a_2,...,a_n $ are natural numbers.

Prove that if for a positive integer $n$ is $5^n + 3^n + 1$ is prime number, then $n$ is divided by $12$.

Find all the odd positive integers $n$ such that there are $n$ odd integers $x_1, x_2,..., x_n$ such that $$x_1^2+x_2^2+...+x_n^2=n^4$$