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

1987 IMO Shortlist, 10

Let $S_1$ and $S_2$ be two spheres with distinct radii that touch externally. The spheres lie inside a cone $C$, and each sphere touches the cone in a full circle. Inside the cone there are $n$ additional solid spheres arranged in a ring in such a way that each solid sphere touches the cone $C$, both of the spheres $S_1$ and $S_2$ externally, as well as the two neighboring solid spheres. What are the possible values of $n$? [i]Proposed by Iceland.[/i]

1996 AMC 12/AHSME, 2

Tags:
Each day Walter gets $\$3$ for doing his chores or $\$5$ for doing them exceptionally well. After 10 days of doing his chores daily, Walter has received a total of $\$36$. On how many days did Walter do them exceptionally well? $\textbf{(A)}\ 3 \qquad \textbf{(B)}\ 4 \qquad \textbf{(C)}\ 5 \qquad \textbf{(D)}\ 6\qquad \textbf{(E)}\ 7$

2024 Singapore Senior Math Olympiad, Q4

Suppose $p$ is a prime number and $x, y, z$ are integers satisfying $0 < x < y < z <p$. If $x^3, y^3, z^3$ have equal remainders when divided by $p$, prove that $x ^ 2 + y ^ 2 + z ^ 2$ is divisible by $x + y + z$.

2022 Germany Team Selection Test, 3

Tags:
Consider a $100\times 100$ square unit lattice $\textbf{L}$ (hence $\textbf{L}$ has $10000$ points). Suppose $\mathcal{F}$ is a set of polygons such that all vertices of polygons in $\mathcal{F}$ lie in $\textbf{L}$ and every point in $\textbf{L}$ is the vertex of exactly one polygon in $\mathcal{F}.$ Find the maximum possible sum of the areas of the polygons in $\mathcal{F}.$ [i]Michael Ren and Ankan Bhattacharya, USA[/i]

2012 NIMO Problems, 5

Tags: geometry , ratio
In the diagram below, three squares are inscribed in right triangles. Their areas are $A$, $M$, and $N$, as indicated in the diagram. If $M = 5$ and $N = 12$, then $A$ can be expressed as $a + b\sqrt{c}$, where $a$, $b$, and $c$ are positive integers and $c$ is not divisible by the square of any prime. Compute $a + b + c$. [asy] size(250); defaultpen (linewidth (0.7) + fontsize (10)); pair O = origin, A = (1, 1), B = (4/3, 1/3), C = (2/3, 5/3), P = (3/2, 0), Q = (0,3); draw (P--O--Q--cycle^^(0, 5/3)--C--(2/3,1)^^(0,1)--A--(1,0)^^(1,1/3)--B--(4/3,0)); label("$A$", (.5,.5)); label("$M$", (7/6, 1/6)); label("$N$", (1/3, 4/3));[/asy] [i]Proposed by Aaron Lin[/i]

1961 AMC 12/AHSME, 14

A rhombus is given with one diagonal twice the length of the other diagonal. Express the side of the rhombus is terms of $K$, where $K$ is the area of the rhombus in square inches. ${{ \textbf{(A)}\ \sqrt{K} \qquad\textbf{(B)}\ \frac{1}{2}\sqrt{2K} \qquad\textbf{(C)}\ \frac{1}{3}\sqrt{3K} \qquad\textbf{(D)}\ \frac{1}{4}\sqrt{4K} }\qquad\textbf{(E)}\ \text{None of these are correct} } $

2024 MMATHS, 9

Tags:
Grant and Stephen are playing Square-Tac-Toe. In this game, players alternate placing $X$'s and $O$'s on a $3 \times 3$ board, and the first person to complete a $2 \times 2$ square with their respective symbols wins the game. If all tiles are filled and no such square exists, the game is a tie. Grant moves first. Given that Stephen plays randomly and Grant plays optimally (knowing that Stephen is playing randomly), the probability that Grant wins is $\tfrac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$ ([i]Note: Grant playing "optimally" means he is maximizing his win probability[/i])

2013 BMT Spring, 19

Tags: geometry
Equilateral triangle $ABC$ is inscribed in a circle. Chord $AD$ meets $BC$ at $E$. If $DE = 2013$, how many scenarios exist such that both $DB$ and $DC$ are integers (two scenarios are different if $AB$ is different or $AD$ is different)?

2019 AMC 10, 23

Tags: geometry
Points $A(6,13)$ and $B(12,11)$ lie on circle $\omega$ in the plane. Suppose that the tangent lines to $\omega$ at $A$ and $B$ intersect at a point on the $x$-axis. What is the area of $\omega$? $\textbf{(A) }\frac{83\pi}{8}\qquad\textbf{(B) }\frac{21\pi}{2}\qquad\textbf{(C) } \frac{85\pi}{8}\qquad\textbf{(D) }\frac{43\pi}{4}\qquad\textbf{(E) }\frac{87\pi}{8}$

2018 JBMO Shortlist, G3

Let $\triangle ABC$ and $A'$,$B'$,$C'$ the symmetrics of vertex over opposite sides.The intersection of the circumcircles of $\triangle ABB'$ and $\triangle ACC'$ is $A_1$.$B_1$ and $C_1$ are defined similarly.Prove that lines $AA_1$,$BB_1$ and $CC_1$ are concurent.

2009 ELMO Problems, 4

Let $n$ be a positive integer. Given $n^2$ points in a unit square, prove that there exists a broken line of length $2n + 1$ that passes through all the points. [i]Allen Yuan[/i]

2021 Thailand TST, 3

Find all functions $f : \mathbb{Z}\rightarrow \mathbb{Z}$ satisfying \[f^{a^{2} + b^{2}}(a+b) = af(a) +bf(b)\] for all integers $a$ and $b$

2009 Princeton University Math Competition, 3

A rectangular piece of paper $ABCD$ has sides of lengths $AB = 1$, $BC = 2$. The rectangle is folded in half such that $AD$ coincides with $BC$ and $EF$ is the folding line. Then fold the paper along a line $BM$ such that the corner $A$ falls on line $EF$. How large, in degrees, is $\angle ABM$? [asy] size(180); pathpen = rgb(0,0,0.6)+linewidth(1); pointpen = black+linewidth(3); pointfontpen = fontsize(10); pen dd = rgb(0,0,0.6) + linewidth(0.7) + linetype("4 4"), dr = rgb(0.8,0,0), dg = rgb(0,0.6,0), db = rgb(0,0,0.6)+linewidth(1); pair A=(0,1), B=(0,0), C=(2,0), D=(2,1), E=A/2, F=(2,.5), M=(1/3^.5,1), N=reflect(B,M)*A; D(B--M--D("N",N,NE)--B--D("C",C,SE)--D("D",D,NE)--M); D(D("M",M,plain.N)--D("A",A,NW)--D("B",B,SW),dd); D(D("E",E,W)--D("F",F,plain.E),dd); [/asy]

2023 Rioplatense Mathematical Olympiad, 1

Determine all triples $(x,y,p)$ of positive integers such that $p$ is prime, $p=x^2+1$ and $2p^2=y^2+1$.

2020 LMT Spring, 19

Tags:
Let $ABC$ be a triangle such that such that $AB=14, BC=13$, and $AC=15$. Let $X$ be a point inside triangle $ABC$. Compute the minimum possible value of $(\sqrt{2}AX+BX+CX)^2$.

2012 CIIM, Problem 3

Tags:
Let $a,b,c,$ the lengths of the sides of a triangle. Prove that \[\sqrt{\frac{(3a+b)(3b+a)}{(2a+c)(2b+c)}} + \sqrt{\frac{(3b+c)(3c+b)}{(2b+a)(2c+a)}} + \sqrt{\frac{(3c+a)(3a+c)}{(2c+b)(2a+b)}} \geq 4.\]

1995 IMO Shortlist, 6

Let $ n$ be an integer,$ n \geq 3.$ Let $ x_1, x_2, \ldots, x_n$ be real numbers such that $ x_i < x_{i\plus{}1}$ for $ 1 \leq i \leq n \minus{} 1$. Prove that \[ \frac{n(n\minus{}1)}{2} \sum_{i < j} x_ix_j > \left(\sum^{n\minus{}1}_{i\equal{}1} (n\minus{}i)\cdot x_i \right) \cdot \left(\sum^{n}_{j\equal{}2} (j\minus{}1) \cdot x_j \right)\]

Math Hour Olympiad, Grades 8-10, 2014.5

An infinite number of lilypads grow in a line, numbered $\dots$, $-2$, $-1$, $0$, $1$, $2$, $\dots$ Thumbelina and her pet frog start on one of the lilypads. She wants to make a sequence of jumps that will end on either pad $0$ or pad $96$. On each jump, Thumbelina tells her frog the distance (number of pads) to leap, but the frog chooses whether to jump left or right. From which starting pads can she always get to pad $0$ or pad $96$, regardless of her frog's decisions?

2024 Azerbaijan Senior NMO, 1

Numbers from 1 to 100 are written on the board in ascending order to make the following large number: 12345678910111213...9899100. Then 100 digits of this number are deleted to get the largest possible number. Find the first 10 digits of the number after deletion.

2016 USA Team Selection Test, 2

Let $ABC$ be a scalene triangle with circumcircle $\Omega$, and suppose the incircle of $ABC$ touches $BC$ at $D$. The angle bisector of $\angle A$ meets $BC$ and $\Omega$ at $E$ and $F$. The circumcircle of $\triangle DEF$ intersects the $A$-excircle at $S_1$, $S_2$, and $\Omega$ at $T \neq F$. Prove that line $AT$ passes through either $S_1$ or $S_2$. [i]Proposed by Evan Chen[/i]

2022 BMT, 1

Tags: algebra , easy
Define an operation $\Diamond$ as $ a \Diamond b = 12a - 10b.$ Compute the value of $((((20 \Diamond 22) \Diamond 22) \Diamond 22) \Diamond22).$

2016 Tournament Of Towns, 7

Several frogs are sitting on the real line at distinct integer points. In each move, one of them can take a $1$-jump towards the right as long as they are still in on distinct points. We calculate the number of ways they can make $N$ moves in this way for a positive integer $N$. Prove that if the jumps were all towards the left, we will still get the same number of ways. [i](F. Petrov)[/i] (Translated from [url=http://sasja.shap.homedns.org/Turniry/TG/index.html]here.[/url])

2003 Bundeswettbewerb Mathematik, 1

Given six consecutive positive integers, prove that there exists a prime such that one and only one of these six integers is divisible by this prime.

Geometry Mathley 2011-12, 5.4

Let $ABC$ be a triangle inscribed in a circle $(O)$. Let $P$ be an arbitrary point in the plane of triangle $ABC$. Points $A',B',C'$ are the reflections of $P$ about the lines $BC,CA,AB$ respectively. $X$ is the intersection, distinct from $A$, of the circle with diameter $AP$ and the circumcircle of triangle $AB'C'$. Points $Y,Z$ are defined in the same way. Prove that five circles $(O), (AB'C')$, $(BC'A'), (CA'B'), (XY Z)$ have a point in common. Nguyễn Văn Linh

2022 Latvia Baltic Way TST, P8

Call the intersection of two segments [i]almost perfect[/i] if for each of the segments the distance between the midpoint of the segment and the intersection is at least $2022$ times smaller than the length of the segment. Prove that there exists a closed broken line of segments such that every segment intersects at least one other segment, and every intersection of segments is [i]almost perfect[/i].