Olympiad problems

1985 AMC 12/AHSME, 18

Tags:

Six bags of marbles contain $ 18$, $ 19$, $ 21$, $ 23$, $ 25$, and $ 34$ marbles, respectively. One bag contains chipped marbles only. The other $ 5$ bags contain no chipped marbles. Jane takes three of the bags and George takes two of the others. Only the bag of chipped marbles remains. If Jane gets twice as many marbles as George, how many chipped marbles are there? $ \textbf{(A)}\ 18 \qquad \textbf{(B)}\ 19 \qquad \textbf{(C)}\ 21 \qquad \textbf{(D)}\ 23 \qquad \textbf{(E)}\ 25$

2017 Pan-African Shortlist, C2

Tags: combinatorics

On a $50 \times 50$ chessboard, we put, in the lower left corner, a die whose faces are numbered from $1$ to $6$. By convention, the sum of digits on two opposite side of the die equals $7$. Adama wants to move the die to the diagonally opposite corner using the following rule: at each step, Adama can roll the die only on to its right side, or to its top side. We suppose that whenever the die lands on a square, the number on its bottom face is printed on the square. By the end of these operations, Adama wants to find the sum of the $99$ numbers appearing on the chessboard. What are the maximum and minimum possible values of this sum?

2010 Korea National Olympiad, 2

Tags: inequalities

Let $ a, b, c $ be positive real numbers such that $ ab+bc+ca=1 $. Prove that \[ \sqrt{ a^2 + b^2 + \frac{1}{c^2}} + \sqrt{ b^2 + c^2 + \frac{1}{a^2}} + \sqrt{ c^2 + a^2 + \frac{1}{b^2}} \ge \sqrt{33} \]

2018 IMC, 8

Tags: combinatorics

Let $\Omega =\{ (x,y,z)\in \mathbb{Z}^3:y+1\geqslant x\geqslant y\geqslant z\geqslant 0\}$. A frog moves along the points of $\Omega$ by jumps of length $1$. For every positive integer $n$, determine the number of paths the frog can take to reach $(n,n,n)$ starting from $(0,0,0)$ in exactly $3n$ jumps. [i]Proposed by Fedor Petrov and Anatoly Vershik, St. Petersburg State University[/i]

Russian TST 2015, P3

Tags: number theory , operation

Fix positive integers $n$ and $k\ge 2$. A list of $n$ integers is written in a row on a blackboard. You can choose a contiguous block of integers, and I will either add $1$ to all of them or subtract $1$ from all of them. You can repeat this step as often as you like, possibly adapting your selections based on what I do. Prove that after a finite number of steps, you can reach a state where at least $n-k+2$ of the numbers on the blackboard are all simultaneously divisible by $k$.

2015 Czech-Polish-Slovak Junior Match, 5

Tags: divisor , number theory

Determine all natural numbers$ n> 1$ with the property: For each divisor $d> 1$ of number $n$, then $d - 1$ is a divisor of $n - 1$.

Math Hour Olympiad, Grades 8-10, 2014.5

Tags: modular arithmetic

An infinite number of lilypads grow in a line, numbered $\dots$, $-2$, $-1$, $0$, $1$, $2$, $\dots$ Thumbelina and her pet frog start on one of the lilypads. She wants to make a sequence of jumps that will end on either pad $0$ or pad $96$. On each jump, Thumbelina tells her frog the distance (number of pads) to leap, but the frog chooses whether to jump left or right. From which starting pads can she always get to pad $0$ or pad $96$, regardless of her frog's decisions?

1968 AMC 12/AHSME, 4

Tags: function

Define an operation $*$ for positve real numbers as $a*b=\dfrac{ab}{a+b}$. Then $4*(4*4)$ equals: $\textbf{(A)}\ \frac{3}{4} \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ \dfrac{4}{3} \qquad \textbf{(D)}\ 2 \qquad \textbf{(E)}\ \dfrac{16}{3} $

2017 Romania Team Selection Test, P1

Tags: number theory , abstract algebra

a) Determine all 4-tuples $(x_0,x_1,x_2,x_3)$ of pairwise distinct intergers such that each $x_k$ is coprime to $x_{k+1}$(indices reduces modulo 4) and the cyclic sum $\frac{x_0}{x_1}+\frac{x_1}{x_2}+\frac{x_2}{x_3}+\frac{x_3}{x_1}$ is an interger. b)Show that there are infinitely many 5-tuples $(x_0,x_1,x_2,x_3,x_4)$ of pairwise distinct intergers such that each $x_k$ is coprime to $x_{k+1}$(indices reduces modulo 5) and the cyclic sum $\frac{x_0}{x_1}+\frac{x_1}{x_2}+\frac{x_2}{x_3}+\frac{x_3}{x_4}+\frac{x_4}{x_0}$ is an interger.

2024 CMIMC Combinatorics and Computer Science, 2

Tags: combinatorics

Robert has two stacks of five cards numbered 1--5, one of which is randomly shuffled while the other is in numerical order. They pick one of the stacks at random and turn over the first three cards, seeing that they are 1, 2, and 3 respectively. What is the probability the next card is a 4? [i]Proposed by Connor Gordon[/i]

1996 Korea National Olympiad, 5

Tags: infinite descent , number theory

Find all integer solution triple $(x,y,z)$ such that $x^2+y^2+z^2-2xyz=0.$

1986 All Soviet Union Mathematical Olympiad, 432

Tags: game , game strategy , combinatorics

Given $30$ equal cups with milk. An elf tries to make the amount of milk equal in all the cups. He takes a pair of cups and aligns the milk level in two cups. Can there be such an initial distribution of milk in the cups, that the elf will not be able to achieve his goal in a finite number of operations?

2009 Irish Math Olympiad, 2

Tags: number theory , greatest common divisor

For any positive integer $n$ define $$E(n)=n(n+1)(2n+1)(3n+1)\cdots (10n+1).$$ Find the greatest common divisor of $E(1),E(2),E(3),\dots ,E(2009).$

2011 Tokyo Instutute Of Technology Entrance Examination, 2

Tags: calculus , integration , trigonometry , calculus computations , logarithm

For a real number $x$, let $f(x)=\int_0^{\frac{\pi}{2}} |\cos t-x\sin 2t|\ dt$. (1) Find the minimum value of $f(x)$. (2) Evaluate $\int_0^1 f(x)\ dx$. [i]2011 Tokyo Institute of Technology entrance exam, Problem 2[/i]

1994 Tournament Of Towns, (401) 3

Tags: geometry , incenter , geometric inequality , angle

Let $O$ be a point inside a convex polygon $A_1A_2... A_n$ such that $$\angle OA_1A_n \le \angle OA_1A_2, \angle OA_2A_1 \le \angle OA_2A_3, ..., \angle OA_{n-1}A_{n-2} \le \angle OA_{n-1}A_n, \angle OA_nA_{n-1} \le \angle OA_nA_1$$ and all of these angles are acute. Prove that $O$ is the centre of the circle inscribed in the polygon. (V Proizvolov)

2021 Vietnam TST, 2

Tags: combinatorics

In a board of $2021 \times 2021$ grids, we pick $k$ unit squares such that every picked square shares vertice(s) with at most $1$ other picked square. Determine the maximum of $k$.

1991 IMO Shortlist, 7

Tags: geometry , 3d geometry , tetrahedron , rhombus

$ ABCD$ is a terahedron: $ AD\plus{}BD\equal{}AC\plus{}BC,$ $ BD\plus{}CD\equal{}BA\plus{}CA,$ $ CD\plus{}AD\equal{}CB\plus{}AB,$ $ M,N,P$ are the mid points of $ BC,CA,AB.$ $ OA\equal{}OB\equal{}OC\equal{}OD.$ Prove that $ \angle MOP \equal{} \angle NOP \equal{}\angle NOM.$

2005 China Team Selection Test, 1

Tags: trigonometry , incenter , geometric transformation , homothety , power of a point , geometry

Triangle $ABC$ is inscribed in circle $\omega$. Circle $\gamma$ is tangent to $AB$ and $AC$ at points $P$ and $Q$ respectively. Also circle $\gamma$ is tangent to circle $\omega$ at point $S$. Let the intesection of $AS$ and $PQ$ be $T$. Prove that $\angle{BTP}=\angle{CTQ}$.

2023 Harvard-MIT Mathematics Tournament, 31

Tags: guts

Let $$P=\prod_{i=0}^{2016} (i^3-i-1)^2.$$ The remainder when $P$ is divided by the prime $2017$ is not zero. Compute this remainder.

2017-2018 SDML (Middle School), 14

Tags:

Amy made a list of every possible distinct five-digit positive integer that can be formed using each of the digits $1, 2, 3, 4,$ and $5$ exactly once in each integer. What is the sum of the integers on Amy's list? $\mathrm{(A) \ } 3000000 \qquad \mathrm{(B) \ } 3600000 \qquad \mathrm {(C) \ } 3999960 \qquad \mathrm{(D) \ } 3999990 \qquad \mathrm{(E) \ } 5999940$

2004 Switzerland Team Selection Test, 7

Tags: system of equations , product , algebra

The real numbers $a,b,c,d$ satisfy the equations: $$\begin{cases} a =\sqrt{45-\sqrt{21-a}} \\ b =\sqrt{45+\sqrt{21-b}}\\ c =\sqrt{45-\sqrt{21+c}}\ \\ d=\sqrt{45+\sqrt{21+d}} \end {cases}$$ Prove that $abcd = 2004$.

1990 Nordic, 4

Tags: positive integer , number theory , operation

It is possible to perform three operations $f, g$, and $h$ for positive integers: $f(n) = 10n, g(n) = 10n + 4$, and $h(2n) = n$; in other words, one may write $0$ or $4$ in the end of the number and one may divide an even number by $2$. Prove: every positive integer can be constructed starting from $4$ and performing a finite number of the operations $f, g,$ and $h$ in some order.

2014 Taiwan TST Round 1, 2

Tags: inequalities , geometry , area of a triangle , heron's formula

A triangle has side lengths $a$, $b$, $c$, and the altitudes have lengths $h_a$, $h_b$, $h_c$. Prove that \[ \left( \frac{a}{h_a} \right)^2 + \left( \frac{b}{h_b} \right)^2 + \left( \frac{c}{h_c} \right)^2 \ge 4. \]

Kyiv City MO Juniors 2003+ geometry, 2020.9.41

Tags: geometry , equal segments , angle

The points $A, B, C, D$ are selected on the circle as followed so that $AB = BC = CD$. Bisectors of $\angle ABD$ and $\angle ACD$ intersect at point $E$. Find $\angle ABC$, if it is known that $AE \parallel CD$.

2024 ELMO Shortlist, C3

Tags: combinatorics

Let $n$ and $k$ be positive integers and $G$ be a complete graph on $n$ vertices. Each edge of $G$ is colored one of $k$ colors such that every triangle consists of either three edges of the same color or three edges of three different colors. Furthermore, there exist two different-colored edges. Prove that $n\le(k-1)^2$. [i]Linus Tang[/i]