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

1979 All Soviet Union Mathematical Olympiad, 269

What is the least possible ratio of two isosceles triangles areas, if three vertices of the first one belong to three different sides of the second one?

2016 Regional Competition For Advanced Students, 2

Let $a$, $b$, $c$ and $d$ be real numbers with $a^2 + b^2 + c^2 + d^2 = 4$. Prove that the inequality $$(a+2)(b+2) \ge cd$$ holds and give four numbers $a$, $b$, $c$ and $d$ such that equality holds. (Walther Janous)

2018 Saint Petersburg Mathematical Olympiad, 2

Vasya has $100$ cards of $3$ colors, and there are not more than $50$ cards of same color. Prove that he can create $10\times 10$ square, such that every cards of same color have not common side.

1993 All-Russian Olympiad Regional Round, 11.8

There are $ 1993$ towns in a country, and at least $ 93$ roads going out of each town. It's known that every town can be reached from any other town. Prove that this can always be done with no more than $ 62$ transfers.

2018 Thailand TSTST, 2

In triangle $\vartriangle ABC$, $\angle BAC = 135^o$. $M$ is the midpoint of $BC$, and $N \ne M$ is on $BC$ such that $AN = AM$. The line $AM$ meets the circumcircle of $\vartriangle ABC$ at $D$. Point $E$ is chosen on segment $AN$ such that $AE = MD$. Show that $ME = BC$.

1996 Romania Team Selection Test, 16

Let $ n\geq 3 $ be an integer and let $ \mathcal{S} \subset \{1,2,\ldots, n^3\} $ be a set with $ 3n^2 $ elements. Prove that there exist nine distinct numbers $ a_1,a_2,\ldots,a_9 \in \mathcal{S} $ such that the following system has a solution in nonzero integers: \begin{eqnarray*} a_1x + a_2y +a_3 z &=& 0 \\ a_4x + a_5 y + a_6 z &=& 0 \\ a_7x + a_8y + a_9z &=& 0. \end{eqnarray*} [i]Marius Cavachi[/i]

2011 Today's Calculation Of Integral, 721

For constant $a$, find the differentiable function $f(x)$ satisfying $\int_0^x (e^{-x}-ae^{-t})f(t)dt=0$.

1951 AMC 12/AHSME, 47

Tags: quadratics
If $ r$ and $ s$ are the roots of the equation $ ax^2 \plus{} bx \plus{} c \equal{} 0$, the value of $ \frac {1}{r^2} \plus{} \frac {1}{s^2}$ is: $ \textbf{(A)}\ b^2 \minus{} 4ac \qquad\textbf{(B)}\ \frac {b^2 \minus{} 4ac}{2a} \qquad\textbf{(C)}\ \frac {b^2 \minus{} 4ac}{c^2} \qquad\textbf{(D)}\ \frac {b^2 \minus{} 2ac}{c^2}$ $ \textbf{(E)}\ \text{none of these}$

2022 Estonia Team Selection Test, 2

Let $d_i$ be the first decimal digit of $2^i$ for every non-negative integer $i$. Prove that for each positive integer $n$ there exists a decimal digit other than $0$ which can be found in the sequence $d_0, d_1, \dots, d_{n-1}$ strictly less than $\frac{n}{17}$ times.

2021 Brazil Team Selection Test, 6

Let $\mathcal{S}$ be a set consisting of $n \ge 3$ positive integers, none of which is a sum of two other distinct members of $\mathcal{S}$. Prove that the elements of $\mathcal{S}$ may be ordered as $a_1, a_2, \dots, a_n$ so that $a_i$ does not divide $a_{i - 1} + a_{i + 1}$ for all $i = 2, 3, \dots, n - 1$.

2020 Princeton University Math Competition, 3

Alice and Bob are playing a guessing game. Bob is thinking of a number n of the form $2^a3^b$, where a and b are positive integers between $ 1$ and $2020$, inclusive. Each turn, Alice guess a number m, and Bob will tell her either $\gcd (m, n)$ or $lcm (m, n)$ (letting her know that he is saying that $gcd$ or $lcm$), as well as whether any of the respective powers match up in their prime factorization. In particular, if $m = n$, Bob will let Alice know this, and the game is over. Determine the smallest number $k$ so that Alice is always able to find $n$ within $k$ guesses, regardless of Bob’s number or choice of revealing either the $lcm$, or the $gcd$ .

1998 Estonia National Olympiad, 4

For real numbers $x, y$ and $z$ it is known that $$\begin{cases} x + y = 2 \\ xy = z^2 + 1\end {cases}$$ Find the value of the expression $x^2 + y^2+ z^2$.

2017-2018 SDML (Middle School), 2

A circle and a square are drawn on the plane so that they overlap. Together, the two shapes cover an area of $329$ square units. The area common to both shapes is $101$ square units. The area of the circle is $234$ square units. What is the perimeter of the square in units? $\mathrm{(A) \ } 14 \qquad \mathrm{(B) \ } 48 \qquad \mathrm {(C) \ } 56 \qquad \mathrm{(D) \ } 64 \qquad \mathrm{(E) \ } 196$

2003 AMC 12-AHSME, 18

Tags:
Let $ n$ be a $ 5$-digit number, and let $ q$ and $ r$ be the quotient and remainder, respectively, when $ n$ is divided by $ 100$. For how many values of $ n$ is $ q \plus{} r$ divisible by $ 11$? $ \textbf{(A)}\ 8180 \qquad \textbf{(B)}\ 8181 \qquad \textbf{(C)}\ 8182 \qquad \textbf{(D)}\ 9000 \qquad \textbf{(E)}\ 9090$

2007 Today's Calculation Of Integral, 170

Let $a,\ b$ be constant numbers such that $a^{2}\geq b.$ Find the following definite integrals. (1) $I=\int \frac{dx}{x^{2}+2ax+b}$ (2) $J=\int \frac{dx}{(x^{2}+2ax+b)^{2}}$

2006 MOP Homework, 4

For positive integers $t,a$, and $b$, Lucy and Windy play the $(t,a,b)$- [i]game [/i] defined by the following rules. Initially, the number $t$ is written on a blackboard. On her turn, a player erases the number on the board and writes either the number $t - a$ or $t - b$ on the board. Lucy goes first and then the players alternate. The player who first reaches a negative losses the game. Prove that there exist infinitely many values of $t$ in which Lucy has a winning strategy for all pairs $(a, b)$ with $a + b = 2005$.

1996 Baltic Way, 11

Real numbers $x_1,x_2,\ldots ,x_{1996}$ have the following property: For any polynomial $W$ of degree $2$ at least three of the numbers $W(x_1),W(x_2),\ldots ,W(x_{1996})$ are equal. Prove that at least three of the numbers $x_1,x_2,\ldots ,x_{1996}$ are equal.

1985 Putnam, B1

Let $k$ be the smallest positive integer for which there exist distinct integers $m_{1}, m_{2}, m_{3}, m_{4}, m_{5}$ such that the polynomial $$p(x)=\left(x-m_{1}\right)\left(x-m_{2}\right)\left(x-m_{3}\right)\left(x-m_{4}\right)\left(x-m_{5}\right)$$ has exactly $k$ nonzero coefficients. Find, with proof, a set of integers $m_{1}, m_{2}, m_{3}, m_{4}, m_{5}$ for which this minimum $k$ is achieved.

2012 AMC 12/AHSME, 13

Paula the painter and her two helpers each paint at constant, but different, rates. They always start at $\text{8:00 AM}$, and all three always take the same amount of time to eat lunch. On Monday the three of them painted $50\%$ of a house, quitting at $\text{4:00 PM}$. On Tuesday, when Paula wasn't there, the two helpers painted only $24\%$ of the house and quit at $\text{2:12 PM}$. On Wednesday Paula worked by herself and finished the house by working until $\text{7:12 PM}$. How long, in minutes, was each day's lunch break? $ \textbf{(A)}\ 30 \qquad\textbf{(B)}\ 36 \qquad\textbf{(C)}\ 42 \qquad\textbf{(D)}\ 48 \qquad\textbf{(E)}\ 60 $

2024 Dutch IMO TST, 3

Given is a polynomial $P(x)$ of degree $n>1$ with real coefficients. The equation $P(P(P(x)))=P(x)$ has $n^3$ distinct real roots. Prove that these roots could be split into two groups with equal arithmetic mean.

2016 China National Olympiad, 5

Tags: geometry
Let $ABCD$ be a convex quadrilateral. Show that there exists a square $A'B'C'D'$ (Vertices maybe ordered clockwise or counter-clockwise) such that $A \not = A', B \not = B', C \not = C', D \not = D'$ and $AA',BB',CC',DD'$ are all concurrent.

2007 Princeton University Math Competition, 2

Tags:
Hugo, Evo, and Fidel are playing Dungeons and Dragons, which requires many twenty-sided dice. Attempting to slay Evo's [i]vicious hobgoblin +1 of viciousness,[/i] Hugo rolls $25$ $20$-sided dice, obtaining a sum of (alas!) only $70$. Trying to console him, Fidel notes that, given that sum, the product of the numbers was as large as possible. How many $2$s did Hugo roll?

1988 IMO Longlists, 9

If $a_0$ is a positive real number, consider the sequence $\{a_n\}$ defined by: \[ a_{n+1} = \frac{a^2_n - 1}{n+1}, n \geq 0. \] Show that there exist a real number $a > 0$ such that: [b]i.)[/b] for all $a_0 \geq a,$ the sequence $\{a_n\} \rightarrow \infty,$ [b]ii.)[/b] for all $a_0 < a,$ the sequence $\{a_n\} \rightarrow 0.$

2017 Olympic Revenge, 4

Let $f:\mathbb{R}_{+}^{*}$$\rightarrow$$\mathbb{R}_{+}^{*}$ such that $f'''(x)>0$ for all $x$ $\in$ $\mathbb{R}_{+}^{*}$. Prove that: $f(a^{2}+b^{2}+c^{2})+2f(ab+bc+ac)$ $\geq$ $f(a^{2}+2bc)+f(b^{2}+2ca)+f(c^{2}+2ab)$, for all $a,b,c$ $\in$ $\mathbb{R}_{+}^{*}$.

2015 HMNT, 6

Tags:
Marcus and four of his relatives are at a party. Each pair of the five people are either $\textit{friends}$ or $\textit{enemies}$. For any two enemies, there is no person that they are both friends with. In how many ways is this possible?