Olympiad problems

2022 Junior Balkan Team Selection Tests - Romania, P4

Let $ABC$ be a right triangle $(AB<AC)$ with heights $AD, BE,$ and $CF$ and orthocenter $H$. Let $M$ denote the midpoint of $BC$ and let $X$ be the second intersection of the circle with diameter $HM$ and line $AM.$ Given that lines $HX$ and $BC$ intersect at $T,$ prove that the circumcircles of $\triangle TFD$ and $\triangle AEF$ are tangent.

geometry Euler's theorem angle chasing

2017 Taiwan TST Round 2, 6

Let $I$ be the incentre of a non-equilateral triangle $ABC$, $I_A$ be the $A$-excentre, $I'_A$ be the reflection of $I_A$ in $BC$, and $l_A$ be the reflection of line $AI'_A$ in $AI$. Define points $I_B$, $I'_B$ and line $l_B$ analogously. Let $P$ be the intersection point of $l_A$ and $l_B$. [list=a] [*] Prove that $P$ lies on line $OI$ where $O$ is the circumcentre of triangle $ABC$. [*] Let one of the tangents from $P$ to the incircle of triangle $ABC$ meet the circumcircle at points $X$ and $Y$. Show that $\angle XIY = 120^{\circ}$. [/list]

geometry Euler's theorem angle chasing barycentric coordinates construction cyclic quadrilaterals homothety power of a point radical axis similar triangles

2024 AMC 10, 18

How many different remainders can result when the $100$th power of an integer is divided by $125$? $ \textbf{(A) }1 \qquad \textbf{(B) }2 \qquad \textbf{(C) }5 \qquad \textbf{(D) }25 \qquad \textbf{(E) }125 \qquad $

remainder Euler's theorem Fermat's little theorem algebra modular arithmetic

2024 USAMTS Problems, 5

Find all ordered triples of nonnegative integers $(a,b,c)$ satisfying $2^a \cdot 5^b - 3^c = 1.$

number theory Euler's theorem Fermat's little theorem casework mathematical induction modular arithmetic parity

PEN J Problems, 3

If $p$ is a prime and $n$ an integer such that $1<n \le p$, then \[\phi \left( \sum_{k=0}^{p-1}n^{k}\right) \equiv 0 \; \pmod{p}.\]

greatest common divisor modular arithmetic number theory divisor function Euler's theorem

2016 IMO Shortlist, G7

Let $I$ be the incentre of a non-equilateral triangle $ABC$, $I_A$ be the $A$-excentre, $I'_A$ be the reflection of $I_A$ in $BC$, and $l_A$ be the reflection of line $AI'_A$ in $AI$. Define points $I_B$, $I'_B$ and line $l_B$ analogously. Let $P$ be the intersection point of $l_A$ and $l_B$. [list=a] [*] Prove that $P$ lies on line $OI$ where $O$ is the circumcentre of triangle $ABC$. [*] Let one of the tangents from $P$ to the incircle of triangle $ABC$ meet the circumcircle at points $X$ and $Y$. Show that $\angle XIY = 120^{\circ}$. [/list]

geometry Euler's theorem angle chasing barycentric coordinates construction cyclic quadrilaterals homothety power of a point radical axis similar triangles

1977 IMO Longlists, 11

Let $n$ and $z$ be integers greater than $1$ and $(n,z)=1$. Prove: (a) At least one of the numbers $z_i=1+z+z^2+\cdots +z^i,\ i=0,1,\ldots ,n-1,$ is divisible by $n$. (b) If $(z-1,n)=1$, then at least one of the numbers $z_i$ is divisible by $n$.

modular arithmetic pigeonhole principle number theory Euler's theorem

2018 ELMO Shortlist, 2

Let $ABC$ be a scalene triangle with orthocenter $H$ and circumcenter $O$. Let $P$ be the midpoint of $\overline{AH}$ and let $T$ be on line $BC$ with $\angle TAO=90^{\circ}$. Let $X$ be the foot of the altitude from $O$ onto line $PT$. Prove that the midpoint of $\overline{PX}$ lies on the nine-point circle* of $\triangle ABC$. *The nine-point circle of $\triangle ABC$ is the unique circle passing through the following nine points: the midpoint of the sides, the feet of the altitudes, and the midpoints of $\overline{AH}$, $\overline{BH}$, and $\overline{CH}$. [i]Proposed by Zack Chroman[/i]

geometry Euler's theorem angle chasing cyclic quadrilaterals homothety modular arithmetic radical axis spiral similarity

2025 Nordic, 2

Let $p$ be a prime and suppose $2^{2p} \equiv 1 (\text{mod}$ $ 2p+1)$ is prime. Prove that $2p+1$ is prime$^{1}$ [size=75]$^{1}$This is a special case of Pocklington's theorem. A proof of this special case is required.[/size]

prime nt number theory Euler's theorem Fermat's little theorem factorization modular arithmetic prime factorization prime numbers

2018 BMT Spring, 15

Let triangle $ABC$ have side lengths $AB = 13$, $BC = 14$, $AC = 15$. Let $I$ be the incenter of $ABC$. The circle centered at $A$ of radius $AI$ intersects the circumcircle of $ABC$ at $H$ and $J$. Let $L$ be a point that lies on both the incircle of $ABC$ and line $HJ$. If the minimal possible value of $AL$ is $\sqrt{n}$, where $n \in \mathbb{Z}$, find $n$.

Euler's theorem Pythagorean theorem geometry power of a point

2006 Paraguay Mathematical Olympiad, 1

What are the last two digits of the decimal representation of $21^{2006}$?

number theory Euler's theorem Fermat's little theorem modular arithmetic

2010 Ukraine Team Selection Test, 6

Find all pairs of odd integers $a$ and $b$ for which there exists a natural number$ c$ such that the number $\frac{c^n+1}{2^na+b}$ is integer for all natural $n$.

integer number theory divisibility Euler's theorem Fermat's little theorem modular arithmetic

2013 Brazil Team Selection Test, 3

Let $x$ and $y$ be positive integers. If ${x^{2^n}}-1$ is divisible by $2^ny+1$ for every positive integer $n$, prove that $x=1$.

modular arithmetic number theory divisibility Euler's theorem factorization invariants mathematical induction p-adic valuation prime factorization proof by contradiction

2025 Nepal National Olympiad, 4

Find all pairs of positive integers $ n $ and $ x $ such that \[ 1^n + 2^n + 3^n + \cdots + n^n = x! \] [i](Petko Lazarov, Bulgaria)[/i]

factorial number theory Euler's theorem modular arithmetic

2014 NIMO Problems, 4

Let $n$ be largest number such that \[ \frac{2014^{100!}-2011^{100!}}{3^n} \] is still an integer. Compute the remainder when $3^n$ is divided by $1000$.

euler modular arithmetic logarithm floor function Chinese remainder theorem Euler's theorem floor and ceiling functions logarithms

2020 Junior Macedonian National Olympiad, 3

Solve the following equation in the set of integers $x^5 + 2 = 3 \cdot 101^y$.

number theory Euler's theorem Fermat's little theorem algebra modular arithmetic

2022 Rioplatense Mathematical Olympiad, 6

In a board, the positive integer $N$ is written. In each round, Olive can realize any one of the following operations: I - Switch the current number by a positive multiple of the current number. II - Switch the current number by a number with the same digits of the current number, but the digits are written in another order(leading zeros are allowed). For instance, if the current number is $2022$, Olive can write any of the following numbers $222,2202,2220$. Determine all the positive integers $N$, such that, Olive can write the number $1$ after a finite quantity of rounds.

combinatorics number theory Euler's theorem factorization invariants modular arithmetic prime factorization

2000 Romania Team Selection Test, 1

Let $a>1$ be an odd positive integer. Find the least positive integer $n$ such that $2^{2000}$ is a divisor of $a^n-1$. [i]Mircea Becheanu [/i]

modular arithmetic number theory Euler's theorem

2017 IMO Shortlist, N7

An ordered pair $(x, y)$ of integers is a primitive point if the greatest common divisor of $x$ and $y$ is $1$. Given a finite set $S$ of primitive points, prove that there exist a positive integer $n$ and integers $a_0, a_1, \ldots , a_n$ such that, for each $(x, y)$ in $S$, we have: $$a_0x^n + a_1x^{n-1} y + a_2x^{n-2}y^2 + \cdots + a_{n-1}xy^{n-1} + a_ny^n = 1.$$ [i]Proposed by John Berman, United States[/i]

john berman more like jawnorz equation polynomial number theory Bézout's identity Chinese remainder theorem Euler's theorem Fermat's little theorem casework construction mathematical induction modular arithmetic p-adic valuation polynomials

2002 Putnam, 2

Consider a polyhedron with at least five faces such that exactly three edges emerge from each of its vertices. Two players play the following game: Each, in turn, signs his or her name on a previously unsigned face. The winner is the player who first succeeds in signing three faces that share a common vertex. Show that the player who signs first will always win by playing as well as possible.

tetrahedron putnam games euler geometry 3d geometry Euler's theorem combinatorial games solid geometry

2012 USA TSTST, 3

Let $\mathbb N$ be the set of positive integers. Let $f: \mathbb N \to \mathbb N$ be a function satisfying the following two conditions: (a) $f(m)$ and $f(n)$ are relatively prime whenever $m$ and $n$ are relatively prime. (b) $n \le f(n) \le n+2012$ for all $n$. Prove that for any natural number $n$ and any prime $p$, if $p$ divides $f(n)$ then $p$ divides $n$.

function induction arithmetic sequence greatest common divisor modular arithmetic relatively prime number theory Chinese remainder theorem Euler's theorem algebra construction factorization mathematical induction p-adic valuation prime factorization sequences

2016 CCA Math Bonanza, L4.3

Let $ABC$ be a non-degenerate triangle with perimeter $4$ such that $a=bc\sin^2A$. If $M$ is the maximum possible area of $ABC$ and $m$ is the minimum possible area of $ABC$, then $M^2+m^2$ can be expressed in the form $\frac{a}{b}$ for relatively prime positive integers $a$ and $b$. Compute $a+b$. [i]2016 CCA Math Bonanza Lightning #4.3[/i]

inequalities Euler's theorem geometry law of sines number theory