[b]p1.[/b] What is the last digit of $$1! + 2! + ... + 10!$$ where $n!$ is defined to equal $1 \cdot 2 \cdot ... \cdot n$? [b]p2.[/b] What pair of positive real numbers, $(x, y)$, satisfies $$x^2y^2 = 144$$ $$(x - y)^3 = 64?$$ [b]p3.[/b] Paul rolls a standard $6$-sided die, and records the results. What is the probability that he rolls a $1$ ten times before he rolls a $6$ twice? [b]p4.[/b] A train is approaching a $1$ kilometer long tunnel at a constant $40$ km/hr. It so happens that if Roger, who is inside, runs towards either end of the tunnel at a contant $10$ km/hr, he will reach that end at the exact same time as the train. How far from the center of the tunnel is Roger? [b]p5.[/b] Let $ABC$ be a triangle with $A$ being a right angle. Let $w$ be a circle tangent to $\overline{AB}$ at $A$ and tangent to $\overline{BC}$ at some point $D$. Suppose $w$ intersects $\overline{AC}$ again at $E$ and that $\overline{CE} = 3$, $\overline{CD} = 6$. Compute $\overline{BD}$. [b]p6.[/b] In how many ways can $1000$ be written as a sum of consecutive integers? [b]p7.[/b] Let $ABC$ be an isosceles triangle with $\overline{AB} = \overline{AC} = 10$ and $\overline{BC} = 6$. Let $M$ be the midpoint of $\overline{AB}$, and let $\ell$ be the line through $A$ parallel to $\overline{BC}$. If $\ell$ intersects the circle through $A$, $C$ and $M$ at $D$, then what is the length of $\overline{AD}$? [b]p8.[/b] How many ordered triples of pairwise relatively prime, positive integers, $\{a, b, c\}$, have the property that $a + b$ is a multiple of $c$, $b + c$ is a multiple of $a$, and $a + c$ is a multiple of $b$? [b]p9.[/b] Consider a hexagon inscribed in a circle of radius $r$. If the hexagon has two sides of length $2$, two sides of length $7$, and two sides of length $11$, what is $r$? [b]p10.[/b] Evaluate $$\sum^{\infty}_{i=0} \sum^{\infty}_{j=0} \frac{\left( (-1)^i + (-1)^j\right) \cos (i) \sin (j)}{i!j!} ,$$ where angles are measured in degrees, and $0!$ is defined to equal $1$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Suppose that a sequence $a_1,a_2,\ldots$ of positive real numbers satisfies \[a_{k+1}\geq\frac{ka_k}{a_k^2+(k-1)}\] for every positive integer $k$. Prove that $a_1+a_2+\ldots+a_n\geq n$ for every $n\geq2$.

The sum of several consecutive natural numbers is $20$ times greater than the largest of them and $30$ times greater than the smallest. Find these numbers.

The sequence of polynomials $ \left\{P_n(x)\right\}_{n\equal{}0}^{\plus{}\infty}$ is defined inductively by $ P_0(x) \equal{} 0$ and $ P_{n\plus{}1}(x) \equal{} P_n(x)\plus{}\frac{x \minus{} P_n^2(x)}{2}$. Prove that for any $ x \in [0, 1]$ and any natural number $ n$ it holds that $ 0\le\sqrt x\minus{} P_n(x)\le\frac{2}{n \plus{} 1}$.

A sequence $(a_n)_0^N$ of real numbers is called concave if $2a_n\ge a_{n-1} + a_{n+1}$ for all integers $n, 1 \le n \le N - 1$. $(a)$ Prove that there exists a constant $C >0$ such that \[\left(\displaystyle\sum_{n=0}^{N}a_n\right)^2\ge C(N - 1)\displaystyle\sum_{n=0}^{N}a_n^2\:\:\:\:\:(1)\] for all concave positive sequences $(a_n)^N_0$ $(b)$ Prove that $(1)$ holds with $C = \frac{3}{4}$ and that this constant is best possible.

Problem Shortlist BMO 2017 Let $ a $,$ b$,$ c$, be positive real numbers such that $abc= 1 $. Prove that $$\frac{1}{a^{5}+b^{5}+c^{2}}+\frac{1}{b^{5}+c^{5}+a^{2}}+\frac{1}{c^{5}+b^{5}+b^{2}}\leq 1 . $$

For a natural number $ n\ge 2, $ calculate the integer part of $ \sqrt[n]{1+n}-\sqrt {2/n} . $ [i]Dan Nedeianu[/i]

Let $a$ be some integer. Prove that the polynomial $x^4(x-a)^4+1$ can not be a product of two non-constant polynomials with integer coefficients

A sequence of integers $a_{1}, a_{2}, \cdots$ is called $good$ if: • $a_{1}=1$, and; • $a_{i+1}-a_{i}$ is either $1$ or $2$ for all $i \geq 1$. Find all positive integers n that cannot be written as a sum $n = a_{1} + a_{2} + \cdots + a_{k}$, such that the integers $a_{1} , a_{2} , \cdots , a_{k}$ forms a good sequence.

[b]p1.[/b] Susan plays a game in which she rolls two fair standard six-sided dice with sides labeled one through six. She wins if the number on one of the dice is three times the number on the other die. If Susan plays this game three times, compute the probability that she wins at least once. [b]p2.[/b] In triangles $\vartriangle ABC$ and $\vartriangle DEF$, $DE = 4AB$, $EF = 4BC$, and $FD = 4CA$. The area of $\vartriangle DEF$ is $360$ units more than the area of $\vartriangle ABC$. Compute the area of $\vartriangle ABC$. [b]p3.[/b] Andy has $2010$ square tiles, each of which has a side length of one unit. He plans to arrange the tiles in an $m\times n$ rectangle, where $mn = 2010$. Compute the sum of the perimeters of all of the different possible rectangles he can make. Two rectangles are considered to be the same if one can be rotated to become the other, so, for instance, a $1\times 2010$ rectangle is considered to be the same as a $2010\times 1$ rectangle. [b]p4.[/b] Let $$S = \log_2 9 \log_3 16 \log_4 25 ... \log_{999} 1000000.$$ Compute the greatest integer less than or equal to $\log_2 S$. [b]p5.[/b] Let $A$ and $B$ be fixed points in the plane with distance $AB = 1$. An ant walks on a straight line from point $A$ to some point $C$ in the plane and notices that the distance from itself to B always decreases at any time during this walk. Compute the area of the region in the plane containing all points where point $C$ could possibly be located. [b]p6.[/b] Lisette notices that $2^{10} = 1024$ and $2^{20} = 1 048 576$. Based on these facts, she claims that every number of the form $2^{10k}$ begins with the digit $1$, where k is a positive integer. Compute the smallest $k$ such that Lisette's claim is false. You may or may not find it helpful to know that $ln 2 \approx 0.69314718$, $ln 5 \approx 1.60943791$, and $log_{10} 2 \approx 0:30103000$. [b]p7.[/b] Let $S$ be the set of all positive integers relatively prime to $6$. Find the value of $\sum_{k\in S}\frac{1}{2^k}$ . [b]p8.[/b] Euclid's algorithm is a way of computing the greatest common divisor of two positive integers $a$ and $b$ with $a > b$. The algorithm works by writing a sequence of pairs of integers as follows. 1. Write down $(a, b)$. 2. Look at the last pair of integers you wrote down, and call it $(c, d)$. $\bullet$ If $d \ne 0$, let r be the remainder when c is divided by d. Write down $(d, r)$. $\bullet$ If $d = 0$, then write down c. Once this happens, you're done, and the number you just wrote down is the greatest common divisor of a and b. 3. Repeat step 2 until you're done. For example, with $a = 7$ and $b = 4$, Euclid's algorithm computes the greatest common divisor in $4$ steps: $$(7, 4) \to (4, 3) \to (3, 1) \to (1, 0) \to 1$$ For $a > b > 0,$ compute the least value of a such that Euclid's algorithm takes $10$ steps to compute the greatest common divisor of $a$ and $b$. [b]p9.[/b] Let $ABCD$ be a square of unit side length. Inscribe a circle $C_0$ tangent to all of the sides of the square. For each positive integer $n$, draw a circle Cn that is externally tangent to $C_{n-1}$ and also tangent to sides $AB$ and $AD$. Suppose $r_i$ is the radius of circle $C_i$ for every nonnegative integer $i$. Compute $\sqrt[200]{r_0/r_{100}}$. [b]p10.[/b] Rachel and Mike are playing a game. They start at $0$ on the number line. At each positive integer on the number line, there is a carrot. At the beginning of the game, Mike picks a positive integer $n$ other than $30$. Every minute, Rachel moves to the next multiple of $30$ on the number line that has a carrot on it and eats that carrot. At the same time, every minute, Mike moves to the next multiple of $n$ on the number line that has a carrot on it and eats that carrot. Mike wants to pick an $n$ such that, as the game goes on, he is always within $1000$ units of Rachel. Compute the average (arithmetic mean) of all such $n$. [b]p11.[/b] Darryl has a six-sided die with faces $1, 2, 3, 4, 5, 6$. He knows the die is weighted so that one face comes up with probability $1/2$ and the other five faces have equal probability of coming up. He unfortunately does not know which side is weighted, but he knows each face is equally likely to be the weighted one. He rolls the die 5 times and gets a $1$, $2$, $3$, $4$ and $5$ in some unspecified order. Compute the probability that his next roll is a $6$. [b]p12.[/b] Let $F_0 = 1$, $F_1 = 1$ and $F_k = F_{k-1} + F_{k-2}$. Let $P(x) =\sum^{99}_{k=0} x^{F_k}$ . The remainder when $P(x)$ is divided by $x^3 - 1$ can be expressed as $ax^2 + bx + c$. Find $2a + b$. [b]p13.[/b] Let $\theta \ne 0$ be the smallest acute angle for which $\sin \theta$, $\sin (2\theta)$, $\sin (3\theta)$, when sorted in increasing order, form an arithmetic progression. Compute $\cos (\theta/2)$. [b]p14.[/b] A $4$-dimensional hypercube of edge length 1 is constructed in $4$-space with its edges parallel to the coordinate axes and one vertex at the origin. The coordinates of its sixteen vertices are given by $(a, b, c, d)$, where each of $a$, $b$, $c$, and $d$ is either $0$ or $1$. The $3$-dimensional hyperplane given by $x + y + z + w = 2$ intersects the hypercube at $6$ of its vertices. Compute the $3$-dimensional volume of the solid formed by the intersection. [b]p15.[/b] A student puts $2010$ red balls and $1957$ blue balls into a box. Weiqing draws randomly from the box one ball at a time without replacement. She wins if, at anytime, the total number of blue balls drawn is more than the total number of red balls drawn. Assuming Weiqing keeps drawing balls until she either wins or runs out, ompute the probability that she eventually wins. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[b]p1.[/b] What is the largest distance between any two points on a regular hexagon with a side length of one? [b]p2.[/b] For how many integers $n \ge 1$ is $\frac{10^n - 1}{9}$ the square of an integer? [b]p3.[/b] A vector in $3D$ space that in standard position in the first octant makes an angle of $\frac{\pi}{3}$ with the $x$ axis and $\frac{\pi}{4}$ with the $y$ axis. What angle does it make with the $z$ axis? [b]p4.[/b] Compute $\sqrt{2012^2 + 2012^2 \cdot 2013^2 + 2013^2} - 2012^2$. [b]p5.[/b] Round $\log_2 \left(\sum^{32}_{k=0} {{32} \choose k} \cdot 3^k \cdot 5^k\right)$ to the nearest integer. [b]p6.[/b] Let $P$ be a point inside a ball. Consider three mutually perpendicular planes through $P$. These planes intersect the ball along three disks. If the radius of the ball is $2$ and $1/2$ is the distance between the center of the ball and $P$, compute the sum of the areas of the three disks of intersection. [b]p7.[/b] Find the sum of the absolute values of the real roots of the equation $x^4 - 4x - 1 = 0$. [b]p8.[/b] The numbers $1, 2, 3, ..., 2013$ are written on a board. A student erases three numbers $a, b, c$ and instead writes the number $$\frac12 (a + b + c)\left((a - b)^2 + (b - c)^2 + (c - a)^2\right).$$ She repeats this process until there is only one number left on the board. List all possible values of the remainder when the last number is divided by 3. [b]p9.[/b] How many ordered triples of integers $(a, b, c)$, where $1 \le a, b, c \le 10$, are such that for every natural number $n$, the equation $(a + n)x^2 + (b + 2n)x + c + n = 0$ has at least one real root? Problems' source (as mentioned on official site) is Gator Mathematics Competition. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Do there exist two real monic polynomials $P(x)$ and $Q(x)$ of degree 3,such that the roots of $P(Q(X))$ are nine pairwise distinct nonnegative integers that add up to $72$? (In a monic polynomial of degree 3, the coefficient of $x^{3}$ is $1$.)

If $x$ is a real number such that $x^2 -x$ is an integer, and for some $n \ge 3$, $x^n -x$ is also an integer, prove that $x$ is an integer.

Given real numbers $x,y,z$ which satisfies $$|x+y+z|+|xy+yz+zx|+|xyz| \le 1$$ Show that $max\{ |x|,|y|,|z|\} \le 1$.

Find the largest positive real number $k$ such that the inequality$$a^3+b^3+c^3-3\ge k(3-ab-bc-ca)$$holds for all positive real triples $(a;b;c)$ satisfying $a+b+c=3.$

Do there exist $2000$ real numbers (not necessarily distinct) such that all of them are not zero and if we put any group containing $1000$ of them as the roots of a monic polynomial of degree $1000$, the coefficients of the resulting polynomial (except the coefficient of $x^{1000}$) be a permutation of the $1000$ remaining numbers? [i]Proposed by Morteza Saghafian[/i]

We consider the sequence $\{u_n\}$ defined by recursion $u_{n+1} =\frac{u_n(u_n + 1)}{n}$ for $n \ge 1$. (a) Determine the terms of the sequence for $u_1 = 1$. (b) Show that if a member of the sequence is rational, then all subsequent members are also rational numbers. (c) Show that for every natural number $K$ there is a $u_1 > 1$ such that the first $K$ terms of the sequence are natural numbers.

Given real numbers $x,y,z$ such that $x+y+z=0$, show that \[\dfrac{x(x+2)}{2x^2+1}+\dfrac{y(y+2)}{2y^2+1}+\dfrac{z(z+2)}{2z^2+1}\ge 0\] When does equality hold?

Find the biggest real number $C$, such that for every different positive real numbers $a_1,a_2...a_{2019}$ that satisfy inequality : $\frac{a_1}{|a_2-a_3|} + \frac{a_2}{|a_3-a_4|} + ... + \frac{a_{2019}}{|a_1-a_2|} > C$

The inradius of triangle $ ABC$ is $ 1$ and the side lengths of $ ABC$ are all integers. Prove that triangle $ ABC$ is right-angled.

Let a function $g:\mathbb{N}_0\to\mathbb{N}_0$ satisfy $g(0)=0$ and $g(n)=n-g(g(n-1))$ for all $n\ge 1$. Prove that: a) $g(k)\ge g(k-1)$ for any positive integer $k$. b) There is no $k$ such that $g(k-1)=g(k)=g(k+1)$.

Let $S_r(n)=1^r+2^r+\cdots+n^r$ where $n$ is a positive integer and $r$ is a rational number. If $S_a(n)=(S_b(n))^c$ for all positive integers $n$ where $a, b$ are positive rationals and $c$ is positive integer then we call $(a,b,c)$ as [i]nice triple.[/i] Find all nice triples.

Let $a,b,c$ real numbers. Show that there are non-negative $x,y,z,xyz\neq0$ such that \begin{align*} cy-bz &\ge 0, \\ az-cx &\ge 0, \\ bx-ay &\ge 0. \end{align*}

Let $X$ be an arbitrary nonempty set contained in the plane and let sets $A_1, A_2,\cdots,A_m$ and $B_1, B_2,\cdots, B_n$ be its images under parallel translations. Let us suppose that $A_1\cup A_2 \cup \cdots\cup A_m \subset B_1 \cup B_2 \cup\cdots\cup B_n$ and that the sets $A_1, A_2,\cdots,A_m$ are disjoint. Prove that $m \le n$.

Suppose that $S$ is a series of real numbers between $2$ and $8$ inclusive, and that for any two elements $y > x$ in $S,$ $$ 98y - 102x - xy \ge 4. $$ What is the maximum possible size for the set $S?$ $$ \mathrm a. ~ 12\qquad \mathrm b.~14\qquad \mathrm c. ~16 \qquad \mathrm d. ~18 \qquad \mathrm e. 20 $$