Let $S$ be the set of all positive integers that are [i]not[/i] perfect squares. For $n$ in $S,$ consider choices of integers $a_1,a_2,\dots, a_r$ such that $n<a_1<a_2<\cdots<a_r$ and $n\cdot a_1\cdot a_2\cdots a_r$ is a perfect square, and let $f(n)$ be the minimum of $a_r$ over all such choices. For example, $2\cdot 3\cdot 6$ is a perfect square, while $2\cdot 3,2\cdot 4, 2\cdot 5, 2\cdot 3\cdot 4,$ $2\cdot 3\cdot 5, 2\cdot 4\cdot 5,$ and $2\cdot 3\cdot 4\cdot 5$ are not, and so $f(2)=6.$ Show that the function $f$ from $S$ to the integers is one-to-one.

if $a^2+b^2+c^2+d^2=1$ prove that \[ (1-a)(1-b)\ge cd. \] A. Khrabrov

It is midnight on April $29$th, and Abigail is listening to a song by her favorite artist while staring at her clock, which has an hour, minute, and second hand. These hands move continuously. Between two consecutive midnights, compute the number of times the hour, minute, and second hands form two equal angles and no two hands overlap.

Show that an integer can be expressed as the difference of two squares if and only if it is not of the form $4k+2 \; (k \in \mathbb{Z})$.

4. Suppose that $\overline{A2021B}$ is a six-digit integer divisible by $9$. Find the maximum possible value of $A \cdot B$. 5. In an arbitrary triangle, two distinct segments are drawn from each vertex to the opposite side. What is the minimum possible number of intersection points between these segments? 6. Suppose that $a$ and $b$ are positive integers such that $\frac{a}{b-20}$ and $\frac{b+21}{a}$ are positive integers. Find the maximum possible value of $a + b$.

Let $a, b, c, d$ be positive real numbers such that $abcd = 1$. Prove the inequality $\frac{1}{a^3 + b + c + d} +\frac{1}{a + b^3 + c + d}+\frac{1}{a + b + c^3 + d} +\frac{1}{a + b + c + d^3} \leq \frac{a+b+c+d}{4}$ [i]Proposed by Romania[/i]

Let $n$ be a natural number and suppose that $ w_1, w_2, \ldots , w_n$ are $n$ weights . We call the set of $\{ w_1, w_2, \ldots , w_n\}$ to be a [i]Perfect Set [/i]if we can achieve all of the $1,2, \ldots, W$ weights with sums of $ w_1, w_2, \ldots , w_n$, where $W=\sum_{i=1}^n w_i $. Prove that if we delete the maximum weight of a Perfect Set, the other weights make again a Perfect Set.

The figure of equation $|x-y^2|=1-|x|$ is [img]https://services.artofproblemsolving.com/download.php?id=YXR0YWNobWVudHMvNi80LzQ4YjgxN2YxMjc0YTBkNzZiZjJiMTRhMjBiNDExN2I5OGZhZGY3LnBuZw==&rn=MjAwMDAwMDAwMDAwMC5wbmc=[/img]

There is a lamp in space.(Consider lamp a point) Do there exist finite number of equal sphers in space that the light of the lamp can not go to the infinite?(If a ray crash in a sphere it stops)

Let $ABC$ be a triangle with $AB > AC$. Let $P$ be a point on the line $AB$ beyond $A$ such that $AP +P C = AB$. Let $M$ be the mid-point of $BC$ and let $Q$ be the point on the side $AB$ such that $CQ \perp AM$. Prove that $BQ = 2AP.$

Let $\alpha_a$ denote the greatest odd divisor of a natural number $a$, and let $S_b=\sum_{a=1}^b\frac{\alpha_a}a$ Prove that the sequence $S_b/b$ has a finite limit when $b\to\infty$, and find this limit.

Angeline flips three fair coins, and if there are any tails, she then flips all coins that landed tails each one more time. The probability that all coins are now heads can be expressed as $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

Find all $f:\mathbb{R}\rightarrow \mathbb{R}$ such that the equation $$f(x^2+yf(x))=(1-x)f(y-x)$$ holds for all $x,y\in\mathbb{R}$.

Let $ABC$ be a Poncelet triangle, $A_1$ is the reflection of $A$ about the incenter $I$, $A_2$ is isogonally conjugated to $A_1$ with respect to $ABC$. Find the locus of points $A_2$.

Find the minimal positive integer $m$, so that there exist positive integers $n>k>1$, which satisfy $11...1=11...1.m$, where the first number has $n$ digits $1$, and the second has $k$ digits $1$.

Given a convex, $n$-sided polygon $P$, form a $2n$-sided polygon $\text{clip}(P)$ by cutting off each corner of $P$ at the edges' trisection points. In other words, $\text{clip}(P)$ is the polygon whose vertices are the $2n$ edge trisection points of $P$, connected in order around the boundary of $P$. Let $P_1$ be an isosceles trapezoid with side lengths $13,13,13,$ and $3$, and for each $i\geq 2$, let $P_i=\text{clip}(P_{i-1}).$ This iterative clipping process approaches a limiting shape $P_\infty=\lim_{i\to\infty}P_i$. If the difference of the areas of $P_{10}$ and $P_\infty$ is written as a fraction $\tfrac xy$ in lowest terms, calculate the number of positive integer factors of $x\cdot y$.

On the board written numbers from 1 to 25 . Bob can pick any three of them say $a,b,c$ and replace by $a^3+b^3+c^3$ . Prove that last number on the board can not be $2013^3$.

Let $ABCD$ be a convex quadrangle such that $AB=AC=BD$ (vertices are labelled in circular order). The lines $AC$ and $BD$ meet at point $O$, the circles $ABC$ and $ADO$ meet again at point $P$, and the lines $AP$ and $BC$ meet at the point $Q$. Show that the angles $COQ$ and $DOQ$ are equal.

Find all triples of real numbers $(a, b, c)$ satisfying $$a+b+c=14, \quad a^2+b^2+c^2=84,\quad a^3+b^3+c^3=584.$$

Let $\left(1+\sqrt{2}\right)^{2012}=a+b\sqrt{2}$, where $a$ and $b$ are integers. The greatest common divisor of $b$ and $81$ is $\text{(A) }1\qquad\text{(B) }3\qquad\text{(C) }9\qquad\text{(D) }27\qquad\text{(E) }81$

Let $ a(k) $ be the largest odd number by which $ k $ is divisible. Prove that $$ \sum_{k=1}^{2^n} a(k) = \frac{1}{3}(4^n+2).$$

Let $a_1, \dots, a_n, b_1, \dots, b_n$ be $2n$ positive integers such that the $n+1$ products \[a_1 a_2 a_3 \cdots a_n, b_1 a_2 a_3 \cdots a_n, b_1 b_2 a_3 \cdots a_n, \dots, b_1 b_2 b_3 \cdots b_n\] form a strictly increasing arithmetic progression in that order. Determine the smallest possible integer that could be the common difference of such an arithmetic progression.

In triangle $ABC$ points $M, N$ are midpoints of $BC, CA$ respectively. Point $P$ is inside $ABC$ such that $\angle BAP = \angle PCA = \angle MAC .$ Prove that $\angle PNA = \angle AMB .$

Three integers $A, B, C$ are written on a whiteboard. Every move, Mr. Doba can either subtract $1$ from all numbers on the board, or choose two numbers on the board and subtract $1$ from both of them whilst leaving the third untouched. For how many ordered triples $(A, B, C)$ with $1 \le A < B < C\le 20$ is it possible for Mr. Doba to turn all three of the numbers on the board to $0$?

Given $25$ different positive numbers. Prove that you can choose two of them such, that none of the other numbers equals neither to the sum nor to the difference between the chosen numbers.