Found problems: 85335
For every natural number $ n $, define $ s(n) $ as the smallest natural number so that for every natural number $ a $ relatively prime to $n$, this equation holds: \[ a^{s(n)} \equiv 1 (mod n) \]
Find all natural numbers $ n $ such that $ s(n) = 2010 $
Show that $\frac{x^2}{1 - x}+\frac{(1 - x)^2}{x} \ge 1$ for all real numbers $x$, where $0 < x < 1$
A given line passes through the center $O$ of a circle. The line intersects the circle at points $A$ and $B$. Point $P$ lies in the exterior of the circle and does not lie on the line $AB$. Using only an unmarked straightedge, construct a line through $P$, perpendicular to the line $AB$. Give complete instructions for the construction and prove that it works.
Let $S$ be a set of integers with the following properties:
[list]
[*] $\{ 1, 2, \dots, 2025 \} \subseteq S$.
[*] If $a, b \in S$ and $\gcd(a, b) = 1$, then $ab \in S$.
[*] If for some $s \in S$, $s + 1$ is composite, then all positive divisors of $s + 1$ are in $S$.
[/list]
Prove that $S$ contains all positive integers.
The parabola with equation $y = x^2 - 4$ is rotated $60^\circ$ counterclockwise around the origin. The unique point in the fourth quadrant where the original parabola and its image intersect has $y$-coordinate $\frac{a - \sqrt{b}}{c}$, where $a$, $b$, and $c$ are positive integers, and $a$ and $c$ are relatively prime. Find $a + b + c$.
Let $n \ge 2$ be a positive integer. Suppose $a_1, a_2, \dots, a_n$ are distinct integers. For $k = 1, 2, \dots, n$, let
\[ s_k := \prod_{\substack{i \not= k, \\ 1 \le i \le n}} |a_k - a_i|, \]
i.e. $s_k$ is the product of all terms of the form $|a_k - a_i|$, where $i \in \{ 1, 2, \dots, n \}$ and $i \not= k$.
Find the largest positive integer $M$ such that $M$ divides the least common multiple of $s_1, s_2, \dots, s_n$ for any choices of $a_1, a_2, \dots, a_n$.
Let $\triangle ABC$ be a triangle with incentre $I$. Points $E$ and $F$ are the tangency points of the incircle and the sides $AC$ and $AB$, respectively. Suppose that the lines $BI$ and $CI$ intersect the line $EF$ at $Y$ and $Z$, respectively. Let $M$ denote the midpoint of the segment $BC$, and $N$ denote the midpoint of the segment $YZ$. Prove that $AI \parallel MN$.
Let $ABC$ be a triangle with $AB \neq AC$ and circumcenter $O$. The bisector of $\angle BAC$ intersects $BC$ at $D$. Let $E$ be the reflection of $D$ with respect to the midpoint of $BC$. The lines through $D$ and $E$ perpendicular to $BC$ intersect the lines $AO$ and $AD$ at $X$ and $Y$ respectively. Prove that the quadrilateral $BXCY$ is cyclic.
Each of the cells of an $m \times n$ table is coloured either black or white. For each cell, the total number of the cells which are in the same row or in the same column and of the same colour as this cell is strictly less than the total number of the cells which are in the same row or in the same column and of the other colour as this cell. Prove that in each row and in each column the number of white cells is the same as the number of black ones.
(A Shapovalov)
Let $ABCD$ be a trapezoid (quadrilateral with one pair of parallel sides) such that $AB < CD$. Suppose that $AC$ and $BD$ meet at $E$ and $AD$ and $BC$ meet at $F$. Construct the parallelograms $AEDK$ and $BECL$. Prove that $EF$ passes through the midpoint of the segment $KL$.
A cyclic quadrilateral is divided into four quadrilaterals by two lines passing through its inner point. Three of these quadrilaterals are cyclic with equal circumradii. Prove that the fourth part also is cyclic quadrilateral and its circumradius is the same.
(A.Blinkov)
Let $\ell$ be a positive integer. We say that a positive integer $k$ is [i]nice [/i] if $k!+\ell$ is a square of an integer. Prove that for every positive integer $n \geqslant \ell$, the set $\{1, 2, \ldots,n^2\}$ contains at most $n^2-n +\ell$ nice integers. \\ \\
(Théo Lenoir)
Show that if n is an arbitrary natural number and $\sqrt n \leq K \leq \frac{n}{2}$, then there exist n distinct integers, $k_j$ ( j = 1, ..., n ) such that $\bigg | \sum_ {j = 1} ^ ne ^ {ik_jt} \bigg | \geq K$ is satisfied on a subset of the interval $(- \pi, \pi)$ with Lebesgue measure at least $\frac{cn}{K^2}$ , where c is a suitable absolute constant.
(V.Yasinsky, Ukraine) Suppose $ X$ and $ Y$ are the common points of two circles $ \omega_1$ and $ \omega_2$. The third circle $ \omega$ is internally tangent to $ \omega_1$ and $ \omega_2$ in $ P$ and $ Q$ respectively. Segment $ XY$ intersects $ \omega$ in points $ M$ and $ N$. Rays $ PM$ and $ PN$ intersect $ \omega_1$ in points $ A$ and $ D$; rays $ QM$ and $ QN$ intersect $ \omega_2$ in points $ B$ and $ C$ respectively. Prove that $ AB \equal{} CD$.
Two persons are playing the following game. They have a pile of stones and take turns removing stones from it, with the first player taking the first turn. At each turn, the first player removes either 1 or 10 stones from the pile, and the second player removes either m or n stones. The player who can not make his move loses. It is known that for any number of stones in the pile, the first player can always win (regardless of the second player's moves). What are the possible values of m and n?
Find all positive solution of system of equation:
$ \frac{xy}{2005y\plus{}2004x}\plus{}\frac{yz}{2004z\plus{}2003y}\plus{}\frac{zx}{2003x\plus{}2005z}\equal{}\frac{x^{2}\plus{}y^{2}\plus{}z^{2}}{2005^{2}\plus{}2004^{2}\plus{}2003^{2}}$
On a 50-question multiple choice math contest, students receive 4 points for a correct answer, 0 points for an answer left blank, and -1 point for an incorrect answer. Jesse's total score on the contest was 99. What is the maximum number of questions that Jesse could have answered correctly?
$ \textbf{(A)}\ 25\qquad\textbf{(B)}\ 27\qquad\textbf{(C)}\ 29\qquad\textbf{(D)}\ 31\qquad\textbf{(E)}\ 33$
Unconventional dice are to be designed such that the six faces are marked with numbers from $1$ to $6$ with $1$ and $2$ appearing on opposite faces. Further, each face is colored either red or yellow with opposite faces always of the same color. Two dice are considered to have the same design if one of them can be rotated to obtain a dice that has the same numbers and colors on the corresponding faces as the other one. Find the number of distinct dice that can be designed.
Find all pairs $(m,n)$ of nonnegative integers for which \[m^2 + 2 \cdot 3^n = m\left(2^{n+1} - 1\right).\]
[i]Proposed by Angelo Di Pasquale, Australia[/i]
Concave pentagon $ABCDE$ has a reflex angle at $D$, with $m\angle EDC = 255^o$. We are also told that $BC = DE$, $m\angle BCD = 45^o$, $CD = 13$, $AB + AE = 29$, and $m\angle BAE = 60^o$. The area of $ABCDE$ can be expressed in simplest radical form as $a\sqrt{b}$. Compute $a + b$.
[img]https://cdn.artofproblemsolving.com/attachments/d/6/5e3faa5755628cceb2b5c39c95f6126669a3c6.png[/img]
If $O$ is a given point, $\ell$ a given line, and $a$ a given positive number, find the locus of points $P$ for which the sum of the distances from $P$ to $O$ and from $P$ to $\ell$ is $a$.
Let $n \geq 3$ be an integer, and consider a set of $n$ points in three-dimensional space such that:
[list=i]
[*] every two distinct points are connected by a string which is either red, green, blue, or
yellow;
[*] for every three distinct points, if the three strings between them are not all of the same
colour, then they are of three different colours;
[*] not all the strings have the same colour.
[/list]
Find the maximum possible value of $n$.
Show that, for every integer $r \ge 2$, there exists an $r$-chromatic simple graph (no loops, nor multiple edges) which has no cycle of less than $6$ edges
The discriminant of the equation $x^2-ax+b=0$ is the square of a rational number and $a$ and $b$ are integers. Prove that the roots of the equation are integers.
Let $a_1,a_2,\dots, a_n$ be positive integers with product $P,$ where $n$ is an odd positive integer. Prove that $$\gcd(a_1^n+P,a_2^n+P,\dots, a_n^n+P)\le 2\gcd(a_1,\dots, a_n)^n.$$
[i]Proposed by Daniel Liu[/i]