A square is drawn on a sheet of grid paper on the sides of the cells $ABCD$ with side $8$. Point $E$ is the midpoint of side $BC$, $Q$ is such a point on the diagonal $AC$ such that $AQ: QC = 3: 1$. Find the angle between straight lines $AE$ and $DQ$.

Let $n$ and $k$ be integers satisfying $\binom{2k}{2} + n = 60$. It is known that $n$ days before Evan's 16th birthday, something happened. Compute $60-n$. [i]Proposed by Evan Chen[/i]

Let $C_1$ be a circle with center $O$ and let $B$ and $C$ be points in $C_1$ such that $BOC$ is an equilateral triangle. Let $D$ be the midpoint of the minor arc $BC$ of $C_1$. Let $C_2$ be the circle with center $C$ that passes through $B$ and $O$. Let $E$ be the second intersection of $C_1$ and $C_2$. The parallel to $DE$ through $B$ intersects $C_1$ for second time in $A$. Let $C_3$ be the circumcircle of triangle $AOC$. The second intersection of $C_2$ and $C_3$ is $F$. Show that $BE$ and $BF$ trisect the angle $\angle ABC$.

Let \( n \geq 3 \) be a positive integer. In a convex polygon with \( n \) sides, all the internal bisectors of its \( n \) internal angles are drawn. Determine, as a function of \( n \), the smallest possible number of distinct lines determined by these bisectors.

Given a set of $2^{2016}$ cards with the numbers $1,2, ..., 2^{2016}$ written on them. We divide the set of cards into pairs arbitrarily, from each pair, we keep the card with larger number and discard the other. We now again divide the $2^{2015}$ remaining cards into pairs arbitrarily, from each pair, we keep the card with smaller number and discard the other. We now have $2^{2014}$ cards, and again divide these cards into pairs and keep the larger one in each pair. We keep doing this way, alternating between keeping the larger number and keeping the smaller number in each pair, until we have just one card left. Find all possible values of this final card.

Let $a, b, c$ be the lengths of the sides of a triangle, and let $S$ be it's area. Prove that $$S \le \frac{a^2+b^2+c^2}{4\sqrt3}$$ and the equality is achieved only for an equilateral triangle.

Suppose that the roots of $x^3+3x^2+4x-11=0$ are $a, b,$ and $c,$ and that the roots of $x^3+rx^2+sx+t=0$ are $a+b, b+c,$ and $c+a.$ Find $t.$

Let $ABC$ be a triangle with incenter $I$. Suppose the reflection of $AB$ across $CI$ and the reflection of $AC$ across $BI$ intersect at a point $X$. Prove that $XI$ is perpendicular to $BC$.

We call a triple of natural numbers $(a, b, c)$ [i]square [/i] if they form an arithmetic progression (in exactly this order), the number $b$ is coprime to each of the numbers $a$ and $c$, and the number $abc$ is a perfect square. Prove that for any given a square triple, there is another square triple that has at least one common number with it.

Amber and Brian are playing a game using $2010$ coins. Throughout the game, the coins are divided into a number of piles of at least 1 coin each. A move consists of choosing one or more piles and dividing each of them into two smaller piles. (So piles consisting of only $1$ coin cannot be chosen.) Initially, there is only one pile containing all $2010$ coins. Amber and Brian alternatingly take turns to make a move, starting with Amber. The winner is the one achieving the situation where all piles have only one coin. Show that Amber can win the game, no matter which moves Brian makes.

Prove that pentagon $ ABCDE$ is cyclic if and only if \[\mathrm{d(}E,AB\mathrm{)}\cdot \mathrm{d(}E,CD\mathrm{)} \equal{} \mathrm{d(}E,AC\mathrm{)}\cdot \mathrm{d(}E,BD\mathrm{)} \equal{} \mathrm{d(}E,AD\mathrm{)}\cdot \mathrm{d(}E,BC\mathrm{)}\] where $ \mathrm{d(}X,YZ\mathrm{)}$ denotes the distance from point $ X$ ot the line $ YZ$.

A positive integer is called [i]vaivém[/i] when, considering its representation in base ten, the first digit from left to right is greater than the second, the second is less than the third, the third is bigger than the fourth and so on alternating bigger and smaller until the last digit. For example, $2021$ is [i]vaivém[/i], as $2 > 0$ and $0 < 2$ and $2 > 1$. The number $2023$ is not [i]vaivém[/i], as $2 > 0$ and $0 < 2$, but $2$ is not greater than $3$. a) How many [i]vaivém[/i] positive integers are there from $2000$ to $2100$? b) What is the largest [i]vaivém[/i] number without repeating digits? c) How many distinct $7$-digit numbers formed by all the digits $1, 2, 3, 4, 5, 6$ and $7$ are [i]vaivém[/i]?

Numbers $x,y,z$ are positive integers and satisfy the equation $x+y+z=2013$. (E) a) Find the number of the triplets $(x,y,z)$ that are solutions of the equation (E). b) Find the number of the solutions of the equation (E) for which $x=y$. c) Find the solution $(x,y,z)$ of the equation (E) for which the product $xyz$ becomes maximum.

[b]p1.[/b] Compute $$\left(\frac{1}{10}\right)^{\frac12}\left(\frac{1}{10^2}\right)^{\frac{1}{2^4}}\left(\frac{1}{10^3}\right)^{\frac{1}{2^3}} ...$$ [b]p2.[/b] Consider the sequence $1, 2, 2, 3, 3, 3, 4, 4, 4, 4,...,$ where the positive integer $m$ appears $m$ times. Let $d(n)$ denote the $n$th element of this sequence starting with $n = 1$. Find a closed-form formula for $d(n)$. [b]p3.[/b] Let $0 < \theta < \frac{\pi}{2}$, prove that $$ \left( \frac{\sin^2 \theta}{2}+\frac{2}{\cos^2 \theta} \right)^{\frac14}+ \left( \frac{\cos^2 \theta}{2}+\frac{2}{\sin^2 \theta} \right)^{\frac14} \ge (68)^{\frac14} $$ and determine the value of \theta when the inequality holds as equality. [b]p4.[/b] In $\vartriangle ABC$, parallel lines to $AB$ and $AC$ are drawn from a point $Q$ lying on side $BC$. If $a$ is used to represent the ratio of the area of parallelogram $ADQE$ to the area of the triangle $\vartriangle ABC$, (i) find the maximum value of $a$. (ii) find the ratio $\frac{BQ}{QC}$ when $a =\frac{24}{49}.$ [img]https://cdn.artofproblemsolving.com/attachments/5/8/eaa58df0d55e6e648855425e581a6ba0ad3ea6.png[/img] [b]p5.[/b] Prove the following inequality $$\frac{1}{2009} < \frac{1}{2} \cdot \frac{3}{4} \cdot \frac{5}{6} \cdot \frac{7}{8}...\frac{2007}{2008}<\frac{1}{40}$$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].Thanks to gauss202 for sending the problems.

a, b, c are positive real numbers and a+b+c=k. Find the minimum value of $ b^2/(ka+bc)^1/2+c^2/(kb+ac)^1/2+a^2/(kc+ab)^1/2 $

Arnold is studying the prevalence of three health risk factors, denoted by A, B, and C. within a population of men. For each of the three factors, the probability that a randomly selected man in the population as only this risk factor (and none of the others) is 0.1. For any two of the three factors, the probability that a randomly selected man has exactly two of these two risk factors (but not the third) is 0.14. The probability that a randomly selected man has all three risk factors, given that he has A and B is $\tfrac{1}{3}$. The probability that a man has none of the three risk factors given that he does not have risk factor A is $\tfrac{p}{q}$, where $p$ and $q$ are relatively prime positive integers. Find $p+q$.

Let $p>2$ be a prime number and let $L=\{0,1,\dots,p-1\}^2$. Prove that we can find $p$ points in $L$ with no three of them collinear.

[b]Determine all four digit numbers [/b]$\bar{a}\bar{b}\bar{c}\bar{d}$[b] such that[/b] $$a(a+b+c+d)(a^{2}+b^{2}+c^{2}+d^{2})(a^{6}+2b^{6}+3c^{6}+4d^{6})=\bar{a}\bar{b}\bar{c}\bar{d}$$

For positive integers $k$ and $n$, we know $k \geq n!$. Prove that $ \phi (k) \geq (n-1)!$

Let $ M(n )\equal{}\{\minus{}1,\minus{}2,\ldots,\minus{}n\}$. For every non-empty subset of $ M(n )$ we consider the product of its elements. How big is the sum over all these products?

In a group of $n$ people, each one had a different ball. They performed a sequence of swaps, in each swap, two people swapped the ball they had at that moment. Each pair of people performed at least one swap. In the end each person had the ball he/she had at the start. Find the least possible number of swaps, if: a) $n = 5$, b) $n = 6$.

Let $n$ be a positive integer. Prove that \[ 3^{\dfrac{5^{2^n}-1}{2^{n+2}}} \equiv (-5)^{\dfrac{3^{2^n}-1}{2^{n+2}}} \pmod{2^{n+4}}. \]

Let $n>1$ be a natural number. Let $U=\{1,2,...,n\}$, and define $A\Delta B$ to be the set of all those elements of $U$ which belong to exactly one of $A$ and $B$. Show that $|\mathcal{F}|\le 2^{n-1}$, where $\mathcal{F}$ is a collection of subsets of $U$ such that for any two distinct elements of $A,B$ of $\mathcal{F}$ we have $|A\Delta B|\ge 2$. Also find all such collections $\mathcal{F}$ for which the maximum is attained.

Find $ \lim_{n\to\infty}(\sum_{i=0}^{n}\frac{1}{n+i})$

Natural numbers from $1$ to $99$ (not necessarily distinct) are written on $99$ cards. It is given that the sum of the numbers on any subset of cards (including the set of all cards) is not divisible by $100$. Show that all the cards contain the same number.