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

1949 Miklós Schweitzer, 5

Let $ f(x)$ be a polynomial of second degree the roots of which are contained in the interval $ [\minus{}1,\plus{}1]$ and let there be a point $ x_0\in [\minus{}1.\plus{}1]$ such that $ |f(x_0)|\equal{}1$. Prove that for every $ \alpha \in [0,1]$, there exists a $ \zeta \in [\minus{}1,\plus{}1]$ such that $ |f'(\zeta)|\equal{}\alpha$ and that this statement is not true if $ \alpha>1$.

1995 Spain Mathematical Olympiad, 5

Prove that if the equations $x^3+mx-n = 0$ $nx^3-2m^2x^2 -5mnx-2m^3-n^2 = 0$ have one root in common ($n \ne 0$), then the first equation has two equal roots, and find the roots of the equations in terms of $n$.

2017 Sharygin Geometry Olympiad, 4

Tags: tangency , geometry
Points $M$ and $K$ are chosen on lateral sides $AB,AC$ of an isosceles triangle $ABC$ and point $D$ is chosen on $BC$ such that $AMDK$ is a parallelogram. Let the lines $MK$ and $BC$ meet at point $L$, and let $X,Y$ be the intersection points of $AB,AC$ with the perpendicular line from $D$ to $BC$. Prove that the circle with center $L$ and radius $LD$ and the circumcircle of triangle $AXY$ are tangent.

2019 Thailand TST, 1

Let $n>1$ be a positive integer. Each cell of an $n\times n$ table contains an integer. Suppose that the following conditions are satisfied: [list=1] [*] Each number in the table is congruent to $1$ modulo $n$. [*] The sum of numbers in any row, as well as the sum of numbers in any column, is congruent to $n$ modulo $n^2$. [/list] Let $R_i$ be the product of the numbers in the $i^{\text{th}}$ row, and $C_j$ be the product of the number in the $j^{\text{th}}$ column. Prove that the sums $R_1+\hdots R_n$ and $C_1+\hdots C_n$ are congruent modulo $n^4$.

2005 Taiwan National Olympiad, 3

$a_1, a_2, ..., a_{95}$ are positive reals. Show that $\displaystyle \sum_{k=1}^{95}{a_k} \le 94+ \prod_{k=1}^{95}{\max{\{1,a_k\}}}$

2017 Azerbaijan Senior National Olympiad, G4

İn convex hexagon $ABCDEF$'s diagonals $AD,BE,CF$ intercepts each other at point $O$. If the area of triangles $AOB,COD,EOF$ are $4,6$ and $9$ respectively, find the minimum possible value of area of hexagon $ABCDEF$

2023 Princeton University Math Competition, A4 / B6

A sequence of integers $a_1, a_2, \ldots, a_n$ is said to be [i]sub-Fibonacci[/i] if $a_1=a_2=1$ and $a_i \le a_{i-1}+a_{i-2}$ for all $3 \le i \le n.$ How many sub-Fibonacci sequences are there with $10$ terms such that the last two terms are both $20$?

KoMaL A Problems 2020/2021, A. 792

Let $p\geq 3$ be a prime number and $0\leq r\leq p-3.$ Let $x_1,x_2,\ldots,x_{p-1+r}$ be integers satisfying \[\sum_{i=1}^{p-1+r}x_i^k\equiv r \bmod{p}\]for all $1\leq k\leq p-2.$ What are the possible remainders of numbers $x_2,x_2,\ldots,x_{p-1+r}$ modulo $p?$ [i]Proposed by Dávid Matolcsi, Budapest[/i]

1990 Chile National Olympiad, 2

Find all the odd naturals whose indicator is the same as $1990$. We clarify that, if a natural decomposes into prime factors in the form $\Pi_{j=1}^r p_j^{a_j}$, define the [i]indicator [/i] as : $\phi (n) = r\Pi_{j=1}^r p_j^{a_j-1} (p_j + 1)$. [hide=official wording for first sentence]Encuentre todos los naturales impares cuyo indicador es el mismo que el de 1990.[/hide]

2008 IberoAmerican Olympiad For University Students, 3

Tags: inequalities
Prove that $x+\frac{1}{x^x}<2$ for $0<x<1$.

1994 All-Russian Olympiad, 8

Players $ A,B$ alternately move a knight on a $ 1994\times 1994$ chessboard. Player $ A$ makes only horizontal moves, i.e. such that the knight is moved to a neighboring row, while $ B$ makes only vertical moves. Initally player $ A$ places the knight to an arbitrary square and makes the first move. The knight cannot be moved to a square that was already visited during the game. A player who cannot make a move loses. Prove that player $ A$ has a winning strategy.

2011 Kazakhstan National Olympiad, 3

In some cells of a rectangular table $m\times n (m, n> 1)$ is one checker. $Baby$ cut along the lines of the grid this table so that it is split into two equal parts, with the number of pieces on each side were the same. $Carlson$ changed the arrangement of checkers on the board (and on each side of the cage is still worth no more than one pieces). Prove that the $Baby$ may again cut the board into two equal parts containing an equal number of pieces

1955 AMC 12/AHSME, 45

Given a geometric sequence with the first term $ \neq 0$ and $ r \neq 0$ and an arithmetic sequence with the first term $ \equal{}0$. A third sequence $ 1,1,2\ldots$ is formed by adding corresponding terms of the two given sequences. The sum of the first ten terms of the third sequence is: $ \textbf{(A)}\ 978 \qquad \textbf{(B)}\ 557 \qquad \textbf{(C)}\ 467 \qquad \textbf{(D)}\ 1068 \\ \textbf{(E)}\ \text{not possible to determine from the information given}$

2020-21 IOQM India, 25

For a positive integer $n$, let $\langle n \rangle$ denote the perfect square integer closest to $n$. For example, $\langle 74 \rangle = 81$, $\langle 18 \rangle = 16$. If $N$ is the smallest positive integer such that $$ \langle 91 \rangle \cdot \langle 120 \rangle \cdot \langle 143 \rangle \cdot \langle 180 \rangle \cdot \langle N \rangle = 91 \cdot 120 \cdot 143 \cdot 180 \cdot N $$ find the sum of the squares of the digits of $N$.

2012 AMC 12/AHSME, 1

Tags:
A bug crawls along a number line, starting at $-2$. It crawls to $-6$, then turns around and crawls to $5$. How many units does the bug crawl altogether? $ \textbf{(A)}\ 9 \qquad\textbf{(B)}\ 11 \qquad\textbf{(C)}\ 13 \qquad\textbf{(D)}\ 14 \qquad\textbf{(E)}\ 15 $

PEN D Problems, 9

Show that there exists a composite number $n$ such that $a^n \equiv a \; \pmod{n}$ for all $a \in \mathbb{Z}$.

2025 6th Memorial "Aleksandar Blazhevski-Cane", P1

Determine all triples of prime numbers $(p, q, r)$ that satisfy \[p2^q + r^2 = 2025.\] Proposed by [i]Ilija Jovcevski[/i]

2024 LMT Fall, 30

Tags: guts
Find \[\sum_{n=1}^{\infty} \frac{\varphi(n)}{(-4)^n-1},\]where $\varphi(n)$ is the number of positive integers $k \le n$ relatively prime to $n$. (Note $\varphi(1)=1$.)

1991 APMO, 3

Let $a_1$, $a_2$, $\cdots$, $a_n$, $b_1$, $b_2$, $\cdots$, $b_n$ be positive real numbers such that $a_1 + a_2 + \cdots + a_n = b_1 + b_2 + \cdots + b_n$. Show that \[ \frac{a_1^2}{a_1 + b_1} + \frac{a_2^2}{a_2 + b_2} + \cdots + \frac{a_n^2}{a_n + b_n} \geq \frac{a_1 + a_2 + \cdots + a_n}{2} \]

2005 AIME Problems, 15

Triangle $ABC$ has $BC=20$. The incircle of the triangle evenly trisects the median $AD$. If the area of the triangle is $m \sqrt{n}$ where $m$ and $n$ are integers and $n$ is not divisible by the square of a prime, find $m+n$.

2016 Latvia Baltic Way TST, 13

Suppose that $A, B, C$, and $X$ are any four distinct points in the plane with $$\max \,(BX,CX) \le AX \le BC.$$ Prove that $\angle BAC \le 150^o$.

2020 AIME Problems, 10

Let $m$ and $n$ be positive integers satisfying the conditions [list] [*] $\gcd(m+n,210) = 1,$ [*] $m^m$ is a multiple of $n^n,$ and [*] $m$ is not a multiple of $n$. [/list] Find the least possible value of $m+n$.

2017 F = ma, 1

Tags: fraction
A motorcycle rides on the vertical walls around the perimeter of a large circular room. The friction coefficient between the motorcycle tires and the walls is $\mu$. How does the minimum $\mu$ needed to prevent the motorcycle from slipping downwards change with the motorcycle's speed, $s$? $\textbf{(A)}\mu \propto s^{0} \qquad \textbf{(B)}\mu \propto s^{-\frac{1}{2}}\qquad \textbf{(C)}\mu \propto s^{-1}\qquad \textbf{(D)}\mu \propto s^{-2}\qquad \textbf{(E)}\text{none of these}$

2018 PUMaC Geometry B, 3

Tags: geometry
Let $\overline{AD}$ be a diameter of a circle. Let point $B$ be on the circle, point $C$ on $\overline{AD}$ such that $A, B, C$ form a right triangle at $C$. The value of the hypotenuse of the triangle is $4$ times the square root of its area. If $\overline{BC}$ has length $30$, what is the length of the radius of the circle?

2023 Thailand Online MO, 10

Let $n$ be an even positive integer. Alice and Bob play the following game. Before the start of the game, Alice chooses a set $S$ containing $m$ integers and announces it to Bob. The players then alternate turns, with Bob going first, choosing $i\in\{1,2,\dots, n\}$ that has not been chosen and setting the value of $v_i$ to either $0$ or $1$. At the end of the game, when all of $v_1,v_2,\dots,v_n$ have been set, the expression $$E=v_1\cdot 2^0 + v_2 \cdot 2^1 + \dots + v_n \cdot 2^{n-1}$$ is calculated. Determine the minimum $m$ such that Alice can always ensure that $E\in S$ regardless of how Bob plays.