Olympiad problems

1993 Tournament Of Towns, (371) 3

Each number in the second, third, and further rows of the following triangle: [img]https://cdn.artofproblemsolving.com/attachments/1/5/589d9266749477b0f56f0f503d4f18a6e5d695.png[/img] is equal to the difference of two neighbouring numbers standing above it. Find the last number (at the bottom of the triangle). (GW Leibnitz,)

2007 Bulgaria National Olympiad, 3

Tags: function , trigonometry , polynomial , search , algebra

Find the least positive integer $n$ such that $\cos\frac{\pi}{n}$ cannot be written in the form $p+\sqrt{q}+\sqrt[3]{r}$ with $p,q,r\in\mathbb{Q}$. [i]O. Mushkarov, N. Nikolov[/i] [hide]No-one in the competition scored more than 2 points[/hide]

1996 Tuymaada Olympiad, 2

Tags: algebra , set theory , real , set

Given a finite set of real numbers $A$, not containing $0$ and $1$ and possessing the property: if the number a belongs to $A$, then numbers $\frac{1}{a}$ and $1-a$ also belong to $A$. How many numbers are in the set $A$?

LMT Speed Rounds, 24

Tags: algebra

Evaluate $$2023 \cdot \frac{2023^6 +27}{(2023^2 +3)(2024^3 -1)}-2023^2.$$ [i]Proposed by Evin Liang[/i]

2024 Canadian Mathematical Olympiad Qualification, 4

Tags: algebra , recurrence relation , inequalities

A sequence $\{a_i\}$ is given such that $a_1 = \frac13$ and for all positive integers $n$ $$a_{n+1} =\frac{a^2_n}{a^2_n - a_n + 1}.$$ Prove that $$\frac12 - \frac{1}{3^{2^{n-1}}} < a_1 + a_2 +... + a_n <\frac12 - \frac{1}{3^{2^n}} ,$$ for all positive integers $n$.

2006 IMO Shortlist, 1

Tags: floor function , algebra , sequence , recurrence relation , periodic sequence

A sequence of real numbers $ a_{0},\ a_{1},\ a_{2},\dots$ is defined by the formula \[ a_{i \plus{} 1} \equal{} \left\lfloor a_{i}\right\rfloor\cdot \left\langle a_{i}\right\rangle\qquad\text{for}\quad i\geq 0; \]here $a_0$ is an arbitrary real number, $\lfloor a_i\rfloor$ denotes the greatest integer not exceeding $a_i$, and $\left\langle a_i\right\rangle=a_i-\lfloor a_i\rfloor$. Prove that $a_i=a_{i+2}$ for $i$ sufficiently large. [i]Proposed by Harmel Nestra, Estionia[/i]

2018 IFYM, Sozopol, 7

Tags: recurrence relation , recursion , algebra

The rows $x_n$ and $y_n$ of positive real numbers are such that: $x_{n+1}=x_n+\frac{1}{2y_n}$ and $y_{n+1}=y_n+\frac{1}{2x_n}$ for each positive integer $n$. Prove that at least one of the numbers $x_{2018}$ and $y_{2018}$ is bigger than 44,9

2020 OMpD, 4

Tags: function , real number , positive real , algebra

Let $\mathbb{R}^+$ the set of positive real numbers. Determine all the functions $f, g: \mathbb{R}^+ \rightarrow \mathbb{R}^+$ such that, for all positive real numbers $x, y$ we have that $$f(x + g(y)) = f(x + y) + g(y) \text{ and } g(x + f(y)) = g(x + y) + f(y)$$

2017 IOM, 3

Tags: polynomial , algebra

Let $Q$ be a quadriatic polynomial having two different real zeros. Prove that there is a non-constant monic polynomial $P$ such that all coefficients of the polynomial $Q(P(x))$ except the leading one are (by absolute value) less than $0.001$.

2018 Middle European Mathematical Olympiad, 4

Tags: number theory , algebra , floor function

(a) Prove that for every positive integer $m$ there exists an integer $n\ge m$ such that $$\left \lfloor \frac{n}{1} \right \rfloor \cdot \left \lfloor \frac{n}{2} \right \rfloor \cdots \left \lfloor \frac{n}{m} \right \rfloor =\binom{n}{m} \\\\\\\\\\\\\\\ (*)$$ (b) Denote by $p(m)$ the smallest integer $n \geq m$ such that the equation $ (*)$ holds. Prove that $p(2018) = p(2019).$ Remark: For a real number $x,$ we denote by $\left \lfloor x \right \rfloor$ the largest integer not larger than $x.$

2018 CMIMC Algebra, 6

Tags: algebra

We call $\overline{a_n\ldots a_2}$ the Fibonacci representation of a positive integer $k$ if \[k = \sum_{i=2}^n a_i F_i,\] where $a_i\in\{0,1\}$ for all $i$, $a_n=1$, and $F_i$ denotes the $i^{\text{th}}$ Fibonacci number ($F_0=0$, $F_1=1$, and $F_i=F_{i-1}+F_{i-2}$ for all $i\ge2$). This representation is said to be $\textit{minimal}$ if it has fewer 1’s than any other Fibonacci representation of $k$. Find the smallest positive integer that has eight ones in its minimal Fibonacci representation.

2017 NIMO Summer Contest, 13

Tags: quadratic , algebra , polynomial

We say that $1\leq a\leq101$ is a quadratic polynomial residue modulo $101$ with respect to a quadratic polynomial $f(x)$ with integer coefficients if there exists an integer $b$ such that $101 \mid a-f(b)$. For a quadratic polynomial $f$, we define its quadratic residue set as the set of quadratic residues modulo $101$ with respect to $f(x)$. Compute the number of quadratic residue sets. [i]Proposed by Michael Ren[/i]

2014 IFYM, Sozopol, 4

Tags: algebra , inequality , inequalities

Prove that for $\forall$ $x,y,z\in \mathbb{R}^+$ the following inequality is true: $\frac{x}{y+z}+\frac{25y}{z+x}+\frac{4z}{x+y}>2$.

2005 Estonia National Olympiad, 4

Tags: radical , algebra

Represent the number $\sqrt[3]{1342\sqrt{167}+2005}$ in the form where it contains only addition, subtraction, multiplication, division and square roots.

2001 Singapore Senior Math Olympiad, 1

Tags: system of equations , trigonometry , algebra

Let $n$ be a positive integer. Suppose that the following simultaneous equations $$\begin{cases} \sin x_1 + \sin x_2+ ...+ \sin x_n = 0 \\ \sin x_1 + 2\sin x_2+ ...+ n \sin x_n = 100 \end{cases}$$ has a solution, where $x_1 x_2,.., x_n$ are the unknowns. Find the smallest possible positive integer $n$. Justify your answer.

1982 Austrian-Polish Competition, 6

Tags: functional , functional equation , algebra

An integer $a$ is given. Find all real-valued functions $f (x)$ defined on integers $x \ge a$, satisfying the equation $f (x+y) = f (x) f (y)$ for all $x,y \ge a$ with $x + y \ge a$.

2010 AIME Problems, 7

Tags: algebra , polynomial , complex number

Let $ P(z) \equal{} z^3 \plus{} az^2 \plus{} bz \plus{} c$, where $ a$, $ b$, and $ c$ are real. There exists a complex number $ w$ such that the three roots of $ P(z)$ are $ w \plus{} 3i$, $ w \plus{} 9i$, and $ 2w \minus{} 4$, where $ i^2 \equal{} \minus{} 1$. Find $ |a \plus{} b \plus{} c|$.

2013 India IMO Training Camp, 3

Tags: induction , algebra

Let $h \ge 3$ be an integer and $X$ the set of all positive integers that are greater than or equal to $2h$. Let $S$ be a nonempty subset of $X$ such that the following two conditions hold: [list] [*]if $a + b \in S$ with $a \ge h, b \ge h$, then $ab \in S$; [*]if $ab \in S$ with $a \ge h, b \ge h$, then $a + b \in S$.[/list] Prove that $S = X$.

2018 Bulgaria National Olympiad, 3.

Tags: algebra , inequalities

Prove that \[ \left(\frac{6}{5}\right)^{\sqrt{3}}>\left(\frac{5}{4}\right)^{\sqrt{2}}. \]

2010 Saudi Arabia Pre-TST, 3.1

Tags: algebra , inequalities

Let $a \ge b \ge c > 0$. Prove that $$(a-b+c)\left(\frac{1}{a}-\frac{1}{b}+\frac{1}{c}\right) \ge 1$$

1993 Iran MO (3rd Round), 6

Tags: algebra

Let $x_1, x_2, \ldots, x_{12}$ be twelve real numbers such that for each $1 \leq i \leq 12$, we have $|x_i| \geq 1$. Let $I=[a,b]$ be an interval such that $b-a \leq 2$. Prove that number of the numbers of the form $t= \sum_{i=1}^{12} r_ix_i$, where $r_i=\pm 1$, which lie inside the interval $I$, is less than $1000$.

2020 Azerbaijan IZHO TST, 5

Tags: algebra

Let $x,y,z$ be positive real numbers such that $x^4+y^4+z^4=1$ . Determine with proof the minimum value of $\frac{x^3}{1-x^8}+\frac{y^3}{1-y^8}+\frac{z^3}{1-z^8}$

2009 IMO, 6

Tags: induction , probability , algebra , combinatorics

Let $ a_1, a_2, \ldots , a_n$ be distinct positive integers and let $ M$ be a set of $ n \minus{} 1$ positive integers not containing $ s \equal{} a_1 \plus{} a_2 \plus{} \ldots \plus{} a_n.$ A grasshopper is to jump along the real axis, starting at the point $ 0$ and making $ n$ jumps to the right with lengths $ a_1, a_2, \ldots , a_n$ in some order. Prove that the order can be chosen in such a way that the grasshopper never lands on any point in $ M.$ [i]Proposed by Dmitry Khramtsov, Russia[/i]

1988 Austrian-Polish Competition, 2

Tags: inequalities , sum , algebra

If $a_1 \le a_2 \le .. \le a_n$ are natural numbers ($n \ge 2$), show that the inequality $$\sum_{i=1}^n a_ix_i^2 +2\sum_{i=1}^{n-1} x_ix_{i+1} >0$$ holds for all $n$-tuples $(x_1,...,x_n) \ne (0,..., 0)$ of real numbers if and only if $a_2 \ge 2$.

2020 Israel Olympic Revenge, P3

Tags: number theory , algebra , polynomial

For each positive integer $n$, define $f(n)$ to be the least positive integer for which the following holds: For any partition of $\{1,2,\dots, n\}$ into $k>1$ disjoint subsets $A_1, \dots, A_k$, [u]all of the same size[/u], let $P_i(x)=\prod_{a\in A_i}(x-a)$. Then there exist $i\neq j$ for which \[\deg(P_i(x)-P_j(x))\geq \frac{n}{k}-f(n)\] a) Prove that there is a constant $c$ so that $f(n)\le c\cdot \sqrt{n}$ for all $n$. b) Prove that for infinitely many $n$, one has $f(n)\ge \ln(n)$.