Solve the equation $\frac{1}{\sin x}+\frac{1}{\cos x}=\frac{1}{p}, $ where $p$ is a real parameter. Investigate for which values of $p$ solutions exist and how many solutions exist. (Of course, the last question ''how many solutions exist'' should be understood as ''how many solutions exists modulo $2\pi $''.)

There are $k$ heaps on the table, each containing a different positive number of stones. Juri and Mari make moves alternatingly, Juri starts. On each move, the player making the move has to pick a heap and remove one or more stones in it from the table; in addition, the player is allowed to distribute any number of remaining stones from that heap in any way between other non-empty heaps. The player to remove the last stone from the table wins. For which positive integers $k$ does Juri have a winning strategy for any initial state that satisfies the conditions?

On a circle there are some black and white points (there are at least $12$ points). Each point has $10$ neighbors ($5$ left and $5$ right neighboring points), $5$ being black and $5$ white. Prove that the number of points on the circle is divisible by $4$.

Decompose the expression into real factors: \[E = 1 - \sin^5(x) - \cos^5(x).\]

Four complex numbers lie at the vertices of a square in the complex plane. Three of the numbers are $1+2i,-2+i$ and $-1-2i$. The fourth number is A. $2+i$ B. $2-i$ C. $1-2i$ D. $-1+2i$ E. $-2-i$

Find the number of positive integral solutions to the equation $\sum \limits_{i=1}^{2019} 10^{a_i}=\sum \limits_{i=1}^{2019} 10^{b_i}$, such that $a_1<a_2<\cdots <a_{2019}$ , $b_1<b_2<\cdots <b_{2019}$ and $a_{2019} < b_{2019}$ [list=1] [*] 1 [*] 2 [*] 2019 [*] None of the above [/list]

Let $x_1=1$, $x_2$, $x_3$, $\ldots$ be a sequence of real numbers such that for all $n\geq 1$ we have \[ x_{n+1} = x_n + \frac 1{2x_n} . \] Prove that \[ \lfloor 25 x_{625} \rfloor = 625 . \]

In triangle $ABC$, with $AB<AC$, $I$ is the incenter, $E$ is the intersection of $A$-excircle and $BC$. Point $F$ lies on the external angle bisector of $BAC$ such that $E$ and $F$ lieas on the same side of the line $AI$ and $\angle AIF=\angle AEB$. Point $Q$ lies on $BC$ such that $\angle AIQ=90$. Circle $\omega_b$ is tangent to $FQ$ and $AB$ at $B$, circle $\omega_c$ is tangent to $FQ$ and $AC$ at $C$ and both circles pass through the inside of triangle $ABC$. if $M$ is the Midpoint od the arc $BC$, which does not contain $A$, prove that $M$ lies on the radical axis of $\omega_b$ and $\omega_c$. Proposed by Amirmahdi Mohseni

In a Cartesian coordinate plane, call a rectangle $standard$ if all of its sides are parallel to the $x$- and $y$- axes, and call a set of points $nice$ if no two of them have the same $x$- or $y$- coordinate. First, Bert chooses a nice set $B$ of $2016$ points in the coordinate plane. To mess with Bert, Ernie then chooses a set $E$ of $n$ points in the coordinate plane such that $B\cup E$ is a nice set with $2016+n$ points. Bert returns and then miraculously notices that there does not exist a standard rectangle that contains at least two points in $B$ and no points in $E$ in its interior. For a given nice set $B$ that Bert chooses, define $f(B)$ as the smallest positive integer $n$ such that Ernie can find a nice set $E$ of size $n$ with the aforementioned properties. Help Bert determine the minimum and maximum possible values of $f(B)$. [i]Yannick Yao[/i]

Given is a square $ABCD$ with $E \in BC$, arbitrarily. On $CD$ lies the point $F$ is such that $\angle EAF = 45^o$. Prove that $EF$ is tangent to the circle with center $A$ and radius $AB$.

Let $ABCD$ be a convex quadrilateral with $AB=5$, $BC=6$, $CD=7$, and $DA=8$. Let $M$, $P$, $N$, $Q$ be the midpoints of sides $AB$, $BC$, $CD$, $DA$ respectively. Compute $MN^2-PQ^2$.

Tetrahedron $ABCD$ has sides of lengths, in increasing order, $7, 13, 18, 27, 36, 41$. If $AB=41$, then what is the length of $CD$?

How many four-digit multiples of $8$ are greater than $2008$?

We have \( n \) chips that are initially placed on the number line at position 0. On each move, we select a position \( x \in \mathbb{Z} \) where there are at least two chips; we take two of these chips, then place one at \( x-1 \) and the other at \( x+1 \). a) Prove that after a finite number of moves, regardless of how the moves are chosen, we will reach a final position where no two chips occupy the same number on the number line. b) For every possible final position, let \( \Delta \) represent the difference between the numbers where the rightmost and the leftmost chips are located. Find all possible values of \( \Delta \) in terms of \( n \).

In triangle $ABC$ the circumcircle has radius $R$ and center $O$ and the incircle has radius $r$ and center $I\ne O$ . Let $G$ denote the centroid of triangle $ABC$. Prove that $IG \perp BC$ if and only if $AB = AC$ or $AB + AC = 3BC$.

Let $f:\mathbb{C} \to \mathbb{C}$ be an entire function, and suppose that the sequence $f^{(n)}$ of derivatives converges pointwise. Prove that $f^{(n)}(z)\to Ce^z$ pointwise for a suitable complex number $C$.

How many sets of two positive prime numbers $\{p,q\}$ have the property that $p + q = 100$?

A quadrilateral $ABCD$ is circumscribed about a circle. Lines $AC$ and $DC$ meet at point $E$ and lines $DA$ and $BC$ meet at $F$, where $B$ is between $A$ and $E$ and between $C$ and $F$. Let $I_1, I_2$ and $I_3$ be the incenters of triangles $AFB, BEC$ and $ABC$, respectively. The line $I_1I_3$ intersects $EA$ at $K$ and $ED$ at $L$, whereas the line $I_2I_3$ intersects $FC$ at $M$ and $FD$ at $N$. Prove that $EK = EL$ if and only if $FM = FN$

Let $n\geq 3$ be a positive integer and a circle $\omega$ is given. A regular polygon(with $n$ sides) $P$ is drawn and your vertices are in the circle $\omega$ and these vertices are red. One operation is choose three red points $A,B,C$, such that $AB=BC$ and delete the point $B$. Prove that one can do some operations, such that only two red points remain in the circle.

Ten square cardboards of $3$ centimeters on a side are cut by a line, as indicated in the figure. After the cuts, there are $20$ pieces: $10$ triangles and $10$ trapezoids. Assemble a square that uses all $20$ pieces without overlaps or gaps. [img]https://cdn.artofproblemsolving.com/attachments/7/9/ec2242cca617305b02eef7a5409e6a6b482d66.gif[/img]

Let $E$ be a finite set, $P_E$ the family of its subsets, and $f$ a mapping from $P_E$ to the set of non-negative reals, such that for any two disjoint subsets $A,B$ of $E$, $f(A\cup B)=f(A)+f(B)$. Prove that there exists a subset $F$ of $E$ such that if with each $A \subset E$, we associate a subset $A'$ consisting of elements of $A$ that are not in $F$, then $f(A)=f(A')$ and $f(A)$ is zero if and only if $A$ is a subset of $F$.

Twelve friends met for dinner at Oscar's Overstuffed Oyster House, and each ordered one meal. The portions were so large, there was enough food for $18$ people. If they share, how many meals should they have ordered to have just enough food for the $12$ of them? $\textbf{(A)}\ 8\qquad \textbf{(B)}\ 9 \qquad \textbf{(C)}\ 10\qquad \textbf{(D)}\ 15\qquad \textbf{(E)}\ 18$

A set of $n$ lights, numbered $1$ to $n$, are initially off. At every moment, it is possible to perform one of the following operations: $\bullet$ change the state of lamp $1$, $\bullet$ change the state of lamp $2$, as long as lamp $1$ is on, $\bullet$ change the state of lamp $k > 2$, as long as lamp $k - 1$ is on and all lamps $1, . . . , k - 2$ are off. It shows that it is possible, after a certain number of operations, to have only the lamp left on.

The cost of $3$ hamburgers, $5$ milk shakes, and $1$ order of fries at a certain fast food restaurant is $\$23.50$. At the same restaurant, the cost of $5$ hamburgers, $9$ milk shakes, and $1$ order of fries is $\$39.50$. What is the cost of $2$ hamburgers, $2$ milk shakes and $2$ orders of fries at this restaurant?

Prove that among the elements of the sequence $\left( \left\lfloor n \sqrt 2 \right\rfloor + \left\lfloor n \sqrt 3 \right\rfloor \right)_{n \geq 0}$ are an infinity of even numbers and an infinity of odd numbers.