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

1998 Belarus Team Selection Test, 2

a) Given that integers $a$ and $b$ satisfy the equality $$a^2 - (b^2 - 4b + 1) a - (b^4 - 2b^3) = 0 \,\,\, (*)$$, prove that $b^2 + a$ is a square of an integer. b) Do there exist an infinitely many of pairs $(a,b)$ satisfying (*)?

2013 AMC 10, 15

Tags: geometry , AMC , AMC 10
Two sides of a triangle have lengths $10$ and $15$. The length of the altitude to the third side is the average of the lengths of the altitudes to the two given sides. How long is the third side? $\textbf{(A) }6\qquad \textbf{(B) }8\qquad \textbf{(C) }9\qquad \textbf{(D) }12\qquad \textbf{(E) }18\qquad$

2014 Cezar Ivănescu, 3

Let $f, g:\mathbb{N}\to\mathbb{N}$ be functions that satisfy the following equation: \[f(f(n))+g(f(n)) = n,\ \forall\ n\in\mathbb{N}\ .\] Prove that $g$ is the zero function on $\mathbb{N}$.

2013 USA Team Selection Test, 4

Let $f: \mathbb{N} \rightarrow \mathbb{N}$ be a function, and let $f^m$ be $f$ applied $m$ times. Suppose that for every $n \in \mathbb{N}$ there exists a $k \in \mathbb{N}$ such that $f^{2k}(n)=n+k$, and let $k_n$ be the smallest such $k$. Prove that the sequence $k_1,k_2,\ldots $ is unbounded. [i]Proposed by Palmer Mebane, United States[/i]

1988 Dutch Mathematical Olympiad, 3

Tags: algebra , Sum
For certain $a,b,c$ holds: $\frac{1}{a}+\frac{1}{b}+\frac{1}{c}=\frac{1}{a+b+c}$ Prove that for all odd $n$ holds, $$\frac{1}{a^n}+\frac{1}{b^n}+\frac{1}{c^n}=\frac{1}{a^n+b^n+c^n}.$$

2018 PUMaC Team Round, 6

Tags: PuMAC , Team Round
Let $\tau(n)$ be the number of distinct positive divisors of $n$ (including $1$ and itself). Find the sum of all positive integers $n$ satisfying $n=\tau(n)^3.$

2011 IMO Shortlist, 5

Let $f$ be a function from the set of integers to the set of positive integers. Suppose that, for any two integers $m$ and $n$, the difference $f(m) - f(n)$ is divisible by $f(m- n)$. Prove that, for all integers $m$ and $n$ with $f(m) \leq f(n)$, the number $f(n)$ is divisible by $f(m)$. [i]Proposed by Mahyar Sefidgaran, Iran[/i]

2016 Harvard-MIT Mathematics Tournament, 6

Tags:
Let $ABC$ be a triangle with incenter $I$, incircle $\gamma$ and circumcircle $\Gamma$. Let $M$, $N$, $P$ be the midpoints of sides $\overline{BC}$, $\overline{CA}$, $\overline{AB}$ and let $E$, $F$ be the tangency points of $\gamma$ with $\overline{CA}$ and $\overline{AB}$, respectively. Let $U$, $V$ be the intersections of line $EF$ with line $MN$ and line $MP$, respectively, and let $X$ be the midpoint of arc $\widehat{BAC}$ of $\Gamma$. Given that $AB = 5$, $AC = 8$, and $\angle A = 60^{\circ}$, compute the area of triangle $XUV$.

2021 CMIMC, 14

Let $S$ be the set of lattice points $(x,y) \in \mathbb{Z}^2$ such that $-10\leq x,y \leq 10$. Let the point $(0,0)$ be $O$. Let Scotty the Dog's position be point $P$, where initially $P=(0,1)$. At every second, consider all pairs of points $C,D \in S$ such that neither $C$ nor $D$ lies on line $OP$, and the area of quadrilateral $OCPD$ (with the points going clockwise in that order) is $1$. Scotty finds the pair $C,D$ maximizing the sum of the $y$ coordinates of $C$ and $D$, and randomly jumps to one of them, setting that as the new point $P$. After $50$ such moves, Scotty ends up at point $(1, 1)$. Find the probability that he never returned to the point $(0,1)$ during these $50$ moves. [i]Proposed by David Tang[/i]

2017 F = ma, 20

Tags: momentum
20) A particle of mass m moving at speed $v_0$ collides with a particle of mass $M$ which is originally at rest. The fractional momentum transfer $f$ is the absolute value of the final momentum of $M$ divided by the initial momentum of $m$. If the collision is completely $inelastic$ under what condition will the fractional momentum transfer between the two objects be a maximum? A) $\frac{m}{M} \ll 1$ B) $0.5 < \frac{m}{M} < 1$ C) $m = M$ D) $1 < \frac{m}{M} < 2$ E) $\frac{m}{M} \gg 1$

2004 Switzerland - Final Round, 3

Let $p$ be an odd prime number. Find all natural numbers $k$ such that $$\sqrt{k^2 - pk}$$ is a positive integer.

2022 Taiwan TST Round 3, 4

Let $\mathcal{X}$ be the collection of all non-empty subsets (not necessarily finite) of the positive integer set $\mathbb{N}$. Determine all functions $f: \mathcal{X} \to \mathbb{R}^+$ satisfying the following properties: (i) For all $S$, $T \in \mathcal{X}$ with $S\subseteq T$, there holds $f(T) \le f(S)$. (ii) For all $S$, $T \in \mathcal{X}$, there hold \[f(S) + f(T) \le f(S + T),\quad f(S)f(T) = f(S\cdot T), \] where $S + T = \{s + t\mid s\in S, t\in T\}$ and $S \cdot T = \{s\cdot t\mid s\in S, t\in T\}$. [i]Proposed by Li4, Untro368, and Ming Hsiao.[/i]

2017 Princeton University Math Competition, A4/B6

Tags:
Let the sequence $a_{1}, a_{2}, \cdots$ be defined recursively as follows: $a_{n}=11a_{n-1}-n$. If all terms of the sequence are positive, the smallest possible value of $a_{1}$ can be written as $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. What is $m+n$?

2013 Romania National Olympiad, 2

A rook starts moving on an infinite chessboard, alternating horizontal and vertical moves. The length of the first move is one square, of the second – two squares, of the third – three squares and so on. a) Is it possible for the rook to arrive at its starting point after exactly $2013$ moves? b) Find all $n$ for which it possible for the rook to come back to its starting point after exactly $n$ moves.

Novosibirsk Oral Geo Oly VII, 2022.7

Vera has several identical matches, from which she makes a triangle. Vera wants any two sides of this triangle to differ in length by at least $10$ matches, but it turned out that it is impossible to add such a triangle from the available matches (it is impossible to leave extra matches). What is the maximum number of matches Vera can have?

2012 Hanoi Open Mathematics Competitions, 4

[b]Q4.[/b] A man travels from town $A$ to town $E$ through $B,C$ and $D$ with uniform speeds 3km/h, 2km/h, 6km/h and 3km/h on the horizontal, up slope, down slope and horizontal road, respectively. If the road between town $A$ and town $E$ can be classified as horizontal, up slope, down slope and horizontal and total length of each typr of road is the same, what is the average speed of his journey? \[(A) \; 2 \text{km/h} \qquad (B) \; 2,5 \text{km/h} ; \qquad (C ) \; 3 \text{km/h} ; \qquad (D) \; 3,5 \text{km/h} ; \qquad (E) \; 4 \text{km/h}.\]

2023 South East Mathematical Olympiad, 5

As shown in the figure, in $\vartriangle ABC$, $AB>AC$, the inscribed circle $I$ is tangent to the sides $BC$, $CA$, $AB$ at points $D$, $E$, $F$ respectively, and the straight lines $BC$ and $EF$ intersect at point $K$, $DG \perp EF$ at point $G$, ray $IG$ intersects the circumscribed circle of $\vartriangle ABC$ at point $H$. Prove that points $H$, $G$, $D$, $K$ lie on a circle. [img]https://cdn.artofproblemsolving.com/attachments/5/e/804fb919e9c2f9cf612099e44bad9c75699b2e.png[/img]

2006 Hong Kong TST., 1

Find the integral solutions of the equation $7(x+y)=3(x^2-xy+y^2)$

2014 NIMO Summer Contest, 10

Among $100$ points in the plane, no three collinear, exactly $4026$ pairs are connected by line segments. Each point is then randomly assigned an integer from $1$ to $100$ inclusive, each equally likely, such that no integer appears more than once. Find the expected value of the number of segments which join two points whose labels differ by at least $50$. [i]Proposed by Evan Chen[/i]

2011 Poland - Second Round, 2

$\forall n\in \mathbb{Z_{+}}-\{1,2\}$ find the maximal length of a sequence with elements from a set $\{1,2,\ldots,n\}$, such that any two consecutive elements of this sequence are different and after removing all elements except for the four we do not receive a sequence in form $x,y,x,y$ ($x\neq y$).

2004 Pre-Preparation Course Examination, 5

Let $ A\equal{}\{A_1,\dots,A_m\}$ be a family distinct subsets of $ \{1,2,\dots,n\}$ with at most $ \frac n2$ elements. Assume that $ A_i\not\subset A_j$ and $ A_i\cap A_j\neq\emptyset$ for each $ i,j$. Prove that: \[ \sum_{i\equal{}1}^m\frac1{\binom{n\minus{}1}{|A_i|\minus{}1}}\leq1\]

1977 All Soviet Union Mathematical Olympiad, 237

a) Given a circle with two inscribed triangles $T_1$ and $T_2$. The vertices of $T_1$ are the midpoints of the arcs with the ends in the vertices of $T_2$. Consider a hexagon -- the intersection of $T_1$ and $T_2$. Prove that its main diagonals are parallel to $T_1$ sides and are intersecting in one point. b) The segment, that connects the midpoints of the arcs $AB$ and $AC$ of the circle circumscribed around the $ABC$ triangle, intersects $[AB]$ and $[AC]$ sides in $D$ and $K$ points. Prove that the points $A,D,K$ and $O$ -- the centre of the circle -- are the vertices of a diamond.

2023 Centroamerican and Caribbean Math Olympiad, 3

Tags: inequalities
Let $a,\ b$ and $c$ be positive real numbers such that $a b+b c+c a=1$. Show that $$ \frac{a^3}{a^2+3 b^2+3 a b+2 b c}+\frac{b^3}{b^2+3 c^2+3 b c+2 c a}+\frac{c^3}{c^2+3 a^2+3 c a+2 a b}>\frac{1}{6\left(a^2+b^2+c^2\right)^2} . $$

2003 India IMO Training Camp, 5

On the real number line, paint red all points that correspond to integers of the form $81x+100y$, where $x$ and $y$ are positive integers. Paint the remaining integer point blue. Find a point $P$ on the line such that, for every integer point $T$, the reflection of $T$ with respect to $P$ is an integer point of a different colour than $T$.

Kyiv City MO Juniors Round2 2010+ geometry, 2022.8.4

Tags: geometry
Points $D, E, F$ are selected on sides $BC, CA, AB$ correspondingly of triangle $ABC$ with $\angle C = 90^\circ$ such that $\angle DAB = \angle CBE$ and $\angle BEC = \angle AEF$. Show that $DB = DF$. [i](Proposed by Mykhailo Shtandenko)[/i]