Prove that the equation $7^x=1+y^2+z^2$ has no solutions over positive integers.

In the quadrilateral $ABCD$, angles $B$ and $C$ are equal to $120^o$, $AB = CD = 1$, $CB = 4$. Find the length $AD$.

Find all pairs \((x, y)\) of real numbers that satisfy the system \[ (x + 1)(x^2 + 1) = y^3 + 1 \] \[ (y + 1)(y^2 + 1) = x^3 + 1 \]

Let $I,\ O$ and $\Gamma$ be the incenter, circumcenter and the circumcircle of triangle $ABC$, respectively. Line $AI$ meets $\Gamma$ at $M$ $(M\neq A)$. The circumference $\omega$ is tangent internally to $\Gamma$ at $T$, and is tangent to the lines $AB$ and $AC$. The tangents through $A$ and $T$ to $\Gamma$ intersect at $P$. Lines $PI$ and $TM$ meet at $Q$. Prove that the lines $QA$ and $MO$ meet at a point on $\Gamma$.

Let $p>2$ be a prime number, and $(a_k)_{k\geqslant 1}$ be a sequence defined by $a_1=p$ and $a_{k+1}=2a_k+1$, $k\geqslant 1$. Show that one of the first $p$ terms of the sequence is not prime. [i]Marcel Țena[/i]

We write one of the numbers $0$ and $1$ into each unit square of a chessboard with $40$ rows and $7$ columns. If any two rows have different sequences, at most how many $1$s can be written into the unit squares? $ \textbf{(A)}\ 198 \qquad\textbf{(B)}\ 128 \qquad\textbf{(C)}\ 82 \qquad\textbf{(D)}\ 40 \qquad\textbf{(E)}\ \text{None of above} $

Find all positive integers $ n $ such that there exists an integer $ m $ satisfying $$ \frac{1}{n}\sum\limits_{k=m}^{m+n-1}{k^2} $$ is a perfect square.

Let $1=d_1<d_2<\ldots<d_{2m}=n$ be the divisors of a positive integer $n$, where $n$ is not a perfect square. Consider the determinant $$D=\begin{vmatrix}n+d_1&n&\ldots&n\\n&n+d_2&\ldots&n\\\ldots&\ldots&&\ldots\\n&n&\ldots&n+d_{2m}\end{vmatrix}.$$ (a) Prove that $n^m$ divides $D$. (b) Prove that $1+d_1+d_2+\ldots+d_{2m}$ divides $D$.

Given a finite set $S$, $P(S)$ denotes the set of all the subsets of $S$. For any $f:P(S)\rightarrow \mathbb{R}$ ,prove the following inequality:$$\sum_{A\in P(S)}\sum_{B\in P(S)}f(A)f(B)2^{\left| A\cap B \right|}\geq 0.$$

In a rectangular plot of land, a man walks in a very peculiar fashion. Labeling the corners $ABCD$, he starts at $A$ and walks to $C$. Then, he walks to the midpoint of side $AD$, say $A_1$. Then, he walks to the midpoint of side $CD$ say $C_1$, and then the midpoint of $A_1D$ which is $A_2$. He continues in this fashion, indefinitely. The total length of his path if $AB=5$ and $BC=12$ is of the form $a + b\sqrt{c}$. Find $\displaystyle\frac{abc}{4}$.

a) There are $2n$ rays marked in a plane, with $n$ being a natural number. Given that no two marked rays have the same direction and no two marked rays have a common initial point, prove that there exists a line that passes through none of the initial points of the marked rays and intersects with exactly $n$ marked rays. (b) Would the claim still hold if the assumption that no two marked rays have a common initial point was dropped?

Find all non-negative integers $x, y$ such that\[x^3y+x+y=xy+2xy^2\]

[b]p1.[/b] Eric is playing Brawl Stars. If he starts playing at $11:10$ AM, and plays for $2$ hours total, then how many minutes past noon does he stop playing? [b]p2.[/b] James is making a mosaic. He takes an equilateral triangle and connects the midpoints of its sides. He then takes the center triangle formed by the midsegments and connects the midpoints of its sides. In total, how many equilateral triangles are in James’ mosaic? [b]p3.[/b] What is the greatest amount of intersections that $3$ circles and $3$ lines can have, given that they all lie on the same plane? [b]p4.[/b] In the faraway land of Arkesia, there are two types of currencies: Silvers and Gold. Each Silver is worth $7$ dollars while each Gold is worth $17$ dollars. In Daniel’s wallet, the total dollar value of the Silvers is $1$ more than that of the Golds. What is the smallest total dollar value of all of the Silvers and Golds in his wallet? [b]p5.[/b] A bishop is placed on a random square of a $8$-by-$8$ chessboard. On average, the bishop is able to move to $s$ other squares on the chessboard. Find $4s$. Note: A bishop is a chess piece that can move diagonally in any direction, as far as it wants. [b]p6.[/b] Andrew has a certain amount of coins. If he distributes them equally across his $9$ friends, he will have $7$ coins left. If he apportions his coins for each of his $15$ classmates, he will have $13$ coins to spare. If he splits the coins into $4$ boxes for safekeeping, he will have $2$ coins left over. What is the minimum number of coins Andrew could have? [b]p7.[/b] A regular polygon $P$ has three times as many sides as another regular polygon $Q$. The interior angle of $P$ is $16^o$ greater than the interior angle of $Q$. Compute how many more diagonals $P$ has compared to $Q$. [b]p8.[/b] In an certain airport, there are three ways to switch between the ground floor and second floor that are 30 meters apart: either stand on an escalator, run on an escalator, or climb the stairs. A family on vacation takes 65 seconds to climb up the stairs. A solo traveller late for their flight takes $25$ seconds to run upwards on the escalator. The amount of time (in seconds) it takes for someone to switch floors by standing on the escalator can be expressed as $\frac{u}{v}$ , where $u$ and $v$ are relatively prime. Find $u + v$. (Assume everyone has the same running speed, and the speed of running on an escalator is the sum of the speeds of riding the escalator and running on the stairs.) [b]p9.[/b] Avanish, being the studious child he is, is taking practice tests to improve his score. Avanish has a $60\%$ chance of passing a practice test. However, whenever Avanish passes a test, he becomes more confident and instead has a $70\%$ chance of passing his next immediate test. If Avanish takes $3$ practice tests in a row, the expected number of practice tests Avanish will pass can be expressed as $\frac{a}{b}$ , where $a$ and $b$ are relatively prime. Find $a + b$. [b]p10.[/b] Triangle $\vartriangle ABC$ has sides $AB = 51$, $BC = 119$, and $AC = 136$. Point $C$ is reflected over line $\overline{AB}$ to create point $C'$. Next, point $B$ is reflected over line $\overline{AC'}$ to create point $B'$. If $[B'C'C]$ can be expressed in the form of $a\sqrt{b}$, where $b$ is not divisible by any perfect square besides $1$, find $a + b$. [b]p11[/b]. Define the following infinite sequence $s$: $$s = \left\{\frac{1}{1},\frac{1}{1 + 3},\frac{1}{1 + 3 + 6}, ... ,\frac{1}{1 + 3 + 6 + ...+ t_k},...\right\},$$ where $t_k$ denotes the $k$th triangular number. The sum of the first $2024$ terms of $s$, denoted $S$, can be expressed as $$S = 3 \left(\frac{1}{2}+\frac{1}{a}-\frac{1}{b}\right),$$ where $a$ and $b$ are positive integers. Find the minimal possible value of $a + b$. [b]p12.[/b] Omar writes the numbers from $1$ to $1296$ on a whiteboard and then converts each of them into base $6$. Find the sum of all of the digits written on the whiteboard (in base $10$), including both the base $10$ and base $6$ numbers. [b]p13.[/b] A mountain number is a number in a list that is greater than the number to its left and right. Let $N$ be the amount of lists created from the integers $1$ - $100$ such that each list only has one mountain number. $N$ can be expressed as $$N = 2^a(2^b - c^2),$$ where $a$, $b$ and $c$ are positive integers and $c$ is not divisible by $2$. Find $a + b+c$. (The numbers at the beginning or end of a list are not considered mountain numbers.)[hide]Original problem was voided because the original format of the answer didn't match the result's format. So I changed it in the wording, in order the problem to be correct[/hide] [b]p14.[/b] A circle $\omega$ with center $O$ has a radius of $25$. Chords $\overline{AB}$ and $\overline{CD}$ are drawn in $\omega$ , intersecting at $X$ such that $\angle BXC = 60^o$ and $AX > BX$. Given that the shortest distance of $O$ with $\overline{AB}$ and $\overline{CD}$ is $7$ and $15$ respectively, the length of $BX$ can be expressed as $x - \frac{y}{\sqrt{z}}$ , where $x$, $y$, and $z$ are positive integers such that $z$ is not divisible by any perfect square. Find $x + y + z.$ [hide]two answers were considered correct according to configuration[/hide] [b]p15.[/b] How many ways are there to split the first $10$ natural numbers into $n$ sets (with $n \ge 1$) such that all the numbers are used and each set has the same average? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Two cyclists start moving simultaneously in opposite directions on a circular circuit. The first cyclist maintains a constant speed $c_1$ meters per second, the second maintains $c_2$ meters per second. How many times did they meet when the first cyclist completed $n$ laps? Compute for $c_1=10,c_2=7,n=11$.

Let $ABC$ be a triangle with $AB < AC$ inscribed in $(O)$. Tangent line at $A$ of $(O)$ cuts $BC$ at $D$. Take $H$ as the projection of $A$ on $OD$ and $E,F$ as projections of $H$ on $AB,AC$.Suppose that $EF$ cuts $(O)$ at $R,S$. Prove that $(HRS)$ is tangent to $OD$

In several cells of a square grid there live hedgehogs. Every hedgehog multiplies the number of hedgehogs in its row by the number of hedgehogs in its column. Is it possible that all the hedgehogs get distinct numbers?