How many four digit perfect square numbers are there in the form $AABB$ where $A,B \in \{1,2,\dots, 9\}$? $ \textbf{(A)}\ 3 \qquad\textbf{(B)}\ 2 \qquad\textbf{(C)}\ 1 \qquad\textbf{(D)}\ 0 \qquad\textbf{(E)}\ \text{None of above} $

Three real numbers $ a,b,c$ satisfy the inequality $ |ax^2\plus{}bx\plus{}c| \le 1$ for all $ x \in [\minus{}1,1]$. Prove that $ |cx^2\plus{}bx\plus{}a| \le 2$ for all $ x \in [\minus{}1,1]$.

Several positive integers are written on a blackboard. The sum of any two of them is some power of two (for example, $2, 4, 8,...$). What is the maximal possible number of different integers on the blackboard?

A median , a bisector and an altitude of a certain triangle intersect at an inner point $O$ . The segment of the bisector from the vertex to $O$ is equal to the segment of the altitude from the vertex to $O$ . Prove that the triangle is equilateral .

For a given natural $n$, we consider the set $A\subset \{1,2, ..., n\}$, which consists of at least $\left[\frac{n+1}{2}\right]$ items. Prove that for $n \ge 2015$ the set $A$ contains a three-element arithmetic sequence.

Consider a sequence of polynomials $P_0(x), P_1(x), P_2(x), \ldots, P_n(x), \ldots$, where $P_0(x) = 2, P_1(x) = x$ and for every $n \geq 1$ the following equality holds: \[P_{n+1}(x) + P_{n-1}(x) = xP_n(x).\] Prove that there exist three real numbers $a, b, c$ such that for all $n \geq 1,$ \[(x^2 - 4)[P_n^2(x) - 4] = [aP_{n+1}(x) + bP_n(x) + cP_{n-1}(x)]^2.\]

$(1)$ Find $\lim_{x \to \infty} \frac{x^2}{e^x}$ $(2)$ Find $\lim_{k \to 0} \frac{1}{k} \int_{0}^{k} (1 + \sin 2x)^{\frac{1}{x}} dx$

Let $ABC$ be an scalene triangle and $I$ and $H$ its incenter, ortocenter respectively. The incircle touchs $BC$, $CA$ and $AB$ at $D,E$ an $F$. $DF$ and $AC$ intersects at $K$ while $EF$ and $BC$ intersets at $M$. Shows that $KM$ cannot be paralel to $IH$. PS1: The original problem without the adaptation apeared at the Brazilian Olympic Revenge 2011 but it was incorrect. PS2:The Brazilian Olympic Revenge is a competition for teachers, and the problems are created by the students. Sorry if I had some English mistakes here.

Find all differentiable functions $f, g:[0,\infty) \to \mathbb{R}$ and the real constant $k\geq 0$ such that \begin{align*} f(x) &=k+ \int_0^x \frac{g(t)}{f(t)}dt \\ g(x) &= -k-\int_0^x f(t)g(t) dt \end{align*} and $f(0)=k, f'(0)=-k^2/3$ and also $f(x)\neq 0$ for all $x\geq 0$.\\ \\ [i] (Nora Gavrea)[/i]

Given a parallelogram $ABCD$, let $\mathcal{P}$ be a plane such that the distance from vertex $A$ to $\mathcal{P}$ is $49$, the distance from vertex $B$ to $\mathcal{P}$ is $25$, and the distance from vertex $C$ to $\mathcal{P}$ is $36$. Find the sum of all possible distances from vertex $D$ to $\mathcal{P}$. [i]Proposed by [b]HrishiP[/b][/i]

If positive integers $p,q,r$ are such that the quadratic equation $px^2-qx+r=0$ has two distinct real roots in the open interval $(0,1)$, find the minimum value of $p$.

Show that any representation of 1 as the sum of distinct reciprocals of numbers drawn from the arithmetic progression $\{2,5,8,11,...\}$ such as given in the following example must have at least eight terms: \[1=\frac{1}{2}+\frac{1}{5}+\frac{1}{8}+\frac{1}{11}+\frac{1}{20}+\frac{1}{41}+\frac{1}{110}+\frac{1}{1640}\]

Circle $\omega$ inscribed in triangle $ABC$ touches sides $BC$, $CA$, $AB$ at points $A_1$, $B_1$ and $C_1$ respectively. On the extension of segment $AA_1$, point $A$ is taken as point D such that $AD= AC_1$. Lines $DB_1$ and $DC_1$ intersect a second time circle $\omega$ at points $B_2$ and $C_2$. Prove that $B_2C_2$ is the diameter of circle of $\omega$.

A [i]trio [/i] is a set of three distinct integers such that two of the numbers are divisors or multiples of the third. Which [i]trio [/i] contained in $\{1, 2, ... , 2002\}$ has the largest possible sum? Find all [i]trios [/i] with the maximum sum.

Let $ \triangle ABC$ be a triangle with incircle $ \omega(I,r)$and circumcircle $ \zeta(O,R)$.Let $ l_{a}$ be the angle bisector of $ \angle BAC$.Denote $ P\equal{}l_{a}\cap\zeta$.Let $ D$ be the point of tangency $ \omega$ with $ [BC]$.Denote $ Q\equal{}PD\cap\zeta$.Show that $ PI\equal{}QI$ if $ PD\equal{}r$.

$2022$ lily pads are arranged in a circle. Each lily pad starts with height $1$. A frog starts on one of the lily pads, and jumps around clockwise as follows: if the frog is on a lily bad of height $k$, the lily pad grows by $1$ (becoming $k+1$), and then the frog jumps $k$ lily pads clockwise (i.e. jumping over $(k-1)$). The frog continues doing this as long as it pleases. After $n$ jumps, let $D(n)$ be the difference between the tallest lily pad and the shortest lily pad. Find, with proof, the maximum possible value of $D(n)$, or prove that $D(n)$ is unbounded.

Tom's Hat Shoppe increased all original prices by $25\%$. Now the shoppe is having a sale where all prices are $20\%$ off these increased prices. Which statement best describes the sale price of an item? $ \text{(A)}\ \text{The sale price is }5\%\text{ higher than the original price.} $ $ \text{(B)}\ \text{The sale price is higher than the original price, but by less than }5\% . $ $ \text{(C)}\ \text{The sale price is higher than the original price, but by more than }5\% . $ $ \text{(D)}\ \text{The sale price is lower than the original price.} $ $ \text{(E)}\ \text{The sale price is the same as the original price.} $

Find all functions $f:\mathbb R\to\mathbb R$ such that $$f\left( x^2+xf(y)\right)=xf(x+y)$$ for all reals $x,y$.

There are $26$ cards and each one has a number written on it. There are two with $1$, two with $2$, two with $3$, and so on up to two with $12$ and two with $13$. You have to distribute the $26$ cards in piles so that the following two conditions are met: $\bullet$ If two cards have the same number they are in the same pile. $\bullet$ No pile contains a card whose number is equal to the sum of the numbers of two cards in that same pile. Determine what is the minimum number of stacks to make. Give an example with the distribution of the cards for that number of stacks and justify why it is impossible to have fewer stacks. Clarification: Two squares are [i]neighbors [/i] if they have a common side.

Let $A$ be a set of $2025$ non-negative integers and $f: \mathbb{Z}_{>0} \to \mathbb{Z}_{>0}$ be a function with the following two properties: 1) For every two distinct positive integers $x,y$ there exists $a\in A$, such that $x-y$ divides $f(x+a) - f(y+a)$. 2) For every positive integer $N$ there exists a positive integer $t$ such that $f(x) \neq f(y)$ whenever $x,y \in [t, t+N]$ are distinct. Prove that there are infinitely many primes $p$ such that $p$ divides $f(x)$ for some positive integer $x$.

Let $\mathcal{C}$ be the family of circumferences in $\mathbb{R}^2$ that satisfy the following properties: (i) if $C_n$ is the circumference with center $(n,1/2)$ and radius $1/2$, then $C_n\in \mathcal{C}$, for all $n\in \mathbb{Z}$. (ii) if $C$ and $C'$, both in $\mathcal{C}$, are externally tangent, then the circunference externally tangent to $C$ and $C'$ and tanget to $x$-axis also belongs to $\mathcal{C}$. (iii) $\mathcal{C}$ is the least family which these properties. Determine the set of the real numbers which are obtained as the first coordinate of the points of intersection between the elements of $\mathcal{C}$ and the $x$-axis.

Let $ p>3$ be a prime. If $ p$ divides $ x$, prove that the equation $ x^2-1=y^p$ does not have positive integer solutions.

Let $a_1,a_2,\cdots,a_{41}\in\mathbb{R},$ such that $a_{41}=a_1, \sum_{i=1}^{40}a_i=0,$ and for any $i=1,2,\cdots,40, |a_i-a_{i+1}|\leq 1.$ Determine the greatest possible value of $(1)a_{10}+a_{20}+a_{30}+a_{40};$ $(2)a_{10}\cdot a_{20}+a_{30}\cdot a_{40}.$

In a $7\times7$ board, some squares are painted red. Let $a$ be the number of rows that have an odd number of red squares and let $b$ be the number of columns that have an odd number of red squares. Find all possible values of $a+b$. For each value found, give a example of how the board can be painted.

In a wagon, every $m \geq 3$ people have exactly one common friend. (When $A$ is $B$'s friend, $B$ is also $A$'s friend. No one was considered as his own friend.) Find the number of friends of the person who has the most friends.