This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 14842

2017 Brazil Team Selection Test, 1

We call a $5$-tuple of integers [i]arrangeable[/i] if its elements can be labeled $a, b, c, d, e$ in some order so that $a-b+c-d+e=29$. Determine all $2017$-tuples of integers $n_1, n_2, . . . , n_{2017}$ such that if we place them in a circle in clockwise order, then any $5$-tuple of numbers in consecutive positions on the circle is arrangeable. [i]Warut Suksompong, Thailand[/i]

2022 Puerto Rico Team Selection Test, 2

There are$ 1$ cm long bars with a number$ 1$, $2$ or $3$ written on each one from them. There is an unlimited supply of bars with each number. Two triangles formed by three bars are considered different if none of them can be built with the bars of the other triangle. (a) How many different triangles formed by three bars are possible? (b) An equilateral triangle of side length $3$ cm is formed using $18$ bars, , divided into $9$ equilateral triangles, different by pairs, $1$ cm long on each side. Find the largest sum possible from the numbers written on the $9$ bars of the border of the big triangle. [center][img]https://cdn.artofproblemsolving.com/attachments/1/1/c2f7edeea3c70ba4689d7b12fe8ac8be72f115.png[/img][/center]

2020 Princeton University Math Competition, 9

Consider a regular $2020$-gon circumscribed into a circle of radius $ 1$. Given three vertices of this polygon such that they form an isosceles triangle, let $X$ be the expected area of the isosceles triangle they create. $X$ can be written as $\frac{1}{m \tan((2\pi)/n)}$ where $m$ and $n$ are integers. Compute $m + n$.

2009 Croatia Team Selection Test, 2

In each field of 2009*2009 table you can write either 1 or -1. Denote Ak multiple of all numbers in k-th row and Bj the multiple of all numbers in j-th column. Is it possible to write the numbers in such a way that $ \sum_{i\equal{}1}^{2009}{Ai}\plus{} \sum_{i\equal{}1}^{2009}{Bi}\equal{}0$?

2016 Latvia Baltic Way TST, 10

On an infinite sheet of tiles, an infinite number of $1 \times 2$ tile rectangles are placed, their edges follow the lines of the tiles, and they do not touch each other, not even the corners. Is it true that the remaining checkered sheet can be completely covered with $1 \times 2$ checkered rectangles? [hide=original wording]Uz bezgalīgas rūtiņu lapas ir novietoti bezgaglīgi daudzi 1 x 2 rūtiņu taisnstūri, to malas iet pa rūtiņu līnijām, un tie nesaskaras cits ar citu pat ne ar stūriem. Vai tiesa, ka atlikušo rūtiņu lapu var pilnībā noklāt ar 1 x 2 rūtiņu tainstūriem? [/hide]

2005 Georgia Team Selection Test, 12

$ 30$ students participated in the mathematical Olympiad. Each of them was given $ 8$ problems to solve. Jury estimated their work with the following rule: 1) Each problem was worth $ k$ points, if it wasn't solved by exactly $ k$ students; 2) Each student received the maximum possible points in each problem or got $ 0$ in it; Lasha got the least number of points. What's the maximal number of points he could have? Remark: 1) means that if the problem was solved by exactly $ k$ students, than each of them got $ 30 \minus{} k$ points in it.

2018 Dutch Mathematical Olympiad, 5

At a quiz show there are three doors. Behind exactly one of the doors, a prize is hidden. You may ask the quizmaster whether the prize is behind the left-hand door. You may also ask whether the prize is behind the right-hand door. You may ask each of these two questions multiple times, in any order that you like. Each time, the quizmaster will answer ‘yes’ or ‘no’. The quizmaster is allowed to lie at most $10$ times. You have to announce in advance how many questions you will be asking (but which questions you will ask may depend on the answers of the quizmaster). What is the smallest number you can announce, such that you can still determine with absolute certainty the door behind which the prize is hidden?

1966 All Russian Mathematical Olympiad, 075

a) Pupils of the $8$-th form are standing in a row. There is the pupil of the $7$-th form in before each, and he is smaller (in height) than the elder. Prove that if you will sort the pupils in each of rows with respect to their height, every 8-former will still be taller than the $7$-former standing before him. b) An infantry detachment soldiers stand in the rectangle, being arranged in columns with respect to their height. Prove that if you rearrange them with respect to their height in every separate row, they will still be staying with respect to their height in columns.

2011 ELMO Shortlist, 3

Wanda the Worm likes to eat Pascal's triangle. One day, she starts at the top of the triangle and eats $\textstyle\binom{0}{0}=1$. Each move, she travels to an adjacent positive integer and eats it, but she can never return to a spot that she has previously eaten. If Wanda can never eat numbers $a,b,c$ such that $a+b=c$, prove that it is possible for her to eat 100,000 numbers in the first 2011 rows given that she is not restricted to traveling only in the first 2011 rows. (Here, the $n+1$st row of Pascal's triangle consists of entries of the form $\textstyle\binom{n}{k}$ for integers $0\le k\le n$. Thus, the entry $\textstyle\binom{n}{k}$ is considered adjacent to the entries $\textstyle\binom{n-1}{k-1}$, $\textstyle\binom{n-1}{k}$, $\textstyle\binom{n}{k-1}$, $\textstyle\binom{n}{k+1}$, $\textstyle\binom{n+1}{k}$, $\textstyle\binom{n+1}{k+1}$.) [i]Linus Hamilton.[/i]

2021 Saudi Arabia Training Tests, 25

The Magician and his Assistant show trick. The Viewer writes on the board the sequence of $N$ digits. Then the Assistant covers some pair of adjacent digits so that they become invisible. Finally, the Magician enters the show, looks at the board and guesses the covered digits and their order. Find the minimal $N$ such that the Magician and his Assistant can agree in advance so that the Magician always guesses right

2007 Brazil National Olympiad, 4

$ 2007^2$ unit squares are arranged forming a $ 2007\times 2007$ table. Arnold and Bernold play the following game: each move by Arnold consists of taking four unit squares that forms a $ 2\times 2$ square; each move by Bernold consists of taking a single unit square. They play anternatively, Arnold being the first. When Arnold is not able to perform his move, Bernold takes all the remaining unit squares. The person with more unit squares in the end is the winner. Is it possible to Bernold to win the game, no matter how Arnold play?

TNO 2008 Junior, 10

A jeweler makes necklaces with round stones, four emeralds (green) and four rubies (red), arranged at equal distances from each other. One day, they decide to give away some necklaces. How many necklaces can they give away without the risk of two friends ending up with the same necklace? (*Observation: The necklace is completely symmetrical except for the type of stone, meaning there is not a unique way to form it. Consider this while solving the problem.*)

2012 Greece Team Selection Test, 4

Let $n=3k$ be a positive integer (with $k\geq 2$). An equilateral triangle is divided in $n^2$ unit equilateral triangles with sides parallel to the initial, forming a grid. We will call "trapezoid" the trapezoid which is formed by three equilateral triangles (one base is equal to one and the other is equal to two). We colour the points of the grid with three colours (red, blue and green) such that each two neighboring points have different colour. Finally, the colour of a "trapezoid" will be the colour of the midpoint of its big base. Find the number of all "trapezoids" in the grid (not necessarily disjoint) and determine the number of red, blue and green "trapezoids".

2014 Mid-Michigan MO, 7-9

[b]p1.[/b] (a) Put the numbers $1$ to $6$ on the circle in such way that for any five consecutive numbers the sum of first three (clockwise) is larger than the sum of remaining two. (b) Can you arrange these numbers so it works both clockwise and counterclockwise. [b]p2.[/b] A girl has a box with $1000$ candies. Outside the box there is an infinite number of chocolates and muffins. A girl may replace: $\bullet$ two candies in the box with one chocolate bar, $\bullet$ two muffins in the box with one chocolate bar, $\bullet$ two chocolate bars in the box with one candy and one muffin, $\bullet$ one candy and one chocolate bar in the box with one muffin, $\bullet$ one muffin and one chocolate bar in the box with one candy. Is it possible that after some time it remains only one object in the box? [b]p3.[/b] Find any integer solution of the puzzle: $WE+ST+RO+NG=128$ (different letters mean different digits between $1$ and $9$). [b]p4.[/b] Two consecutive three‐digit positive integer numbers are written one after the other one. Show that the six‐digit number that is obtained is not divisible by $1001$. [b]p5.[/b] There are $9$ straight lines drawn in the plane. Some of them are parallel some of them intersect each other. No three lines do intersect at one point. Is it possible to have exactly $17$ intersection points? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

2006 Moldova Team Selection Test, 4

Let $m$ circles intersect in points $A$ and $B$. We write numbers using the following algorithm: we write $1$ in points $A$ and $B$, in every midpoint of the open arc $AB$ we write $2$, then between every two numbers written in the midpoint we write their sum and so on repeating $n$ times. Let $r(n,m)$ be the number of appearances of the number $n$ writing all of them on our $m$ circles. a) Determine $r(n,m)$; b) For $n=2006$, find the smallest $m$ for which $r(n,m)$ is a perfect square. Example for half arc: $1-1$; $1-2-1$; $1-3-2-3-1$; $1-4-3-5-2-5-3-4-1$; $1-5-4-7-3-8-5-7-2-7-5-8-3-7-4-5-1$...

2023-24 IOQM India, 20

For any finite non empty set $X$ of integers, let $\max (X)$ denote the largest element of $X$ and $|X|$ denote the number of elements in $X$. If $N$ is the number of ordered pairs $(A, B)$ of finite non-empty sets of positive integers, such that $$ \begin{aligned} & \max (A) \times|B|=12 ; \text { and } \\ & |A| \times \max (B)=11 \end{aligned} $$ and $N$ can be written as $100 a+b$ where $a, b$ are positive integers less than 100 , find $a+b$.

2020 Bulgaria Team Selection Test, 3

Let $\mathcal{C}$ be a family of subsets of $A=\{1,2,\dots,100\}$ satisfying the following two conditions: 1) Every $99$ element subset of $A$ is in $\mathcal{C}.$ 2) For any non empty subset $C\in\mathcal{C}$ there is $c\in C$ such that $C\setminus\{c\}\in \mathcal{C}.$ What is the least possible value of $|\mathcal{C}|$?

2021 Latvia Baltic Way TST, P6

Let's call $1 \times 2$ rectangle, which can be a rotated, a domino. Prove that there exists polygon, who can be covered by dominoes in exactly $2021$ different ways.

2011 Turkey MO (2nd round), 6

Let $A$ and $B$ two countries which inlude exactly $2011$ cities.There is exactly one flight from a city of $A$ to a city of $B$ and there is no domestic flights (flights are bi-directional).For every city $X$ (doesn't matter from $A$ or from $B$), there exist at most $19$ different airline such that airline have a flight from $X$ to the another city.For an integer $k$, (it doesn't matter how flights arranged ) we can say that there exists at least $k$ cities such that it is possible to trip from one of these $k$ cities to another with same airline.So find the maximum value of $k$.

1976 Chisinau City MO, 123

Five points are given on the plane. Prove that among all the triangles with vertices at these points there are no more than seven acute-angled ones.

2020 Abels Math Contest (Norwegian MO) Final, 1a

In how many ways can the circles be coloured using three colours, so that no two circles connected by a line segment have the same colour? [img]https://cdn.artofproblemsolving.com/attachments/3/2/e2bd61786aa4269593233311e85204cff071ec.png[/img]

1989 Tournament Of Towns, (222) 6

We are given $101$ rectangles with sides of integer lengths not exceeding $100$ . Prove that among these $101$ rectangles there are $3$ rectangles, say $A , B$ and $C$ such that $A$ will fit inside $B$ and $B$ inside $C$. ( N . Sedrakyan, Yerevan)

2017 Indonesia Juniors, day 1

p1. Find all real numbers $x$ that satisfy the inequality $$\frac{x^2-3}{x^2-1}+ \frac{x^2 + 5}{x^2 + 3} \ge \frac{x^2-5}{x^2-3}+\frac{x^2 + 3}{x^2 + 1}$$ p2. It is known that $m$ is a four-digit natural number with the same units and thousands digits. If $m$ is a square of an integer, find all possible numbers $m$. p3. In the following figure, $\vartriangle ABP$ is an isosceles triangle, with $AB = BP$ and point $C$ on $BP$. Calculate the volume of the object obtained by rotating $ \vartriangle ABC$ around the line $AP$ [img]https://cdn.artofproblemsolving.com/attachments/c/a/65157e2d49d0d4f0f087f3732c75d96a49036d.png[/img] p4. A class farewell event is attended by $10$ male students and $ 12$ female students. Homeroom teacher from the class provides six prizes to randomly selected students. Gifts that provided are one school bag, two novels, and three calculators. If the total students The number of male students who received prizes was equal to the total number of female students who received prizes. How many possible arrangements are there of the student who gets the prize? p5. It is known that $S =\{1945, 1946, 1947, ..., 2016, 2017\}$. If $A = \{a, b, c, d, e\}$ a subset of $S$ where $a + b + c + d + e$ is divisible by $5$, find the number of possible $A$'s.

2023 UMD Math Competition Part II, 1

An Indian raga has two kinds of notes: a short note, which lasts for $1$ beat and a long note, which lasts for $2$ beats. For example, there are $3$ ragas which are $3$ beats long; $3$ short notes, a short note followed by a long note, and a long note followed by a short note. How many Indian ragas are 11 beats long?

EMCC Speed Rounds, 2020

[i]20 problems for 25 minutes.[/i] [b]p1.[/b] What is $20 \div 2 - 0 \times 1 + 2 \times 5$? [b]p2.[/b] Today is Saturday, January $25$, $2020$. Exactly four hundred years from today, January $25$, $2420$, is again a Saturday. How many weekend days (Saturdays and Sundays) are in February, $2420$? (January has $31$ days and in year $2040$, February has $29$ days.) [b]p3.[/b] Given that there are four people sitting around a circular table, and two of them stand up, what is the probability that the two of them were originally sitting next to each other? [b]p4.[/b] What is the area of a triangle with side lengths $5$, $5$, and $6$? [b]p5.[/b] Six people go to OBA Noodles on Main Street. Each person has $1/2$ probability to order Duck Noodle Soup, $1/3$ probability to order OBA Ramen, and $1/6$ probability to order Kimchi Udon Soup. What is the probability that three people get Duck Noodle Soup, two people get OBA Ramen, and one person gets Kimchi Udon Soup? [b]p6.[/b] Among all positive integers $a$ and $b$ that satisfy $a^b = 64$, what is the minimum possible value of $a+b$? [b]p7.[/b] A positive integer $n$ is called trivial if its tens digit divides $n$. How many two-digit trivial numbers are there? [b]p8.[/b] Triangle $ABC$ has $AB = 5$, $BC = 13$, and $AC = 12$. Square $BCDE$ is constructed outside of the triangle. The perpendicular line from $A$ to side $DE$ cuts the square into two parts. What is the positive difference in their areas? [b]p9.[/b] In an increasing arithmetic sequence, the first, third, and ninth terms form an increasing geometric sequence (in that order). Given that the first term is $5$, find the sum of the first nine terms of the arithmetic sequence. [b]p10.[/b] Square $ABCD$ has side length $1$. Let points $C'$ and $D'$ be the reflections of points $C$ and $D$ over lines $AB$ and $BC$, respectively. Let P be the center of square $ABCD$. What is the area of the concave quadrilateral $PD'BC'$? [b]p11.[/b] How many four-digit palindromes are multiples of $7$? (A palindrome is a number which reads the same forwards and backwards.) [b]p12.[/b] Let $A$ and $B$ be positive integers such that the absolute value of the difference between the sum of the digits of $A$ and the sum of the digits of $(A + B)$ is $14$. What is the minimum possible value for $B$? [b]p13.[/b] Clark writes the following set of congruences: $x \equiv a$ (mod $6$), $x \equiv b$ (mod $10$), $x \equiv c$ (mod $15$), and he picks $a$, $b$, and $c$ to be three randomly chosen integers. What is the probability that a solution for $x$ exists? [b]p14.[/b] Vincent the bug is crawling on the real number line starting from $2020$. Each second, he may crawl from $x$ to $x - 1$, or teleport from $x$ to $\frac{x}{3}$ . What is the least number of seconds needed for Vincent to get to $0$? [b]p15.[/b] How many positive divisors of $2020$ do not also divide $1010$? [b]p16.[/b] A bishop is a piece in the game of chess that can move in any direction along a diagonal on which it stands. Two bishops attack each other if the two bishops lie on the same diagonal of a chessboard. Find the maximum number of bishops that can be placed on an $8\times 8$ chessboard such that no two bishops attack each other. [b]p17.[/b] Let $ABC$ be a right triangle with hypotenuse $20$ and perimeter $41$. What is the area of $ABC$? [b]p18.[/b] What is the remainder when $x^{19} + 2x^{18} + 3x^{17} +...+ 20$ is divided by $x^2 + 1$? [b]p19.[/b] Ben splits the integers from $1$ to $1000$ into $50$ groups of $20$ consecutive integers each, starting with $\{1, 2,...,20\}$. How many of these groups contain at least one perfect square? [b]p20.[/b] Trapezoid $ABCD$ with $AB$ parallel to $CD$ has $AB = 10$, $BC = 20$, $CD = 35$, and $AD = 15$. Let $AD$ and $BC$ intersect at $P$ and let $AC$ and $BD$ intersect at $Q$. Line $PQ$ intersects $AB$ at $R$. What is the length of $AR$? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].