Point $P$ lies inside of parallelogram $ABCD$. Perpendicular lines to $PA,PB,PC$ and $PD$ through $A,B,C$ and $D$ construct convex quadrilateral $XYZT$. Prove that $S_{XYZT}\geq 2S_{ABCD}$. [i]Proposed by Siamak Ahmadpour[/i]

Prove that if a natural number $n$ is greater than $4$ and is not a prime number, then the produxt of the consecutive natural numbers from $1$ to $n-1$ is divisible by $ n$.

Evaluate $\int_0^1 \frac{x^2+x+1}{x^4+x^3+x^2+x+1}\ dx.$

[b]p1.[/b] Prair takes some set $S$ of positive integers, and for each pair of integers she computes the positive difference between them. Listing down all the numbers she computed, she notices that every integer from $1$ to $10$ is on her list! What is the smallest possible value of $|S|$, the number of elements in her set $S$? [b]p2.[/b] Jake has $2021$ balls that he wants to separate into some number of bags, such that if he wants any number of balls, he can just pick up some bags and take all the balls out of them. What is the least number of bags Jake needs? [b]p3.[/b] Claire has stolen Cat’s scooter once again! She is currently at (0; 0) in the coordinate plane, and wants to ride to $(2, 2)$, but she doesn’t know how to get there. So each second, she rides one unit in the positive $x$ or $y$-direction, each with probability $\frac12$ . If the probability that she makes it to $(2, 2)$ during her ride can be expressed as $\frac{a}{b}$ for positive integers $a, b$ with $gcd(a, b) = 1$, then find $a + b$. [b]p4.[/b] Triangle $ABC$ with $AB = BC = 6$ and $\angle ABC = 120^o$ is rotated about $A$, and suppose that the images of points $B$ and $C$ under this rotation are $B'$ and $C'$, respectively. Suppose that $A$, $B'$ and $C$ are collinear in that order. If the area of triangle $B'CC'$ can be expressed as $a - b\sqrt{c}$ for positive integers $a, b, c$ with csquarefree, find $a + b + c$. [b]p5.[/b] Find the sum of all possible values of $a + b + c + d$ if $a, b, c, $d are positive integers satisfying $$ab + cd = 100,$$ $$ac + bd = 500.$$ [b]p6.[/b] Alex lives in Chutes and Ladders land, which is set in the coordinate plane. Each step they take brings them one unit to the right or one unit up. However, there’s a chute-ladder between points $(1, 2)$ and $(2, 0)$ and a chute-ladder between points $(1, 3)$ and $(4, 0)$, whenever Alex visits an endpoint on a chute-ladder, they immediately appear at the other endpoint of that chute-ladder! How many ways are there for Alex to go from $(0, 0)$ to $(4, 4)$? [b]p7.[/b] There are $8$ identical cubes that each belong to $8$ different people. Each person randomly picks a cube. The probability that exactly $3$ people picked their own cube can be written as $\frac{a}{b}$ , where $a$ and $b$ are positive integers with $gcd(a, b) = 1$. Find $a + b$. [b]p8.[/b] Suppose that $p(R) = Rx^2 + 4x$ for all $R$. There exist finitely many integer values of $R$ such that $p(R)$ intersects the graph of $x^3 + 2021x^2 + 2x + 1$ at some point $(j, k)$ for integers $j$ and $k$. Find the sum of all possible values of $R$. [b]p9.[/b] Let $a, b, c$ be the roots of the polynomial $x^3 - 20x^2 + 22$. Find $\frac{bc}{a^2} +\frac{ac}{b^2} +\frac{ab}{c^2}$. [b]p10.[/b] In any finite grid of squares, some shaded and some not, for each unshaded square, record the number of shaded squares horizontally or vertically adjacent to it, this grid’s score is the sum of all numbers recorded this way. Deyuan shades each square in a blank $n \times n$ grid with probability $k$; he notices that the expected value of the score of the resulting grid is equal to $k$, too! Given that $k > 0.9999$, find the minimum possible value of $n$. [b]p11.[/b] Find the sum of all $x$ from $2$ to $1000$ inclusive such that $$\prod^x_{n=2} \log_{n^n}(n + 1)^{n+2}$$ is an integer. [b]p12.[/b] Let triangle $ABC$ with incenter $I$ and circumcircle $\Gamma$ satisfy $AB = 6\sqrt3$, $BC = 14$, and $CA = 22$. Construct points $P$ and $Q$ on rays $BA$ and $CA$ such that $BP = CQ = 14$. Lines $PI$ and $QI$ meet the tangents from $B$ and $C$ to $\Gamma$, respectively, at points $X$ and $Y$ . If $XY$ can be expressed as $a\sqrt{b}-c$ for positive integers $a, b, c$ with $c$ squarefree, find $a + b + c$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $ABCDE$ be a convex pentagon such that $AB=BC=CD$, $\angle{EAB}=\angle{BCD}$, and $\angle{EDC}=\angle{CBA}$. Prove that the perpendicular line from $E$ to $BC$ and the line segments $AC$ and $BD$ are concurrent.

(Game) At the beginning of the game, the organisers place paper disks on the table, grouped into piles which may contain various numbers of disks. The two players take turns. On a player’s turn, their opponent selects two piles (one if there is only one pile left), and the player must remove some number of disks from one of the piles selected. This means that at least one disk has to be removed, and removing all disks in the pile is also permitted. The player removing the last disk from the table wins. [i]Defeat the organisers in this game twice in a row! A starting position will be given and then you can decide whether you want to go first or second.[/i]

Let $\Gamma$ consist of all polynomials in $x$ with integer coefficients. For $f$ and $g$ in $\Gamma$ and $m$ a positive integer, let $f \equiv g \pmod{m}$ mean that every coefficient of $f-g$ is an integral multiple of $m$. Let $n$ and $p$ be positive integers with $p$ prime. Given that $f,g,h,r$ and $s$ are in $\Gamma$ with $rf+sg\equiv 1 \pmod{p}$ and $fg \equiv h \pmod{p}$, prove that there exist $F$ and $G$ in $\Gamma$ with $F \equiv f \pmod{p}$, $G \equiv g \pmod{p}$, and $FG \equiv h \pmod{p^n}$.

In an acute triangle $ ABC$ segments $ BE$ and $ CF$ are altitudes. Two circles passing through the point $ A$ and $ F$ and tangent to the line $ BC$ at the points $ P$ and $ Q$ so that $ B$ lies between $ C$ and $ Q$. Prove that lines $ PE$ and $ QF$ intersect on the circumcircle of triangle $ AEF$. [i]Proposed by Davood Vakili, Iran[/i]

Let $f:\mathbb{R}\backslash0 \rightarrow \mathbb{R}\backslash0$ be a non-constant, continuous function defined such that $f(3^x2^y)=\frac{y}{x}f(3^y)$ for any $x,y \neq 0.$ Compute $\frac{f(1296)}{f(6)}.$ [i]Proposed by Richard Chen and Zachary Perry[/i]

The square $ABCD$ has side length $1$. The point $E$ lies on the side $CD$. The line through $A$ and $E$ intersects the line through $B$ and $C$ at the point $F$. Prove that $$\frac{1}{|AE|^2}+\frac{1}{|AF|^2}= 1.$$ [img]https://cdn.artofproblemsolving.com/attachments/5/8/4e803eb7748f7a72783065717044cfc06f565f.png[/img]

Simon draws some line segments on the face of a regular polygon, dissecting it into exactly $2021$ triangles, such that no two drawn line segments are collinear, and no two triangles share a pair of vertices. Simon then assigns each drawn line segment and each side of the polygon with one of three colours. Prove that there is some triangle in the dissection with a pair of identically-coloured sides.

Let $a,b\in\mathbb{N}$ such that : \[ ab(a-b)\mid a^3+b^3+ab \] Then show that $\operatorname{lcm}(a,b)$ is a perfect square.

Let $O_n$ be the $n$-dimensional vector $(0,0,\cdots, 0)$. Let $M$ be a $2n \times n$ matrix of complex numbers such that whenever $(z_1, z_2, \dots, z_{2n})M = O_n$, with complex $z_i$, not all zero, then at least one of the $z_i$ is not real. Prove that for arbitrary real numbers $r_1, r_2, \dots, r_{2n}$, there are complex numbers $w_1, w_2, \dots, w_n$ such that \[ \mathrm{re}\left[ M \left( \begin{array}{c} w_1 \\ \vdots \\ w_n \end{array} \right) \right] = \left( \begin{array}{c} r_1 \\ \vdots \\ r_n \end{array} \right). \] (Note: if $C$ is a matrix of complex numbers, $\mathrm{re}(C)$ is the matrix whose entries are the real parts of the entries of $C$.)

Let $V=[(x,y,z)|0\le x,y,z\le 2008]$ be a set of points in a 3-D space. If the distance between two points is either $1, \sqrt{2}, 2$, we color the two points differently. How many colors are needed to color all points in $V$?

Let a, b, c be the sidelengths and S the area of a triangle ABC. Denote $x=a+\frac{b}{2}$, $y=b+\frac{c}{2}$ and $z=c+\frac{a}{2}$. Prove that there exists a triangle with sidelengths x, y, z, and the area of this triangle is $\geq\frac94 S$.

Consider the set of numbers $\{1,10,10^2,10^3, ... 10^{10} \}$. The ratio of the largest element of the set to the sum of the other ten elements of the set is closest to which integer? $ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 9 \qquad \textbf{(C)}\ 10 \qquad \textbf{(D)}\ 11 \qquad \textbf{(E)}\ 101 $

Given an integer $n\geq 3$, determine the smallest positive number $k$ such that any two points in any $n$-gon (or at its boundary) in the plane can be connected by a polygonal path consisting of $k$ line segments contained in the $n$-gon (including its boundary).

Find the maximum number of subsets from $\left \{ 1,...,n \right \}$ such that for any two of them like $A,B$ if $A\subset B$ then $\left | B-A \right |\geq 3$. (Here $\left | X \right |$ is the number of elements of the set $X$.)

Determine the minimum possible amount of distinct prime divisors of $19^{4n}+4$, for a positive integer $n$.

A [i]Benelux n-square[/i] (with $n\geq 2$) is an $n\times n$ grid consisting of $n^2$ cells, each of them containing a positive integer, satisfying the following conditions: $\bullet$ the $n^2$ positive integers are pairwise distinct. $\bullet$ if for each row and each column we compute the greatest common divisor of the $n$ numbers in that row/column, then we obtain $2n$ different outcomes. (a) Prove that, in each Benelux n-square (with $n \geq 2$), there exists a cell containing a number which is at least $2n^2.$ (b) Call a Benelux n-square [i]minimal[/i] if all $n^2$ numbers in the cells are at most $2n^2.$ Determine all $n\geq 2$ for which there exists a minimal Benelux n-square.

Given a sequence $a_n$: \[ 1, 2, 2, 3, 3, 3, 4, 4, 4, 4, \dots \] (one '1', two '2' and so on) and another sequence $b_n$ such that $a_{b_n}=b_{a_n}$ for all positive integers $n$. It is known that $b_k=1$ for some $k>100$. Prove that $b_m=1$ for all $m>k$.

Determine all polynomials $P(x)$ with real coefficients such that $(x+1)P(x-1)-(x-1)P(x)$ is a constant polynomial.

A gas diffuses one-third as fast as $\ce{O2}$ at $100^{\circ}\text{C}$. This gas could be: $ \textbf{(A)}\hspace{.05in}\text{He (M=4)}\qquad\textbf{(B)}\hspace{.05in}\ce{C2H5F}(\text{M=48})$ $\qquad\textbf{(C)}\hspace{.05in}\ce{C7H12}\text{(M=96)}\qquad\textbf{(D)}\hspace{.05in}\ce{C5F12}\text{(M=288)}\qquad$

If $x$ and $y$ are positive integers, and $x^4+y^4=4721$, find all possible values of $x+y$

How many solutions does the equation system \[\dfrac{x-1}{xy-3}=\dfrac{3-x-y}{7-x^2-y^2} = \dfrac{y-2}{xy-4}\] have? $ \textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ 3 \qquad\textbf{(E)}\ 4 $