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

May Olympiad L2 - geometry, 1995.4

Consider a pyramid whose base is an equilateral triangle $BCD$ and whose other faces are triangles isosceles, right at the common vertex $A$. An ant leaves the vertex $B$ arrives at a point $P$ of the $CD$ edge, from there goes to a point $Q$ of the edge $AC$ and returns to point $B$. If the path you made is minimal, how much is the angle $PQA$ ?

2008 iTest Tournament of Champions, 1

Tags:
Find the smallest positive integer $n$ such that there are at least three distinct ordered pairs $(x,y)$ of positive integers such that \[x^2-y^2=n.\]

2020 Regional Olympiad of Mexico Southeast, 5

Let $ABC$ an acute triangle with $\angle BAC\geq 60^\circ$ and $\Gamma$ it´s circumcircule. Let $P$ the intersection of the tangents to $\Gamma$ from $B$ and $C$. Let $\Omega$ the circumcircle of the triangle $BPC$. The bisector of $\angle BAC$ intersect $\Gamma$ again in $E$ and $\Omega$ in $D$, in the way that $E$ is between $A$ and $D$. Prove that $\frac{AE}{ED}\leq 2$ and determine when equality holds.

2017 ASDAN Math Tournament, 8

Tags:
Let $S=\{1,2,3,4,5,6\}$. Compute the number of functions $f:S\rightarrow S$ such that $f(f(f(s)))=2$ if $s$ is odd and $f(f(f(s)))=1$ if $s$ is even.

1994 AMC 12/AHSME, 10

Tags:
For distinct real numbers $x$ and $y$, let $M(x,y)$ be the larger of $x$ and $y$ and let $m(x,y)$ be the smaller of $x$ and $y$. If $a<b<c<d<e$, then \[ M(M(a,m(b,c)),m(d,m(a,e)))= \] $ \textbf{(A)}\ a \qquad\textbf{(B)}\ b \qquad\textbf{(C)}\ c \qquad\textbf{(D)}\ d \qquad\textbf{(E)}\ e $

2023 Macedonian Mathematical Olympiad, Problem 4

Tags: geometry
Let $ABC$ be a scalene acute triangle with orthocenter $H$. The circle with center $A$ and radius $AH$ meets the circumcircle of $BHC$ at $T_{a} \neq H$. Define $T_{b}$ and $T_{c}$ similarly. Show that $H$ lies on the circumcircle of $T_{a}T_{b}T_{c}$. [i]Authored by Nikola Velov[/i]

1988 IMO Longlists, 3

Let $ n$ be a positive integer. Find the number of odd coefficients of the polynomial \[ u_n(x) \equal{} (x^2 \plus{} x \plus{} 1)^n. \]

2015 Belarus Team Selection Test, 3

Determine all functions $f: \mathbb{Z}\to\mathbb{Z}$ satisfying \[f\big(f(m)+n\big)+f(m)=f(n)+f(3m)+2014\] for all integers $m$ and $n$. [i]Proposed by Netherlands[/i]

2019 China Team Selection Test, 2

A graph $G(V,E)$ is triangle-free, but adding any edges to the graph will form a triangle. It's given that $|V|=2019$, $|E|>2018$, find the minimum of $|E|$ .

2018 ELMO Shortlist, 4

Tags: geometry
Let $ABCDEF$ be a hexagon inscribed in a circle $\Omega$ such that triangles $ACE$ and $BDF$ have the same orthocenter. Suppose that segments $BD$ and $DF$ intersect $CE$ at $X$ and $Y$, respectively. Show that there is a point common to $\Omega$, the circumcircle of $DXY$, and the line through $A$ perpendicular to $CE$. [i]Proposed by Michael Ren and Vincent Huang[/i]

KoMaL A Problems 2023/2024, A. 870

We label every edge of a simple graph with the difference of the degrees of its endpoints. If the number of vertices is $N$, what can be the largest value of the sum of the labels on the edges? [i]Proposed by Dániel Lenger and Gábor Szűcs, Budapest[/i]

2022 Germany Team Selection Test, 3

Find all positive integers $n$ with the following property: the $k$ positive divisors of $n$ have a permutation $(d_1,d_2,\ldots,d_k)$ such that for $i=1,2,\ldots,k$, the number $d_1+d_2+\cdots+d_i$ is a perfect square.

1941 Moscow Mathematical Olympiad, 088

Solve in integers the equation $x + y = x^2 - xy + y^2$.

2001 Belarusian National Olympiad, 3

Tags: geometry
Three distinct points $A$, $B$, and $N$ are marked on the line $l$, with $B$ lying between $A$ and $N$. For an arbitrary angle $\alpha \in (0,\frac{\pi}{2})$, points $C$ and $D$ are marked in the plane on the same side of $l$ such that $N$, $C$, and $D$ are collinear; $\angle NAD = \angle NBC = \alpha$; and $A$, $B$, $C$, and $D$ are concyclic. Find the locus of the intersection points of the diagonals of $ABCD$ as $\alpha$ varies between $0$ and $\frac{\pi}{2}$.

1951 Moscow Mathematical Olympiad, 191

Given an isosceles trapezoid $ABCD$ and a point $P$. Prove that a quadrilateral can be constructed from segments $PA, PB, PC, PD$. Note: It is allowed that the vertices of a quadrilateral lie not only not only on the sides of the trapezoid, but also on their extensions.

1974 Poland - Second Round, 5

Tags: limit , algebra , sequence
The given numbers are real numbers $ q,t \in \langle \frac{1}{2}; 1) $, $ t \in (0; 1 \rangle $. Prove that there is an increasing sequence of natural numbers $ {n_k} $ ($ k = 1,2, \ldots $) such that $$ t = \lim_{N\to \infty} \sum_{j=1}^N q^{n_j}.$$

2005 India IMO Training Camp, 1

Let $0 <a <b$ be two rational numbers. Let $M$ be a set of positive real numbers with the properties: (i) $a \in M$ and $b \in M$; (ii) if $x$ $\in M$ and $y \in M$, then $\sqrt{xy} \in M$. Let $M^*$denote the set of all irrational numbers in $M$. prove that every $c,d$ such that $a <c <d<b$, $M^*$ contains an element $m$ with property $c<m<d$

2016 AMC 12/AHSME, 25

Tags:
Let $k$ be a positive integer. Bernardo and Silvia take turns writing and erasing numbers on a blackboard as follows. Bernardo starts by writing the smallest perfect square with $k+1$ digits. Every time Bernardo writes a number, Silvia erases the last $k$ digits of it. Bernardo then writes the next perfect square, Silvia erases the last $k$ digits of it, and this process continues until the last two numbers that remain on the board differ by at least $2$. Let $f(k)$ be the smallest positive integer not written on the board. For example, if $k = 1$, then the numbers that Bernardo writes are $16$, $25$, $36$, $49$, and $64$, and the numbers showing on the board after Silvia erases are $1$, $2$, $3$, $4$, and $6$, and thus $f(1) = 5$. What is the sum of the digits of $f(2) + f(4) + f(6) + \cdots + f(2016)$? $\textbf{(A) } 7986 \qquad\textbf{(B) } 8002 \qquad\textbf{(C) } 8030 \qquad\textbf{(D) } 8048 \qquad\textbf{(E) } 8064$

2022 China Team Selection Test, 5

Given a positive integer $n$, let $D$ is the set of positive divisors of $n$, and let $f: D \to \mathbb{Z}$ be a function. Prove that the following are equivalent: (a) For any positive divisor $m$ of $n$, \[ n ~\Big|~ \sum_{d|m} f(d) \binom{n/d}{m/d}. \] (b) For any positive divisor $k$ of $n$, \[ k ~\Big|~ \sum_{d|k} f(d). \]

1990 Putnam, B3

Let $S$ be a set of $ 2 \times 2 $ integer matrices whose entries $a_{ij}(1)$ are all squares of integers and, $(2)$ satisfy $a_{ij} \le 200$. Show that $S$ has more than $ 50387 (=15^4-15^2-15+2) $ elements, then it has two elements that commute.

2013 BMT Spring, 8

Tags: geometry
$ABC$ is an isosceles right triangle with right angle $B$ and $AB = 1$. $ABC$ has an incenter at $E$. The excircle to $ABC$ at side $AC$ is drawn and has center $P$. Let this excircle be tangent to $AB$ at $R$. Draw $T$ on the excircle so that $RT$ is the diameter. Extend line $BC$ and draw point $D$ on $BC$ so that $DT$ is perpendicular to $RT$. Extend $AC$ and let it intersect with $DT$ at $G$. Let $F$ be the incenter of $CDG$. Find the area of $\vartriangle EFP$.

2015 Caucasus Mathematical Olympiad, 5

What is the smallest number of $3$-cell corners needed to be painted in a $6\times 6$ square so that it was impossible to paint more than one corner of it? (The painted corners should not overlap.)

2019 Saudi Arabia JBMO TST, 1

We have 11 boxes. On a move, we can choose 10 of them and put one ball in each of the boxes chosen. Two players move alternately. The one who gets a box of 21 balls wins. Which of the two players has winning strategy?

2005 Irish Math Olympiad, 1

Show that $ 2005^{2005}$ is a sum of two perfect squares, but not a sum of two perfect cubes.

2018 Costa Rica - Final Round, LRP5

The Matini company released a special album with the flags of the $ 12$ countries that compete in the CONCACAM Mathematics Cup. Each postcard envelope has two flags chosen randomly. Determine the minimum number of envelopes that need to be opened to that the probability of having a repeated flag is $50\%$.