Given that $x$ and $y$ are real numbers, compute the minimum value of $$x^4+4x^3+8x^2+4xy+6x+4y^2+10.$$

Jerry places at most one rook in each cell of a $2025 \times 2025$ grid of cells. A rook [i]attacks[/i] another rook if the two rooks are in the same row or column and there are no other rooks between them. Determine, with proof, the maximum number of rooks Jerry can place on the grid such that no rook attacks $4$ other rooks.

Let $P(x)=x^{2016}+2x^{2015}+...+2017,Q(x)=1399x^{1398}+...+2x+1$. Prove that there are strictly increasing sequances $a_i,b_i, i=1,...$ of positive integers such that $gcd(a_i,a_{i+1})=1$ for each $i$. Moreover, for each even $i$, $P(b_i) \nmid a_i, Q(b_i) | a_i$ and for each odd $i$, $P(b_i)|a_i,Q(b_i) \nmid a_i$ Proposed by [i]Shayan Talaei[/i]

In $ n$-dimensional Euclidean space, the union of any set of closed balls (of positive radii) is measurable in the sense of Lebesgue. [i]A. Csaszar[/i]

Prove that $$x\cos x \le \frac{\pi^2}{16}$$ for $0 \le x \le \frac{\pi}{2}$

The degree-$6$ polynomial $f$ satisfies $f(7) - f(1) = 1, f(8) - f(2) = 16, f(9) - f(3) = 81, f(10) - f(4) = 256$ and $f(11) - f(5) = 625.$ Compute $f(15) - f(-3).$

$2022$ points are arranged in a circle, one of which is colored in black, and others in white. In one operation, The Hedgehog can do one of the following actions: 1) Choose two adjacent points of the same color and flip the color of both of them (white becomes black, black becomes white) 2) Choose two points of opposite colors with exactly one point in between them, and flip the color of both of them Is it possible to achieve a configuration where each point has a color opposite to its initial color with these operations? [i](Proposed by Oleksii Masalitin)[/i]

Let $p$ be a prime and suppose $2^{2p} \equiv 1 (\text{mod}$ $ 2p+1)$ is prime. Prove that $2p+1$ is prime$^{1}$ [size=75]$^{1}$This is a special case of Pocklington's theorem. A proof of this special case is required.[/size]

A certain college student had the night of February 23 to work on a chemistry problem set and a math problem set (both due on February 24, 2006). If the student worked on his problem sets in the math library, the probability of him finishing his math problem set that night is 95% and the probability of him finishing his chemistry problem set that night is 75%. If the student worked on his problem sets in the the chemistry library, the probability of him finishing his chemistry problem set that night is 90% and the probability of him finishing his math problem set that night is 80%. Since he had no bicycle, he could only work in one of the libraries on February 23rd. He works in the math library with a probability of 60%. Given that he finished both problem sets that night, what is the probability that he worked on the problem sets in the math library?

Let $n\geq 2$ be an integer and let $a_1, a_2, \ldots, a_n$ be positive real numbers with sum $1$. Prove that $$\sum_{k=1}^n \frac{a_k}{1-a_k}(a_1+a_2+\cdots+a_{k-1})^2 < \frac{1}{3}.$$

Consider a regular $24$-gon $\mathcal{P}.$ A quadrilateral is said to be inscribed in $\mathcal{P}$ if its vertices are among those of $\mathcal{P}.$ We consider two inscribed quadrilaterals equivalent if one can be obtained from the other via a rotation about the center of $\mathcal{P}.$ How many distinct (i.e. not equivalent) quadrilaterals can be inscribed in $\mathcal{P}$?

The coefficient of $x^7$ in the expansion of $(\frac{x^2}{2}-\frac{2}{x})^8$ is: $ \textbf{(A)}\ 56\qquad\textbf{(B)}\ -56\qquad\textbf{(C)}\ 14\qquad\textbf{(D)}\ -14\qquad\textbf{(E)}\ 0 $

[b]p1.[/b] Let $x_1 = 0$, $x_2 = 1/2$ and for $n >2$, let $x_n$ be the average of $x_{n-1}$ and $x_{n-2}$. Find a formula for $a_n = x_{n+1} - x_{n}$, $n = 1, 2, 3, \dots$. Justify your answer. [b]p2.[/b] Given a triangle $ABC$. Let $h_a, h_b, h_c$ be the altitudes to its sides $a, b, c,$ respectively. Prove: $\frac{1}{h_a}+\frac{1}{h_b}>\frac{1}{h_c}$ Is it possible to construct a triangle with altitudes $7$, $11$, and $20$? Justify your answer. [b]p3.[/b] Does there exist a polynomial $P(x)$ with integer coefficients such that $P(0) = 1$, $P(2) = 3$ and $P(4) = 9$? Justify your answer. [b]p4.[/b] Prove that if $\cos \theta$ is rational and $n$ is an integer, then $\cos n\theta$ is rational. Let $\alpha=\frac{1}{2010}$. Is $\cos \alpha $ rational ? Justify your answer. [b]p5.[/b] Let function $f(x)$ be defined as $f(x) = x^2 + bx + c$, where $b, c$ are real numbers. (A) Evaluate $f(1) -2f(5) + f(9)$ . (B) Determine all pairs $(b, c)$ such that $|f(x)| \le 8$ for all $x$ in the interval $[1, 9]$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Sasha has $10$ cards with numbers $1, 2, 4, 8,\ldots, 512$. He writes the number $0$ on the board and invites Dima to play a game. Dima tells the integer $0 < p < 10, p$ can vary from round to round. Sasha chooses $p$ cards before which he puts a “$+$” sign, and before the other cards he puts a “$-$" sign. The obtained number is calculated and added to the number on the board. Find the greatest absolute value of the number on the board Dima can get on the board after several rounds regardless Sasha’s moves.

Prove that there exists an innite sequence $<a_n>$ of positive integers such that for each $k \ge 1$ $(a_1 - 1)(a_2 - 1)(a_3 -1)...(a_k - 1)$ divides $a_1a_2a_3 ...a_k + 1$.

Let $ I $ be the incenter of triangle $ ABC $. The incircle touches $ BC, CA, AB$ at points $ P, Q, R $. A circle passing through $ B , C $ is tangent to the circle $I$ at point $ X $, a circle passing through $ C , A $ is tangent to the circle $I$ at point $ Y $, and a circle passing through $ A , B $ is tangent to the circle $I$ at point $ Z $, respectively. Prove that three lines $ PX, QY, RZ $ are concurrent.

[b]p1.[/b] Calculate $\left( \frac12 + \frac13 + \frac14 \right)^2$. [b]p2.[/b] Find the $2010^{th}$ digit after the decimal point in the expansion of $\frac17$. [b]p3.[/b] If you add $1$ liter of water to a solution consisting of acid and water, the new solutions will contain of $30\%$ water. If you add another $5$ liters of water to the new solution, it will contain $36\frac{4}{11}\%$ water. Find the number of liters of acid in the original solution. [b]p4.[/b] John places $5$ indistinguishable blue marbles and $5$ indistinguishable red marbles into two distinguishable buckets such that each bucket has at least one blue marble and one red marble. How many distinguishable marble distributions are possible after the process is completed? [b]p5.[/b] In quadrilateral $PEAR$, $PE = 21$, $EA = 20$, $AR = 15$, $RE = 25$, and $AP = 29$. Find the area of the quadrilateral. [b]p6.[/b] Four congruent semicircles are drawn within the boundary of a square with side length $1$. The center of each semicircle is the midpoint of a side of the square. Each semicircle is tangent to two other semicircles. Region $R$ consists of points lying inside the square but outside of the semicircles. The area of $R$ can be written in the form $a - b\pi$, where $a$ and $b$ are positive rational numbers. Compute $a + b$. [b]p7.[/b] Let $x$ and $y$ be two numbers satisfying the relations $x\ge 0$, $y\ge 0$, and $3x + 5y = 7$. What is the maximum possible value of $9x^2 + 25y^2$? [b]p8.[/b] In the Senate office in Exie-land, there are $6$ distinguishable senators and $6$ distinguishable interns. Some senators and an equal number of interns will attend a convention. If at least one senator must attend, how many combinations of senators and interns can attend the convention? [b]p9.[/b] Evaluate $(1^2 - 3^2 + 5^2 - 7^2 + 9^2 - ... + 2009^2) -(2^2 - 4^2 + 6^2 - 8^2 + 10^2- ... + 2010^2)$. [b]p10.[/b] Segment $EA$ has length $1$. Region $R$ consists of points $P$ in the plane such that $\angle PEA \ge 120^o$ and $PE <\sqrt3$. If point $X$ is picked randomly from the region$ R$, the probability that $AX <\sqrt3$ can be written in the form $a - \frac{\sqrt{b}}{c\pi}$ , where $a$ is a rational number, $b$ and $c$ are positive integers, and $b$ is not divisible by the square of a prime. Find the ordered triple $(a, b, c)$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $a_0,a_1,\ldots$ be a sequence of positive integers with $a_0=1$, $a_1=2$ and \[a_n = a_{n-1}^{a_{n-1}a_{n-2}}-1\] for all $n\geq 2$. Show that if $p$ is a prime less than $2^k$ for some positive integer $k$, then there exists $n\leq k+1$ such that $p\mid a_n$.

$\angle{A}$ is the least angle in $\Delta{ABC}$. Point $D$ is on the arc $BC$ from the circumcircle of $\Delta{ABC}$. The perpendicular bisectors of the segments $AB,AC$ intersect the line $AD$ at $M,N$, respectively. Point $T$ is the meet point of $BM,CN$. Suppose that $R$ is the radius of the circumcircle of $\Delta{ABC}$. Prove that: \[ BT+CT\leq{2R}. \]

Given two circles $(O_1)$ and $(O_2)$ intersect at $A$ and $B$. Let $d_1$ and $d_2$ be two lines through $A$ and be symmetric with respect to $AB$. The line $d_1$ cuts $(O_1)$ and $(O_2)$ at $G, E$ ($\ne A$), respectively, the line $d_2$ cuts $(O_1)$ and $(O_2)$ at $F, H$ ($\ne A$), respectively, such that $E$ is between $A, G$ and $F$ is between $A, H$. Let $J$ be the intersection of $EH$ and $FG$. The line $BJ$ cuts $(O_1), (O_2)$ at $K, L$ ($\ne B$), respectively. Let $N$ be the intersection of $O_1K$ and $O_2L$. Prove that the circle $(NLK)$ is tangent to $AB$.

Consider a $100\times 100$ square unit lattice $\textbf{L}$ (hence $\textbf{L}$ has $10000$ points). Suppose $\mathcal{F}$ is a set of polygons such that all vertices of polygons in $\mathcal{F}$ lie in $\textbf{L}$ and every point in $\textbf{L}$ is the vertex of exactly one polygon in $\mathcal{F}.$ Find the maximum possible sum of the areas of the polygons in $\mathcal{F}.$ [i]Michael Ren and Ankan Bhattacharya, USA[/i]

Let a regular polygon with $p$ vertices be given, where $p$ is an odd prime number. At every vertex there is one monkey. An owner of monkeys takes $p$ peanuts, goes along the perimeter of polygon clockwise and delivers to the monkeys by the following rule: Gives the first peanut for the leader, skips the two next vertices and gives the second peanut to the monkey at the next vertex; skip four next vertices gives the second peanut for the monkey at the next vertex ... after giving the $k$-th peanut, he skips the $2 \cdot k$ next vertices and gives $k+1$-th for the monkey at the next vertex. He does so until all $p$ peanuts are delivered. [b]I.[/b] How many monkeys are there which does not receive peanuts? [b]II.[/b] How many edges of polygon are there which satisfying condition: both two monkey at its vertex received peanut(s)?

We are given $2001$ balloons and a positive integer $k$. Each balloon has been blown up to a certain size (not necessarily the same for each balloon). In each step it is allowed to choose at most $k$ balloons and equalize their sizes to their arithmetic mean. Determine the smallest value of $k$ such that, whatever the initial sizes are, it is possible to make all the balloons have equal size after a finite number of steps.

$ABC$ is an acute triangle with orthocenter $H$. Points $D$ and $E$ lie on segment $BC$. Circumcircle of $\triangle BHC$ instersects with segments $AD$,$AE$ at $P$ and $Q$, respectively. Prove that if $BD^2+CD^2=2DP\cdot DA$ and $BE^2+CE^2=2EQ\cdot EA$, then $BP=CQ$.

What is the smallest prime number $p$ such that $1+p+p^2+\ldots+p^{p-1}$ is [i]not[/i] prime? [i]2019 CCA Math Bonanza Lightning Round #1.4[/i]