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

1991 AMC 12/AHSME, 29

Equilateral triangle $ABC$ has been creased and folded so that vertex $A$ now rests at $A'$ on $\overline{BC}$ as shown. If $BA' = 1$ and $A'C = 2$ then the length of crease $\overline{PQ}$ is [asy] size(170); defaultpen(linewidth(0.7)+fontsize(10)); pair B=origin, A=(1.5,3*sqrt(3)/2), C=(3,0), D=(1,0), P=B+1.6*dir(B--A), Q=C+1.2*dir(C--A); draw(B--P--D--B^^P--Q--D--C--Q); draw(Q--A--P, linetype("4 4")); label("$A$", A, N); label("$B$", B, W); label("$C$", C, E); label("$A'$", D, S); label("$P$", P, W); label("$Q$", Q, E); [/asy] $ \textbf{(A)}\ \frac{8}{5}\qquad\textbf{(B)}\ \frac{7}{20}\sqrt{21}\qquad\textbf{(C)}\ \frac{1+\sqrt{5}}{2}\qquad\textbf{(D)}\ \frac{13}{8}\qquad\textbf{(E)}\ \sqrt{3} $

MMPC Part II 1958 - 95, 1986

[b]p1.[/b] $\vartriangle DEF$ is constructed from equilateral $\vartriangle ABC$ by choosing $D$ on $AB$, $E$ on $BC$ and $F$ on $CA$ so that $\frac{DB}{AB}=\frac{EC}{BC}=\frac{FA}{CA}=a$, where $a$ is a number between $0$ and $1/2$. (a) Show that $\vartriangle DEF$ is also equilateral. (b) Determine the value of $a$ that makes the area of $\vartriangle DEF$ equal to one half the area of $\vartriangle ABC$. [b]p2.[/b] A bowl contains some red balls and some white balls. The following operation is repeated until only one ball remains in the bowl: Two balls are drawn at random from the bowl. If they have different colors, then the red one is discarded and the white one is returned to the bowl. If they have the same color, then both are discarded and a red ball (from an outside supply of red balls) is added to the bowl. (Note that this operation—in either case—reduces the number of balls in the bowl by one.) (a) Show that if the bowl originally contained exactly $1$ red ball and $ 2$ white balls, then the color of the ball remaining at the end (i.e., after two applications of the operation) does not depend on chance, and determine the color of this remaining ball. (b) Suppose the bowl originally contained exactly $1986$ red balls and $1986$ white balls. Show again that the color of the ball remaining at the end does not depend on chance and determine its color. [b]p3.[/b] Let $a, b$, and $c$ be three consecutive positive integers, with $a < b < c.$ (a) Show that $ab$ cannot be the square of an integer. (b) Show that $ac$ cannot be the square of an integer. (c) Show that $abc$ cannot be the square of an integer. [b]p4.[/b] Consider the system of equations $$\sqrt{x}+\sqrt{y}=2$$ $$ x^2+y^2=5$$ (a) Show (algebraically or graphically) that there are two or more solutions in real numbers $x$ and $y$. (b) The graphs of the two given equations intersect in exactly two points. Find the equation of the straight line passing through these two points of intersection. [b]p5.[/b] Let $n$ and $m$ be positive integers. An $n \times m $ rectangle is tiled with unit squares. Let $r(n, m)$ denote the number of rectangles formed by the edges of these unit squares. Thus, for example, $r(2, 1) = 3$. (a) Find $r(2, 3)$. (b) Find $r(n, 1)$. (c) Find, with justification, a formula for $r(n, m)$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

2019 Azerbaijan BMO TST, 4

Let $N$ be an odd number, $N\geq 3$. $N$ tennis players take part in a championship. Before starting the championship, a commission puts the players in a row depending on how good they think the players are. During the championship, every player plays with every other player exactly once, and each match has a winner. A match is called [i]suprising[/i] if the winner was rated lower by the commission. At the end of the tournament, players are arranged in a line based on the number of victories they have achieved. In the event of a tie, the commission's initial order is used to decide which player will be higher. It turns out that the final order is exactly the same as the commission's initial order. What is the maximal number of suprising matches that could have happened.

2017 ASDAN Math Tournament, 7

Tags:
Compute $$\lim_{t\rightarrow0}\int_0^t\frac{x^2+4x+4}{\sqrt{t^2-x^2}}dx.$$

1978 Bulgaria National Olympiad, Problem 1

We are given the sequence $a_1,a_2,a_3,\ldots$, for which: $$a_n=\frac{a^2_{n-1}+c}{a_{n-2}}\enspace\text{for all }n>2.$$ Prove that the numbers $a_1$, $a_2$ and $\frac{a_1^2+a_2^2+c}{a_1a_2}$ are whole numbers.

2001 Tournament Of Towns, 3

Tags: algebra
An $8\times8$ array consists of the numbers $1,2,...,64$. Consecutive numbers are adjacent along a row or a column. What is the minimum value of the sum of the numbers along the diagonal?

1999 Baltic Way, 5

The point $(a,b)$ lies on the circle $x^2+y^2=1$. The tangent to the circle at this point meets the parabola $y=x^2+1$ at exactly one point. Find all such points $(a,b)$.

2023 Mongolian Mathematical Olympiad, 3

Five girls and five boys took part in a competition. Suppose that we can number the boys and girls $1, 2, 3, 4, 5$ such that for each $1 \leq i,j \leq 5$, there are exactly $|i-j|$ contestants that the girl numbered $i$ and the boy numbered $j$ both know. Let $a_i$ and $b_i$ be the number of contestants that the girl numbered $i$ knows and the number of contestants that the boy numbered $i$ knows respectively. Find the minimum value of $\max(\sum\limits_{i=1}^5a_i, \sum\limits_{i=1}^5b_i)$. (Note that for a pair of contestants $A$ and $B$, $A$ knowing $B$ doesn't mean that $B$ knows $A$ and a contestant cannot know themself.)

1998 Poland - First Round, 1

Tags:
Prove that among the numbers of the form $ 50^n \plus{} (50n\plus{}1)^{50}$, where $ n$ is a natural number, there exist infinitely many composite numbers.

1998 Czech and Slovak Match, 1

Let $P$ be an interior point of the parallelogram $ABCD$. Prove that $\angle APB+ \angle CPD = 180^\circ$ if and only if $\angle PDC = \angle PBC$.

2025 239 Open Mathematical Olympiad, 6

Tags: algebra
The real number $a>1$ is given. Suppose that $r$, $s$ and $t$ are different positive integer numbers such that $\{a^r\}=\{a^s\}=\{a^t\}$. Prove that $\{a^r\}=\{a^s\}=\{a^t\}=0$.

Croatia MO (HMO) - geometry, 2015.7

In an acute-angled triangle $ABC$ is $AB > BC$ , and the points $A_1$ and $C_1$ are the feet of the altitudes of from the vertices $A$ and $C$. Let $D$ be the second intersection of the circumcircles of triangles $ABC$ and $A_1BC_1$ (different of $B$). Let $Z$ be the intersection of the tangents to the circumcircle of the triangle ABC at the points $A$ and $C$ , and let the lines $ZA$ and $A_1C_1$ intersect at the point $X$, and the lines $ZC$ and $A_1C_1$ intersect at the point $Y$. Prove that the point $D$ lies on the circumcircle of the triangle $XYZ$.

2006 AMC 10, 24

Circles with centers $ O$ and $ P$ have radii 2 and 4, respectively, and are externally tangent. Points $ A$ and $ B$ are on the circle centered at $ O$, and points $ C$ and $ D$ are on the circle centered at $ P$, such that $ \overline{AD}$ and $ \overline{BC}$ are common external tangents to the circles. What is the area of hexagon $ AOBCPD$? [asy] size(250);defaultpen(linewidth(0.8)); pair X=(-6,0), O=origin, P=(6,0), B=tangent(X, O, 2, 1), A=tangent(X, O, 2, 2), C=tangent(X, P, 4, 1), D=tangent(X, P, 4, 2); pair top=X+15*dir(X--A), bottom=X+15*dir(X--B); draw(Circle(O, 2)^^Circle(P, 4)); draw(bottom--X--top); draw(A--O--B^^O--P^^D--P--C); pair point=X; label("$2$", midpoint(O--A), dir(point--midpoint(O--A))); label("$4$", midpoint(P--D), dir(point--midpoint(P--D))); label("$O$", O, SE); label("$P$", P, dir(point--P)); pair point=O; label("$A$", A, dir(point--A)); label("$B$", B, dir(point--B)); pair point=P; label("$C$", C, dir(point--C)); label("$D$", D, dir(point--D)); fill((-3,7)--(-3,-7)--(-7,-7)--(-7,7)--cycle, white);[/asy] $ \textbf{(A) } 18\sqrt {3} \qquad \textbf{(B) } 24\sqrt {2} \qquad \textbf{(C) } 36 \qquad \textbf{(D) } 24\sqrt {3} \qquad \textbf{(E) } 32\sqrt {2}$

2023 Hong Kong Team Selection Test, Problem 1

Given a $24 \times 24$ square grid, initially all its unit squares are coloured white. A move consists of choosing a row, or a column, and changing the colours of all its unit squares, from white to black, and from black to white. Is it possible that after finitely many moves, the square grid contains exactly $574$ black unit squares?

2021 Harvard-MIT Mathematics Tournament., 9

Tags: combi
An up-right path between two lattice points $P$ and $Q$ is a path from $P$ to $Q$ that takes steps of length $1$ unit either up or to the right. How many up-right paths from $(0, 0)$ to $(7, 7),$ when drawn in the plane with the line $y = x - 2.021$, enclose exactly one bounded region below that line?

1983 IMO Shortlist, 15

Decide whether there exists a set $M$ of positive integers satisfying the following conditions: (i) For any natural number $m>1$ there exist $a, b \in M$ such that $a+b = m.$ (ii) If $a, b, c, d \in M$, $a, b, c, d > 10$ and $a + b = c + d$, then $a = c$ or $a = d.$

2012 IFYM, Sozopol, 5

Let $p$ be some odd prime number and let $k=\frac{p+1}{2}$. The natural numbers $a_1,a_2…a_k$ are such that $a_i\neq a_j$ and $a_i<p$ for $\forall i,j=1,2…k$. Prove that for each natural number $r<p$ there exist not necessarily different $a_i$ and $a_j$, for which $a_i a_j\equiv r\, (mod\, p)$.

I Soros Olympiad 1994-95 (Rus + Ukr), 11.5

Prove that for any natural $n>1$ there are infinitely many natural numbers $m$ such that for any nonnegative integers $k_1$,$k_2$, $...$,$k_m$, $$m \ne k_1^n+ k_2^n+... k_n^n,$$

1992 Miklós Schweitzer, 8

Let $F$ be a set of filters on X so that if $ \sigma, \tau \in F$ , $\forall S \in\sigma$ , $\forall T\in\tau$ , we have $S \cap T\neq\emptyset$ , then $\sigma \cap \tau \in F$. We say that $F$ is compatible with a topology on X when $x \in X$ is a contact point of $A\subset X$ , if and only if , there is $\sigma \in F$ such that $x \in S$ and $S \cap A \neq\emptyset$ for all $S \in\sigma$ . When is there an $F$ compatible with the topology on X in which finite subsets of X and X are closed ? contact point is also known as adherent point.

Kyiv City MO Seniors 2003+ geometry, 2011.10.3

A trapezoid $ABCD$ with bases $BC = a$ and $AD = 2a$ is drawn on the plane. Using only with a ruler, construct a triangle whose area is equal to the area of the trapezoid. With the help of a ruler you can draw straight lines through two known points. (Rozhkova Maria)

2023 Belarusian National Olympiad, 9.1

Tags: algebra
Real numbers $a,b,c,d$ satisfy the equality $$\frac{1-ab}{a+b}=\frac{bc-1}{b+c}=\frac{1-cd}{c+d}=\sqrt{3}$$ Find all possible values of $ad$.

2008 Moldova National Olympiad, 9.2

Tags: algebra
Find $ f(x): (0,\plus{}\infty) \to \mathbb R$ such that \[ f(x)\cdot f(y) \plus{} f(\frac{2008}{x})\cdot f(\frac{2008}{y})\equal{}2f(x\cdot y)\] and $ f(2008)\equal{}1$ for $ \forall x \in (0,\plus{}\infty)$.

2021 AMC 10 Spring, 23

Tags: prob
Frieda the frog begins a sequence of hops on a $3 \times 3$ grid of squares, moving one square on each hop and choosing at random the direction of each hop up, down, left, or right. She does not hop diagonally. When the direction of a hop would take Frieda off the grid, she "wraps around'' and jumps to the opposite edge. For example if Frieda begins in the center square and makes two hops "up'', the first hop would place her in the top row middle square, and the second hop would cause Frieda to jump to the opposite edge, landing in the bottom row middle square. Suppose Frieda starts from the center square, makes at most four hops at random, and stops hopping if she lands on a corner square. What is the probability that she reaches a corner square on one of the four hops? $\textbf{(A) }\frac{9}{16}\qquad\textbf{(B) }\frac{5}{8}\qquad\textbf{(C) }\frac{3}{4}\qquad\textbf{(D) }\frac{25}{32}\qquad\textbf{(E) }\frac{13}{16}$

2019 BMT Spring, 19

Tags: algebra
Let $a$ and $b$ be real numbers such that $\max_{0\le x\le 1} |x^3 - ax - b|$ is as small as possible. Find $a + b$ in simplest radical form. (Hint: If $f(x) = x^3 - cx - d$, then the maximum (or minimum) of $f(x)$ either occurs when $x = 0$ and/or $x = 1$ and/or when x satisfies $3x^2 - c = 0$).

1967 IMO Longlists, 20

In the space $n \geq 3$ points are given. Every pair of points determines some distance. Suppose all distances are different. Connect every point with the nearest point. Prove that it is impossible to obtain (closed) polygonal line in such a way.