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

V Soros Olympiad 1998 - 99 (Russia), 11.1

Find all $x$ for which the inequality holds $$9 \sin x +40 \cos x \ge 41.$$

2007 Iran Team Selection Test, 2

Triangle $ABC$ is isosceles ($AB=AC$). From $A$, we draw a line $\ell$ parallel to $BC$. $P,Q$ are on perpendicular bisectors of $AB,AC$ such that $PQ\perp BC$. $M,N$ are points on $\ell$ such that angles $\angle APM$ and $\angle AQN$ are $\frac\pi2$. Prove that \[\frac{1}{AM}+\frac1{AN}\leq\frac2{AB}\]

2024 CAPS Match, 1

Determine whether there exist 2024 distinct positive integers satisfying the following: if we consider every possible ratio between two distinct numbers (we include both $a/b$ and $b/a$), we will obtain numbers with finite decimal expansions (after the decimal point) of mutually distinct non-zero lengths.

2007 Greece National Olympiad, 1

Find all positive integers $n$ such that $4^{n}+2007$ is a perfect square.

1990 IMO Shortlist, 28

Prove that on the coordinate plane it is impossible to draw a closed broken line such that [i](i)[/i] the coordinates of each vertex are rational; [i](ii)[/i] the length each of its edges is 1; [i](iii)[/i] the line has an odd number of vertices.

1982 AMC 12/AHSME, 13

Tags: logarithm
If $a>1$, $b>1$, and $p=\frac{\log_b(\log_ba)}{\log_ba}$, then $a^n$ equals $\textbf {(A) } 1 \qquad \textbf {(B) } b \qquad \textbf {(C) } \log_ab \qquad \textbf {(D) } \log_ba \qquad \textbf {(E) } a^{\log_ba}$

2016 Romania Team Selection Tests, 3

Given a prime $p$, prove that the sum $\sum_{k=1}^{\lfloor \frac{q}{p} \rfloor}{k^{p-1}}$ is not divisible by $q$ for all but finitely many primes $q$.

1951 Putnam, A5

Tags:
Consider in the plane the network of points having integral coordinates. For lines having rational slope show that: (i) the line passes through no points of the network or through infinitely many; (ii) there exists for each line a positive number $d$ having the property that no point of the network, except such as may be on the line, is closer to the line than the distance $d.$

1988 Putnam, B5

Tags:
For positive integers $n$, let $M_n$ be the $2n+1$ by $2n+1$ skew-symmetric matrix for which each entry in the first $n$ subdiagonals below the main diagonal is 1 and each of the remaining entries below the main diagonal is -1. Find, with proof, the rank of $M_n$. (According to one definition, the rank of a matrix is the largest $k$ such that there is a $k \times k$ submatrix with nonzero determinant.) One may note that \begin{align*} M_1 &= \left( \begin{array}{ccc} 0 & -1 & 1 \\ 1 & 0 & -1 \\ -1 & 1 & 0 \end{array}\right) \\ M_2 &= \left( \begin{array}{ccccc} 0 & -1 & -1 & 1 & 1 \\ 1 & 0 & -1 & -1 & 1 \\ 1 & 1 & 0 & -1 & -1 \\ -1 & 1 & 1 & 0 & -1 \\ -1 & -1 & 1 & 1 & 0 \end{array} \right). \end{align*}

1977 All Soviet Union Mathematical Olympiad, 239

Tags: limit , algebra , sequence
Given infinite sequence $a_n$. It is known that the limit of $$b_n=a_{n+1}-a_n/2$$ equals zero. Prove that the limit of $a_n$ equals zero.

2017 Harvard-MIT Mathematics Tournament, 22

Kelvin the Frog and $10$ of his relatives are at a party. Every pair of frogs is either [i]friendly[/i] or [i]unfriendly[/i]. When $3$ pairwise friendly frogs meet up, they will gossip about one another and end up in a [i]fight[/i] (but stay [i]friendly[/i] anyway). When $3$ pairwise unfriendly frogs meet up, they will also end up in a [i]fight[/i]. In all other cases, common ground is found and there is no fight. If all $\binom{11}{3}$ triples of frogs meet up exactly once, what is the minimum possible number of fights?

2001 Manhattan Mathematical Olympiad, 6

Tags:
There are $n$ coins of the radius $r$ on a table which is a circle of the radius $R$. It is known that: a) any two coins either touch each other or have no common points; b) there is no place for one more coin on the table. Prove that \[ \dfrac12 \left(\dfrac{R}{r} - 1\right) < \sqrt{n} < \dfrac{R}{r}.\]

2000 Mongolian Mathematical Olympiad, Problem 2

Let $n\ge2$. For any two $n$-vectors $\vec x=(x_1,\ldots,x_n)$ and $\vec y=(y_1,\ldots,y_n)$, we define $$f\left(\vec x,\vec y\right)=x_1\overline{y_1}-\sum_{i=2}^nx_i\overline{y_i}.$$Prove that if $f\left(\vec x,\vec x\right)\ge0$, and $f\left(\vec y,\vec y\right)\ge0$, then $\left|f\left(\vec x,\vec y\right)\right|^2\ge f\left(\vec x,\vec x\right)f\left(\vec y,\vec y\right)$.

2014 Online Math Open Problems, 2

Consider two circles of radius one, and let $O$ and $O'$ denote their centers. Point $M$ is selected on either circle. If $OO' = 2014$, what is the largest possible area of triangle $OMO'$? [i]Proposed by Evan Chen[/i]

2020 AMC 8 -, 5

Tags:
Three fourths of a pitcher is filled with pineapple juice. The pitcher is emptied by pouring an equal amount of juice into each of $5$ cups. What percent of the total capacity of the pitcher did each cup receive? $\textbf{(A) }5 \qquad \textbf{(B) }10 \qquad \textbf{(C) }15 \qquad \textbf{(D) }20 \qquad \textbf{(E) }25$

2020 Dutch IMO TST, 1

Given are real numbers $a_1, a_2,..., a_{2020}$, not necessarily different. For every $n \ge 2020$, define $a_{n + 1}$ as the smallest real zero of the polynomial $$P_n (x) = x^{2n} + a_1x^{2n - 2} + a_2x^{2n - 4} +... + a_{n -1}x^2 + a_n$$, if it exists. Assume that $a_{n + 1}$ exists for all $n \ge 2020$. Prove that $a_{n + 1} \le a_n$ for all $n \ge 2021$.

1976 Dutch Mathematical Olympiad, 2

Given $\vartriangle ABC$ and a point $P$ inside that triangle. The parallelograms $CPBL$, $APCM$ and $BPAN$ are constructed. Prove that $AL$, $BM$ and $CN$ pass through one point $S$, and that $S$ is the midpoint of $AL$, $BM$ and $CN$.

2014 Ukraine Team Selection Test, 11

Find all functions $f: R \to R$ that satisfy the condition $(f (x) - f (y)) (u - v) = (f (u) - f (v)) (x -y)$ for arbitrary real $x, y, u, v$ such that $x + y = u + v$.

2012 National Olympiad First Round, 32

Tags:
How many permutations $(a_1,a_2,\dots,a_{10})$ of $1,2,3,4,5,6,7,8,9,10$ satisfy $|a_1-1|+|a_2-2|+\dots+|a_{10}-10|=4$ ? $ \textbf{(A)}\ 60 \qquad \textbf{(B)}\ 52 \qquad \textbf{(C)}\ 50 \qquad \textbf{(D)}\ 44 \qquad \textbf{(E)}\ 36$

2022 Tuymaada Olympiad, 5

Prove that a quadratic trinomial $x^2 + ax + b (a, b \in R)$ cannot attain at ten consecutive integral points values equal to powers of $2$ with non-negative integral exponent. [i](F. Petrov )[/i]

2022 BMT, 1

Tags: geometry
To fold a paper airplane, Austin starts with a square paper $F OLD$ with side length $2$. First, he folds corners $L$ and $D$ to the square’s center. Then, he folds corner $F$ to corner $O$. What is the longest distance between two corners of the resulting figure?

2022 AIME Problems, 10

Tags:
Find the remainder when $$\binom{\binom{3}{2}}{2} + \binom{\binom{4}{2}}{2} + \dots + \binom{\binom{40}{2}}{2}$$ is divided by $1000$.

2021 Czech-Polish-Slovak Junior Match, 1

You are given a $2 \times 2$ array with a positive integer in each field. If we add the product of the numbers in the first column, the product of the numbers in the second column, the product of the numbers in the first row and the product of the numbers in the second row, we get $2021$. a) Find possible values for the sum of the four numbers in the table. b) Find the number of distinct arrays that satisfy the given conditions that contain four pairwise distinct numbers in arrays.

2014 CHMMC (Fall), 7

Tags: algebra
Let $$P(x) = \sum^n_{k=1}(x^{3^k}+ x^{-3^k}- 1), Q(x) = \sum^n_{k=1}(x^{3^k}+ x^{-3^k}+ 1).$$ Given that $$P(x)Q(x) =\sum^{2\cdot 3^n}_{k=-2\cdot 3^n} a_kx^k,$$ Compute $\sum^{3^n}_{k=0}a_k$ in terms of $n$.

2022 IMO Shortlist, N3

Let $a > 1$ be a positive integer and $d > 1$ be a positive integer coprime to $a$. Let $x_1=1$, and for $k\geq 1$, define $$x_{k+1} = \begin{cases} x_k + d &\text{if } a \text{ does not divide } x_k \\ x_k/a & \text{if } a \text{ divides } x_k \end{cases}$$ Find, in terms of $a$ and $d$, the greatest positive integer $n$ for which there exists an index $k$ such that $x_k$ is divisible by $a^n$.