If $x$, $y$, and $z$ are distinct positive integers such that $x^2+y^2=z^3$, what is the smallest possible value of $x+y+z$?

There are pairs of square numbers with the following two properties: (1) Their decimal representations have the same number of digits, with the first digit starting is different from $0$ . (2) If one appends the second to the decimal representation of the first, the decimal representation results another square number. Example: $16$ and $81$; $1681 = 41^2$. Prove that there are infinitely many pairs of squares with these properties.

Consider a Riemannian metric on the vector space ${\Bbb{R}^n}$ which satisfies the property that for each two points ${a,b}$ there is a single distance minimising geodesic segment ${g(a,b)}$. Suppose that for all ${a \in \Bbb{R}^n}$, the Riemannian distance with respect to ${a}, {\rho_a : \Bbb{R}^n \rightarrow \Bbb{R}}$ is convex and differentiable outside of ${a}$. Prove that if for a point ${x \neq a,b}$ we have \[ \displaystyle \partial_i \rho_a(x)=-\partial_i \rho_b(x),\ i=1,\cdots, n\] then ${x}$ is a point on ${g(a,b)}$ and conversely. [i]Proposed by Lajos Tamássy and Dávid Kertész[/i]

Let $a_1, a_2,...,a_{51}$ be non-zero elements of a field of characteristic $p$. We simultaneously replace each element with the sum of the 50 remaining ones. In this way we get a sequence $b_1, ... , b_{51}$. If this new sequence is a permutation of the original one, find all possible values of $p$.

Edward starts in his house, which is at (0,0) and needs to go point (6,4), which is coordinate for his school. However, there is a park that shaped as a square and has coordinates (2,1),(2,3),(4,1), and (4,3). There is no road for him to walk inside the park but there is a road for him to walk around the perimeter of the square. How many different shortest road routes are there from Edward's house to his school?

What is the largest number of points that can exist on a plane so that each distance between any two of them is an odd integer?

Compute $\left\lfloor \sum_{k=0}^{10}\left(3+2\cos\left(\frac{2k\pi}{11}\right)\right)^{10}\right\rfloor \pmod{100}.$

Let $a, b, c$ be the lengths of the sides of a triangle, and let $S$ be its area. We know that $S = \frac14 (c^2 - a^2 - b^2)$. Prove that $\angle C = 135^o$.

Points $M$ and $N$ are the midpoints of sides $AB$ and $CD$, respectively of quadrilateral $ABCD$. It is known that $BC // AD$ and $AN = CM$. Is it true that $ABCD$ is parallelogram?

Determine all functions $f$ from the set of non-negative integers to itself such that $f(a + b) = f(a) + f(b) + f(c) + f(d)$, whenever $a, b, c, d$, are non-negative integers satisfying $2ab = c^2 + d^2$.

$ 30$ students participated in the mathematical Olympiad. Each of them was given $ 8$ problems to solve. Jury estimated their work with the following rule: 1) Each problem was worth $ k$ points, if it wasn't solved by exactly $ k$ students; 2) Each student received the maximum possible points in each problem or got $ 0$ in it; Lasha got the least number of points. What's the maximal number of points he could have? Remark: 1) means that if the problem was solved by exactly $ k$ students, than each of them got $ 30 \minus{} k$ points in it.

Find all square-free integers $d$ for which there exist positive integers $x, y$ and $n$ satisfying $x^2+dy^2=2^n$ Submitted by Kada Williams, Cambridge

Let $n$ be some positive integer. Find all functions $f:{{R}^{+}}\to R$ (i.e., functions defined by the set of all positive real numbers with real values) for which equality holds $f\left( {{x}^{n+1}}+ {{y}^{n+1}} \right)={{x}^{n}}f\left( x \right)+{{y}^{n}}f\left( y \right)$ for any positive real numbers $x, y$

Let $p>13$ be a prime of the form $2q+1$, where $q$ is prime. Find the number of ordered pairs of integers $(m,n)$ such that $0\le m<n<p-1$ and \[3^m+(-12)^m\equiv 3^n+(-12)^n\pmod{p}.\] [i]Alex Zhu.[/i] [hide="Note"]The original version asked for the number of solutions to $2^m+3^m\equiv 2^n+3^n\pmod{p}$ (still $0\le m<n<p-1$), where $p$ is a Fermat prime.[/hide]

Consider the triangular numbers $T_n = \frac{n(n+1)}{2} , n \in \mathbb N$. [list][b](a)[/b] If $a_n$ is the last digit of $T_n$, show that the sequence $(a_n)$ is periodic and find its basic period. [b](b)[/b] If $s_n$ is the sum of the first $n$ terms of the sequence $(T_n)$, prove that for every $n \geq 3$ there is at least one perfect square between $s_{n-1} and $s_n$.[/list]

Let $N$ be a positive integer. Prove that there exist three permutations $a_1,\dots,a_N$, $b_1,\dots,b_N$, and $c_1,\dots,c_N$ of $1,\dots,N$ such that \[\left|\sqrt{a_k}+\sqrt{b_k}+\sqrt{c_k}-2\sqrt{N}\right|<2023\] for every $k=1,2,\dots,N$.

[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_1, a_2, \ldots, a_n$ be positive real numbers. Prove the inequality \[\binom n2 \sum_{i<j} \frac{1}{a_ia_j} \geq 4 \left( \sum_{i<j} \frac{1}{a_i+a_j} \right)^2\]

The vertices of a regular $2002$-sided polygon are numbered $1$ through $2002$, clockwise. Given an integer $ n$, $1 \le n \le 2002$, color vertex $n$ blue, then, going clockwise, count$ n$ vertices starting at the next of $n$, and color $n$ blue. And so on, starting from the vertex that follows the last vertex that was colored, n vertices are counted, colored or uncolored, and the number $n$ is colored blue. When the vertex to be colored is already blue, the process stops. We denote $P(n)$ to the set of blue vertices obtained with this procedure when starting with vertex $n$. For example, $P(364)$ is made up of vertices $364$, $728$, $1092$, $1456$, $1820$, $182$, $546$, $910$, $1274$, $1638$, and $2002$. Determine all integers $n$, $1 \le n \le 2002$, such that $P(n)$ has exactly $14 $ vertices,

$ (a_n)_{n \equal{} 1}^\infty$ is defined on real numbers with $ a_n \not \equal{} 0$, $ a_na_{n \plus{} 3} \equal{} a_{n \plus{} 2}a_{n \plus{} 5}$ and $ a_1a_2 \plus{} a_3a_4 \plus{} a_5a_6 \equal{} 6$. So $ a_1a_2 \plus{} a_3a_4 \plus{} \cdots \plus{}a_{41}a_{42} \equal{} ?$ $\textbf{(A)}\ 21 \qquad\textbf{(B)}\ 42 \qquad\textbf{(C)}\ 63 \qquad\textbf{(D)}\ 882 \qquad\textbf{(E)}\ \text{None}$

Define a $100 \times 100$ square grid $G$. Initially color all cells of $G$ white. A move consists of selecting a $1 \times 7$ or $7 \times 1$ subgrid of $G$ and flipping the colors of all cells in this subgrid from white to black or vice versa. Is it possible that after a series of moves, all cells are colored black? [i]Proposed by Evan Chang (squareman), USA[/i]

Prove that for any positive integers $k$ and $N$, \[\left(\frac{1}{N}\sum\limits_{n=1}^{N}(\omega (n))^k\right)^{\frac{1}{k}}\leq k+\sum\limits_{q\leq N}\frac{1}{q},\] where $\sum\limits_{q\leq N}\frac{1}{q}$ is the summation over of prime powers $q\leq N$ (including $q=1$). Note: For integer $n>1$, $\omega (n)$ denotes number of distinct prime factors of $n$, and $\omega (1)=0$.

Let $n \ge 3$ be an integer. A finite number of disjoint arcs with the total sum of length $1 -\frac{1}{n}$ are given on a circle of perimeter $1$. Prove that there is a regular $n$-gon whose all vertices lie on the considered arcs

Envelop the cube in one layer with five convex pentagons of equal areas.

There are 6 distinct values of $x$ strictly between $0$ and $\frac{\pi}{2}$ that satisfy the equation \[ \tan(15 x) = 15 \tan(x) . \] Call these 6 values $r_1$, $r_2$, $r_3$, $r_4$, $r_5$, and $r_6$. What is the value of the sum \[ \frac{1}{\tan^2 r_1} + \frac{1}{\tan^2 r_2} + \frac{1}{\tan^2 r_3} + \frac{1}{\tan^2 r_4} + \frac{1}{\tan^2 r_5} + \frac{1}{\tan^2 r_6} \, ? \]