Find all pairs of positive numbers $(x,y)$ which satisfy the system of equations $$\begin{cases} x^2 +y^2 = a^2 +b^2 \\ x^3 +y^3 = a^3 +b^3 \end{cases}$$ where $a$ and $b$ are given positive numbers.

In each square of the table below, we must write a different integer from $1$ to $17$, such that the sum of the numbers in each of the eight columns is the same, and the sum of the numbers in the top row is twice the sum of the numbers in the bottom row. Which number from $1$ to $17$ can be omitted? [img]https://wiki-images.artofproblemsolving.com//2/2b/Zrzut_ekranu_2023-05-22_o_10.28.33.png[/img]

What’s the greatest pyramid volume one can form using edges of length $2, 3, 3, 4, 5, 5$, respectively?

In the equilateral triangle $[ABC], D$ is the midpoint of $[AC], E$ and the orthogonal projection of $D$ over $[CB]$ and $F$ is the midpoint of $[DE]$. Prove that $[FB]$ and $[AE]$ are perpendicular. [img]https://1.bp.blogspot.com/-TjSyQotGIOM/X4XMolaXHvI/AAAAAAAAMng/cVsHfl-lrXAFE5LMdosE6vqK1Tf-8WOQgCLcBGAsYHQ/s0/2006%2Bportugal%2Bp2.png[/img]

Find all primes $p$ such that there exist positive integers $x,y$ that satisfy $x(y^2-p)+y(x^2-p)=5p$

Triangle $ABC$ is given. Circle $ \omega $ passes through $B$, touch $AC$ in $D$ and intersect sides $AB$ and $BC$ at $P$ and $Q$ respectively. Line $PQ$ intersect $BD$ and $AC$ at $M$ and $N$ respectively. Prove that $ \omega $, circumcircle of $DMN$ and circle, touching $PQ$ in $M$ and passes through B, intersects in one point.

Let $n!=ab^2$ where $a$ is free from squares. Prove, that for every $\epsilon>0$ for every big enough $n$ it is true, that $$2^{(1-\epsilon)n}<a<2^{(1+\epsilon)n}$$ [i]M. Ivanov[/i]

Given integer $n \geq 3$. There are $n$ dots marked $1$ to $n$ clockwise on a big circle. And between every two neighboring dots, there is a light. At first, every light were dark. A and B are playing a game, A pick up $n$ pairs from $\{ (i,j)|1 \leq i < j \leq n \}$ and for every pairs $(i,j)$. B starts from the point marked $i$ and choose to walk clockwise or counterclockwise to the point marked $j$. And B invert the status of all passing lights (bright $\leftrightarrow$ dark) A hopes the number of dark light can be as much as possible while B hopes the number of bright light can be as much as possible. Suppose A, B are both smart, how many lights are bright in the end? [i]Proposed by BlessingOfHeaven[/i] [img]https://pbs.twimg.com/profile_images/1014932415201120256/u9KAaMZ4_400x400.jpg[/img]

Let $(F_{n})_{n\geq1}$ the Fibonacci sequence. Find all $n \in \mathbb{N}$ such that for every $k=0,1,...,F_{n}$ \[ {F_{n}\choose k} \equiv (-1)^{k} \ (mod \ F_{n}+1) \]

In Vila Par, all the truth coins weigh an even quantity of grams and the false coins weigh an odd quantity of grams. The eletronic device only gives the parity of the weight of a set of coins. If there are $2020$ truth coins and $2$ false coins, detemine the least $k$, such that, there exists a strategy that allows to identify the two false coins using the eletronic device, at most, $k$ times.

Find all real numbers $ x$ such that $ \lfloor x^3 \rfloor \equal{} 4x \plus{} 3$.

To control her blood pressure, Jill's grandmother takes one half of a pill every other day. If one supply of medicine contains $60$ pills, then the supply of medicine would last approximately $\text{(A)}\ 1\text{ month} \qquad \text{(B)}\ 4\text{ months} \qquad \text{(C)}\ 6\text{ months} \qquad \text{(D)}\ 8\text{ months} \qquad \text{(E)}\ 1\text{ year}$

Let $a, b$ be two co-prime positive integers. A number is called [i]good [/i] if it can be written in the form $ax + by$ for non-negative integers $x, y$. Define the function $f : Z\to Z $as $f(n) = n - n_a - n_b$, where $s_t$ represents the remainder of $s$ upon division by $t$. Show that an integer $n$ is [i]good [/i]if and only if the infinite sequence $n, f(n), f(f(n)), ...$ contains only non-negative integers.

Let $S$ be a set of $2022$ lines in the plane, no two parallel, no three concurrent. $S$ divides the plane into finite regions and infinite regions. Is it possible for all the finite regions to have integer area? [i]Proposed by Tony Wang[/i]

Let $\alpha = \cos^{-1} \left( \frac35 \right)$ and $\beta = \sin^{-1} \left( \frac35 \right) $. $$\sum_{n=0}^{\infty}\sum_{m=0}^{\infty} \frac{\cos(\alpha n +\beta m)}{2^n3^m}$$ can be written as $\frac{A}{B}$ for relatively prime positive integers $A$ and $B$. Find $1000A +B$.

Initially, only the integer $44$ is written on a board. An integer a on the board can be re- placed with four pairwise different integers $a_1, a_2, a_3, a_4$ such that the arithmetic mean $\frac 14 (a_1 + a_2 + a_3 + a_4)$ of the four new integers is equal to the number $a$. In a step we simultaneously replace all the integers on the board in the above way. After $30$ steps we end up with $n = 4^{30}$ integers $b_1, b2,\ldots, b_n$ on the board. Prove that \[\frac{b_1^2 + b_2^2+b_3^2+\cdots+b_n^2}{n}\geq 2011.\]

Find the sum of all positive integers $n$ such that when $1^3+2^3+3^3+\cdots+n^3$ is divided by $n+5$, the remainder is $17.$

The sequence ($a_n$) is defined by $a_1 = a_2 = 1, a_3 = 199$ and $a_{n+1} =\frac{1989+a_na_{n-1}}{a_{n-2}}$ for all $n \ge 3$. Prove that all terms of the sequence are positive integers

Let $ M $ be a finite set of integers, and let be a function $ \varphi :\mathbb{Z}\longrightarrow\mathbb{Z} $ whose restriction to $ \mathbb{Z}\setminus M $ evaluates to a constant $ c, $ such that $$ 2\le |\varphi (M)|=|M|\neq \frac{1}{c}\cdot \sum_{\iota \in \varphi (M) } \iota . $$ Prove that $ \varphi $ is not a sum between an injective function and a surjective function. [i]Sorin Rădulescu[/i] and [i]Ion Savu[/i]

Given $n^2$ numbers $x_{i,j}$ ($i,j=1,2,...,n$) satisfying the system of $n^3$ equations $$x_{i,j}+x_{j,k}+x_{k,i}=0 \,\,\, (i,j,k = 1,...,n)$$Prove that there exist such numbers $a_1,a_2,...,a_n$, that $x_{i,j}=a_i-a_j$ for all $i,j=1,...n$.

Determine all positive integers $(x_1,x_2,x_3,y_1,y_2,y_3)$ such that $y_1+ny_2^n+n^2y_3^{2n}$ divides $x_1+nx_2^n+n^2x_3^{2n}$ for all positive integer $n$.

Anana has an ordered $n$-tuple $(a_1,a_2,...,a_n)$ if integers. Banana may make a guess on Anana's ordered integer $n$-tuple $(x_1,x_2,...,x_n)$, upon which Anana will reveal the product of differences $(a_1-x_1)(a_2-x_2)...(a_n-x_n)$. How many guesses does Banana need to figure out Anana's $n$-tuple for certain?

For each integer $n\ge 1,$ compute the smallest possible value of \[\sum_{k=1}^{n}\left\lfloor\frac{a_k}{k}\right\rfloor\] over all permutations $(a_1,\dots,a_n)$ of $\{1,\dots,n\}.$ [i]Proposed by Shahjalal Shohag, Bangladesh[/i]

Let $A$ be a point and let k be a circle through $A$. Let $B$ and $C$ be two more points on $k$. Let $X$ be the intersection of the bisector of $\angle ABC$ with $k$. Let $Y$ be the reflection of $A$ wrt point $X$, and $D$ the intersection of the straight line $YC$ with $k$. Prove that point $D$ is independent of the choice of $B$ and $C$ on the circle $k$.

If an arc of $ 45^\circ$ on circle $ A$ has the same length as an arc of $ 30^\circ$ on circle $ B$, then the ratio of the area of circle $ A$ to the area of circle $ B$ is $ \textbf{(A)}\ \frac {4}{9} \qquad \textbf{(B)}\ \frac {2}{3} \qquad \textbf{(C)}\ \frac {5}{6} \qquad \textbf{(D)}\ \frac {3}{2} \qquad \textbf{(E)}\ \frac {9}{4}$