[i]20 problems for 20 minutes.[/i] [b]p1.[/b] Evaluate $=\frac{1}{2 \cdot 3 \cdot 4}+\frac{1}{3 \cdot 4 \cdot 5}$. [b]p2.[/b] A regular hexagon and a regular $n$-sided polygon have the same perimeter. If the ratio of the side length of the hexagon to the side length of the $n$-sided polygon is $2 : 1$, what is $n$? [b]p3.[/b] How many nonzero digits are there in the decimal representation of $2 \cdot 10\cdot 500 \cdot 2500$? [b]p4.[/b] When the numerator of a certain fraction is increased by $2012$, the value of the fraction increases by $2$. What is the denominator of the fraction? [b]p5.[/b] Sam did the computation $1 - 10 \cdot a + 22$, where $a$ is some real number, except he messed up his order of operations and computed the multiplication last; that is, he found the value of $(1 - 10) \cdot (a + 22)$ instead. Luckily, he still ended up with the right answer. What is $a$? [b]p6.[/b] Let $n! = n \cdot(n-1) \cdot\cdot\cdot 2 \cdot 1$. For how many integers $n$ between $1$ and $100$ inclusive is $n!$ divisible by $36$? [b]p7.[/b] Simplify the expression $\sqrt{\frac{3 \cdot 27^3}{27 \cdot 3^3}}$ [b]p8.[/b] Four points $A,B,C,D$ lie on a line in that order such that $\frac{AB}{CB}=\frac{AD}{CD}$ . Let $M$ be the midpoint of segment $AC$. If $AB = 6$, $BC = 2$, compute $MB \cdot MD$. [b]p9.[/b] Allan has a deck with $8$ cards, numbered $1$, $1$, $2$, $2$, $3$, $3$, $4$, $4$. He pulls out cards without replacement, until he pulls out an even numbered card, and then he stops. What is the probability that he pulls out exactly $2$ cards? [b]p10.[/b] Starting from the sequence $(3, 4, 5, 6, 7, 8, ... )$, one applies the following operation repeatedly. In each operation, we change the sequence $$(a_1, a_2, a_3, ... , a_{a_1-1}, a_{a_1} , a_{a_1+1},...)$$ to the sequence $$(a_2, a_3, ... , a_{a_1} , a_1, a_{a_1+1}, ...) .$$ (In other words, for a sequence starting with$ x$, we shift each of the next $x-1$ term to the left by one, and put x immediately to the right of these numbers, and keep the rest of the terms unchanged. For example, after one operation, the sequence is $(4, 5, 3, 6, 7, 8, ... )$, and after two operations, the sequence becomes $(5, 3, 6, 4, 7, 8,... )$. How many operations will it take to obtain a sequence of the form $(7, ... )$ (that is, a sequence starting with $7$)? [b]p11.[/b] How many ways are there to place $4$ balls into a $4\times 6$ grid such that no column or row has more than one ball in it? (Rotations and reflections are considered distinct.) [b]p12.[/b] Point $P$ lies inside triangle $ABC$ such that $\angle PBC = 30^o$ and $\angle PAC = 20^o$. If $\angle APB$ is a right angle, find the measure of $\angle BCA$ in degrees. [b]p13.[/b] What is the largest prime factor of $9^3 - 4^3$? [b]p14.[/b] Joey writes down the numbers $1$ through $10$ and crosses one number out. He then adds the remaining numbers. What is the probability that the sum is less than or equal to $47$? [b]p15.[/b] In the coordinate plane, a lattice point is a point whose coordinates are integers. There is a pile of grass at every lattice point in the coordinate plane. A certain cow can only eat piles of grass that are at most $3$ units away from the origin. How many piles of grass can she eat? [b]p16.[/b] A book has 1000 pages numbered $1$, $2$, $...$ , $1000$. The pages are numbered so that pages $1$ and $2$ are back to back on a single sheet, pages $3$ and $4$ are back to back on the next sheet, and so on, with pages $999$ and $1000$ being back to back on the last sheet. How many pairs of pages that are back to back (on a single sheet) share no digits in the same position? (For example, pages $9$ and $10$, and pages $89$ and $90$.) [b]p17.[/b] Find a pair of integers $(a, b)$ for which $\frac{10^a}{a!}=\frac{10^b}{b!}$ and $a < b$. [b]p18.[/b] Find all ordered pairs $(x, y)$ of real numbers satisfying $$\begin{cases} -x^2 + 3y^2 - 5x + 7y + 4 = 0 \\ 2x^2 - 2y^2 - x + y + 21 = 0 \end{cases}$$ [b]p19.[/b] There are six blank fish drawn in a line on a piece of paper. Lucy wants to color them either red or blue, but will not color two adjacent fish red. In how many ways can Lucy color the fish? [b]p20.[/b] There are sixteen $100$-gram balls and sixteen $99$-gram balls on a table (the balls are visibly indistinguishable). You are given a balance scale with two sides that reports which side is heavier or that the two sides have equal weights. A weighing is defined as reading the result of the balance scale: For example, if you place three balls on each side, look at the result, then add two more balls to each side, and look at the result again, then two weighings have been performed. You wish to pick out two different sets of balls (from the $32$ balls) with equal numbers of balls in them but different total weights. What is the minimal number of weighings needed to ensure this? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

$a,b,c,d$ are positive reals with sum $1$. Show that $\frac{a^2}{a+b}+\frac{b^2}{b+c}+\frac{c^2}{c+d}+\frac{d^2}{d+a} \ge \frac{1}{2}$ with equality iff $a=b=c=d=\frac{1}{4}$.

The first three terms of an arithmetic sequence are $ 2x\minus{}3$, $ 5x\minus{}11$, and $ 3x\plus{}1$ respectively. The $ n$th term of the sequence is $ 2009$. What is $ n$? $ \textbf{(A)}\ 255 \qquad \textbf{(B)}\ 502 \qquad \textbf{(C)}\ 1004 \qquad \textbf{(D)}\ 1506 \qquad \textbf{(E)}\ 8037$

Find the greatest possible value of $pq + r$, where p, q, and r are (not necessarily distinct) prime numbers satisfying $pq + qr + rp = 2016$.

Let $ ABCD$ be a (not self-intersecting) quadrilateral satisfying $ \measuredangle DAB \equal{} \measuredangle BCD\neq 90^{\circ}$. Let $ X$ and $ Y$ be the orthogonal projections of the point $ D$ on the lines $ AB$ and $ BC$, and let $ Z$ and $ W$ be the orthogonal projections of the point $ B$ on the lines $ CD$ and $ DA$. Establish the following facts: [b]a)[/b] The quadrilateral $ XYZW$ is an isosceles trapezoid such that $ XY\parallel ZW$. [b]b)[/b] Let $ M$ be the midpoint of the segment $ AC$. Then, the lines $ XZ$ and $ YW$ pass through the point $ M$. [b]c)[/b] Let $ N$ be the midpoint of the segment $ BD$, and let $ X^{\prime}$, $ Y^{\prime}$, $ Z^{\prime}$, $ W^{\prime}$ be the midpoints of the segments $ AB$, $ BC$, $ CD$, $ DA$. Then, the point $ M$ lies on the circumcircles of the triangles $ W^{\prime}X^{\prime}N$ and $ Y^{\prime}Z^{\prime}N$. [hide="Notice"][i]Notice.[/i] This problem has been discussed at http://www.mathlinks.ro/Forum/viewtopic.php?t=172417 .[/hide]

We say that a positive integer is [i]decomposed [/i] if it is prime and also If a line is drawn separating it into two numbers, those two numbers are never composite. For example 1997 is [i]decomposed [/i] since it is prime, it is divided into: $1$, $997$; $19$, $97$; $199$, $7$ and none of those numbers are compound. How many [i]decomposed [/i] numbers are there between $2000$ and $3000$?

Given that $a_1, a_2, \ldots,a_{2020}$ are integers, find the maximal number of subsequences $a_i,a_{i+1}, ..., a_j$ ($0<i\leq j<2021$) with with sum $2021$

I have 6 friends and during a vacation I met them during several dinners. I found that I dined with all the 6 exactly on 1 day; with every 5 of them on 2 days; with every 4 of them on 3 days; with every 3 of them on 4 days; with every 2 of them on 5 days. Further every friend was present at 7 dinners and every friend was absent at 7 dinners. How many dinners did I have alone?

If 46 squares are colored red in a $9\times 9$ board, show that there is a $2\times 2$ block on the board in which at least 3 of the squares are colored red.

Find the lengths of the principal axes of the ellipsoid \[\sum_{i\le j}x_i x_j=1\]

A block $Z$ is formed by gluing one face of a solid cube with side length 6 onto one of the circular faces of a right circular cylinder with radius $10$ and height $3$ so that the centers of the square and circle coincide. If $V$ is the smallest convex region that contains Z, calculate $\lfloor\operatorname{vol}V\rfloor$ (the greatest integer less than or equal to the volume of $V$).

Let $P$ be a cyclic polygon with circumcenter $O$ that does not lie on any diagonal, and let $S$ be the set of points on 2D plane containing $P$ and $O$. The $\textit{Matcha Sweep Game}$ is a game between two players $A$ and $B$, with $A$ going first, such that each choosing a nonempty subset $T$ of points in $S$ that has not been previously chosen, and such that if $T$ has at least $3$ vertices then $T$ forms a convex polygon. The game ends with all points have been chosen, with the player picking the last point wins. For which polygons $P$ can $A$ guarantee a win? [i]Proposed by Anzo Teh Zhao Yang[/i]

Let $n$ be a nonnegative integer less than $2023$ such that $2n^2 + 3n$ is a perfect square. What is the sum of all possible $n$? [i]Proposed by Giacomo Rizzo[/i]

$\triangle ABC$, $AB>AC$. the incircle $I$ of $\triangle ABC$ meet $BC$ at point $D$, $AD$ meet $I$ again at $E$. $EP$ is a tangent of $I$, and $EP$ meet the extension line of $BC$ at $P$. $CF\parallel PE$, $CF\cap AD=F$. the line $BF$ meet $I$ at $M,N$, point $M$ is on the line segment $BF$, the line segment $PM$ meet $I$ again at $Q$. Show that $\angle ENP=\angle ENQ$

Find all positive integers $n$ for which the following statement holds: For any two polynomials $P(x)$ and $Q(x)$ of degree $n$ there exist monomials $ax^k$ and $bx^{ell}, 0 \le k,\ ell \le n$, such that the graphs of $P(x) + ax^k$ and $Q(x) + bx^{ell}$ have no common points.

Let $f(n)$ be the number of ways to write $n$ as a sum of powers of $2$, where we keep track of the order of the summation. For example, $f(4)=6$ because $4$ can be written as $4$, $2+2$, $2+1+1$, $1+2+1$, $1+1+2$, and $1+1+1+1$. Find the smallest $n$ greater than $2013$ for which $f(n)$ is odd.

Prove that a regular polygon with an odd number of edges cannot be partitioned into four pieces with equal areas by two lines that pass through the center of polygon.

Find all positive integers $(x, n)$ such that $x^{n}+2^{n}+1$ divides $x^{n+1}+2^{n+1}+1$.

We say that two sequences $x,y \colon \mathbb{N} \to \mathbb{N}$ are [i]completely different[/i] if $x_n \neq y_n$ holds for all $n\in \mathbb{N}$. Let $F$ be a function assigning a natural number to every sequence of natural numbers such that $F(x)\neq F(y)$ for any pair of completely different sequences $x$, $y$, and for constant sequences we have $F \left((k,k,\dots)\right)=k$. Prove that there exists $n\in \mathbb{N}$ such that $F(x)=x_{n}$ for all sequences $x$.

The average (arithmetic mean) age of a group consisting of doctors and lawyers in 40. If the doctors average 35 and the lawyers 50 years old, then the ratio of the numbers of doctors to the number of lawyers is $ \textbf{(A)}\ 3: 2 \qquad \textbf{(B)}\ 3: 1 \qquad \textbf{(C)}\ 2: 3 \qquad \textbf{(D)}\ 2: 1 \qquad \textbf{(E)}\ 1: 2$

Let $S$ be a set of positive integers such that $\lfloor \sqrt{x}\rfloor =\lfloor \sqrt{y}\rfloor $ for all $x, y \in S$. Show that the products $xy$, where $x, y \in S$, are pairwise distinct.

Let $\mathcal{S}$ be a set consisting of $n \ge 3$ positive integers, none of which is a sum of two other distinct members of $\mathcal{S}$. Prove that the elements of $\mathcal{S}$ may be ordered as $a_1, a_2, \dots, a_n$ so that $a_i$ does not divide $a_{i - 1} + a_{i + 1}$ for all $i = 2, 3, \dots, n - 1$.

A natural number $A$ is given. One may add to it one of its divisors $d$ ($1 < d < A$). One may then repeat this operation with the new number $A + d$ and so on. Prove that starting from $A = 4$ one can get any composite number by these operations. (M Vyalyi)

The bisectors of the angles $\angle{A},\angle{B},\angle{C}$ of a triangle $\triangle{ABC}$ intersect with the circumcircle $c_1(O,R)$ of $\triangle{ABC}$ at $A_2,B_2,C_2$ respectively.The tangents of $c_1$ at $A_2,B_2,C_2$ intersect each other at $A_3,B_3,C_3$ (the points $A_3,A$ lie on the same side of $BC$,the points $B_3,B$ on the same side of $CA$,and $C_3,C$ on the same side of $AB$).The incircle $c_2(I,r)$ of $\triangle{ABC}$ is tangent to $BC,CA,AB$ at $A_1,B_1,C_1$ respectively.Prove that $A_1A_2,B_1B_2,C_1C_2,AA_3,BB_3,CC_3$ are concurrent. [hide=Diagram][asy]import graph; size(11cm); real labelscalefactor = 0.5; /* changes label-to-point distance */ pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); /* default pen style */ pen dotstyle = black; /* point style */ real xmin = -9.26871978147865, xmax = 19.467150423463277, ymin = -6.150626456647122, ymax = 10.10782642246474; /* image dimensions */ pen aqaqaq = rgb(0.6274509803921569,0.6274509803921569,0.6274509803921569); pen uququq = rgb(0.25098039215686274,0.25098039215686274,0.25098039215686274); draw((1.0409487561836381,4.30054785243355)--(0.,0.)--(6.,0.)--cycle, aqaqaq); /* draw figures */ draw((1.0409487561836381,4.30054785243355)--(0.,0.), uququq); draw((0.,0.)--(6.,0.), uququq); draw((6.,0.)--(1.0409487561836381,4.30054785243355), uququq); draw(circle((3.,1.550104087253063), 3.376806580383107)); draw(circle((1.9303371951242874,1.5188413314630436), 1.5188413314630436)); draw((1.0226422135625703,7.734611112525813)--(1.0559139088339535,1.4932847901569466), linetype("2 2")); draw((-1.2916762981259242,-1.8267024931300444)--(1.0559139088339535,1.4932847901569466), linetype("2 2")); draw((-0.2820306621765219,2.344520485530311)--(1.0559139088339535,1.4932847901569466), linetype("2 2")); draw((1.0559139088339535,1.4932847901569466)--(5.212367857300808,4.101231513568902), linetype("2 2")); draw((1.0559139088339535,1.4932847901569466)--(3.,-1.8267024931300442), linetype("2 2")); draw((12.047991949367804,-1.8267024931300444)--(1.0559139088339535,1.4932847901569466), linetype("2 2")); draw((1.0226422135625703,7.734611112525813)--(-1.2916762981259242,-1.8267024931300444)); draw((-1.2916762981259242,-1.8267024931300444)--(12.047991949367804,-1.8267024931300444)); draw((12.047991949367804,-1.8267024931300444)--(1.0226422135625703,7.734611112525813)); /* dots and labels */ dot((1.0409487561836381,4.30054785243355),linewidth(3.pt) + dotstyle); label("$A$", (0.5889800538632699,4.463280489351154), NE * labelscalefactor); dot((0.,0.),linewidth(3.pt) + dotstyle); label("$B$", (-0.5723380089304358,-0.10096957139619551), NE * labelscalefactor); dot((6.,0.),linewidth(3.pt) + dotstyle); label("$C$", (6.233525986976863,0.06107480945873997), NE * labelscalefactor); label("$c_1$", (1.9663572911302232,5.111458012770896), NE * labelscalefactor); dot((3.,-1.8267024931300442),linewidth(3.pt) + dotstyle); label("$A_2$", (2.9386235762598374,-2.3155761097469805), NE * labelscalefactor); dot((5.212367857300808,4.101231513568902),linewidth(3.pt) + dotstyle); label("$B_2$", (5.315274495465561,4.274228711687063), NE * labelscalefactor); dot((-0.2820306621765219,2.344520485530311),linewidth(3.pt) + dotstyle); label("$C_2$", (-0.9234341674494632,2.6807922999468636), NE * labelscalefactor); dot((1.0226422135625703,7.734611112525813),linewidth(3.pt) + dotstyle); label("$A_3$", (1.1291279900463889,7.893219884113956), NE * labelscalefactor); dot((-1.2916762981259242,-1.8267024931300444),linewidth(3.pt) + dotstyle); label("$B_3$", (-1.8146782621516093,-1.4783468086631473), NE * labelscalefactor); dot((12.047991949367804,-1.8267024931300444),linewidth(3.pt) + dotstyle); label("$C_3$", (12.148145888182015,-1.6673985863272387), NE * labelscalefactor); dot((1.9303371951242874,1.5188413314630436),linewidth(3.pt) + dotstyle); label("$I$", (2.047379481557691,1.681518618008095), NE * labelscalefactor); dot((1.9303371951242878,0.),linewidth(3.pt) + dotstyle); label("$A_1$", (1.4532167517562602,-0.5600953171518461), NE * labelscalefactor); label("$c_2$", (1.5072315453745722,3.247947632939138), NE * labelscalefactor); dot((2.9254299438737803,2.666303492733126),linewidth(3.pt) + dotstyle); label("$B_1$", (2.8576013858323694,3.1129106488933584), NE * labelscalefactor); dot((0.45412477306806903,1.8761589424582812),linewidth(3.pt) + dotstyle); label("$C_1$", (0,2.3296961414278368), NE * labelscalefactor); dot((1.0559139088339535,1.4932847901569466),linewidth(3.pt) + dotstyle); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); /* end of picture */[/asy][/hide]

[b]p1.[/b] Let $S$ be the sum of the $99$ terms: $$(\sqrt1 + \sqrt2)^{-1},(\sqrt2 + \sqrt3)^{-1}, (\sqrt3 + \sqrt4)^{-1},..., (\sqrt{99} + \sqrt{100})^{-1}.$$ Prove that $S$ is an integer. [b]p2.[/b] Determine all pairs of positive integers $x$ and $y$ for which $N=x^4+4y^4$ is a prime. (Your work should indicate why no other solutions are possible.) [b]p3.[/b] Let $w,x,y,z$ be arbitrary positive real numbers. Prove each inequality: (a) $xy \le \left(\frac{x+y}{2}\right)^2$ (b) $wxyz \le \left(\frac{w+x+y+z}{4}\right)^4$ (c) $xyz \le \left(\frac{x+y+z}{3}\right)^3$ [b]p4.[/b] Twelve points $P_1$,$P_2$, $...$,$P_{12}$ are equally spaaed on a circle, as shown. Prove: that the chords $\overline{P_1P_9}$, $\overline{P_4P_{12}}$ and $\overline{P_2P_{11}}$ have a point in common. [img]https://cdn.artofproblemsolving.com/attachments/d/4/2eb343fd1f9238ebcc6137f7c84a5f621eb277.png[/img] [b]p5.[/b] Two very busy men, $A$ and $B$, who wish to confer, agree to appear at a designated place on a certain day, but no earlier than noon and no later than $12:15$ p.m. If necessary, $A$ will wait $6$ minutes for $B$ to arrive, while $B$ will wait $9$ minutes for $A$ to arrive but neither can stay past $12:15$ p.m. Express as a percent their chance of meeting. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].