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: 85335

2004 Nordic, 1

Twenty-seven balls labelled from $1$ to $27$ are distributed in three bowls: red, blue, and yellow. What are the possible values of the number of balls in the red bowl if the average labels in the red, blue and yellow bowl are $15$, $3$, and $18$, respectively?

2013 IberoAmerican, 3

Let $A = \{1,...,n\}$ with $n \textgreater 5$. Prove that one can find $B$ a finite set of positive integers such that $A$ is a subset of $B$ and $\displaystyle\sum_{x \in B} x^2 = \displaystyle\prod_{x \in B} x$

2023 VN Math Olympiad For High School Students, Problem 10

Tags: geometry
Given a triangle $ABC$ with [i]Lemoine[/i] point $L.$ Choose points $X,Y,Z$ on the segments $LA,LB,LC,$ respectively such that:$$\angle XBA=\angle YAB,\angle XCA=\angle ZAC.$$ Prove that: $\angle ZBC=\angle YCB.$

2022 APMO, 4

Let $n$ and $k$ be positive integers. Cathy is playing the following game. There are $n$ marbles and $k$ boxes, with the marbles labelled $1$ to $n$. Initially, all marbles are placed inside one box. Each turn, Cathy chooses a box and then moves the marbles with the smallest label, say $i$, to either any empty box or the box containing marble $i+1$. Cathy wins if at any point there is a box containing only marble $n$. Determine all pairs of integers $(n,k)$ such that Cathy can win this game.

2011 India IMO Training Camp, 3

Consider a $ n\times n $ square grid which is divided into $ n^2 $ unit squares(think of a chess-board). The set of all unit squares intersecting the main diagonal of the square or lying under it is called an $n$-staircase. Find the number of ways in which an $n$-stair case can be partitioned into several rectangles, with sides along the grid lines, having mutually distinct areas.

DMM Individual Rounds, 2008

[b]p1.[/b] Joe owns stock. On Monday morning on October $20$th, $2008$, his stocks were worth $\$250,000$. The value of his stocks, for each day from Monday to Friday of that week, increased by $10\%$, increased by $5\%$, decreased by $5\%$, decreased by $15\%$, and decreased by $20\%$, though not necessarily in that order. Given this information, let $A$ be the largest possible value of his stocks on that Friday evening, and let $B$ be the smallest possible value of his stocks on that Friday evening. What is $A - B$? [b]p2.[/b] What is the smallest positive integer $k$ such that $2k$ is a perfect square and $3k$ is a perfect cube? [b]p3.[/b] Two competitive ducks decide to have a race in the first quadrant of the $xy$ plane. They both start at the origin, and the race ends when one of the ducks reaches the line $y = \frac12$ . The first duck follows the graph of $y = \frac{x}{3}$ and the second duck follows the graph of $y = \frac{x}{5}$ . If the two ducks move in such a way that their $x$-coordinates are the same at any time during the race, find the ratio of the speed of the first duck to that of the second duck when the race ends. [b]p4.[/b] There were grammatical errors in this problem as stated during the contest. The problem should have said: You play a carnival game as follows: The carnival worker has a circular mat of radius 20 cm, and on top of that is a square mat of side length $10$ cm, placed so that the centers of the two mats coincide. The carnival worker also has three disks, one each of radius $1$ cm, $2$ cm, and $3$ cm. You start by paying the worker a modest fee of one dollar, then choosing two of the disks, then throwing the two disks onto the mats, one at a time, so that the center of each disk lies on the circular mat. You win a cash prize if the center of the large disk is on the square AND the large disk touches the small disk, otherwise you just lost the game and you get no money. How much is the cash prize if choosing the two disks randomly and then throwing the disks randomly (i.e. with uniform distribution) will, on average, result in you breaking even? [b]p5.[/b] Four boys and four girls arrive at the Highball High School Senior Ball without a date. The principal, seeking to rectify the situation, asks each of the boys to rank the four girls in decreasing order of preference as a prom date and asks each girl to do the same for the four boys. None of the boys know any of the girls and vice-versa (otherwise they would have probably found each other before the prom), so all eight teenagers write their rankings randomly. Because the principal lacks the mathematical chops to pair the teenagers together according to their stated preference, he promptly ignores all eight of the lists and randomly pairs each of the boys with a girl. What is the probability that no boy ends up with his third or his fourth choice, and no girl ends up with her third or fourth choice? [b]p6.[/b] In the diagram below, $ABCDEFGH$ is a rectangular prism, $\angle BAF = 30^o$ and $\angle DAH = 60^o$. What is the cosine of $\angle CEG$? [img]https://cdn.artofproblemsolving.com/attachments/a/1/1af1a7d5d523884703b9ff95aaf301bcc18140.png[/img] [b]p7.[/b] Two cows play a game where each has one playing piece, they begin by having the two pieces on opposite vertices of an octahedron, and the two cows take turns moving their piece to an adjacent vertex. The winner is the first player who moves its piece to the vertex occupied by its opponent’s piece. Because cows are not the most intelligent of creatures, they move their pieces randomly. What is the probability that the first cow to move eventually wins? [b]p8.[/b] Find the last two digits of $$\sum^{2008}_{k=1}k {2008 \choose k}.$$ PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

2022 AIME Problems, 8

Tags: AMC , AIME , AIME I , geometry
Equilateral triangle $\triangle ABC$ is inscribed in circle $\omega$ with radius $18.$ Circle $\omega_A$ is tangent to sides $\overline{AB}$ and $\overline{AC}$ and is internally tangent to $\omega$. Circles $\omega_B$ and $\omega_C$ are defined analogously. Circles $\omega_A$, $\omega_B$, and $\omega_C$ meet in six points$-$two points for each pair of circles. The three intersection points closest to the vertices of $\triangle ABC$ are the vertices of a large equilateral triangle in the interior of $\triangle ABC$, and the other three intersection points are the vertices of a smaller equilateral triangle in the interior of $\triangle ABC$. The side length of the smaller equilateral triangle can be written as $\sqrt{a}-\sqrt{b}$, where $a$ and $b$ are positive integers. Find $a+b$.

2009 Vietnam National Olympiad, 4

Let $ a$, $ b$, $ c$ be three real numbers. For each positive integer number $ n$, $ a^n \plus{} b^n \plus{} c^n$ is an integer number. Prove that there exist three integers $ p$, $ q$, $ r$ such that $ a$, $ b$, $ c$ are the roots of the equation $ x^3 \plus{} px^2 \plus{} qx \plus{} r \equal{} 0$.

2021 Kazakhstan National Olympiad, 4

Tags: geometry
Given acute triangle $ABC$ with circumcircle $\Gamma$ and altitudes $AD, BE, CF$, line $AD$ cuts $\Gamma$ again at $P$ and $PF, PE$ meet $\Gamma$ again at $R, Q$. Let $O_1, O_2$ be the circumcenters of $\triangle BFR$ and $\triangle CEQ$ respectively. Prove that $O_{1}O_{2}$ bisects $\overline{EF}$.

1987 AMC 8, 22

$\text{ABCD}$ is a rectangle, $\text{D}$ is the center of the circle, and $\text{B}$ is on the circle. If $\text{AD}=4$ and $\text{CD}=3$, then the area of the shaded region is between [asy] pair A,B,C,D; A=(0,4); B=(3,4); C=(3,0); D=origin; draw(circle(D,5)); fill((0,5)..(1.5,4.7697)..B--A--cycle,black); fill(B..(4,3)..(5,0)--C--cycle,black); draw((0,5)--D--(5,0)); label("A",A,NW); label("B",B,NE); label("C",C,S); label("D",D,SW); [/asy] $\text{(A)}\ 4\text{ and }5 \qquad \text{(B)}\ 5\text{ and }6 \qquad \text{(C)}\ 6\text{ and }7 \qquad \text{(D)}\ 7\text{ and }8 \qquad \text{(E)}\ 8\text{ and }9$

2013 India IMO Training Camp, 1

A positive integer $a$ is called a [i]double number[/i] if it has an even number of digits (in base 10) and its base 10 representation has the form $a = a_1a_2 \cdots a_k a_1 a_2 \cdots a_k$ with $0 \le a_i \le 9$ for $1 \le i \le k$, and $a_1 \ne 0$. For example, $283283$ is a double number. Determine whether or not there are infinitely many double numbers $a$ such that $a + 1$ is a square and $a + 1$ is not a power of $10$.

2018 EGMO, 2

Consider the set \[A = \left\{1+\frac{1}{k} : k=1,2,3,4,\cdots \right\}.\] [list=a] [*]Prove that every integer $x \geq 2$ can be written as the product of one or more elements of $A$, which are not necessarily different. [*]For every integer $x \geq 2$ let $f(x)$ denote the minimum integer such that $x$ can be written as the product of $f(x)$ elements of $A$, which are not necessarily different. Prove that there exist infinitely many pairs $(x,y)$ of integers with $x\geq 2$, $y \geq 2$, and \[f(xy)<f(x)+f(y).\] (Pairs $(x_1,y_1)$ and $(x_2,y_2)$ are different if $x_1 \neq x_2$ or $y_1 \neq y_2$). [/list]

2002 Turkey Junior National Olympiad, 2

Tags: induction
$\text{ }$ [asy] unitsize(11); for(int i=0; i<6; ++i) { if(i<5) draw( (i, 0)--(i,5) ); else draw( (i, 0)--(i,2) ); if(i < 3) draw((0,i)--(5,i)); else draw((0,i)--(4,i)); } [/asy] We are dividing the above figure into parts with shapes: [asy] unitsize(11); draw((0,0)--(0,2)); draw((1,0)--(1,2)); draw((2,1)--(2,2)); draw((0,0)--(1,0)); draw((0,1)--(2,1)); draw((0,2)--(2,2)); [/asy][asy] unitsize(11); draw((0,0)--(0,2)); draw((1,0)--(1,2)); draw((2,1)--(2,2)); draw((3,1)--(3,2)); draw((0,0)--(1,0)); draw((0,1)--(3,1)); draw((0,2)--(3,2)); [/asy] After that division, find the number of [asy] unitsize(11); draw((0,0)--(0,2)); draw((1,0)--(1,2)); draw((2,1)--(2,2)); draw((0,0)--(1,0)); draw((0,1)--(2,1)); draw((0,2)--(2,2)); [/asy] shaped parts.

1988 Tournament Of Towns, (166) 3

(a) The vertices of a regular $10$-gon are painted in turn black and white. Two people play the following game . Each in turn draws a diagonal connecting two vertices of the same colour . These diagonals must not intersect . The winner is the player who is able to make the last move. Who will win if both players adopt the best strategy? (b) Answer the same question for the regular $12$-gon . (V.G. Ivanov)

2005 Moldova Team Selection Test, 2

Let $ a$, $ b$, $ c$ be positive reals such that $ a^4 \plus{} b^4 \plus{} c^4 \equal{} 3$. Prove that $ \sum\frac1{4 \minus{} ab}\leq1$, where the $ \sum$ sign stands for cyclic summation. [i]Alternative formulation:[/i] For any positive reals $ a$, $ b$, $ c$ satisfying $ a^4 \plus{} b^4 \plus{} c^4 \equal{} 3$, prove the inequality $ \frac{1}{4\minus{}bc}\plus{}\frac{1}{4\minus{}ca}\plus{}\frac{1}{4\minus{}ab}\leq 1$.

2009 AMC 10, 23

Rachel and Robert run on a circular track. Rachel runs counterclockwise and completes a lap every $ 90$ seconds, and Robert runs clockwise and completes a lap every $ 80$ seconds. Both start from the start line at the same time. At some random time between $ 10$ minutes and $ 11$ minutes after they begin to run, a photographer standing inside the track takes a picture that shows one-fourth of the track, centered on the starting line. What is the probability that both Rachel and Robert are in the picture? $ \textbf{(A)}\ \frac{1}{16}\qquad \textbf{(B)}\ \frac18\qquad \textbf{(C)}\ \frac{3}{16} \qquad \textbf{(D)}\ \frac14\qquad \textbf{(E)}\ \frac{5}{16}$

2000 Romania Team Selection Test, 1

Prove that the equation $x^3+y^3+z^3=t^4$ has infinitely many solutions in positive integers such that $\gcd(x,y,z,t)=1$. [i]Mihai Pitticari & Sorin Rǎdulescu[/i]

2023 Durer Math Competition Finals, 2

Timi was born in $1999$. Ever since her birth how many times has it happened that you could write that day’s date using only the digits $0$, $1$ and $2$? For example, $2022.02.21$. is such a date.

2003 India Regional Mathematical Olympiad, 4

Find the number of ordered triples $(x,y,z)$ of non-negative integers satisfying (i) $x \leq y \leq z$ (ii) $x + y + z \leq 100.$

2009 Germany Team Selection Test, 1

In the coordinate plane consider the set $ S$ of all points with integer coordinates. For a positive integer $ k$, two distinct points $A$, $ B\in S$ will be called $ k$-[i]friends[/i] if there is a point $ C\in S$ such that the area of the triangle $ ABC$ is equal to $ k$. A set $ T\subset S$ will be called $ k$-[i]clique[/i] if every two points in $ T$ are $ k$-friends. Find the least positive integer $ k$ for which there exits a $ k$-clique with more than 200 elements. [i]Proposed by Jorge Tipe, Peru[/i]

2016 Polish MO Finals, 6

Let $I$ be an incenter of $\triangle ABC$. Denote $D, \ S \neq A$ intersections of $AI$ with $BC, \ O(ABC)$ respectively. Let $K, \ L$ be incenters of $\triangle DSB, \ \triangle DCS$. Let $P$ be a reflection of $I$ with the respect to $KL$. Prove that $BP \perp CP$.

2013 National Olympiad First Round, 33

Let $D$ be a point on side $[BC]$ of triangle $ABC$ such that $[AD]$ is an angle bisector, $|BD|=4$, and $|DC|=3$. Let $E$ be a point on side $[AB]$ and different than $A$ such that $m(\widehat{BED})=m(\widehat{DEC})$. If the perpendicular bisector of segment $[AE]$ meets the line $BC$ at $M$, what is $|CM|$? $ \textbf{(A)}\ 12 \qquad\textbf{(B)}\ 9 \qquad\textbf{(C)}\ 7 \qquad\textbf{(D)}\ 5 \qquad\textbf{(E)}\ \text { None of above} $

2017 District Olympiad, 2

Let $ ABC $ be a triangle in which $ O,I, $ are the circumcenter, respectively, incenter. The mediators of $ IA,IB,IC, $ form a triangle $ A_1B_1C_1. $ Show that $ \overrightarrow{OI}=\overrightarrow{OA_1} +\overrightarrow{OA_2} +\overrightarrow{OA_3} . $

2021 Bulgaria National Olympiad, 1

A city has $4$ horizontal and $n\geq3$ vertical boulevards which intersect at $4n$ crossroads. The crossroads divide every horizontal boulevard into $n-1$ streets and every vertical boulevard into $3$ streets. The mayor of the city decides to close the minimum possible number of crossroads so that the city doesn't have a closed path(this means that starting from any street and going only through open crossroads without turning back you can't return to the same street). $a)$Prove that exactly $n$ crossroads are closed. $b)$Prove that if from any street you can go to any other street and none of the $4$ corner crossroads are closed then exactly $3$ crossroads on the border are closed(A crossroad is on the border if it lies either on the first or fourth horizontal boulevard, or on the first or the n-th vertical boulevard).

2003 Germany Team Selection Test, 2

Let $B$ be a point on a circle $S_1$, and let $A$ be a point distinct from $B$ on the tangent at $B$ to $S_1$. Let $C$ be a point not on $S_1$ such that the line segment $AC$ meets $S_1$ at two distinct points. Let $S_2$ be the circle touching $AC$ at $C$ and touching $S_1$ at a point $D$ on the opposite side of $AC$ from $B$. Prove that the circumcentre of triangle $BCD$ lies on the circumcircle of triangle $ABC$.