Let $p$ be an odd prime. Prove that: \[\displaystyle\sum_{k\equal{}1}^{p\minus{}1}k^{2p\minus{}1} \equiv \frac{p(p\plus{}1)}{2} \pmod{p^2}\]

The diagonals $AC$ and $BD$ of the cyclic quadrilateral $ABCD$ intersect at a point O. It is known that $\angle BAD = 60^o$ and $AO = 3OC$. Prove that the sum of some two sides of a quadrilateral is equal to the sum of the other two sides.

Find all continuous functions $f : \mathbb R \to \mathbb R$ such that for all $x \in \mathbb R$ and for all $n \in \mathbb N^{\ast}$ we have \[ n^2 \int_{x}^{x + \frac{1}{n}} f(t) \, dt = n f(x) + \frac12 . \] [i]Mihai Piticari[/i]

Two players play the following game. At the outset there are two piles, containing $10,000$ and $20,000$ tokens,respectively . A move consists of removing any positive number of tokens from a single pile $or$ removing $x>0$ tokens from one pile and $y>0$ tokens from the other , where $x+y$ is divisible by $2015$. The player who can not make a move loses. Which player has a winning strategy

Let $ ABC $ be a triangle, $ M_A $ be the midpoint of the side $ BC, $ and $ P_A $ be the orthogonal projection of $ A $ on $ BC. $ Similarly, define $ M_B,M_C,P_B,P_C. M_BM_C $ intersects $ P_BP_C $ at $ S_A, $ and the tangent of the circumcircle of $ ABC $ at $ A $ meets $ BC $ at $ T_A. $ Similarly, define $ S_B,S_C,T_B,T_C. $ Show that the perpendiculars through $ A,B,C, $ to $ S_AT_A,S_BT_B, $ respectively, $ S_CT_C, $ are concurent. [i]Flavian Georgescu[/i]

Frankie the Frog starts his morning at the origin in $\mathbb{R}^2$. He decides to go on a leisurely stroll, consisting of $3^1+3^{10}+3^{11}+3^{100}+3^{111}+3^{1000}$ moves, starting with the first move. On the $n$th move, he hops a distance of $$\max\{k\in\mathbb{Z}:3^k|n\}+1,$$ then turns $90^{\circ}$ counterclockwise. What is the square of the distance from his final position to the origin?

Let $N$ be the number of ordered pairs $(x,y)$ st $1 \leq x,y \leq p(p-1)$ and : $$x^{y} \equiv y^{x} \equiv 1 \pmod{p}$$ where $p$ is a fixed prime number. Show that : $$(\phi {(p-1)}d(p-1))^2 \leq N \leq ((p-1)d(p-1))^2$$ where $d(n)$ is the number of divisors of $n$

Arrange all square-free positive integers in ascending order $a_1,a_2,a_3,\ldots,a_n,\ldots$. Prove that there are infinitely many positive integers $n$, such that $a_{n+1}-a_n=2020$.

Does there exist a nonnegative integer $a$ for which the equation \[\left\lfloor\frac{m}{1}\right\rfloor + \left\lfloor\frac{m}{2}\right\rfloor + \left\lfloor\frac{m}{3}\right\rfloor + \cdots + \left\lfloor\frac{m}{m}\right\rfloor = n^2 + a\] has more than one million different solutions $(m, n)$ where $m$ and $n$ are positive integers? [i]The expression $\lfloor x\rfloor$ denotes the integer part (or floor) of the real number $x$. Thus $\lfloor\sqrt{2}\rfloor = 1, \lfloor\pi\rfloor =\lfloor 22/7 \rfloor = 3, \lfloor 42\rfloor = 42,$ and $\lfloor 0 \rfloor = 0$.[/i]

Suppose that $\tan \alpha =\frac{p}{q}$, where $p$ and $q$ are integers and $q \neq 0$. Prove the number $\tan \beta$ for which $\tan 2\beta =\tan 3\alpha$ is rational only when $p^2 +q^2$ is the square of an integer.

Given a triangle $ABC$, the points $D$, $E$, and $F$ lie on the sides $BC$, $CA$, and $AB$, respectively, are such that $$DC + CE = EA + AF = FB + BD.$$ Prove that $$DE + EF + FD \ge \frac12 (AB + BC + CA).$$

An equilateral triangle $DCE$ is placed outside a square $ABCD$. The center of this triangle is denoted as $M$ and the intersection of the straight line $AC$ and $BE$ with $S$. Prove that the triangle $CMS$ is isosceles.

A quadrilateral $ABCD$ without parallel sidelines is circumscribed around a circle centered at $I$. Let $K, L, M$ and $N$ be the midpoints of $AB, BC, CD$ and $DA$ respectively. It is known that $AB \cdot CD = 4IK \cdot IM$. Prove that $BC \cdot AD = 4IL \cdot IN$.

Given a fixed integer $k>0,r=k+0.5$,define $f^1(r)=f(r)=r[r],f^l(r)=f(f^{l-1}(r))(l>1)$ where $[x]$ denotes the smallest integer not less than $x$. prove that there exists integer $m$ such that $f^m(r)$ is an integer.

Consider a $5\times 5$ grid with $25$ cells. What is the least number of cells that should be colored, such that every $2\times 3$ or $3\times 2$ rectangle in the grid has at least two colored cells?

The sequence $x_1, x_2, x_3, . . .$ is defined by $x_1 = 2022$ and $x_{n+1}= 7x_n + 5$ for all positive integers $n$. Determine the maximum positive integer $m$ such that $$\frac{x_n(x_n - 1)(x_n - 2) . . . (x_n - m + 1)}{m!}$$ is never a multiple of $7$ for any positive integer $n$.

Let $N=4^KL$ where $L\equiv\ 7\pmod 8$. Prove that $N$ cannot be written as a sum of 3 squares

A Geostationary Earth Orbit is situated directly above the equator and has a period equal to the Earth’s rotational pe­riod. It is at the precise distance of $22,236$ miles above the Earth that a satellite can maintain an orbit with a period of rotation around the Earth exactly equal to $24$ hours. Be­ cause the satellites revolve at the same rotational speed of the Earth, they appear stationary from the Earth surface. That is why most station antennas (satellite dishes) do not need to move once they have been properly aimed at a tar­ get satellite in the sky. In an international project, a total of ten stations were equally spaced on this orbit (at the precise distance of $22,236$ miles above the equator). Given that the radius of the Earth is $3960$ miles, find the exact straight dis­tance between two neighboring stations. Write your answer in the form $a + b\sqrt{c}$, where $a, b, c$ are integers and $c > 0$ is square-free.

In the binomial expansion of $(\sqrt{x}+2)^{2n+1}$, sum of coefficients that power of $x$ is an integer is________.

There are 2009 boxes numbered from 1 to 2009, some of which contain stones. Two players, $ A$ and $ B$, play alternately, starting with $ A$. A move consists in selecting a non-empty box $ i$, taking one or more stones from that box and putting them in box $ i \plus{} 1$. If $ i \equal{} 2009$, the selected stones are eliminated. The player who removes the last stone wins a) If there are 2009 stones in the box 2 and the others are empty, find a winning strategy for either player. b) If there is exactly one stone in each box, find a winning strategy for either player.

If $a$ and $b$ are positive real numbers and each of the equations \[x^2+ax+2b = 0\quad\text{and}\quad x^2+2bx+a = 0\] has real roots, then the smallest possible value of $a+b$ is $\textbf{(A) }2\qquad \textbf{(B) }3\qquad \textbf{(C) }4\qquad \textbf{(D) }5\qquad \textbf{(E) }6$

[u]Set 7[/u] [b]G19.[/b] How many ordered triples $(x, y, z)$ with $1 \le x, y, z \le 50$ are there such that both $x + y + z$ and $xy + yz + zx$ are divisible by$ 6$? [b]G20.[/b] Triangle $ABC$ has orthocenter $H$ and circumcenter $O$. If $D$ is the foot of the perpendicular from $A$ to $BC$, then $AH = 8$ and $HD = 3$. If $\angle AOH = 90^o$, find $BC^2$. [b]G21.[/b] Nate flips a fair coin until he gets two heads in a row, immediately followed by a tails. The probability that he flips the coin exactly $12$ times is $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$. [u]Set 8[/u] [b]G22.[/b] Let $f$ be a function defined by $f(1) = 1$ and $$f(n) = \frac{1}{p}f\left(\frac{n}{p}\right)f(p) + 2p - 2,$$ where $p$ is the least prime dividing $n$, for all integers $n \ge 2$. Find $f(2022)$. [b]G23.[/b] Jessica has $15$ balls numbered $1$ through $15$. With her left hand, she scoops up $2$ of the balls. With her right hand, she scoops up $2$ of the remaining balls. The probability that the sum of the balls in her left hand is equal to the sum of the balls in her right hand can be expressed as $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$. [b]G24.[/b] Let $ABCD$ be a cyclic quadrilateral such that its diagonal $BD = 17$ is the diameter of its circumcircle. Given $AB = 8$, $BC = CD$, and that a line $\ell$ through A intersects the incircle of $ABD$ at two points $P$ and $Q$, the maximum area of $CP Q$ can be expressed as a fraction $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Find $m + n$. [u]Set 9[/u] [i]This set consists of three estimation problems, with scoring schemes described.[/i] [b]G25.[/b] Estimate $N$, the total number of participants (in person and online) at MOAA this year. An estimate of $e$ gets a total of max $ \left( 0, \lfloor 150 \left( 1- \frac{|N-e|}{N}\right) \rfloor -120 \right)$ points. [b]G26.[/b] If $A$ is the the total number of in person participants at MOAA this year, and $B$ is the total number of online participants at MOAA this year, estimate $N$, the product $AB$. An estimate of $e$ gets a total of max $(0, 30 - \lceil \log10(8|N - e| + 1)\rceil )$ points. [b]G27.[/b] Estimate $N$, the total number of letters in all the teams that signed up for MOAA this year, both in person and online. An estimate of e gets a total of max $(0, 30 - \lceil 7 log5(|N - E|)\rceil )$ points. PS. You should use hide for answers. Sets 1-3 have been posted [url=https://artofproblemsolving.com/community/c3h3131303p28367061]here [/url] and 4-6 [url=https://artofproblemsolving.com/community/c3h3131305p28367080]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Prove that for each positive integer $n$ there are at most two pairs $(a, b)$ of positive integers with following two properties: (i) $a^2 + b = n$, (ii) $a+b$ is a power of two, i.e. there is an integer $k \ge 0$ such that $a+b = 2^k$.

Some positive integers are initially written on a board, where each $2$ of them are different. Each time we can do the following moves: (1) If there are 2 numbers (written in the board) in the form $n, n+1$ we can erase them and write down $n-2$ (2) If there are 2 numbers (written in the board) in the form $n, n+4$ we can erase them and write down $n-1$ After some moves, there might appear negative numbers. Find the maximum value of the integer $c$ such that: Independetly of the starting numbers, each number which appears in any move is greater or equal to $c$

Determine the number of $3-$digit numbers in base $10$ having at least one $5$ and at most one $3$.