Olympiad problems

2016 Rioplatense Mathematical Olympiad, Level 3, 4

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$).

1969 All Soviet Union Mathematical Olympiad, 121

Tags: combinatorial geometry , points in space , geometry

Given $n$ points in the three dimensional space such, that the arbitrary triangle with the vertices in three of those points contains an angle greater than $120$ degrees. Prove that you can rearrange them to make a polyline (unclosed) with all the angles between the sequent links greater than $120$ degrees.

2021 Austrian MO Regional Competition, 2

Tags: geometry , tangent , isosceles

Let $ABC$ be an isosceles triangle with $AC = BC$ and circumcircle $k$. The point $D$ lies on the shorter arc of $k$ over the chord $BC$ and is different from $B$ and $C$. Let $E$ denote the intersection of $CD$ and $AB$. Prove that the line through $B$ and $C$ is a tangent of the circumcircle of the triangle $BDE$. (Karl Czakler)

1992 Putnam, B1

Tags: average , set theory

Let $S$ be a set of $n$ distinct real numbers. Let $A_{S}$ be the set of numbers that occur as averages of two distinct elements of $S$. For a given $n \geq 2$, what is the smallest possible number of elements in $A_{S}$?

2006 AIME Problems, 8

Tags: counting , distinguishability , geometry , geometric transformation , rotation , reflection

There is an unlimited supply of congruent equilateral triangles made of colored paper. Each triangle is a solid color with the same color on both sides of the paper. A large equilateral triangle is constructed from four of these paper triangles. Two large triangles are considered distinguishable if it is not possible to place one on the other, using translations, rotations, and/or reflections, so that their corresponding small triangles are of the same color. Given that there are six different colors of triangles from which to choose, how many distinguishable large equilateral triangles may be formed?

KoMaL A Problems 2023/2024, A. 865

Tags: combinatorics , grid problem

A crossword is a grid of black and white cells such that every white cell belongs to some $2\times 2$ square of white cells. A word in the crossword is a contiguous sequence of two or more white cells in the same row or column, delimited on each side by either a black cell or the boundary of the grid. Show that the total number of words in an $n\times n$ crossword cannot exceed $(n+1)^2/2$. [i]Proposed by Nikolai Beluhov, Bulgaria[/i]

2014 ELMO Shortlist, 5

Tags: function , combinatorics

Let $n$ be a positive integer. For any $k$, denote by $a_k$ the number of permutations of $\{1,2,\dots,n\}$ with exactly $k$ disjoint cycles. (For example, if $n=3$ then $a_2=3$ since $(1)(23)$, $(2)(31)$, $(3)(12)$ are the only such permutations.) Evaluate \[ a_n n^n + a_{n-1} n^{n-1} + \dots + a_1 n. \][i]Proposed by Sammy Luo[/i]

2022 Saudi Arabia BMO + EGMO TST, 2.1

Tags: recurrence relation , recurrence , number theory

Define $a_0 = 2$ and $a_{n+1} = a^2_n + a_n -1$ for $n \ge 0$. Prove that $a_n$ is coprime to $2n + 1$ for all $n \in N$.

1986 Tournament Of Towns, (118) 6

Tags: inequalities , algebra

Given the nonincreasing sequence of non-negative numbers in which $a_1 \ge a_2 \ge a_3 \ge ... \ge a_{2n-1}\ge 0$. Prove that $a^2_1 -a^2_2 + a^2_3 - ... + a^2_{2n- l} \ge (a_1 - a_2 + a_3 - ... + a_{2n- l} )^2$ . ( L . Kurlyandchik , Leningrad )

2007 India IMO Training Camp, 2

Tags: number theory

Find all integer solutions of the equation \[\frac {x^{7} \minus{} 1}{x \minus{} 1} \equal{} y^{5} \minus{} 1.\]

2023 China Second Round, 4

Tags: vector , algebra

if three non-zero vectors on a plane $\vec{a},\vec{b},\vec{c}$ satisfy: (a) $\vec{a}\bot\vec{b}$ (b) $\vec{b}\cdot\vec{c}=2|\vec{a}|$ (c) $\vec{c}\cdot\vec{a}=3|\vec{b}|$ find out the minimum of $|\vec{c}|$

1992 IMO Longlists, 70

Tags: inequalities , geometry , perimeter , geometric inequality

Let two circles $A$ and $B$ with unequal radii $r$ and $R$, respectively, be tangent internally at the point $A_0$. If there exists a sequence of distinct circles $(C_n)$ such that each circle is tangent to both $A$ and $B$, and each circle $C_{n+1}$ touches circle $C_{n}$ at the point $A_n$, prove that \[\sum_{n=1}^{\infty} |A_{n+1}A_n| < \frac{4 \pi Rr}{R+r}.\]