Consider the sequence $a(n)$ defined by the following conditions: $$a(1) = 1\,\,\,\, a(n + 1) = a(n) + [\sqrt{a(n)}] \,\,\, , \,\,\,\, n = 1,2,3,...$$ Prove that the sequence contains an infinite number of perfect squares. (Note: $[x]$ means the integer part of $x$, that is the greatest integer not greater than $x$.) (A Andjans)

Let $n\geq 2$ be a given integer. Find all functions $f:\mathbb{R}\rightarrow \mathbb{R}$ such that \[f(x-f(y))=f(x+y^n)+f(f(y)+y^n), \qquad \forall x,y \in \mathbb R.\]

[b]p1.[/b] Jack made $3$ quarts of fruit drink from orange and apple juice. His drink contains $45\%$ of orange juice. Nick prefers more orange juice in the drink. How much orange juice should he add to the drink to obtain a drink composed of $60\%$ of orange juice? [b]p2.[/b] A square is tiled by smaller squares as shown in the figure. Find the area of the black square in the middle if the perimeter of the big square $ABCD$ is $40$ cm. [img]https://cdn.artofproblemsolving.com/attachments/8/c/d54925cba07f63ec8578048f46e1e730cb8df3.png[/img] [b]p3.[/b] For one particular number $a > 0$ the function f satisfies the equality $f(x + a) =\frac{1 + f(x)}{1 - f(x)}$ for all $x$. Show that $f$ is a periodic function. (A function $f$ is periodic with the period $T$ if $f(x + T) = f(x)$ for any $x$.) [b]p4.[/b] If $a, b, c, x, y, z$ are numbers so that $\frac{x}{a}+\frac{y}{b}+\frac{z}{c}= 1$ and $\frac{a}{x}+\frac{b}{y}+\frac{c}{z}= 0$. Show that $\frac{x^2}{a^2} +\frac{y^2}{b^2} +\frac{z^2}{c^2} = 1$ [b]p5.[/b] Is it possible that a four-digit number $AABB$ is a perfect square? (Same letters denote the same digits). [b]p6.[/b] A finite number of arcs of a circle are painted black (see figure). The total length of these arcs is less than $\frac15$ of the circumference. Show that it is possible to inscribe a square in the circle so that all vertices of the square are in the unpainted portion of the circle. [img]https://cdn.artofproblemsolving.com/attachments/2/c/bdfa61917a47f3de5dd3684627792a9ebf05d5.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $ABC$ be a triangle. Choose points $A'$, $B'$ and $C'$ independently on side segments $BC$, $CA$ and $AB$ respectively with a uniform distribution. For a point $Z$ in the plane, let $p(Z)$ denote the probability that $Z$ is contained in the triangle enclosed by lines $AA'$, $BB'$ and $CC'$. For which interior point $Z$ in triangle $ABC$ is $p(Z)$ maximised?

Determine all functions $f : \mathbb R \to \mathbb R$ such that for all real numbers $x$ and $y$, $$f(x^2 + xy) = f(x)f(y) + yf(x) + xf(x+y).$$ [i]Proposed by Walther Janous, Austria[/i]

[b]p1.[/b] A right triangle has hypotenuse of length $12$ cm. The height corresponding to the right angle has length $7$ cm. Is this possible? [img]https://cdn.artofproblemsolving.com/attachments/0/e/3a0c82dc59097b814a68e1063a8570358222a6.png[/img] [b]p2.[/b] Prove that from any $5$ integers one can choose $3$ such that their sum is divisible by $3$. [b]p3.[/b] Two players play the following game on an $8\times 8$ chessboard. The first player can put a knight on an arbitrary square. Then the second player can put another knight on a free square that is not controlled by the first knight. Then the first player can put a new knight on a free square that is not controlled by the knights on the board. Then the second player can do the same, etc. A player who cannot put a new knight on the board loses the game. Who has a winning strategy? [b]p4.[/b] Consider a regular octagon $ABCDEGH$ (i.e., all sides of the octagon are equal and all angles of the octagon are equal). Show that the area of the rectangle $ABEF$ is one half of the area of the octagon. [img]https://cdn.artofproblemsolving.com/attachments/d/1/674034f0b045c0bcde3d03172b01aae337fba7.png[/img] [b]p5.[/b] Can you find a positive whole number such that after deleting the first digit and the zeros following it (if they are) the number becomes $24$ times smaller? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

For which real numbers $p$ does the equation $x^{2}+px+3p=0$ have integer solutions ?

The positive integers $a,b,c$ are less than $99$ and satisfy $a^2+b^2=c^2+99^2$. . Find the minimum and maximum value of $a+b+c$.

Solve : $y(x+y)^2=9 $ ; $y(x^3-y^3)=7$

Let $P(x)$ be a polynomial with integer coefficients. It is known that the number $\sqrt2+\sqrt3$ is its root. Prove that the number $\sqrt2-\sqrt3$ is also its root.

Let $\lfloor x \rfloor$ denote the greatest integer less than or equal to $x.$ Find the value of the sum \[ \left\lfloor 2+\frac{1}{2^{2021}} \right\rfloor+\left\lfloor 2+\frac{1}{2^{2020}} \right\rfloor+\cdots+\left\lfloor 2+\frac{1}{2^1} \right\rfloor+\left\lfloor 2+\frac{1}{2^0} \right\rfloor. \]

Find the area of a figure consisting of points whose coordinates satisfy the inequality $$(y^3 - arcsin x)(x^3 + arcsin y) \ge 0.$$

Let $ f(x) \equal{} \frac{x^2\plus{}1}{2x}$ for $ x \neq 0.$ Define $ f^{(0)}(x) \equal{} x$ and $ f^{(n)}(x) \equal{} f(f^{(n\minus{}1)}(x))$ for all positive integers $ n$ and $ x \neq 0.$ Prove that for all non-negative integers $ n$ and $ x \neq \{\minus{}1,0,1\}$ \[ \frac{f^{(n)}(x)}{f^{(n\plus{}1)}(x)} \equal{} 1 \plus{} \frac{1}{f \left( \left( \frac{x\plus{}1}{x\minus{}1} \right)^{2n} \right)}.\]

Find all pairs of integers $a,b$ for which there exists a polynomial $P(x) \in \mathbb{Z}[X]$ such that product $(x^2+ax+b)\cdot P(x)$ is a polynomial of a form \[ x^n+c_{n-1}x^{n-1}+\cdots+c_1x+c_0 \] where each of $c_0,c_1,\ldots,c_{n-1}$ is equal to $1$ or $-1$.

Let $n\geq 3$ be a natural number and $x\in \mathbb{R}$, for which $\{ x\} =\{ x^2\} =\{ x^n\} $ (with $\{ x\} $ we denote the fractional part of $x$). Prove that $x$ is an integer.

Suppose $\{a(n) \}_{n=1}^{\infty}$ is a sequence that: \[ a(n) =a(a(n-1))+a(n-a(n-1)) \ \ \ \forall \ n \geq 3\] and $a(1)=a(2)=1$. Prove that for each $n \geq 1$ , $a(2n) \leq 2a(n)$.

Determine all real numbers $x, y, z \in (0, 1)$ that satisfy simultaneously the conditions: $(x^2 + y^2)\sqrt{1- z^2}\ge z$ $(y^2 + z^2)\sqrt{1- x^2}\ge x$ $(z^2 + x^2)\sqrt{1- y^2}\ge y$

Consider all pairs of points $(a,b,c)$ and $(d,e, f )$ in the $3$-D coordinate system with $ad +be +c f = -2023$. What is the least positive integer that can be the distance between such a pair of points? [i]Proposed by William Hua[/i]

Let $a=\lfloor \sqrt{n} \rfloor$ for given positive integer $n.$ Express the summation $\sum_{k=1}^{n}\lfloor \sqrt{k} \rfloor$ in terms of $n$ and $a.$

Find the largest $a$ for which there exists a polynomial $$P(x) =a x^4 +bx^3 +cx^2 +dx +e$$ with real coefficients which satisfies $0\leq P(x) \leq 1$ for $-1 \leq x \leq 1.$

For coprime integers $m > n > 1$ consider the polynomials $f(x) = x^{m+n} -x^{m+1} -x+1$ and $g(x) = x^{m+n} +x^{n+1} -x+1$. If $f$ and $g$ have a common divisor of degree greater than $1$, find this divisor.

Let $n$ be a positive integer. Prove that $a_1!a_2! ... a_n! < k!$, where $k$ is an integer which is greater than the sum of the positive integers $a_1, a_2,.., a_n$.

(1) Let $x>0,\ y$ be real numbers. For variable $t$, find the difference of Maximum and minimum value of the quadratic function $f(t)=xt^2+yt$ in $0\leq t\leq 1$. (2) Let $S$ be the domain of the points $(x,\ y)$ in the coordinate plane forming the following condition: For $x>0$ and all real numbers $t$ with $0\leq t\leq 1$ , there exists real number $z$ for which $0\leq xt^2+yt+z\leq 1$ . Sketch the outline of $S$. (3) Let $V$ be the domain of the points $(x,\ y,\ z) $ in the coordinate space forming the following condition: For $0\leq x\leq 1$ and for all real numbers $t$ with $0\leq t\leq 1$, $0\leq xt^2+yt+z\leq 1$ holds. Find the volume of $V$. [i]2011 Tokyo University entrance exam/Science, Problem 6[/i]

Let $a$ be a positive integer. Prove that for any pair $(x,y)$ of integer solutions of equation $$x(y^2-2x^2)+x+y+a=0$$ we have: $$|x| \leqslant a+\sqrt{2a^2+2}$$

Prove: there are polynomials $S_1, S_2, \ldots$ in the variables $x_1, x_2, \ldots,y_1, y_2,\ldots$ with integer coefficients satisfying, for every integer $n \ge 1$, $$\sum_{d \mid n} d \cdot S_d ^{n/d}=\sum_{d \mid n} d \cdot (x_d ^{n/d}+y_d ^{n/d}) \quad (*)$$ Here, the sums run through the positive divisors $d$ of $n$. For example, the first two polynomials are $S_1 = x_1 + y_1$ and $S_2 = x_2 + y_2 - x_1y_1$, which verify identity $(*)$ for $n = 2$: $S_1^2 + 2S_2 = (x_1^2 + y_1^2) + 2 \cdot(x_2 + y_2)$.