Given positive integers $m$, $a$, $b$, $(a,b)=1$. $A$ is a non-empty subset of the set of all positive integers, so that for every positive integer $n$ there is $an \in A$ and $bn \in A$. For all $A$ that satisfy the above condition, find the minimum of the value of $\left| A \cap \{ 1,2, \cdots,m \} \right|$

In triangle $ABC$, $P$ is a point on altitude $AD$. $Q,R$ are the feet of the perpendiculars from $P$ to $AB,AC$, and $QP,RP$ meet $BC$ at $S$ and $T$ respectively. the circumcircles of $BQS$ and $CRT$ meet $QR$ at $X,Y$. a) Prove $SX,TY, AD$ are concurrent at a point $Z$. b) Prove $Z$ is on $QR$ iff $Z=H$, where $H$ is the orthocenter of $ABC$. [i]Ray Li.[/i]

In the right triangle $ABC$ with hypotenuse $AB$, the incircle touches $BC$ and $AC$ at points ${{A}_{1}}$ and ${{B}_{1}}$ respectively. The straight line containing the midline of $\Delta ABC$ , parallel to $AB$, intersects its circumcircle at points $P$ and $T$. Prove that points $P,T,{{A}_{1}}$ and ${{B}_{1}}$ lie on one circle.

All possible vertical lines $x = k$ and horizontal lines $y = m$ are drawn on the coordinate plane, where $k$ and $m$ are integers. Let's imagine that all these straight lines are black. A red straight line is also drawn, the equation of which is $19x+96y= c$. Let us denote by $M$ the number of segments of different lengths formed on the red line when intersecting with the black ones.(The ends of each segment are the intersection points of the red and black lines. There are no such intersection points inside the segment.) What values can $M$ take when $c$ changes?

On the bisector of the angle $ BAC $ of the triangle $ ABC $ we choose the points $ {{B} _ {1}}, \, \, {{C} _ {1}} $ for which $ B {{B} _ {1 }}\perp AB $, $ C {{C} _ {1}} \perp AC $. The point $ M $ is the midpoint of the segment $ {{B} _ {1}} {{C} _ {1}} $. Prove that $ MB = MC $.

Let $AB$ be a diameter of a circle and let $C$ be a point on the segement $AB$ such that $AC : CB = 6 : 7$. Let $D$ be a point on the circle such that $DC$ is perpendicular to $AB$. Let $DE$ be the diameter through $D$. If $[XYZ]$ denotes the area of the triangle $XYZ$, find $[ABD]/[CDE]$ to the nearest integer.

(Game) At the beginning of the game the organisers place $4$ piles of paper disks onto the table. The player who is in turn takes away a pile, then divides one of the remaining piles into two nonempty piles. Whoever is unable to move, loses. [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]

For any two positive integers $n>m$ prove the following inequality: $$[m,n]+[m+1,n+1]\geq \dfrac{2nm}{\sqrt{m-n}}$$ As always, $[x,y]$ means the least common multiply of $x,y$. [I]Proposed by A. Golovanov[/i]

Let $ABC$ be an acute triangle inscribed in a circle centered at $O$. Let $M$ be a point on the small arc $AB$ of the triangle's circumcircle. The perpendicular dropped from $M$ on the ray $OA$ intersects the sides $AB$ and $AC$ at the points $K$ and $L$, respectively. Similarly, the perpendicular dropped from $M$ on the ray $OB$ intersects the sides $AB$ and $BC$ at $N$ and $P$, respectively. Assume that $KL=MN$. Find the size of the angle $\angle{MLP}$ in terms of the angles of the triangle $ABC$.

Given an acute triangle $ABC$ ($AC\ne AB$) and let $(C)$ be its circumcircle. The excircle $(C_1)$ corresponding to the vertex $A$, of center $I_a$, tangents to the side $BC$ at the point $D$ and to the extensions of the sides $AB,AC$ at the points $E,Z$ respectively. Let $I$ and $L$ are the intersection points of the circles $(C)$ and $(C_1)$, $H$ the orthocenter of the triangle $EDZ$ and $N$ the midpoint of segment $EZ$. The parallel line through the point $l_a$ to the line $HL$ meets the line $HI$ at the point $G$. Prove that the perpendicular line $(e)$ through the point $N$ to the line $BC$ and the parallel line $(\delta)$ through the point $G$ to the line $IL$ meet each other on the line $HI_a$.

[b]p1.[/b] What is the smallest positive integer $x$ such that $\frac{1}{x} <\sqrt{12011} - \sqrt{12006}$? [b]p2. [/b] Two soccer players run a drill on a $100$ foot by $300$ foot rectangular soccer eld. The two players start on two different corners of the rectangle separated by $100$ feet, then run parallel along the long edges of the eld, passing a soccer ball back and forth between them. Assume that the ball travels at a constant speed of $50$ feet per second, both players run at a constant speed of $30$ feet per second, and the players lead each other perfectly and pass the ball as soon as they receive it, how far has the ball travelled by the time it reaches the other end of the eld? [b]p3.[/b] A trapezoid $ABCD$ has $AB$ and $CD$ both perpendicular to $AD$ and $BC =AB + AD$. If $AB = 26$, what is $\frac{CD^2}{AD+CD}$ ? [b]p4.[/b] A hydrophobic, hungry, and lazy mouse is at $(0, 0)$, a piece of cheese at $(26, 26)$, and a circular lake of radius $5\sqrt2$ is centered at $(13, 13)$. What is the length of the shortest path that the mouse can take to reach the cheese that also does not also pass through the lake? [b]p5.[/b] Let $a, b$, and $c$ be real numbers such that $a + b + c = 0$ and $a^2 + b^2 + c^2 = 3$. If $a^5 + b^5 + c^5\ne 0$, compute $\frac{(a^3+b^3+c^3)(a^4+b^4+c^4)}{a^5+b^5+c^5}$. [b]p6. [/b] Let $S$ be the number of points with integer coordinates that lie on the line segment with endpoints $\left( 2^{2^2}, 4^{4^4}\right)$ and $\left(4^{4^4}, 0\right)$. Compute $\log_2 (S - 1)$. [b]p7.[/b] For a positive integer $n$ let $f(n)$ be the sum of the digits of $n$. Calculate $$f(f(f(2^{2006})))$$ [b]p8.[/b] If $a_1, a_2, a_3, a_4$ are roots of $x^4 - 2006x^3 + 11x + 11 = 0$, find $|a^3_1 + a^3_2 + a^3_3 + a^3_4|$. [b]p9.[/b] A triangle $ABC$ has $M$ and $N$ on sides $BC$ and $AC$, respectively, such that $AM$ and $BN$ intersect at $P$ and the areas of triangles $ANP$, $APB$, and $PMB$ are $5$, $10$, and $8$ respectively. If $R$ and $S$ are the midpoints of $MC$ and $NC$, respectively, compute the area of triangle $CRS$. [b]p10.[/b] Jack's calculator has a strange button labelled ''PS.'' If Jack's calculator is displaying the positive integer $n$, pressing PS will cause the calculator to divide $n$ by the largest power of $2$ that evenly divides $n$, and then adding 1 to the result and displaying that number. If Jack randomly chooses an integer $k$ between $ 1$ and $1023$, inclusive, and enters it on his calculator, then presses the PS button twice, what is the probability that the number that is displayed is a power of $2$? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Two types of pieces, bishops and rooks, are to be placed on a $10\times 10$ chessboard (without necessarily filling it) such that each piece occupies exactly one square of the board. A bishop $B$ is said to [i]attack[/i] a piece $P$ if $B$ and $P$ are on the same diagonal and there are no pieces between $B$ and $P$ on that diagonal; a rook $R$ is said to attack a piece $P$ if $R$ and $P$ are on the same row or column and there are no pieces between $R$ and $P$ on that row or column. A piece $P$ is [i]chocolate[/i] if no other piece $Q$ attacks $P$. What is the maximum number of chocolate pieces there may be, after placing some pieces on the chessboard? [i]Proposed by José Alejandro Reyes González[/i]

Is there a convex pentagon in which each diagonal is equal to a side?

Find the graph of the function $y=1-|1-sin x|$.

Magic Mark performs a magic trick using a standard $52$-card deck except the suits are erased from cards (so that there are $4$ identical cards of each rank). He randomly takes $13$ cards and uses those to perform his trick. He lets you randomly pick a card from those $13$, memorize it, and put it back in the pile of $13$ cards. He then shuffles the $13$ and takes out a card randomly. If he picks a card identical to yours, the trick is successful. What is probability that the trick is successful? [i]2017 CCA Math Bonanza Individual Round #9[/i]

Let $ABC$ be a right triangle with leg $CB = 2$ and hypotenuse $AB= 4$. Point $K$ is chosen on the hypotenuse $AB$, and point $L$ is chosen on the leg $AC$. a) Describe and justify how to construct such points $K$ and $ L$ so that the sum of the distances $CK+KL$ is the smallest possible. b) Find the smallest possible value of $CK+KL$. (Olexii Panasenko)

Fill in the corners of the square, so that the sum of the numbers in each one of the $5$ lines of the square is the same and the sum of the four corners is $123$.

One day students in school organised a exchange between them such that : $11$ strawberries change for $14$ raspberries, $22$ cherries change for $21$ raspberries, $10$ cherries change for $3$ bananas and $5$ pears for $2$ bananas. How many pears has Amila to give to get $7$ strawberries

Given parallelogram $ABCD$ with $E$ the midpoint of diagonal $BD$. Point $E$ is connected to a point $F$ in $DA$ so that $DF=\frac{1}{3}DA$. What is the ratio of the area of triangle $DFE$ to the area of quadrilateral $ABEF$? $ \textbf{(A)}\ 1:2 \qquad\textbf{(B)}\ 1:3 \qquad\textbf{(C)}\ 1:5 \qquad\textbf{(D)}\ 1:6 \qquad\textbf{(E)}\ 1:7 $

Let $\mathbb{N}=\{1, 2, 3, \dots\}$ be the set of all positive integers. Find all functions $f : \mathbb{N} \rightarrow \mathbb{N}$ such that for any positive integers $a$ and $b$, the following two conditions hold: (1) $f(ab) = f(a)f(b)$, and (2) at least two of the numbers $f(a)$, $f(b)$, and $f(a+b)$ are equal.

Each edge of a graph with $15$ vertices is colored either red or blue in such a way that no three vertices are pairwise connected with edges of the same color. Determine the largest possible number of edges in the graph.

Distinct points $ A$, $ B$, $ C$, and $ D$ lie on a line, with $ AB\equal{}BC\equal{}CD\equal{}1$. Points $ E$ and $ F$ lie on a second line, parallel to the first, with $ EF\equal{}1$. A triangle with positive area has three of the six points as its vertices. How many possible values are there for the area of the triangle? $ \textbf{(A)}\ 3 \qquad \textbf{(B)}\ 4 \qquad \textbf{(C)}\ 5 \qquad \textbf{(D)}\ 6 \qquad \textbf{(E)}\ 7$

Fix integers $a$ and $b$ greater than $1$. For any positive integer $n$, let $r_n$ be the (non-negative) remainder that $b^n$ leaves upon division by $a^n$. Assume there exists a positive integer $N$ such that $r_n < \frac{2^n}{n}$ for all integers $n\geq N$. Prove that $a$ divides $b$. [i]Pouria Mahmoudkhan Shirazi, Iran[/i]

A convex hexagon $ ABCDEF$ satisfies the following conditions: 1) $ AB\parallel DE$, $ BC\parallel EF$, and $ CD\parallel FA$. 2) The distances between these pairs of parallel lines are the same. 3) $ \angle FAB \equal{} \angle CDE \equal{} 90^\circ$ Prove that the diagonals $ BE$ and $ CF$ of the hexagon intersect with angle $ 45$ degrees. $ \bullet$ Thank you dear [b]Babis Stergiou[/b] for your translation. :P

The robot crawls the meter in a straight line, puts a flag on and turns by an angle $a <180^o$ clockwise. After that, everything is repeated. Prove that all flags are on the same circle.