How many positive integers less than or equal to $150$ have exactly three distinct prime factors?

There is a table in the shape of a $8\times 5$ rectangle with four holes on its corners. After shooting a ball from points $A, B$ and $C$ on the shown paths, will the ball fall into any of the holes after 6 reflections? (The ball reflects with the same angle after contacting the table edges.) [img]http://s5.picofile.com/file/8372960750/E01.png[/img] [i]Proposed by Hirad Alipanah[/i]

Let $\omega_1$ and $\omega_2$ be two circles with no common points, such that any of them is not inside the other one. Let $M, N$ lie on $\omega_1, \omega_2$, such that the tangents at $M$ to $\omega_1$ and $N$ to $\omega_2$ meet at $P$, such that $PM=PN$. The circles $\omega_1$, $\omega_2$ meet $MN$ at $A, B$. The lines $PA, PB$ meet $\omega_1, \omega_2$ at $C, D$. Show that $\angle BCN=\angle ADM$.

Given a right-angled triangle with perimeter $18$. The sum of the squares of the three side lengths is $128$. What is the area of the triangle?

[THE PROBLEM OF PAINTING THE THÁP RÙA (THE CENTRAL TOWER) MODEL] The following picture illustrates the model of the Tháp Rùa (the Central Tower) in Hanoi, which consists of $3$ levels. For the first and second levels, each has $10$ doorways among which $3$ doorways are located at the front, $3$ at the back, $2$ on the right side and $2$ on the left side. The top level of the tower model has no doorways. The front of the tower model is signified by a disk symbol on the top level. We paint the tower model with three colors: Blue, Yellow and Brown by fulfilling the following requirements: 1. The top level is painted with only one color. 2. In the second level, the $3$ doorways at the front are painted with the same color which is different from the one used for the center doorway at the back. Besides, any two adjacent doorways, including the pairs at the same corners, are painted with different colors. 3. For the first level, we apply the same rules as for the second level. [img]https://cdn.artofproblemsolving.com/attachments/2/3/18ee062b79693c4ccc26bf922a7f54e9f352ee.png[/img] (a) In how many ways the first level can be painted? (b) In how many ways the whole tower model can be painted?

Sines of three acute angles form an arithmetic progression, while the cosines of these angles form a geometric progression. Prove that all three angles are equal.

David, Hikmet, Jack, Marta, Rand, and Todd were in a $12$-person race with $6$ other people. Rand finished $6$ places ahead of Hikmet. Marta finished $1$ place behind Jack. David finished $2$ places behind Hikmet. Jack finished $2$ places behind Todd. Todd finished $1$ place behind Rand. Marta finished in $6$th place. Who finished in $8$th place? $\textbf{(A) } \text{David} \qquad\textbf{(B) } \text{Hikmet} \qquad\textbf{(C) } \text{Jack} \qquad\textbf{(D) } \text{Rand} \qquad\textbf{(E) } \text{Todd} $

Let $f(x) = x^2 + ax + b$, where $a$ and $b$ are real numbers. If $f(f(1)) = f(f(2)) = 0$, then find $f(0)$.

A $9\times 7$ rectangle is tiled with tiles of the two types: L-shaped tiles composed by three unit squares (can be rotated repeatedly with $90^\circ$) and square tiles composed by four unit squares. Let $n\ge 0$ be the number of the $2 \times 2 $ tiles which can be used in such a tiling. Find all the values of $n$.

The the parallel lines through an inner point $P$ of triangle $\triangle ABC$ split the triangle into three parallelograms and three triangles adjacent to the sides of $\triangle ABC$. (a) Show that if $P$ is the incenter, the perimeter of each of the three small triangles equals the length of the adjacent side. (b) For a given triangle $\triangle ABC$, determine all inner points $P$ such that the perimeter of each of the three small triangles equals the length of the adjacent side. (c) For which inner point does the sum of the areas of the three small triangles attain a minimum? [i](41st Austrian Mathematical Olympiad, National Competition, part 1, Problem 4)[/i]

The following diagram shows four adjacent $2\times 2$ squares labeled $1, 2, 3$, and $4$. A line passing through the lower left vertex of square $1$ divides the combined areas of squares $1, 3$, and $4$ in half so that the shaded region has area $6$. The difference between the areas of the shaded region within square $4$ and the shaded region within square $1$ is $\frac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. Find $p + q$. [img]https://cdn.artofproblemsolving.com/attachments/7/4/b9554ccd782af15c680824a1fbef278a4f736b.png[/img]

Let $n \ge 3$ be an integer, and consider a $n \times n$-board, divided into $n^2$ unit squares. For all $m \ge 1$, arbitrarily many $1\times m$-rectangles (type I) and arbitrarily many $m\times 1$-rectangles (type II) are available. We cover the board with $N$ such rectangles, without overlaps, and such that every rectangle lies entirely inside the board. We require that the number of type I rectangles used is equal to the number of type II rectangles used.(Note that a $1 \times 1$-rectangle has both types.) What is the minimal value of $N$ for which this is possible?

Convex polygon $A_1A_2\ldots A_n$ is called $balanced$ if there is a point $M{}$ inside it such that the half lines $(A_iM, (i=1,2,\ldots,n)$ intersect disctinct sides of the polygon. a) Show that if $n>3$ is even, then every polygon with $n{}$ sides is not balanced. b) Do polygons with an odd number of sides that are not balanced exist?

Prove that :$$\sum_{k=0}^{58}C_{2017+k}^{58-k}C_{2075-k}^{k}=\sum_{p=0}^{29}C_{4091-2p}^{58-2p}$$

What is the surface area of a cube with volume $64$?

Suppose that $n$ is a positive integer number. Consider a regular polygon with $2n$ sides such that one of its largest diagonals is parallel to the $x$-axis. Find the smallest integer $d$ such that there is a polynomial $P$ of degree $d$ whose graph intersects all sides of the polygon on points other than vertices. Proposed by Mohammad Ahmadi

Find the product of all divisors of $1980^n$, $n \ge 1$.

Show that for any positive integer $n$ there is an integer $N$ such that the product $x_1x_2\cdots x_n$ can be expressed identically in the form \[x_1x_2\cdots x_n=\sum_{i=1}^Nc_i(a_{i1}x_1+a_{i2}x_2+\cdots +a_{in}x_n)^n\] where the $c_i$ are rational numbers and each $a_{ij}$ is one of the numbers, $-1,0,1.$

155 birds $ P_1, \ldots, P_{155}$ are sitting down on the boundary of a circle $ C.$ Two birds $ P_i, P_j$ are mutually visible if the angle at centre $ m(\cdot)$ of their positions $ m(P_iP_j) \leq 10^{\circ}.$ Find the smallest number of mutually visible pairs of birds, i.e. minimal set of pairs $ \{x,y\}$ of mutually visible pairs of birds with $ x,y \in \{P_1, \ldots, P_{155}\}.$ One assumes that a position (point) on $ C$ can be occupied simultaneously by several birds, e.g. all possible birds.

A checkered square $8 \times 8$ is divided into rectangles with two cells. Two rectangles are called adjacent if they share a segment of length 1 or 2. In each rectangle the amount of adjacent with it rectangles is written. Find the maximal possible value of the sum of all numbers in rectangles. [i]A. Voidelevich[/i]

Let be a bipartition of the set formed by the first $ 13 $ nonnegative numbers. Prove that at least one of these two subsets that form this partition contains an arithmetic progression.

The King called two wizards. He ordered First Wizard to write down $100$ positive integers (not necessarily distinct) on cards without revealing them to Second Wizard. Second Wizard must correctly determine all these integers, otherwise both wizards will lose their heads. First Wizard is allowed to provide Second Wizard with a list of distinct integers, each of which is either one of the integers on the cards or a sum of some of these integers. He is not allowed to tell which integers are on the cards and which integers are their sums. If Second Wizard correctly determines all $100$ integers the King tears as many hairs from each wizard's beard as the number of integers in the list given to Second Wizard. What is the minimal number of hairs each wizard should sacrice to stay alive?

Let $a,b$ and $c$ be positive integers, no two of which have a common divisor greater than $1$. Show that $2abc-ab-bc-ca$ is the largest integer which cannot be expressed in the form $xbc+yca+zab$, where $x,y,z$ are non-negative integers.

Let $ n\geq 3 $ be an integer and let $ x_1,x_2,\ldots,x_{n-1} $ be nonnegative integers such that \begin{eqnarray*} \ x_1 + x_2 + \cdots + x_{n-1} &=& n \\ x_1 + 2x_2 + \cdots + (n-1)x_{n-1} &=& 2n-2. \end{eqnarray*} Find the minimal value of $ F(x_1,x_2,\ldots,x_n) = \sum_{k=1}^{n-1} k(2n-k)x_k $.

For a point $P = (a,a^2)$ in the coordinate plane, let $l(P)$ denote the line passing through $P$ with slope $2a$. Consider the set of triangles with vertices of the form $P_1 = (a_1, a_1^2), P_2 = (a_2, a_2^2), P_3 = (a_3, a_3^2)$, such that the intersection of the lines $l(P_1), l(P_2), l(P_3)$ form an equilateral triangle $\triangle$. Find the locus of the center of $\triangle$ as $P_1P_2P_3$ ranges over all such triangles.