Cut a square into eight acute-angled triangles.

Each face of a cube is given a single narrow stripe painted from the center of one edge to the center of its opposite edge. The choice of the edge pairing is made at random and independently for each face. What is the probability that there is a continuous stripe encircling the cube? $ \textbf{(A)}\ \frac {1}{8}\qquad \textbf{(B)}\ \frac {3}{16}\qquad \textbf{(C)}\ \frac {1}{4} \qquad \textbf{(D)}\ \frac {3}{8}\qquad \textbf{(E)}\ \frac {1}{2}$

Prove that there exists a positive integer $n$ such that $\int_0^1 x\sin\ (x^2-x+1)dx\geq \frac {n}{n+1}\sin \frac{n+2}{n+3}.$

Let a triangle $ABC$ inscribed in a circle $\Gamma$ with center $O$. Let $I$ the incenter of triangle $ABC$ and $D, E, F$ the contact points of the incircle with sides $BC, AC, AB$ of triangle $ABC$ respectively . Let also $S$ the foot of the perpendicular line from $D$ to the line $EF$.Prove that line $SI$ passes from the antidiametric point $N$ of $A$ in the circle $\Gamma$.( $AN$ is a diametre of the circle $\Gamma$).

Find all integers $n \geq 3$ such that among any $n$ positive real numbers $a_1, a_2, \hdots, a_n$ with $\text{max}(a_1,a_2,\hdots,a_n) \leq n \cdot \text{min}(a_1,a_2,\hdots,a_n)$, there exist three that are the side lengths of an acute triangle.

Let $ABCD$ be a rectangle inscribed in circle $\omega$ with center $O$. Line $l$ passes trough $O$ and intersects lines $BC$ and $AD$ at points $E$ and $F$ respectively. Points $K$ and $L$ are the intersection points of $l$ and $\omega$ and points $K, E, F, L$ lie in this order on the line $l$. Lines tangent to $w$ in $K$ and $L$ intersect $CD$ at $M$ and $N$ respectively. Prove that $E, F, M, N$ lie on a common circle.

Let $ABCD$ be a convex cyclic quadilateral. Suppose $P$ is a point in the plane of the quadilateral such that the sum of its distances from the vertices of $ABCD$ is the least. If $$\{PC, PB, PC, PD\} = \{3, 4, 6, 8\}$$, what is the maxumum possible area of $ABCD$?

A rectangular box $\mathcal{P}$ has distinct edge lengths $a, b,$ and $c$. The sum of the lengths of all $12$ edges of $\mathcal{P}$ is $13$, the sum of the areas of all $6$ faces of $\mathcal{P}$ is $\frac{11}{2}$, and the volume of $\mathcal{P}$ is $\frac{1}{2}$. What is the length of the longest interior diagonal connecting two vertices of $\mathcal{P}$? $\textbf{(A)}~2\qquad\textbf{(B)}~\frac{3}{8}\qquad\textbf{(C)}~\frac{9}{8}\qquad\textbf{(D)}~\frac{9}{4}\qquad\textbf{(E)}~\frac{3}{2}$

Define the product $P_n=1! \cdot 2!\cdot 3!\cdots (n-1)!\cdot n!$ a) Find all positive integers $m$, such that $\frac {P_{2020}}{m!}$ is a perfect square. b) Prove that there are infinite many value(s) of $n$, such that $\frac {P_{n}}{m!}$ is a perfect square, for at least two positive integers $m$.

Solve in the integers the diophantine equation $$x^4-6x^2+1 = 7 \cdot 2^y.$$

In an exam with k questions, n students are taking part. A student fails the exam if he answers correctly less than half of all questions. Call a question easy if more than half of all students answer it correctly. For which pairs (k, n) of positive integers is it possible that (a) all students fail the exam although all questions are easy; (b) no student fails the exam although no question is easy?

find all polynomials with integer coefficients that $P(\mathbb{Z})= ${$p(a):a\in \mathbb{Z}$} has a Geometric progression.

The symbol $\ge$ means "greater than or equal to"; the symbol $\le$ means "less than or equal to". In the equation $(x-m)^2-(x-n)^2=(m-n)^2$; m is a fixed positive number, and $n$ is a fixed negative number. The set of values $x$ satisfying the equation is: $ \textbf{(A)}\ x\ge 0 \qquad\textbf{(B)}\ x\le n\qquad\textbf{(C)}\ x=0\qquad\textbf{(D)}\ \text{the set of all real numbers}\qquad\textbf{(E)}\ \text{none of these} $

Let $\triangle ABC$ be an isosceles triangle such that $AB=AC$. Let $\omega$ be a circle centered at $A$ with a radius strictly less than $AB$. Draw a tangent from $B$ to $\omega$ at $P$, and draw a tangent from $C$ to $\omega$ at $Q$. Suppose that the line $PQ$ intersects the line $BC$ at point $M$. Prove that $M$ is the midpoint of $BC$.

Given arbitrary positive integer $ a$ larger than $ 1$, show that for any positive integer $ n$, there always exists a n-degree integral coefficient polynomial $ p(x)$, such that $ p(0)$, $ p(1)$, $ \cdots$, $ p(n)$ are pairwise distinct positive integers, and all have the form of $ 2a^k\plus{}3$, where $ k$ is also an integer.

Let $x$, $y$ and $z$ be positive real numbers such that $\sqrt{xy} + \sqrt{yz} + \sqrt{zx} = 3$. Prove that $\sqrt{x^3+x} + \sqrt{y^3+y} + \sqrt{z^3+z} \geq \sqrt{6(x+y+z)}$

Find all functions $f : \mathbb R \to \mathbb R$ such that \[f(x)+f\left(1-\frac{1}{x}\right)=x,\] holds for all real $x$.

The function $f: \mathbb{R}\rightarrow\mathbb{R}$ is twice differentiable and satisfies $f(0)=2,f'(0)=-2,f(1)=1$. Prove that there is a $\xi \in ]0,1[$ for which we have $f(\xi)\cdot f'(\xi)+f''(\xi)=0$.

[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].

Find a method by which one can compute the coefficients of $P(x) = x^6 + a_1x^5 + \cdots+ a_6$ from the roots of $P(x) = 0$ by performing not more than $15$ additions and $15$ multiplications.

Consider the figure consisting of a square, its diagonals, and the segments joining the midpoints of opposite sides. The total number of triangles of any size in the figure is [asy] size(100); defaultpen(linewidth(0.7)); draw(unitsquare^^(0,0)--(1,1)^^(0,1)--(1,0)^^(.5,0)--(.5,1)^^(0,.5)--(1,.5));[/asy] $\textbf{(A)}\ 10 \qquad \textbf{(B)}\ 12 \qquad \textbf{(C)}\ 14 \qquad \textbf{(D)}\ 16 \qquad \textbf{(E)}\ 18$

Show that there exists no function $f : Z \to Z$ such that for all $m, n \in Z$ $$f(m + f(n)) = f(m) - n.$$

Compute the number of subsets $S$ of $\{0,1,\dots,14\}$ with the property that for each $n=0,1,\dots, 6$, either $n$ is in $S$ or both of $2n+1$ and $2n+2$ are in $S$. [i]Proposed by Evan Chen[/i]

Suppose that $\{D_n\}_{n\ge 1}$ is an finite sequence of disks in the plane whose total area is less than $1$. Prove that it is possible to rearrange the disks so that they are disjoint from each other and all contained inside a disk of area $4$.

Consider the polynomials \[f(x) =\sum_{k=1}^{n}a_{k}x^{k}\quad\text{and}\quad g(x) =\sum_{k=1}^{n}\frac{a_{k}}{2^{k}-1}x^{k},\] where $a_{1},a_{2},\ldots,a_{n}$ are real numbers and $n$ is a positive integer. Show that if 1 and $2^{n+1}$ are zeros of $g$ then $f$ has a positive zero less than $2^{n}$.