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

2020 Thailand TSTST, 2

For any positive integer $m \geq 2$, let $p(m)$ be the smallest prime dividing $m$ and $P(m)$ be the largest prime dividing $m$. Let $C$ be a positive integer. Define sequences $\{a_n\}$ and $\{b_n\}$ by $a_0 = b_0 = C$ and, for each positive integer $k$ such that $a_{k-1}\geq 2$, $$a_k=a_{k-1}-\frac{a_{k-1}}{p(a_{k-1})};$$ and, for each positive integer $k$ such that $b_{k-1}\geq 2$, $$b_k=b_{k-1}-\frac{b_{k-1}}{P(b_{k-1})}$$ It is easy to see that both $\{a_n\}$ and $\{b_n\}$ are finite sequences which terminate when they reach the number $1$. Prove that the numbers of terms in the two sequences are always equal.

2021 Cyprus JBMO TST, 4

Tags: geometry
Let $\triangle AB\varGamma$ be an acute-angled triangle with $AB < A\varGamma$, and let $O$ be the center of the circumcircle of the triangle. On the sides $AB$ and $A \varGamma$ we select points $T$ and $P$ respectively such that $OT=OP$. Let $M,K$ and $\varLambda$ be the midpoints of $PT,PB$ and $\varGamma T$ respectively. Prove that $\angle TMK = \angle M\varLambda K$.

2005 Tournament of Towns, 3

Tags: logic
John and James wish to divide $25$ coins, of denominations $1, 2, 3, \ldots , 25$ kopeks. In each move, one of them chooses a coin, and the other player decides who must take this coin. John makes the initial choice of a coin, and in subsequent moves, the choice is made by the player having more kopeks at the time. In the event that there is a tie, the choice is made by the same player in the preceding move. After all the coins have been taken, the player with more kopeks wins. Which player has a winning strategy? [i](5 points)[/i]

2007 Turkey MO (2nd round), 1

In an acute triangle $ABC$, the circle with diameter $AC$ intersects $AB$ and $AC$ at $K$ and $L$ different from $A$ and $C$ respectively. The circumcircle of $ABC$ intersects the line $CK$ at the point $F$ different from $C$ and the line $AL$ at the point $D$ different from $A$. A point $E$ is choosen on the smaller arc of $AC$ of the circumcircle of $ABC$ . Let $N$ be the intersection of the lines $BE$ and $AC$ . If $AF^{2}+BD^{2}+CE^{2}=AE^{2}+CD^{2}+BF^{2}$ prove that $\angle KNB= \angle BNL$ .

2016 Bangladesh Mathematical Olympiad, 3

$\triangle ABC$ is isosceles $AB = AC$. $P$ is a point inside $\triangle ABC$ such that $\angle BCP = 30$ and $\angle APB = 150$ and $\angle CAP = 39$. Find $\angle BAP$.

1954 AMC 12/AHSME, 18

Tags: inequalities
Of the following sets, the one that includes all values of $ x$ which will satisfy $ 2x \minus{} 3 > 7 \minus{} x$ is: $ \textbf{(A)}\ x > 4 \qquad \textbf{(B)}\ x < \frac {10}{3} \qquad \textbf{(C)}\ x \equal{} \frac {10}{3} \qquad \textbf{(D)}\ x > \frac {10}{3} \qquad \textbf{(E)}\ x < 0$

2008 Irish Math Olympiad, 1

Find, with proof, all triples of integers $ (a,b,c)$ such that $ a, b$ and $ c$ are the lengths of the sides of a right angled triangle whose area is $ a \plus{} b \plus{} c$

2002 Singapore MO Open, 4

Find all real-valued functions $f : Q \to R$ defined on the set of all rational numbers $Q$ satisfying the conditions $f(x + y) = f(x) + f(y) + 2xy$ for all $x, y$ in $Q$ and $f(1) = 2002.$ Justify your answers.

1967 IMO Longlists, 10

The square $ABCD$ has to be decomposed into $n$ triangles (which are not overlapping) and which have all angles acute. Find the smallest integer $n$ for which there exist a solution of that problem and for such $n$ construct at least one decomposition. Answer whether it is possible to ask moreover that (at least) one of these triangles has the perimeter less than an arbitrarily given positive number.

1995 AMC 12/AHSME, 21

Two nonadjacent vertices of a rectangle are $(4,3)$ and $(-4,-3)$, and the coordinates of the other two vertices are integers. The number of such rectangles is $\textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 5$

1975 AMC 12/AHSME, 29

Tags:
What is the smallest integer larger than $(\sqrt{3}+\sqrt{2})^6$? $ \textbf{(A)}\ 972 \qquad\textbf{(B)}\ 971 \qquad\textbf{(C)}\ 970 \qquad\textbf{(D)}\ 969 \qquad\textbf{(E)}\ 968 $

2015 Brazil National Olympiad, 4

Let $n$ be a integer and let $n=d_1>d_2>\cdots>d_k=1$ its positive divisors. a) Prove that $$d_1-d_2+d_3-\cdots+(-1)^{k-1}d_k=n-1$$ iff $n$ is prime or $n=4$. b) Determine the three positive integers such that $$d_1-d_2+d_3-...+(-1)^{k-1}d_k=n-4.$$

2014 Israel National Olympiad, 7

Tags: algebra , polynomial , root
Find one real value of $x$ satisfying $\frac{x^7}{7}=1+\sqrt[7]{10}x\left(x^2-\sqrt[7]{10}\right)^2$.

2007 USA Team Selection Test, 1

Circles $ \omega_1$ and $ \omega_2$ meet at $ P$ and $ Q$. Segments $ AC$ and $ BD$ are chords of $ \omega_1$ and $ \omega_2$ respectively, such that segment $ AB$ and ray $ CD$ meet at $ P$. Ray $ BD$ and segment $ AC$ meet at $ X$. Point $ Y$ lies on $ \omega_1$ such that $ PY \parallel BD$. Point $ Z$ lies on $ \omega_2$ such that $ PZ \parallel AC$. Prove that points $ Q,X,Y,Z$ are collinear.

2001 Moldova Team Selection Test, 7

Tags: polynomial
Let $(P_n(X))_{n\in\mathbb{N}}$ be a sequence of polynomials defined as: $P_1(X)=X-1, P_2(X)=X^2-X-1, P_n(X)=XP_{n-1}(X)-P_{n-2}(X), \forall n>2$. For every nonnegative integer $n{}$ find all roots of the polynomial $P_n(X)$.

2009 IMC, 2

Tags:
Let $A,B,C$ be real square matrices of the same order, and suppose $A$ is invertible. Prove that \[ (A-B)C=BA^{-1}\implies C(A-B)=A^{-1}B \]

1994 Abels Math Contest (Norwegian MO), 3a

Let $x_1,x_2,...,x_{1994}$ be positive real numbers. Prove that $$\left(\frac{x_1}{x_2}\right)^{\frac{x_1}{x_2}}\left(\frac{x_2}{x_3}\right)^{\frac{x_2}{x_3}}...\left(\frac{x_{1993}}{x_{1994}}\right)^{\frac{x_{1993}}{x_{1994}}} \ge \left(\frac{x_1}{x_2}\right)^{\frac{x_2}{x_1}}\left(\frac{x_2}{x_3}\right)^{\frac{x_3}{x_2}}...\left(\frac{x_{1993}}{x_{1994}}\right)^{\frac{x_{1994}}{x_{1993}}}$$

1959 Miklós Schweitzer, 10

Tags:
[b]10.[/b] Prove that if a graph with $2n+1$ vertices has at least $3n+1$ edges, then the graph contains a circuit having an even number of edges. Prove further that this statemente does not hold for $3n$ edges. (By a circuit, we mean a closed line which does not intersect itself.) [b](C. 5)[/b]

2008 Putnam, A5

Let $ n\ge 3$ be an integer. Let $ f(x)$ and $ g(x)$ be polynomials with real coefficients such that the points $ (f(1),g(1)),(f(2),g(2)),\dots,(f(n),g(n))$ in $ \mathbb{R}^2$ are the vertices of a regular $ n$-gon in counterclockwise order. Prove that at least one of $ f(x)$ and $ g(x)$ has degree greater than or equal to $ n\minus{}1.$

Geometry Mathley 2011-12, 3.2

Given a triangle $ABC$, a line $\delta$ and a constant $k$, distinct from $0$ and $1,M$ a variable point on the line $\delta$. Points $E, F$ are on $MB,MC$ respectively such that $\frac{\overline{ME}}{\overline{MB}} = \frac{\overline{MF}}{\overline{MC}} = k$. Points $P,Q$ are on $AB,AC$ such that $PE, QF$ are perpendicular to $\delta$. Prove that the line through $M$ perpendicular to $PQ$ has a fixed point. Nguyễn Minh Hà

2023 Francophone Mathematical Olympiad, 1

Let $u_0, u_1, u_2, \ldots$ be integers such that $u_0 = 100$; $u_{k+2} \geqslant 2 + u_k$ for all $k \geqslant 0$; and $u_{\ell+5} \leqslant 5 + u_\ell$ for all $\ell \geqslant 0$. Find all possible values for the integer $u_{2023}$.

2000 Harvard-MIT Mathematics Tournament, 8

Tags:
How many non-isomorphic graphs with $9$ vertices, with each vertex connected to exactly $6$ other vertices, are there? (Two graphs are isomorphic if one can relabel the vertices of one graph to make all edges be exactly the same.)

2020 Estonia Team Selection Test, 3

The prime numbers $p$ and $q$ and the integer $a$ are chosen such that $p> 2$ and $a \not\equiv 1$ (mod $q$), but $a^p \equiv 1$ (mod $q$). Prove that $(1 + a^1)(1 + a^2)...(1 + a^{p - 1})\equiv 1$ (mod $q$) .

2024 Junior Balkan Team Selection Tests - Moldova, 8

There are $n$ blocks placed on the unit squares of a $n \times n$ chessboard such that there is exactly one block in each row and each column. Find the maximum value $k$, in terms of $n$, such that however the blocks are arranged, we can place $k$ rooks on the board without any two of them threatening each other. (Two rooks are not threatening each other if there is a block lying between them.)

2006 Bulgaria Team Selection Test, 2

Prove that if $a,b,c>0,$ then \[ \frac{ab}{3a+4b+5c}+\frac{bc}{3b+4c+5a}+\frac{ca}{3c+4a+5b}\le \frac{a+b+c}{12}. \] [i] Nikolai Nikolov[/i]