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

2014 Postal Coaching, 1

Let $p$ be a prime such that $p\mid 2a^2-1$ for some integer $a$. Show that there exist integers $b,c$ such that $p=2b^2-c^2$.

1970 IMO Longlists, 40

Let ABC be a triangle with angles $\alpha, \beta, \gamma$ commensurable with $\pi$. Starting from a point $P$ interior to the triangle, a ball reflects on the sides of $ABC$, respecting the law of reflection that the angle of incidence is equal to the angle of reflection. Prove that, supposing that the ball never reaches any of the vertices $A,B,C$, the set of all directions in which the ball will move through time is finite. In other words, its path from the moment $0$ to infinity consists of segments parallel to a finite set of lines.

2010 Indonesia TST, 4

Let $n$ be a positive integer with $n = p^{2010}q^{2010}$ for two odd primes $p$ and $q$. Show that there exist exactly $\sqrt[2010]{n}$ positive integers $x \le n$ such that $p^{2010}|x^p - 1$ and $q^{2010}|x^q - 1$.

2024 Moldova EGMO TST, 8

Tags:
In the plane there are $n$ $(n\geq4)$ marked points. There are at least $n+1$ pairs of marked points such that the distance between each pair of points is $1$. Find the greatest integer $k$ such that there is a marked point that is the center of the circle with radius $1$ on which there are at least $k$ of the marked points.

1997 AMC 12/AHSME, 16

The three row sums and the three column sums of the array \[\begin{bmatrix} 4 & 9 & 2 \\ 8 & 1 & 6 \\ 3 & 5 & 7 \end{bmatrix} \]are the same. What is the least number of entries that must be altered to make all six sums different from one another? $ \textbf{(A)}\ 1\qquad \textbf{(B)}\ 2\qquad \textbf{(C)}\ 3\qquad \textbf{(D)}\ 4\qquad \textbf{(E)}\ 5$

2007 Nicolae Coculescu, 3

Determine all sets of natural numbers $ A $ that have at least two elements, and satisfying the following proposition: $$ \forall x,y\in A\quad x>y\implies \frac{x-y}{\text{gcd} (x,y)} \in A. $$ [i]Marius Perianu[/i]

1978 Romania Team Selection Test, 5

Prove that there is no square with its four vertices on four concentric circles whose radii form an arithmetic progression.

2007 Korea National Olympiad, 2

$ ABC$ is a triangle which is not isosceles. Let the circumcenter and orthocenter of $ ABC$ be $ O$, $ H$, respectively, and the altitudes of $ ABC$ be $ AD$, $ BC$, $ CF$. Let $ K\neq A$ be the intersection of $ AD$ and circumcircle of triangle $ ABC$, $ L$ be the intersection of $ OK$ and $ BC$, $ M$ be the midpoint of $ BC$, $ P$ be the intersection of $ AM$ and the line that passes $ L$ and perpendicular to $ BC$, $ Q$ be the intersection of $ AD$ and the line that passes $ P$ and parallel to $ MH$, $ R$ be the intersection of line $ EQ$ and $ AB$, $ S$ be the intersection of $ FD$ and $ BE$. If $ OL \equal{} KL$, then prove that two lines $ OH$ and $ RS$ are orthogonal.

2020 Thailand TST, 1

Let $ABC$ be a triangle with circumcircle $\Gamma$. Let $\omega_0$ be a circle tangent to chord $AB$ and arc $ACB$. For each $i = 1, 2$, let $\omega_i$ be a circle tangent to $AB$ at $T_i$ , to $\omega_0$ at $S_i$ , and to arc $ACB$. Suppose $\omega_1 \ne \omega_2$. Prove that there is a circle passing through $S_1, S_2, T_1$, and $T_2$, and tangent to $\Gamma$ if and only if $\angle ACB = 90^o$. .

2018 USAJMO, 3

Let $ABCD$ be a quadrilateral inscribed in circle $\omega$ with $\overline{AC} \perp \overline{BD}$. Let $E$ and $F$ be the reflections of $D$ over lines $BA$ and $BC$, respectively, and let $P$ be the intersection of lines $BD$ and $EF$. Suppose that the circumcircle of $\triangle EPD$ meets $\omega$ at $D$ and $Q$, and the circumcircle of $\triangle FPD$ meets $\omega$ at $D$ and $R$. Show that $EQ = FR$.

1992 Polish MO Finals, 1

The functions $f_0, f_1, f_2, ...$ are defined on the reals by $f_0(x) = 8$ for all $x$, $f_{n+1}(x) = \sqrt{x^2 + 6f_n(x)}$. For all $n$ solve the equation $f_n(x) = 2x$.

2007 Federal Competition For Advanced Students, Part 2, 1

Let $ M$ be the set of all polynomials $ P(x)$ with pairwise distinct integer roots, integer coefficients and all absolut values of the coefficients less than $ 2007$. Which is the highest degree among all the polynomials of the set $ M$?

1983 USAMO, 1

On a given circle, six points $A$, $B$, $C$, $D$, $E$, and $F$ are chosen at random, independently and uniformly with respect to arc length. Determine the probability that the two triangles $ABC$ and $DEF$ are disjoint, i.e., have no common points.

2009 Jozsef Wildt International Math Competition, w. 24

If $K$, $L$, $M$ denote the midpoints of the sides $AB$, $BC$, $CA$ in triangle $\triangle ABC$, then for all $P$ in the plane of triangle $\triangle ABC$, we have $$\frac{AB}{PK}+\frac{BC}{PL}+\frac{CA}{PM} \geq \frac{AB\cdot BC \cdot CA}{4\cdot PK\cdot PL\cdot PM}$$

Indonesia MO Shortlist - geometry, g1.1

$ABCD$ is a parallelogram. $g$ is a line passing $A$. Prove that the distance from $C$ to $g$ is either the sum or the difference of the distance from $B$ to $g$, and the distance from $D$ to $g$.

1996 AIME Problems, 7

Two of the squares of a $ 7\times 7$ checkerboard are painted yellow, and the rest are painted green. Two color schemes are equivalent if one can be obtained from the other by applying a rotation in the plane of the board. How many inequivalent color schemes are possible?

2008 Chile National Olympiad, 4

Three colors are available to paint the plane. If each point in the plane is assigned one of these three colors, prove that there is a segment of length $1$ whose endpoints have the same color.

1964 Kurschak Competition, 1

$ABC$ is an equilateral triangle. $D$ and$ D'$ are points on opposite sides of the plane $ABC$ such that the two tetrahedra $ABCD$ and $ABCD'$ are congruent (but not necessarily with the vertices in that order). If the polyhedron with the five vertices $A, B, C, D, D'$ is such that the angle between any two adjacent faces is the same, find $DD'/AB$ .

LMT Guts Rounds, 9

Tags:
A trapezoid has bases with lengths equal to $5$ and $15$ and legs with lengths equal to $13$ and $13.$ Determine the area of the trapezoid.

2006 International Zhautykov Olympiad, 1

In a pile you have 100 stones. A partition of the pile in $ k$ piles is [i]good[/i] if: 1) the small piles have different numbers of stones; 2) for any partition of one of the small piles in 2 smaller piles, among the $ k \plus{} 1$ piles you get 2 with the same number of stones (any pile has at least 1 stone). Find the maximum and minimal values of $ k$ for which this is possible.

2004 Spain Mathematical Olympiad, Problem 5

Demonstrate that the condition necessary so that, in triangle ${ABC}$, the median from ${B}$ is divided into three equal parts by the inscribed circumference of a circle is: ${A/5 = B/10 = C/13}$.

2019 Hong Kong TST, 6

Tags: inequalities
If $57a + 88b + 125c \geq 1148$, where $a,b,c > 0$, what is the minimum value of \[ a^3 + b^3 + c^3 + 5a^2 + 5b^2 + 5c^2? \]

VMEO IV 2015, 11.1

Let $k \ge 0$ and $a, b, c$ be three positive real numbers such that $$\frac{a}{b}+\frac{b}{c}+ \frac{c}{a}= (k + 1)^2 + \frac{2}{k+ 1}.$$ Prove that $$a^2 + b^2 + c^2 \le (k^2 + 1)(ab + bc + ca).$$

VI Soros Olympiad 1999 - 2000 (Russia), 9.10

The schoolboy wrote a homework essay on the topic “How I spent my summer.” Two of his comrades from a neighboring school decided not to bother themselves with work and rewrote his essay. But while rewriting they made several mistakes - each their own. Before submitting their work, both students gave their essays to four other friends to rewrite (each gave them to two acquaintances). These four schoolchildren do the same, and so on. With each rewrite, all previous mistakes are saved and, possibly, new ones are made. It is known that on some day each new essay contained at least $10$ errors. Prove that there was a day when at least $11$ new mistakes were made in total.

2020 Peru IMO TST, 5

You are given a set of $n$ blocks, each weighing at least $1$; their total weight is $2n$. Prove that for every real number $r$ with $0 \leq r \leq 2n-2$ you can choose a subset of the blocks whose total weight is at least $r$ but at most $r + 2$.