Olympiad problems

2023-24 IOQM India, 22

Tags:

In an equilateral triangle of side length 6 , pegs are placed at the vertices and also evenly along each side at a distance of 1 from each other. Four distinct pegs are chosen from the 15 interior pegs on the sides (that is, the chosen ones are not vertices of the triangle) and each peg is joined to the respective opposite vertex by a line segment. If $N$ denotes the number of ways we can choose the pegs such that the drawn line segments divide the interior of the triangle into exactly nine regions, find the sum of the squares of the digits of $N$.

PEN S Problems, 27

Tags:

Which integers have the following property? If the final digit is deleted, the integer is divisible by the new number.

2016 Czech-Polish-Slovak Junior Match, 6

Let $k$ be a given positive integer. Find all triples of positive integers $a, b, c$, such that $a + b + c = 3k + 1$, $ab + bc + ca = 3k^2 + 2k$. Slovakia

2009 Purple Comet Problems, 11

Tags: percent

Aisha went shopping. At the first store she spent $40$ percent of her money plus four dollars. At the second store she spent $50$ percent of her remaining money plus $5$ dollars. At the third store she spent $60$ percent of her remaining money plus six dollars. When Aisha was done shopping at the three stores, she had two dollars left. How many dollars did she have with her when she started shopping?

2022 VN Math Olympiad For High School Students, Problem 5

Tags: algebra , number theory

Given [i]Fibonacci[/i] sequence $(F_n),$ and a positive integer $m$, denote $k(m)$ by the smallest positive integer satisfying $F_{n+k(m)}\equiv F_n(\bmod m),$ for all natural numbers $n$, $p$ is an odd prime such that $p \equiv \pm 1(\bmod 5)$. Prove that: a) ${5^{\frac{{p - 1}}{2}}} \equiv 1(\bmod p).$ b) ${F_{p - 1}} \equiv 0(\bmod p).$ c) $k(p)|p-1.$

2022 Grosman Mathematical Olympiad, P7

Tags: combinatorics

Let $k\leq n$ be two positive integers. $n$ points are marked on a line. It is known that for each marked point, the number of marked points at a distance $\leq 1$ from it (including the point itself) is divisible by $k$. Show that $k$ divides $n$ (without remainder).

2018 Israel National Olympiad, 3

Tags: absolute value , minimum value , maximum value , maximum and minimum , algebra , inequality

Determine the minimal and maximal values the expression $\frac{|a+b|+|b+c|+|c+a|}{|a|+|b|+|c|}$ can take, where $a,b,c$ are real numbers.

1997 Cono Sur Olympiad, 4

Tags: combinatorics

Consider a board with $n$ rows and $4$ columns. In the first line are written $4$ zeros (one in each house). Next, each line is then obtained from the previous line by performing the following operation: one of the houses, (that you can choose), is maintained as in the previous line; the other three are changed: * if in the previous line there was a $0$, then in the down square $1$ is placed; * if in the previous line there was a $1$, then in the down square $2$ is placed; * if in the previous line there was a $2$, then in the down square $0$ is placed; Build the largest possible board with all its distinct lines and demonstrate that it is impossible to build a larger board.

II Soros Olympiad 1995 - 96 (Russia), 11.4

Tags: analytic geometry , algebra

Draw on the coordinate plane a set of points $M(a, b)$ such that the equation $x^4+ax+b=0$ has a unique root satisfying the condition $0 \le x \le 1$.

2021 Grand Duchy of Lithuania, 2

Tags: combinatorics , coloring

Every number in the sequence $1, 2, ... , 2021$ is either white or black. At one step Alice can choose three numbers of the sequence and change the color of each of them (white to black and black to white) if one of those three numbers is the arithmetic mean of the other two. Alice wants to perform several steps so that at the end all the numbers in the sequence are black. For which initial colorings of numbers can Alice achieve this?

2001 Brazil Team Selection Test, Problem 4

Tags: algebra , number theory

Prove that for all integers $n\ge3$ there exists a set $A_n=\{a_1,a_2,\ldots,a_n\}$ of $n$ distinct natural numbers such that, for each $i=1,2,\ldots,n$, $$\prod_{\small{\begin{matrix}1\le k\le n\\k\ne i\end{matrix}}}a_k\equiv1\pmod{a_i}.$$

2020 Harvest Math Invitational Team Round Problems, HMI Team #6

Tags: combi , number theory

6. A triple of integers $(a,b,c)$ is said to be $\gamma$[i]-special[/i] if $a\le \gamma(b+c)$, $b\le \gamma(c+a)$ and $c\le\gamma(a+b)$. For each integer triple $(a,b,c)$ such that $1\le a,b,c \le 20$, Kodvick writes down the smallest value of $\gamma$ such that $(a,b,c)$ is $\gamma$-special. How many distinct values does he write down? [i]Proposed by winnertakeover[/i]

2021 Irish Math Olympiad, 4

Tags: domino , combinatorial geometry , combinatorics

You have a $3 \times 2021$ chessboard from which one corner square has been removed. You also have a set of $3031$ identical dominoes, each of which can cover two adjacent chessboard squares. Let $m$ be the number of ways in which the chessboard can be covered with the dominoes, without gaps or overlaps. What is the remainder when $m$ is divided by $19$?

2007 Serbia National Math Olympiad, 2

Tags: combinatorics

Triangle $\Delta GRB$ is dissected into $25$ small triangles as shown. All vertices of these triangles are painted in three colors so that the following conditions are satisfied: Vertex $G$ is painted in green, vertex $R$ in red, and $B$ in blue; Each vertex on side $GR$ is either green or red, each vertex on $RB$ is either red or blue, and each vertex on $GB$ is either green or blue. The vertices inside the big triangle are arbitrarily colored. Prove that, regardless of the way of coloring, at least one of the $25$ small triangles has vertices of three different colors.

2022 Germany Team Selection Test, 3

Tags: algebra , combinatorics

For each integer $n\ge 1,$ compute the smallest possible value of \[\sum_{k=1}^{n}\left\lfloor\frac{a_k}{k}\right\rfloor\] over all permutations $(a_1,\dots,a_n)$ of $\{1,\dots,n\}.$ [i]Proposed by Shahjalal Shohag, Bangladesh[/i]

MBMT Team Rounds, 2020.44

Tags: number theory

Let $a_n =\sum_{d|n} \frac{1}{2^{d+ \frac{n}{d}}}$. In other words, $a_n$ is the sum of $\frac{1}{2^{d+ \frac{n}{d}}}$ over all divisors $d$ of $n$. Find $$\frac{\sum_{k=1} ^{\infty}ka_k}{\sum_{k=1}^{\infty} a_k} =\frac{a_1 + 2a_2 + 3a_3 + ....}{a_1 + a_2 + a_3 +....}$$

2012 Iran Team Selection Test, 1

Tags: geometric transformation , reflection , perimeter , rotation , induction , geometry

Consider a regular $2^k$-gon with center $O$ and label its sides clockwise by $l_1,l_2,...,l_{2^k}$. Reflect $O$ with respect to $l_1$, then reflect the resulting point with respect to $l_2$ and do this process until the last side. Prove that the distance between the final point and $O$ is less than the perimeter of the $2^k$-gon. [i]Proposed by Hesam Rajabzade[/i]

2023 USEMO, 1

Tags: number theory

A positive integer $n$ is called [i]beautiful[/i] if, for every integer $4 \le b \le 10000$, the base-$b$ representation of $n$ contains the consecutive digits $2$, $0$, $2$, $3$ (in this order, from left to right). Determine whether the set of all beautiful integers is finite. [i]Oleg Kryzhanovsky[/i]

2017 Iran Team Selection Test, 2

Tags: combinatorics

In the country of [i]Sugarland[/i], there are $13$ students in the IMO team selection camp. $6$ team selection tests were taken and the results have came out. Assume that no students have the same score on the same test.To select the IMO team, the national committee of math Olympiad have decided to choose a permutation of these $6$ tests and starting from the first test, the person with the highest score between the remaining students will become a member of the team.The committee is having a session to choose the permutation. Is it possible that all $13$ students have a chance of being a team member? [i]Proposed by Morteza Saghafian[/i]

1995 Baltic Way, 10

Tags: function , functional equation , algebra

Find all real-valued functions $f$ defined on the set of all non-zero real numbers such that: (i) $f(1)=1$, (ii) $f\left(\frac{1}{x+y}\right)=f\left(\frac{1}{x}\right)+f\left(\frac{1}{y}\right)$ for all non-zero $x,y,x+y$, (iii) $(x+y)\cdot f(x+y)=xy\cdot f(x)\cdot f(y)$ for all non-zero $x,y,x+y$.

2021 JHMT HS, 7

Tags: combinatorial game , combinatorics , game theory

A number line with the integers $1$ through $20,$ from left to right, is drawn. Ten coins are placed along this number line, with one coin at each odd number on the line. A legal move consists of moving one coin from its current position to a position of strictly greater value on the number line that is not already occupied by another coin. How many ways can we perform two legal moves in sequence, starting from the initial position of the coins (different two-move sequences that result in the same position are considered distinct)?

1970 Polish MO Finals, 2

Tags: algebra , inequalities

Consider three sequences $(a_n)_{n=1}^{^\infty}$, $(b_n)_{n=1}^{^\infty}$ , $(c_n)_{n=1}^{^\infty}$, each of which has pairwisedistinct terms. Prove that there exist two indices $k$ and $l$ for which $k < l$, $$a_k < a_l , b_k < b_l , \,\,\, and \,\,\, c_k < c_l.$$

1993 Romania Team Selection Test, 4

Tags: subset , function , algebra

Let $Y$ be the family of all subsets of $X = \{1,2,...,n\}$ ($n > 1$) and let $f : Y \to X$ be an arbitrary mapping. Prove that there exist distinct subsets $A,B$ of $X$ such that $f(A) = f(B) = max A\triangle B$, where $A\triangle B = (A-B)\cup(B-A)$.

2015 China Girls Math Olympiad, 6

Tags: geometry , perpendicular bisector , power of a point , radical axis

Let $\Gamma_1$ and $\Gamma_2$ be two non-overlapping circles. $A,C$ are on $\Gamma_1$ and $B,D$ are on $\Gamma_2$ such that $AB$ is an external common tangent to the two circles, and $CD$ is an internal common tangent to the two circles. $AC$ and $BD$ meet at $E$. $F$ is a point on $\Gamma_1$, the tangent line to $\Gamma_1$ at $F$ meets the perpendicular bisector of $EF$ at $M$. $MG$ is a line tangent to $\Gamma_2$ at $G$. Prove that $MF=MG$.

1986 AMC 12/AHSME, 18

Tags: geometry , ellipse , conic

A plane intersects a right circular cylinder of radius $1$ forming an ellipse. If the major axis of the ellipse of $50\%$ longer than the minor axis, the length of the major axis is $ \textbf{(A)}\ 1\qquad\textbf{(B)}\ \frac{3}{2}\qquad\textbf{(C)}\ 2\qquad\textbf{(D)}\ \frac{9}{4}\qquad\textbf{(E)}\ 3$