Olympiad problems

2012 South East Mathematical Olympiad, 2

Tags: inequalities

Find the least natural number $n$, such that the following inequality holds:$\sqrt{\dfrac{n-2011}{2012}}-\sqrt{\dfrac{n-2012}{2011}}<\sqrt[3]{\dfrac{n-2013}{2011}}-\sqrt[3]{\dfrac{n-2011}{2013}}$.

2005 Greece JBMO TST, 1

Tags: geometry , convex polygon , convex

Examine if we can place $9$ convex $6$-angled polygons the one next to the other (with common only one side or part of her) to construct a convex $39$-angled polygon.

2003 National High School Mathematics League, 12

Tags:

$M_n=\{\overline{0.a_1a_2\cdots a_n}|a_i\in{0,1},i=1,2,\cdots,n,a_n=1\}$. $T_n=|M_n|,S_n=\sum_{x\in M_n}x$, then $\lim_{n\to\infty}\frac{S_n}{T_n}=$________.

1957 Czech and Slovak Olympiad III A, 1

Tags: equation , parametric equation , algebra , parameterization

Find all real numbers $p$ such that the equation $$\sqrt{x^2-5p^2}=px-1$$ has a root $x=3$. Then, solve the equation for the determined values of $p$.

2018 Moscow Mathematical Olympiad, 5

Tags: geometry

On the sides of the convex hexagon $ABCDEF$ into the outer side were built equilateral triangles $ABC_1$, $BCD_1$, $CDE_1$, $DEF_1$, $EFA_1$ and $FAB_1$. The triangle $B_1D_1F_1$ is equilateral too. Prove that, the triangle $A_1C_1E_1$ is also equilateral.

2024 Simon Marais Mathematical Competition, A2

Tags: number theory

A positive integer $n$ is [i] tripariable [/i] if it is possible to partition the set $\{1, 2, \dots, n\}$ into disjoint pairs such that the sum of two elements in each pair is a power of $3$. For example $6$ is tripariable because $\{1, 2, \dots, n\}=\{1,2\}\cup\{3,6\}\cup\{4,5\}$ and $$1+2=3^1,\quad 3+6 = 3^2\quad\text{and}\quad4+5=3^2$$ are all powers of 3. How many positive integers less than or equal to 2024 are tripariable?

2019 AIME Problems, 5

Tags:

Four ambassadors and one advisor for each of them are to be seated at a round table with $12$ chairs numbered in order from $1$ to $12$. Each ambassador must sit in an even-numbered chair. Each advisor must sit in a chair adjacent to his or her ambassador. There are $N$ ways for the $8$ people to be seated at the table under these conditions. Find the remainder when $N$ is divided by $1000$.

1980 IMO, 4

Tags: limit , real analysis

Given a real number $x>1$, prove that there exists a real number $y >0$ such that \[\lim_{n \to \infty} \underbrace{\sqrt{y+\sqrt {y + \cdots+\sqrt y}}}_{n \text{ roots}}=x.\]

2016 PUMaC Geometry B, 3

Tags: geometry

Let $ABCD$ be a square with side length $8$. Let $M$ be the midpoint of $BC$ and let $\omega$ be the circle passing through $M, A$, and $D$. Let $O$ be the center of $\omega, X$ be the intersection point (besides A) of $\omega$ with $AB$, and $Y$ be the intersection point of $OX$ and $AM$. If the length of $OY$ can be written in simplest form as $\frac{m}{n}$ , compute $m + n$.

1978 All Soviet Union Mathematical Olympiad, 256

Tags: game strategy , combinatorics

Given two heaps of checkers. the bigger contains $m$ checkers, the smaller -- $n$ ($m>n$). Two players are taking checkers in turn from the arbitrary heap. The players are allowed to take from the heap a number of checkers (not zero) divisible by the number of checkers in another heap. The player that takes the last checker in any heap wins. a) Prove that if $m > 2n$, than the first can always win. b) Find all $x$ such that if $m > xn$, than the first can always win.

2014 IFYM, Sozopol, 8

Tags: combinatorics , table

We will call a rectangular table filled with natural numbers [i]“good”[/i], if for each two rows, there exist a column for which its two cells that are also in these two rows, contain numbers of different parity. Prove that for $\forall$ $n>2$ we can erase a column from a [i]good[/i] $n$ x $n$ table so that the remaining $n$ x $(n-1)$ table is also [i]good[/i].

2001 District Olympiad, 1

Tags: modular arithmetic , number theory

A positive integer is called [i]good[/i] if it can be written as a sum of two consecutive positive integers and as a sum of three consecutive positive integers. Prove that: a)2001 is [i]good[/i], but 3001 isn't [i]good[/i]. b)the product of two [i]good[/i] numbers is a [i]good[/i] number. c)if the product of two numbers is [i]good[/i], then at least one of the numbers is [i]good[/i]. [i]Bogdan Enescu[/i]

2005 Estonia National Olympiad, 3

Tags: digit , number theory , divisible

How many such four-digit natural numbers divisible by $7$ exist such when changing the first and last number we also get a four-digit divisible by $7$?

2000 Harvard-MIT Mathematics Tournament, 21

Tags:

How many ways can you color a necklace of $7$ beads with $4$ colors so that no two adjacent beads have the same color?

2019 Latvia Baltic Way TST, 4

Tags: algebra , polynomial , inequalities , chebyshev polynomial

Let $P(x)$ be a polynomial with degree $n$ and real coefficients. For all $0 \le y \le 1$ holds $\mid p(y) \mid \le 1$. Prove that $p(-\frac{1}{n}) \le 2^{n+1} -1$

2016 AMC 10, 25

Tags: number theory , least common multiple

How many ordered triples $(x,y,z)$ of positive integers satisfy $\text{lcm}(x,y) = 72, \text{lcm}(x,z) = 600$ and $\text{lcm}(y,z)=900$? $\textbf{(A)}\ 15\qquad\textbf{(B)}\ 16\qquad\textbf{(C)}\ 24\qquad\textbf{(D)}\ 27\qquad\textbf{(E)}\ 64$

2017 China Team Selection Test, 1

Tags: inequalities

Let $n \geq 4$ be a natural and let $x_1,\ldots,x_n$ be non-negative reals such that $x_1 + \cdots + x_n = 1$. Determine the maximum value of $x_1x_2x_3 + x_2x_3x_4 + \cdots + x_nx_1x_2$.

2014 Contests, 2

Tags: pigeonhole principle , number theory

Prove that among any $16$ perfect cubes we can always find two cubes whose difference is divisible by $91$.

2017 Math Prize for Girls Problems, 10

Tags: geometry , 3d geometry

Let $C$ be a cube. Let $P$, $Q$, and $R$ be random vertices of $C$, chosen uniformly and independently from the set of vertices of $C$. (Note that $P$, $Q$, and $R$ might be equal.) Compute the probability that some face of $C$ contains $P$, $Q$, and $R$.

Indonesia MO Shortlist - geometry, g3

Tags: geometry , tangent circle

Given triangle $ABC$. A circle $\Gamma$ is tangent to the circumcircle of triangle $ABC$ at $A$ and tangent to $BC$ at $D$. Let $E$ be the intersection of circle $\Gamma$ and $AC$. Prove that $$R^2=OE^2+CD^2\left(1- \frac{BC^2}{AB^2+AC^2}\right)$$ where $O$ is the center of the circumcircle of triangle $ABC$, with radius $R$.

1957 Polish MO Finals, 2

Tags: trigonometry , geometry

Prove that between the sides $ a $, $ b $, $ c $ and the opposite angles $ A $, $ B $, $ C $ of a triangle there is a relationship $$ a^2 \cos^2 A = b^2 \cos^2 B + c^2 \cos^2 C + 2bc \cos B \cos C \cos 2A.$$

1958 February Putnam, B7

Tags: continuity , integral

Prove that if $f(x)$ is continuous for $a\leq x \leq b$ and $$\int_{a}^{b} x^n f(x) \, dx =0$$ for $n=0,1,2, \ldots,$ then $f(x)$ is identically zero on $a \leq x \leq b.$

2007 District Olympiad, 2

Tags: combinatorics

In an urn we have red and blue balls. A person has invented the next game: he extracts balls until he realises for the first time that the number of blue balls is equal to the number of red balls. After a such game he finds out that he has extracted 10 balls, and that there does not exist 3 consecutive balls of the same color. Prove that the fifth and the sixth balls have different collors.

2016 Tournament Of Towns, 1

Tags: logarithm , algebra

On a blackboard the product $log_{( )}[ ]\times\dots\times log_{( )}[ ]$ is written (there are 50 logarithms in the product). Donald has $100$ cards: $[2], [3],\dots, [51]$ and $(52),\dots,(101)$. He is replacing each $()$ with some card of form $(x)$ and each $[]$ with some card of form $[y]$. Find the difference between largest and smallest values Donald can achieve.

2018 Greece Team Selection Test, 1

Tags: inequalities

If $x, y, z$ are positive real numbers such that $x + y + z = 9xyz.$ Prove that: $$\frac {x} {\sqrt {x^2+2yz+2}}+\frac {y} {\sqrt {y^2+2zx+2}}+\frac {z} {\sqrt {z^2+2xy+2}}\ge 1.$$ Consider when equality applies.