Olympiad problems

2022 Kosovo National Mathematical Olympiad, 1

Tags: combinatorics

Ana has a scale that shows which side weight more or if both side are equal. She has $4$ weights which look the same but they weight $1001g, 1002g, 1004g$ and $1005g$, respectively. Is it possible for Ana to find out the weight of each of them with only $4$ measurements?

2007 Junior Balkan Team Selection Tests - Romania, 2

Tags: power of a point , radical axis , geometry

Let $w_{1}$ and $w_{2}$ be two circles which intersect at points $A$ and $B$. Consider $w_{3}$ another circle which cuts $w_{1}$ in $D,E$, and it is tangent to $w_{2}$ in the point $C$, and also tangent to $AB$ in $F$. Consider $G \in DE \cap AB$, and $H$ the symetric point of $F$ w.r.t $G$. Find $\angle{HCF}$.

2010 CHMMC Fall, 9

Tags: algebra

Let $a_0, a_1, . . . ,a_n$ be such that $a_n \ne 0$ and $$(1 + x + x^3)^{342} (1 + 2x + x^2 + 2x^3 + 2x^4 + x^6)^{341} =\sum^{n}_{i=0}a_ix^i.$$ Compute the number of odd terms in the sequence $a_0, a_1, . . . ,a_n$.

2014 CentroAmerican, 3

Tags: inequalities

Let $a$, $b$, $c$ and $d$ be real numbers such that no two of them are equal, \[\frac{a}{b}+\frac{b}{c}+\frac{c}{d}+\frac{d}{a}=4\] and $ac=bd$. Find the maximum possible value of \[\frac{a}{c}+\frac{b}{d}+\frac{c}{a}+\frac{d}{b}.\]

2019 Miklós Schweitzer, 8

Tags: real analysis

Let $f: \mathbb{R} \to \mathbb{R}$ be a measurable function such that $f(x+t) - f(x)$ is locally integrable for every $t$ as a function of $x$. Prove that $f$ is locally integrable.

2002 National Olympiad First Round, 22

Tags: modular arithmetic

If $2^n$ divides $5^{256} - 1$, what is the largest possible value of $n$? $ \textbf{a)}\ 8 \qquad\textbf{b)}\ 10 \qquad\textbf{c)}\ 11 \qquad\textbf{d)}\ 12 \qquad\textbf{e)}\ \text{None of above} $

2011 District Olympiad, 3

Tags: linear algebra

Let $A,B\in \mathcal{M}_2(\mathbb{C})$ two non-zero matrices such that $AB+BA=O_2$ and $\det(A+B)=0$. Prove $A$ and $B$ have null traces.

2009 Turkey Team Selection Test, 2

Tags: inequalities , geometry

In a triangle $ ABC$ incircle touches the sides $ AB$, $ AC$ and $ BC$ at $ C_1$, $ B_1$ and $ A_1$ respectively. Prove that $ \sqrt {\frac {AB_1}{AB}} \plus{} \sqrt {\frac {BC_1}{BC}} \plus{} \sqrt {\frac {CA_1}{CA}}\leq\frac {3}{\sqrt {2}}$ is true.

1991 Swedish Mathematical Competition, 2

Tags: inequalities , algebra

$x, y$ are positive reals such that $x - \sqrt{x} \le y - 1/4 \le x + \sqrt{x}$. Show that $y - \sqrt{y} \le x - 1/4 \le y + \sqrt{y}$.

2020 Mexico National Olympiad, 6

Tags: vector , algebra

Let $n\ge 2$ be a positive integer. Let $x_1, x_2, \dots, x_n$ be non-zero real numbers satisfying the equation \[\left(x_1+\frac{1}{x_2}\right)\left(x_2+\frac{1}{x_3}\right)\dots\left(x_n+\frac{1}{x_1}\right)=\left(x_1^2+\frac{1}{x_2^2}\right)\left(x_2^2+\frac{1}{x_3^2}\right)\dots\left(x_n^2+\frac{1}{x_1^2}\right).\] Find all possible values of $x_1, x_2, \dots, x_n$. [i]Proposed by Victor Domínguez[/i]

2004 IMO Shortlist, 3

Tags: graph theory , combinatorics , algorithm , game

The following operation is allowed on a finite graph: Choose an arbitrary cycle of length 4 (if there is any), choose an arbitrary edge in that cycle, and delete it from the graph. For a fixed integer ${n\ge 4}$, find the least number of edges of a graph that can be obtained by repeated applications of this operation from the complete graph on $n$ vertices (where each pair of vertices are joined by an edge). [i]Proposed by Norman Do, Australia[/i]

1990 Poland - Second Round, 6

Tags: geometry , combinatorics , combinatorial geometry , convex polygon , area

For any convex polygon $ W $ with area 1, let us denote by $ f(W) $ the area of the convex polygon whose vertices are the centers of all sides of the polygon $ W $. For each natural number $ n \geq 3 $, determine the lower limit and the upper limit of the set of numbers $ f(W) $ when $ W $ runs through the set of all $ n $ convex angles with area 1.

1998 Austrian-Polish Competition, 4

Tags: inequalities , sum , algebra

For positive integers $m, n$, denote $$S_m(n)=\sum_{1\le k \le n} \left[ \sqrt[k^2]{k^m}\right]$$ Prove that $S_m(n) \le n + m (\sqrt[4]{2^m}-1)$

2016 Turkey EGMO TST, 5

Tags: combinatorics , periodic sequence , algebra , sequence

A sequence $a_1, a_2, \ldots $ consisting of $1$'s and $0$'s satisfies for all $k>2016$ that \[ a_k=0 \quad \Longleftrightarrow \quad a_{k-1}+a_{k-2}+\cdots+a_{k-2016}>23. \] Prove that there exist positive integers $N$ and $T$ such that $a_k=a_{k+T}$ for all $k>N$.

1996 Putnam, 5

Tags: floor function

Given a finite binary string $S$ of symbols $X,O$ we define $\Delta(S)=n(X)-n(O)$ where $n(X),n(O)$ respectively denote number of $X$'s and $O$'s in a string. For example $\Delta(XOOXOOX)=3-4=-1$. We call a string $S$ $\emph{balanced}$ if every substring $T$ of $S$ has $-2\le \Delta(T)\le 2$. Find number of balanced strings of length $n$.

2023 Belarusian National Olympiad, 8.7

Tags: number theory

A sequence $(a_n)$ positive integers is determined by equalities $a_1=20,a_2=22$ and $a_{n+1}=4a_n^2+5a_{n-1}^3$ for all $n \geq 2$. Find the maximum power of two which divides $a_{2023}$.

2023 Junior Balkan Team Selection Tests - Romania, P1

Tags: number theory

Determine all natural numbers $n \geq 2$ with at most four natural divisors, which have the property that for any two distinct proper divisors $d_1$ and $d_2$ of $n$, the positive integer $d_1-d_2$ divides $n$.

2002 AMC 10, 4

Tags:

What is the value of \[ (3x \minus{} 2)(4x \plus{} 1) \minus{} (3x \minus{} 2)4x \plus{} 1\]when $ x \equal{} 4$? $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 10 \qquad \textbf{(D)}\ 11 \qquad \textbf{(E)}\ 12$

2010 Today's Calculation Of Integral, 599

Tags: calculus , integration , trigonometry , calculus computations

Evaluate $\int_0^{\frac{\pi}{6}} \frac{e^x(\sin x+\cos x+\cos 3x)}{\cos^ 2 {2x}}\ dx$. created by kunny

2012 Iran Team Selection Test, 2

Tags: rotation , inequalities , combinatorial geometry , combinatorics

Let $n$ be a natural number. Suppose $A$ and $B$ are two sets, each containing $n$ points in the plane, such that no three points of a set are collinear. Let $T(A)$ be the number of broken lines, each containing $n-1$ segments, and such that it doesn't intersect itself and its vertices are points of $A$. Define $T(B)$ similarly. If the points of $B$ are vertices of a convex $n$-gon (are in [i]convex position[/i]), but the points of $A$ are not, prove that $T(B)<T(A)$. [i]Proposed by Ali Khezeli[/i]

2008 Tournament Of Towns, 2

Tags: 3d geometry , analytic geometry , geometry

Space is dissected into congruent cubes. Is it necessarily true that for each cube there exists another cube so that both cubes have a whole face in common?

EGMO 2017, 4

Tags: combinatorics , graph theory , vertex degree

Let $n\geq1$ be an integer and let $t_1<t_2<\dots<t_n$ be positive integers. In a group of $t_n+1$ people, some games of chess are played. Two people can play each other at most once. Prove that it is possible for the following two conditions to hold at the same time: (i) The number of games played by each person is one of $t_1,t_2,\dots,t_n$. (ii) For every $i$ with $1\leq i\leq n$, there is someone who has played exactly $t_i$ games of chess.

2017 ASDAN Math Tournament, 10

Tags:

Compute $$\lim_{k\rightarrow\infty}\left(\frac{2017^{1/k}}{k+1}+\frac{2017^{2/k}}{k+\frac{1}{2}}+\dots+\frac{2017^{k/k}}{k+\frac{1}{k}}\right).$$

2011 Dutch IMO TST, 5

Tags: bisects segment , angle bisector , geometry

Let $ABC$ be a triangle with $|AB|> |BC|$. Let $D$ be the midpoint of $AC$. Let $E$ be the intersection of the angular bisector of $\angle ABC$ and the line $AC$. Let $F$ be the point on $BE$ such that $CF$ is perpendicular to $BE$. Finally, let $G$ be the intersection of $CF$ and $BD$. Prove that $DF$ divides the line segment $EG$ into two equal parts.

1983 IMO Shortlist, 22

Tags: trigonometric equation , trigonometry , number theory , equation , trigonometric identities

Let $n$ be a positive integer having at least two different prime factors. Show that there exists a permutation $a_1, a_2, \dots , a_n$ of the integers $1, 2, \dots , n$ such that \[\sum_{k=1}^{n} k \cdot \cos \frac{2 \pi a_k}{n}=0.\]