Olympiad problems

2014 Thailand Mathematical Olympiad, 1

Let $\vartriangle ABC$ be an isosceles triangle with $\angle BAC = 100^o$. Let $D, E$ be points on ray $\overrightarrow{AB}$ so that $BC = AD = BE$. Show that $BC \cdot DE = BD \cdot CE$

2014 AMC 8, 2

Tags:

Paul owes Paula $35$ cents and has a pocket full of $5$-cent coins, $10$-cent coins, and $25$-cent coins that he can use to pay her. What is the difference between the largest and the smallest number of coins he can use to pay her? $\textbf{(A) }1\qquad\textbf{(B) }2\qquad\textbf{(C) }3\qquad\textbf{(D) }4\qquad \textbf{(E) }5$

2003 Korea - Final Round, 2

Tags: rhombus , trigonometry , circumcircle , ratio , perpendicular bisector , angle bisector , geometry

Let $M$ be the intersection of two diagonal, $AC$ and $BD$, of a rhombus $ABCD$, where angle $A<90^\circ$. Construct $O$ on segment $MC$ so that $OB<OC$ and let $t=\frac{MA}{MO}$, provided that $O \neq M$. Construct a circle that has $O$ as centre and goes through $B$ and $D$. Let the intersections between the circle and $AB$ be $B$ and $X$. Let the intersections between the circle and $BC$ be $B$ and $Y$. Let the intersections of $AC$ with $DX$ and $DY$ be $P$ and $Q$, respectively. Express $\frac{OQ}{OP}$ in terms of $t$.

2019 Online Math Open Problems, 22

Tags:

For finite sets $A$ and $B$, call a function $f: A \rightarrow B$ an \emph{antibijection} if there does not exist a set $S \subseteq A \cap B$ such that $S$ has at least two elements and, for all $s \in S$, there exists exactly one element $s'$ of $S$ such that $f(s')=s$. Let $N$ be the number of antibijections from $\{1,2,3, \ldots 2018 \}$ to $\{1,2,3, \ldots 2019 \}$. Suppose $N$ is written as the product of a collection of (not necessarily distinct) prime numbers. Compute the sum of the members of this collection. (For example, if it were true that $N=12=2\times 2\times 3$, then the answer would be $2+2+3=7$.) [i]Proposed by Ankit Bisain[/i]

2008 Iran MO (3rd Round), 3

Tags: function , induction , combinatorics

Prove that for each $ n$: \[ \sum_{k\equal{}1}^n\binom{n\plus{}k\minus{}1}{2k\minus{}1}\equal{}F_{2n}\]

2004 All-Russian Olympiad Regional Round, 8.1

Tags: algebra

On two intersecting roads with equal constant speeds Audi and BMW cars are moving fast. It turned out that as in 17.00, and at 18.00 the BMW was twice as far from the intersection, than ''Audi''. At what time could an Audi drive across the river?

1999 Turkey Team Selection Test, 3

Tags: parabola , combinatorics , conic

Prove that the plane is not a union of the inner regions of finitely many parabolas. (The outer region of a parabola is the union of the lines not intersecting the parabola. The inner region of a parabola is the set of points of the plane that do not belong to the outer region of the parabola)

Kvant 2022, M2722

Tags: geometry

Consider an acute non-isosceles triangle. In a single step it is allowed to cut any one of the available triangles into two triangles along its median. Is it possible that after a finite number of cuttings all triangles will be isosceles? [i]Proposed by E. Bakaev[/i]

2015 District Olympiad, 2

Tags: geometry , perpendicular bisector

Let $ ABC $ be an obtuse triangle with $ AB=AC, M $ the symmetric point of $ A $ with respect to $ C, $ and $ P $ the intersection of the line $ AB $ with the perpendicular bisector of the segment $ \overline{AB} . $ Knowing that $ PM $ is perpendicular to $ BC, $ show that $ APM $ is equilateral.

2024 Francophone Mathematical Olympiad, 2

Tags: combinatorics , combinatorial geometry , 3d geometry , geometry

Given a positive integer $n \ge 2$, let $\mathcal{P}$ and $\mathcal{Q}$ be two sets, each consisting of $n$ points in three-dimensional space. Suppose that these $2n$ points are distinct. Show that it is possible to label the points of $\mathcal{P}$ as $P_1,P_2,\dots,P_n$ and the points of $\mathcal{Q}$ as $Q_1,Q_2,\dots,Q_n$ such that for any indices $i$ and $j$, the balls of diameters $P_iQ_i$ and $P_jQ_j$ have at least one common point.

2002 USA Team Selection Test, 1

Tags: inequalities , trigonometry , trigonometric inequality , function

Let $ ABC$ be a triangle, and $ A$, $ B$, $ C$ its angles. Prove that \[ \sin\frac{3A}{2}+\sin\frac{3B}{2}+\sin\frac{3C}{2}\leq \cos\frac{A-B}{2}+\cos\frac{B-C}{2}+\cos\frac{C-A}{2}. \]

2016 Rioplatense Mathematical Olympiad, Level 3, 4

Tags: function , algebra , maximum , functional inequality

Let $c > 1$ be a real number. A function $f: [0 ,1 ] \to R$ is called c-friendly if $f(0) = 0, f(1) = 1$ and $|f(x) -f(y)| \le c|x - y|$ for all the numbers $x ,y \in [0,1]$. Find the maximum of the expression $|f(x) - f(y)|$ for all [i]c-friendly[/i] functions $f$ and for all the numbers $x,y \in [0,1]$.

1992 AMC 12/AHSME, 6

Tags:

If $x > y > 0$, then $\frac{x^{y}y^{x}}{y^{y}x^{x}} = $ $ \textbf{(A)}\ (x - y)^{y/x}\qquad\textbf{(B)}\ \left(\frac{x}{y}\right)^{x-y}\qquad\textbf{(C)}\ 1\qquad\textbf{(D)}\ \left(\frac{x}{y}\right)^{y-x}\qquad\textbf{(E)}\ (x - y)^{x/y} $

2019 Harvard-MIT Mathematics Tournament, 7

Tags: hmmt , geometry , combinatorics

A convex polygon on the plane is called [i]wide[/i] if the projection of the polygon onto any line in the same plane is a segment with length at least 1. Prove that a circle of radius $\tfrac{1}{3}$ can be placed completely inside any wide polygon.

2014 Czech-Polish-Slovak Junior Match, 4

Tags: number theory , divide , divisible , digit

The number $a_n$ is formed by writing in succession, without spaces, the numbers $1, 2, ..., n$ (for example, $a_{11} = 1234567891011$). Find the smallest number t such that $11 | a_t$.

1996 Israel National Olympiad, 7

Tags: system of equations , diophantine , diophantine equation , number theory

Find all positive integers $a,b,c$ such that $$\begin{cases} a^2 = 4(b+c) \\ a^3 -2b^3 -4c^3 =\frac12 abc \end {cases}$$

2020 Brazil Undergrad MO, Problem 5

Tags: combinatorial game , combinatorics , game , game theory

Let $N$ a positive integer. In a spaceship there are $2 \cdot N$ people, and each two of them are friends or foes (both relationships are symmetric). Two aliens play a game as follows: 1) The first alien chooses any person as she wishes. 2) Thenceforth, alternately, each alien chooses one person not chosen before such that the person chosen on each turn be a friend of the person chosen on the previous turn. 3) The alien that can't play in her turn loses. Prove that second player has a winning strategy [i]if, and only if[/i], the $2 \cdot N$ people can be divided in $N$ pairs in such a way that two people in the same pair are friends.

2003 Federal Math Competition of S&M, Problem 4

Tags: geometry , locus

An acute angle with the vertex $O$ and the rays $Op_1$ and $Op_2$ is given in a plane. Let $k_1$ be a circle with the center on $Op_1$ which is tangent to $Op_2$. Let $k_2$ be the circle that is tangent to both rays $Op_1$ and $Op_2$ and to the circle $k_1$ from outside. Find the locus of tangency points of $k_1$ and $k_2$ when center of $k_1$ moves along the ray $Op_1$.

2022 Yasinsky Geometry Olympiad, 5

Tags: geometry , incircle , square

Point $X$ is chosen on side $AD$ of square $ABCD$. The inscribed circle of triangle $ABX$ touches $AX$, $BX$, and $AB$ at points $N$, $K$, and $F$, respectively. Prove that the ray $NK$ passes through the center $O$ of the square $ABCD$. (Dmytro Shvetsov)

VMEO III 2006 Shortlist, N8

Tags: number theory , algebra

For every positive integer $n$, the symbol $a_n/b_n$ is the simplest form of the fraction $1+1/2+...+1/n$. Prove that for every pair of positive integers $(M, N)$ we can always find a positive integer $m$ where $(a_n, N) = 1$ for all $n = m, m + 1, ...,m + M$.

2016 Singapore Junior Math Olympiad, 5

Tags: point , combinatorics , combinatorial geometry , line , min

Determine the minimum number of lines that can be drawn on the plane so that they intersect in exactly $200$ distinct points. (Note that for $3$ distinct points, the minimum number of lines is $3$ and for $4$ distinct points, the minimum is $4$)

2018 Canadian Senior Mathematics Contest, A1

Tags:

Paul has 6 boxes, each of which contains 12 trays. Paul also has 4 extra trays. If each tray can hold 8 apples, what is the largest possible number of apples that can be held by the 6 boxes and 4 extra trays?

2001 Romania Team Selection Test, 3

Tags: inequalities

The sides of a triangle have lengths $a,b,c$. Prove that: \begin{align*}(-a+b+c)(a-b+c)\, +\, & (a-b+c)(a+b-c)+(a+b-c)(-a+b+c)\\ &\le\sqrt{abc}(\sqrt{a}+\sqrt{b}+\sqrt{c})\end{align*}

2005 AIME Problems, 12

Tags: number theory , prime factorization

For positive integers $n$, let $\tau (n)$ denote the number of positive integer divisors of $n$, including $1$ and $n$. For example, $\tau (1)=1$ and $\tau(6) =4$. Define $S(n)$ by \[S(n)=\tau(1)+ \tau(2) + ... + \tau(n).\] Let $a$ denote the number of positive integers $n \leq 2005$ with $S(n)$ odd, and let $b$ denote the number of positive integers $n \leq 2005$ with $S(n)$ even. Find $|a-b|$.

2019 Romanian Master of Mathematics, 6

Tags: number theory , combinatorics , graph theory

Find all pairs of integers $(c, d)$, both greater than 1, such that the following holds: For any monic polynomial $Q$ of degree $d$ with integer coefficients and for any prime $p > c(2c+1)$, there exists a set $S$ of at most $\big(\tfrac{2c-1}{2c+1}\big)p$ integers, such that \[\bigcup_{s \in S} \{s,\; Q(s),\; Q(Q(s)),\; Q(Q(Q(s))),\; \dots\}\] contains a complete residue system modulo $p$ (i.e., intersects with every residue class modulo $p$).