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

2006 MOP Homework, 5

Let $\{a_n\}^{\inf}_{n=1}$ and $\{b_n\}^{\inf}_{n=1}$ be two sequences of real numbers such that $a_{n+1}=2b_n-a_n$ and $b_{n+1}=2a_n-b_n$ for every positive integer $n$. Prove that $a_n>0$ for all $n$, then $a_1=b_1$.

Kvant 2022, M2703

Given an infinite sequence of numbers $a_1, a_2,...$, in which there are no two equal members. Segment $a_i, a_{i+1}, ..., a_{i+m-1}$ of this sequence is called a monotone segment of length $m$, if $a_i < a_{i+1} <...<a_{i+m-1}$ or $a_i > a_{i+1} >... > a_{i+m-1}$. It turned out that for each natural $k$ the term $a_k$ is contained in some monotonic segment of length $k + 1$. Prove that there exists a natural $N$ such that the sequence $a_N , a_{N+1} ,...$ monotonic.

1960 AMC 12/AHSME, 3

Tags: AMC
Applied to a bill for $\$10,000$ the difference between a discount of $40\%$ and two successive discounts of $36\%$ and $4\%$, expressed in dollars, is: $ \textbf{(A) }0\qquad\textbf{(B) }144\qquad\textbf{(C) }256\qquad\textbf{(D) }400\qquad\textbf{(E) }416 $

2015 Benelux, 4

Let $n$ be a positive integer. For each partition of the set $\{1,2,\dots,3n\}$ into arithmetic progressions, we consider the sum $S$ of the respective common differences of these arithmetic progressions. What is the maximal value that $S$ can attain? (An [i]arithmetic progression[/i] is a set of the form $\{a,a+d,\dots,a+kd\}$, where $a,d,k$ are positive integers, and $k\geqslant 2$; thus an arithmetic progression has at least three elements, and successive elements have difference $d$, called the [i]common difference[/i] of the arithmetic progression.)

2003 Alexandru Myller, 3

Let $ S $ be the first quadrant and $ T:S\longrightarrow S $ be a transformation that takes the reciprocal of the coordinates of the points that belong to its domain. Define an [i]S-line[/i] to be the intersection of a line with $ S. $ [b]a)[/b] Show that the fixed points of $ T $ lie on any fixed S-line of $ T. $ [b]b)[/b] Find all fixed S-lines of $ T. $ [i]Gabriel Popa[/i]

2012 NIMO Summer Contest, 4

The degree measures of the angles of nondegenerate hexagon $ABCDEF$ are integers that form a non-constant arithmetic sequence in some order, and $\angle A$ is the smallest angle of the (not necessarily convex) hexagon. Compute the sum of all possible degree measures of $\angle A$. [i]Proposed by Lewis Chen[/i]

2024 Al-Khwarizmi IJMO, 4

We call a permutation of the set of real numbers $\{a_1,\cdots,a_n\}$, $n\in\mathbb{N}$ [i]average increasing[/i] if the arithmetic mean of its first $k$ elements for $k=1,\cdots ,n$ form a strictly increasing sequence. 1) Depending on $n$, determine the smallest number that can be the last term of some average increasing permutation of the numbers $\{1,\cdots,n\}$; 2) Depending on $n$, determine the lowest position (in some general order) that the number $n$ can be achieved in some average increasing permutation of the numbers $\{1,\cdots,n\}.$ [i] Proposed by David Hruska, Czech Republic[/i]

2015 British Mathematical Olympiad Round 1, 6

A positive integer is called [i]charming[/i] if it is equal to $2$ or is of the form $3^{i}5^{j}$ where $i$ and $j$ are non-negative integers. Prove that every positive integer can be written as a sum of different charming numbers.

2021 Latvia TST, 1.4

Initially, on the board, all integers from $1$ to $400$ are written. Two players play a game alternating their moves. In one move it is allowed to erase from the board any 3 integers, which form a triangle. The player, who can not perform a move loses. Who has a winning strategy?

2020 Moldova EGMO TST, 1

Let[i] $a,b,c$[/i] be positive integers , such that $A=\frac{a^2+1}{bc}+\frac{b^2+1}{ca}+\frac{c^2+1}{ab}$ is, also, an integer. Proof that $\gcd( a, b, c)\leq\lfloor\sqrt[3]{a+ b+ c}\rfloor$.

1996 All-Russian Olympiad Regional Round, 11.2

Let us call the [i]median [/i] of a system of $2n$ points of a plane a straight line passing through exactly two of them, on both sides of which there are points of this system equally. What is the smallest number of [i]medians [/i] that a system of $2n$ points, no three of which lie on the same line?

2023 ISL, G2

Tags: geometry
Let $ABC$ be a triangle with $AC > BC,$ let $\omega$ be the circumcircle of $\triangle ABC,$ and let $r$ be its radius. Point $P$ is chosen on $\overline{AC}$ such taht $BC=CP,$ and point $S$ is the foot of the perpendicular from $P$ to $\overline{AB}$. Ray $BP$ mets $\omega$ again at $D$. Point $Q$ is chosen on line $SP$ such that $PQ = r$ and $S,P,Q$ lie on a line in that order. Finally, let $E$ be a point satisfying $\overline{AE} \perp \overline{CQ}$ and $\overline{BE} \perp \overline{DQ}$. Prove that $E$ lies on $\omega$.

2023 USA IMOTST, 3

Let $\mathbb{N}$ denote the set of positive integers. Fix a function $f: \mathbb{N} \rightarrow \mathbb{N}$ and for any $m,n \in \mathbb{N}$ define $$\Delta(m,n)=\underbrace{f(f(\ldots f}_{f(n)\text{ times}}(m)\ldots))-\underbrace{f(f(\ldots f}_{f(m)\text{ times}}(n)\ldots)).$$ Suppose $\Delta(m,n) \neq 0$ for any distinct $m,n \in \mathbb{N}$. Show that $\Delta$ is unbounded, meaning that for any constant $C$ there exists $m,n \in \mathbb{N}$ with $\left|\Delta(m,n)\right| > C$.

2002 May Olympiad, 4

The vertices of a regular $2002$-sided polygon are numbered $1$ through $2002$, clockwise. Given an integer $ n$, $1 \le n \le 2002$, color vertex $n$ blue, then, going clockwise, count$ n$ vertices starting at the next of $n$, and color $n$ blue. And so on, starting from the vertex that follows the last vertex that was colored, n vertices are counted, colored or uncolored, and the number $n$ is colored blue. When the vertex to be colored is already blue, the process stops. We denote $P(n)$ to the set of blue vertices obtained with this procedure when starting with vertex $n$. For example, $P(364)$ is made up of vertices $364$, $728$, $1092$, $1456$, $1820$, $182$, $546$, $910$, $1274$, $1638$, and $2002$. Determine all integers $n$, $1 \le n \le 2002$, such that $P(n)$ has exactly $14 $ vertices,

2021 Azerbaijan Junior NMO, 5

In $\triangle ABC\ T$ is a point lies on the internal angle bisector of $B$. Let $\omega$ be circle with diameter $BT$. $\omega$ intersects with $BA$ and $BC$ at $P$ and $Q$,respectively. A circle passes through $A$ and tangent to $\omega$ at $P$ intersects with $AC$ again at $X$ . A circle passes through $B$ and tangent to $\omega$ at $Q$ intersects with $AC$ again at $Y$ . Prove that $TX=TY$

2013 Tournament of Towns, 6

Tags: algebra , Product , Sum
There are fi ve distinct real positive numbers. It is known that the total sum of their squares and the total sum of their pairwise products are equal. (a) Prove that we can choose three numbers such that it would not be possible to make a triangle with sides' lengths equal to these numbers. (b) Prove that the number of such triples is at least six (triples which consist of the same numbers in different order are considered the same).

2017 CCA Math Bonanza, T5

Tags:
Twelve people go to a party. First, everybody with no friends at the party leave. Then, at the $i$-th hour, everybody with exactly $i$ friends left at the party leave. After the eleventh hour, what is the maximum number of people left? Note that friendship is mutual. [i]2017 CCA Math Bonanza Team Round #5[/i]

2010 Today's Calculation Of Integral, 649

Let $f_n(x,\ y)=\frac{n}{r\cos \pi r+n^2r^3}\ (r=\sqrt{x^2+y^2})$, $I_n=\int\int_{r\leq 1} f_n(x,\ y)\ dxdy\ (n\geq 2).$ Find $\lim_{n\to\infty} I_n.$ [i]2009 Tokyo Institute of Technology, Master Course in Mathematics[/i]

1955 AMC 12/AHSME, 35

Tags:
Three boys agree to divide a bag of marbles in the following manner. The first boy takes one more than half the marbles. The second takes a third of the number remaining. The third boy finds that he is left with twice as many marbles as the second boy. The original number of marbles: $ \textbf{(A)}\ \text{is none of the following} \qquad \textbf{(B)}\ \text{cannot be determined from the given data}\\ \textbf{(C)}\ \text{is 20 or 26} \qquad \textbf{(D)}\ \text{is 14 or 32} \qquad \textbf{(E)}\ \text{is 8 or 38}$

Durer Math Competition CD Finals - geometry, 2013.D3

The circle circumscribed to the triangle $ABC$ is $k$. The altitude $AT$ intersects circle $k$ at $P$. The perpendicular from $P$ on line $AB$ intersects is at $R$. Prove that line $TR$ is parallel to the tangent of the circle $k$ at point $A$.

2017 AMC 12/AHSME, 11

Claire adds the degree measures of the interior angles of a convex polygon and arrives at a sum of $2017$. She then discovers that she forgot to include one angle. What is the degree measure of the forgotten angle? $\textbf{(A)}\ 37\qquad\textbf{(B)}\ 63\qquad\textbf{(C)}\ 117\qquad\textbf{(D)}\ 143\qquad\textbf{(E)}\ 163$

2020 Brazil National Olympiad, 5

Let $ABC$ be a triangle and $M$ the midpoint of $AB$. Let circumcircles of triangles $CMO$ and $ABC$ intersect at $K$ where $O$ is the circumcenter of $ABC$. Let $P$ be the intersection of lines $OM$ and $CK$. Prove that $\angle{PAK} = \angle{MCB}$.

2021 Princeton University Math Competition, 6

Jack plays a game in which he first rolls a fair six-sided die and gets some number $n$, then, he flips a coin until he flips $n$ heads in a row and wins, or he flips $n$ tails in a row in which case he rerolls the die and tries again. What is the expected number of times Jack must flip the coin before he wins the game.

1994 Brazil National Olympiad, 5

Call a super-integer an infinite sequence of decimal digits: $\ldots d_n \ldots d_2d_1$. (Formally speaking, it is the sequence $(d_1,d_2d_1,d_3d_2d_1,\ldots)$ ) Given two such super-integers $\ldots c_n \ldots c_2c_1$ and $\ldots d_n \ldots d_2d_1$, their product $\ldots p_n \ldots p_2p_1$ is formed by taking $p_n \ldots p_2p_1$ to be the last n digits of the product $c_n \ldots c_2c_1$ and $d_n \ldots d_2d_1$. Can we find two non-zero super-integers with zero product? (a zero super-integer has all its digits zero)

PEN P Problems, 33

Let $a_{1}, a_{2}, \cdots, a_{k}$ be relatively prime positive integers. Determine the largest integer which cannot be expressed in the form \[x_{1}a_{2}a_{3}\cdots a_{k}+x_{2}a_{1}a_{3}\cdots a_{k}+\cdots+x_{k}a_{1}a_{2}\cdots a_{k-1}\] for some nonnegative integers $x_{1}, x_{2}, \cdots, x_{k}$.