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

2019 USA TSTST, 2

Tags: geometry
Let $ABC$ be an acute triangle with circumcircle $\Omega$ and orthocenter $H$. Points $D$ and $E$ lie on segments $AB$ and $AC$ respectively, such that $AD = AE$. The lines through $B$ and $C$ parallel to $\overline{DE}$ intersect $\Omega$ again at $P$ and $Q$, respectively. Denote by $\omega$ the circumcircle of $\triangle ADE$. [list=a] [*] Show that lines $PE$ and $QD$ meet on $\omega$. [*] Prove that if $\omega$ passes through $H$, then lines $PD$ and $QE$ meet on $\omega$ as well. [/list] [i]Merlijn Staps[/i]

2018 Hanoi Open Mathematics Competitions, 12

Let $ABC$ be an acute triangle with $AB < AC$, and let $BE$ and $CF$ be the altitudes. Let the median $AM$ intersect $BE$ at point $P$, and let line $CP$ intersect $AB$ at point $D$ (see Figure 2). Prove that $DE \parallel BC$, and $AC$ is tangent to the circumcircle of $\vartriangle DEF$. [img]https://cdn.artofproblemsolving.com/attachments/f/7/bbad9f6019a77c6aa46c3a821857f06233cb93.png[/img]

2005 Danube Mathematical Olympiad, 4

Let $k$ and $n$ be positive integers. Consider an array of $2\left(2^n-1\right)$ rows by $k$ columns. A $2$-coloring of the elements of the array is said to be [i]acceptable[/i] if any two columns agree on less than $2^n-1$ entries on the same row. Given $n$, determine the maximum value of $k$ for an acceptable $2$-coloring to exist.

2019 Azerbaijan BMO TST, 3

Tags: inequalities
Let $ a, b, c$ be positive real numbers such that $ abc = 1. $ Prove that: $$ 2 (a^ 2 + b^ 2 + c^ 2) \left (\frac 1 {a^ 2} + \frac 1{b^ 2}+ \frac 1{c^2}\right)\geq 3(a+ b + c + ab + bc + ca).$$

2019 Tournament Of Towns, 3

The product of two positive integers $m$ and $n$ is divisible by their sum. Prove that $m + n \le n^2$. (Boris Frenkin)

PEN A Problems, 96

Find all positive integers $n$ that have exactly $16$ positive integral divisors $d_{1},d_{2} \cdots, d_{16}$ such that $1=d_{1}<d_{2}<\cdots<d_{16}=n$, $d_6=18$, and $d_{9}-d_{8}=17$.

1983 IMO Longlists, 21

Prove that there are infinitely many positive integers $n$ for which it is possible for a knight, starting at one of the squares of an $n \times n$ chessboard, to go through each of the squares exactly once.

1968 AMC 12/AHSME, 32

Tags: ratio
$A$ and $B$ move uniformly along two straight paths intersecting at right angles in point $O$. When $A$ is at $O$, $B$ is $500$ yards short of $O$. In $2$ minutes, they are equidistant from $O$, and in $8$ minutes more they are again equidistant from $O$. Then the ratio of $A'$s speed to $B'$s speed is: $\textbf{(A)}\ 4:5 \qquad\textbf{(B)}\ 5:6 \qquad\textbf{(C)}\ 2:3 \qquad\textbf{(D)}\ 5:8 \qquad\textbf{(E)}\ 1:2$

2012 LMT, Individual

[b]p1[/b]. Evaluate $1! + 2! + 3! + 4! + 5! $ (where $n!$ is the product of all integers from $1$ to $n$, inclusive). [b]p2.[/b] Harold opens a pack of Bertie Bott's Every Flavor Beans that contains $10$ blueberry, $10$ watermelon, $3$ spinach and $2$ earwax-flavored jelly beans. If he picks a jelly bean at random, then what is the probability that it is not spinach-flavored? [b]p3.[/b] Find the sum of the positive factors of $32$ (including $32$ itself). [b]p4.[/b] Carol stands at a flag pole that is $21$ feet tall. She begins to walk in the direction of the flag's shadow to say hi to her friends. When she has walked $10$ feet, her shadow passes the flag's shadow. Given that Carol is exactly $5$ feet tall, how long in feet is her shadow? [b]p5.[/b] A solid metal sphere of radius $7$ cm is melted and reshaped into four solid metal spheres with radii $1$, $5$, $6$, and $x$ cm. What is the value of $x$? [b]p6.[/b] Let $A = (2,-2)$ and $B = (-3, 3)$. If $(a,0)$ and $(0, b)$ are both equidistant from $A$ and $B$, then what is the value of $a + b$? [b]p7.[/b] For every flip, there is an $x^2$ percent chance of flipping heads, where $x$ is the number of flips that have already been made. What is the probability that my first three flips will all come up tails? [b]p8.[/b] Consider the sequence of letters $Z\,\,W\,\,Y\,\,X\,\,V$. There are two ways to modify the sequence: we can either swap two adjacent letters or reverse the entire sequence. What is the least number of these changes we need to make in order to put the letters in alphabetical order? [b]p9.[/b] A square and a rectangle overlap each other such that the area inside the square but outside the rectangle is equal to the area inside the rectangle but outside the square. If the area of the rectangle is $169$, then find the side length of the square. [b]p10.[/b] If $A = 50\sqrt3$, $B = 60\sqrt2$, and $C = 85$, then order $A$, $B$, and $C$ from least to greatest. [b]p11.[/b] How many ways are there to arrange the letters of the word $RACECAR$? (Identical letters are assumed to be indistinguishable.) [b]p12.[/b] A cube and a regular tetrahedron (which has four faces composed of equilateral triangles) have the same surface area. Let $r$ be the ratio of the edge length of the cube to the edge length of the tetrahedron. Find $r^2$. [b]p13.[/b] Given that $x^2 + x + \frac{1}{x} +\frac{1}{x^2} = 10$, find all possible values of $x +\frac{1}{x}$ . [b]p14.[/b] Astronaut Bob has a rope one unit long. He must attach one end to his spacesuit and one end to his stationary spacecraft, which assumes the shape of a box with dimensions $3\times 2\times 2$. If he can attach and re-attach the rope onto any point on the surface of his spacecraft, then what is the total volume of space outside of the spacecraft that Bob can reach? Assume that Bob's size is negligible. [b]p15.[/b] Triangle $ABC$ has $AB = 4$, $BC = 3$, and $AC = 5$. Point $B$ is reflected across $\overline{AC}$ to point $B'$. The lines that contain $AB'$ and $BC$ are then drawn to intersect at point $D$. Find $AD$. [b]p16.[/b] Consider a rectangle $ABCD$ with side lengths $5$ and $12$. If a circle tangent to all sides of $\vartriangle ABD$ and a circle tangent to all sides of $\vartriangle BCD$ are drawn, then how far apart are the centers of the circles? [b]p17.[/b] An increasing geometric sequence $a_0, a_1, a_2,...$ has a positive common ratio. Also, the value of $a_3 + a_2 - a_1 - a_0$ is equal to half the value of $a_4 - a_0$. What is the value of the common ratio? [b]p18.[/b] In triangle $ABC$, $AB = 9$, $BC = 11$, and $AC = 16$. Points $E$ and $F$ are on $\overline{AB}$ and $\overline{BC}$, respectively, such that $BE = BF = 4$. What is the area of triangle $CEF$? [b]p19.[/b] Xavier, Yuna, and Zach are running around a circular track. The three start at one point and run clockwise, each at a constant speed. After $8$ minutes, Zach passes Xavier for the first time. Xavier first passes Yuna for the first time in $12$ minutes. After how many seconds since the three began running did Zach first pass Yuna? [b]p20.[/b] How many unit fractions are there such that their decimal equivalent has a cycle of $6$ repeating integers? Exclude fractions that repeat in cycles of $1$, $2$, or $3$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

2024 Mexico National Olympiad, 6

Ana and Beto play on a blackboard where all integers from 1 to 2024 (inclusive) are written. On each turn, Ana chooses three numbers $a,b,c$ written on the board and then Beto erases them and writes one of the following numbers: $$a+b-c, a-b+c, ~\text{or}~ -a+b+c.$$ The game ends when only two numbers are left on the board and Ana cannot play. If the sum of the final numbers is a multiple of 3, Beto wins. Otherwise, Ana wins. ¿Who has a winning strategy?

1992 Miklós Schweitzer, 10

We place n points in the unit square independently, according to a uniform distribution. These points are the vertices of a graph $G_n$. Two points are connected by an edge if the slope of the segment connecting them is nonnegative. Denote by $M_n$ the event that the graph $G_n$ has a 1-factor. Prove that $\lim_{n \to \infty} P(M_ {2n}) = 1$.

Mathley 2014-15, 8

Two circles $(U)$ and $(V)$ intersect at $A,B$. A line d meets $(U), (V)$ at $P, Q$ and $R,S$ respectively. Let $t_P, t_Q, t_R,t_S$ be the tangents at $P,Q,R, S$ of the two circles. Another circle $(W)$ passes through through $A, B$. Prove that if the circumcircle of triangle that is formed by the intersections of $t_P,t_R, AB$ is tangent to $(W)$ then the circumcircle of triangle formed by $t_Q, t_S, AB$ is also tangent to $(W)$. Tran Minh Ngoc, a student of Ho Chi Minh City College, Ho Chi Minh

2020 Bundeswettbewerb Mathematik, 2

Konstantin moves a knight on a $n \times n$- chess board from the lower left corner to the lower right corner with the minimal number of moves. Then Isabelle takes the knight and moves it from the lower left corner to the upper right corner with the minimal number of moves. For which values of $n$ do they need the same number of moves?

1977 Putnam, A4

Tags:
For $0<x<1,$ express $$\sum_{n=0}^{\infty} \frac{x^{2^n}}{1-x^{2^{n+1}}}$$ as a rational function of $x.$

2023 India National Olympiad, 2

Suppose $a_0,\ldots, a_{100}$ are positive reals. Consider the following polynomial for each $k$ in $\{0,1,\ldots, 100\}$: $$a_{100+k}x^{100}+100a_{99+k}x^{99}+a_{98+k}x^{98}+a_{97+k}x^{97}+\dots+a_{2+k}x^2+a_{1+k}x+a_k,$$where indices are taken modulo $101$, [i]i.e.[/i], $a_{100+i}=a_{i-1}$ for any $i$ in $\{1,2,\dots, 100\}$. Show that it is impossible that each of these $101$ polynomials has all its roots real. [i]Proposed by Prithwijit De[/i]

2012 All-Russian Olympiad, 3

Consider the parallelogram $ABCD$ with obtuse angle $A$. Let $H$ be the feet of perpendicular from $A$ to the side $BC$. The median from $C$ in triangle $ABC$ meets the circumcircle of triangle $ABC$ at the point $K$. Prove that points $K,H,C,D$ lie on the same circle.

1993 Tournament Of Towns, (393) 1

Two tangents $CA$ and $CB$ are drawn to a circle ($A$ and $B$ being the tangent points). Consider a “triangle” bounded by an arc $AB$ (the smaller one) and segments $CA$ and $CB$. Prove that the length of any segment inside the triangle is not greater than the length of $CA = CB$. (Folklore)

2024 Bulgarian Winter Tournament, 10.2

Find all positive integers $k$ for which there exist positive integers $x, y$, such that $\frac{x^ky}{x^2+y^2}$ is a prime.

1993 All-Russian Olympiad, 4

On a board, there are $n$ equations in the form $*x^2+*x+*$. Two people play a game where they take turns. During a turn, you are aloud to change a star into a number not equal to zero. After $3n$ moves, there will be $n$ quadratic equations. The first player is trying to make more of the equations not have real roots, while the second player is trying to do the opposite. What is the maximum number of equations that the first player can create without real roots no matter how the second player acts?

1996 China Team Selection Test, 1

Let side $BC$ of $\bigtriangleup ABC$ be the diameter of a semicircle which cuts $AB$ and $AC$ at $D$ and $E$ respectively. $F$ and $G$ are the feet of the perpendiculars from $D$ and $E$ to $BC$ respectively. $DG$ and $EF$ intersect at $M$. Prove that $AM \perp BC$.

1998 Harvard-MIT Mathematics Tournament, 8

Find the slopes of all lines passing through the origin and tangent to the curve $y^2=x^3+39x-35$.

1999 Italy TST, 4

Let $X$ be an $n$-element set and let $A_1,\ldots ,A_m$ be subsets of $X$ such that i) $|A_i|=3$ for each $i=1,\ldots ,m$. ii) $|A_i\cap A_j|\le 1$ for any two distinct indices $i,j$. Show that there exists a subset of $X$ with at least $\lfloor\sqrt{2n}\rfloor$ elements which does not contain any of the $A_i$’s.

2008 Princeton University Math Competition, A10/B10

What is the smallest number $n$ such that you can choose $n$ distinct odd integers $a_1, a_2,..., a_n$, none of them $1$, with $\frac{1}{a_1}+ \frac{1}{a_2}+ ...+ \frac{1}{a_n}= 1$?

1986 IMO Shortlist, 9

Given a finite set of points in the plane, each with integer coordinates, is it always possible to color the points red or white so that for any straight line $L$ parallel to one of the coordinate axes the difference (in absolute value) between the numbers of white and red points on $L$ is not greater than $1$?

2020 CCA Math Bonanza, I13

Let $n$ be a positive integer. Compute, in terms of $n$, the number of sequences $(x_1,\ldots,x_{2n})$ with each $x_i\in\{0,1,2,3,4\}$ such that $x_1^2+\dots+x_{2n}^2$ is divisible by $5$. [i]2020 CCA Math Bonanza Individual Round #13[/i]