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

2002 Romania Team Selection Test, 1

Let $m,n$ be positive integers of distinct parities and such that $m<n<5m$. Show that there exists a partition with two element subsets of the set $\{ 1,2,3,\ldots ,4mn\}$ such that the sum of numbers in each set is a perfect square. [i]Dinu Șerbănescu[/i]

1997 All-Russian Olympiad, 3

The incircle of triangle $ABC$ touches sides $AB$;$BC$;$CA$ at $M$;$N$;$K$, respectively. The line through $A$ parallel to $NK$ meets $MN$ at $D$. The line through $A$ parallel to $MN$ meets $NK$ at $E$. Show that the line $DE$ bisects sides $AB$ and $AC$ of triangle $ABC$. [i]M. Sonkin[/i]

2019 Azerbaijan Junior NMO, 4

Prove that, for any triangle with side lengths $a,b,c$, the following inequality holds $$\frac{a}{(b+c)^2}+\frac{b}{(c+a)^2}+\frac{c}{(a+b)^2}\geq\frac9{8p}$$ ($p$ denotes the semiperimeter of a triangle)

2021 Auckland Mathematical Olympiad, 1

Tags: algebra
Find all real numbers $x$ for which $$\sqrt{\frac{x^3 - 8}{x}} > x - 2.$$

2019 Mediterranean Mathematics Olympiad, 2

Let $m_1<m_2<\cdots<m_s$ be a sequence of $s\ge2$ positive integers, none of which can be written as the sum of (two or more) distinct other numbers in the sequence. For every integer $r$ with $1\le r<s$, prove that \[ r\cdot m_r+m_s ~\ge~ (r+1)(s-1). \] (Proposed by Gerhard Woeginger, Austria)

LMT Speed Rounds, 18

Tags: geometry
In square $ABCD$ with side length $2$, let $M$ be the midpoint of $AB$. Let $N$ be a point on $AD$ such that $AN = 2ND$. Let point $P$ be the intersection of segment $MN$ and diagonal $AC$. Find the area of triangle $BPM$. [i]Proposed by Jacob Xu[/i]

1993 Tournament Of Towns, (363) 2

Let $O$ be the centre of the circle touching the side $AC$ of triangle $ABC$ and the continuations of the sides $BA$ and $BC$. $D$ is the centre of the circle passing through the points $A$, $B$ and $O$. Prove that the points $A$, $B$, $C$ and $D$ lie on a circle. (YF Akurlich)

2021 USMCA, 15

Tags:
Find the sum of all real values of $A$ such that the equation $Axy+25x^2+25y^2-20x-22y+5=0$ has a unique solution in real numbers $(x,y)$.

2012 Greece Team Selection Test, 2

Given is an acute triangle $ABC$ $\left(AB<AC<BC\right)$,inscribed in circle $c(O,R)$.The perpendicular bisector of the angle bisector $AD$ $\left(D\in BC\right)$ intersects $c$ at $K,L$ ($K$ lies on the small arc $\overarc{AB}$).The circle $c_1(K,KA)$ intersects $c$ at $T$ and the circle $c_2(L,LA)$ intersects $c$ at $S$.Prove that $\angle{BAT}=\angle{CAS}$. [hide=Diagram][asy]import graph; size(10cm); real labelscalefactor = 0.5; /* changes label-to-point distance */ pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); /* default pen style */ pen dotstyle = black; /* point style */ real xmin = -6.94236331697463, xmax = 15.849400903703716, ymin = -5.002235438802758, ymax = 7.893104843949444; /* image dimensions */ pen aqaqaq = rgb(0.6274509803921569,0.6274509803921569,0.6274509803921569); pen uququq = rgb(0.25098039215686274,0.25098039215686274,0.25098039215686274); pen qqqqtt = rgb(0.,0.,0.2); draw((1.8318261909633622,3.572783369254345)--(0.,0.)--(6.,0.)--cycle, aqaqaq); draw(arc((1.8318261909633622,3.572783369254345),0.6426249310341638,-117.14497824050169,-101.88970202103212)--(1.8318261909633622,3.572783369254345)--cycle, qqqqtt); draw(arc((1.8318261909633622,3.572783369254345),0.6426249310341638,-55.85706977865775,-40.60179355918817)--(1.8318261909633622,3.572783369254345)--cycle, qqqqtt); /* draw figures */ draw((1.8318261909633622,3.572783369254345)--(0.,0.), uququq); draw((0.,0.)--(6.,0.), uququq); draw((6.,0.)--(1.8318261909633622,3.572783369254345), uququq); draw(circle((3.,0.7178452373968209), 3.0846882800136055)); draw((2.5345020274407277,0.)--(1.8318261909633622,3.572783369254345)); draw(circle((-0.01850947366601585,1.3533783539547308), 2.889550258039566)); draw(circle((5.553011501106743,2.4491551634556963), 3.887127532933951)); draw((-0.01850947366601585,1.3533783539547308)--(5.553011501106743,2.4491551634556963), linetype("2 2")); draw((1.8318261909633622,3.572783369254345)--(0.7798408954511686,-1.423695174396108)); draw((1.8318261909633622,3.572783369254345)--(5.22015910454883,-1.4236951743961088)); /* dots and labels */ dot((1.8318261909633622,3.572783369254345),linewidth(3.pt) + dotstyle); label("$A$", (1.5831274347452782,3.951671933606579), NE * labelscalefactor); dot((0.,0.),linewidth(3.pt) + dotstyle); label("$B$", (-0.6,0.05), NE * labelscalefactor); dot((6.,0.),linewidth(3.pt) + dotstyle); label("$C$", (6.188606107156787,0.07450151636712989), NE * labelscalefactor); dot((2.5345020274407277,0.),linewidth(3.pt) + dotstyle); label("$D$", (2.3,-0.7), NE * labelscalefactor); dot((-0.01850947366601585,1.3533783539547308),linewidth(3.pt) + dotstyle); label("$K$", (-0.3447473583572136,1.6382221818835927), NE * labelscalefactor); dot((5.553011501106743,2.4491551634556963),linewidth(3.pt) + dotstyle); label("$L$", (5.631664500260511,2.580738747400365), NE * labelscalefactor); dot((0.7798408954511686,-1.423695174396108),linewidth(3.pt) + dotstyle); label("$T$", (0.5977692071595602,-1.960477431907719), NE * labelscalefactor); dot((5.22015910454883,-1.4236951743961088),linewidth(3.pt) + dotstyle); label("$S$", (5.160406217502124,-1.8747941077698307), NE * labelscalefactor); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); /* end of picture */[/asy][/hide]

2011 China Team Selection Test, 3

Let $m$ and $n$ be positive integers. A sequence of points $(A_0,A_1,\ldots,A_n)$ on the Cartesian plane is called [i]interesting[/i] if $A_i$ are all lattice points, the slopes of $OA_0,OA_1,\cdots,OA_n$ are strictly increasing ($O$ is the origin) and the area of triangle $OA_iA_{i+1}$ is equal to $\frac{1}{2}$ for $i=0,1,\ldots,n-1$. Let $(B_0,B_1,\cdots,B_n)$ be a sequence of points. We may insert a point $B$ between $B_i$ and $B_{i+1}$ if $\overrightarrow{OB}=\overrightarrow{OB_i}+\overrightarrow{OB_{i+1}}$, and the resulting sequence $(B_0,B_1,\ldots,B_i,B,B_{i+1},\ldots,B_n)$ is called an [i]extension[/i] of the original sequence. Given two [i]interesting[/i] sequences $(C_0,C_1,\ldots,C_n)$ and $(D_0,D_1,\ldots,D_m)$, prove that if $C_0=D_0$ and $C_n=D_m$, then we may perform finitely many [i]extensions[/i] on each sequence until the resulting two sequences become identical.

2019 Saudi Arabia JBMO TST, 2

Tags: geometry
An acute triangle ABC is inscribed in a circle C. Tangents in A and C to circle C intersect at F. Segment bisector of AB intersects the line BC at E. Show that the lines FE and AB are parallel.

1990 Nordic, 3

Tags: geometry
Let $ABC$ be a triangle and let $P$ be an interior point of $ABC$. We assume that a line $l$, which passes through $P$, but not through $A$, intersects $AB$ and $AC$ (or their extensions over $B$ or $C$) at $Q$ and $R$, respectively. Find $l$ such that the perimeter of the triangle $AQR$ is as small as possible.

2005 National Olympiad First Round, 16

Tags:
$100$ stones, each weighs $1$ kg or $10$ kgs or $50$ kgs, weighs $500$ kgs in total. How many values can the number of stones weighing $10$ kgs take? $ \textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ 3 \qquad\textbf{(E)}\ 4 $

2000 Korea Junior Math Olympiad, 1

Tags: gcd , number theory
For arbitrary natural number $a$, show that $\gcd(a^3+1, a^7+1)=a+1$.

1998 Harvard-MIT Mathematics Tournament, 5

How many positive integers less than $1998$ are relatively prime to $1547$? (Two integers are relatively prime if they have no common factors besides 1.)

2001 Turkey MO (2nd round), 3

One wants to distribute $n$ same sized cakes between $k$ people equally by cutting every cake at most once. If the number of positive divisors of $n$ is denoted as $d(n)$, show that the number of different values of $k$ which makes such distribution possible is $n+d(n)$

1992 Bundeswettbewerb Mathematik, 4

A finite set $\{a_1, a_2, ... a_k\}$ of positive integers with $a_1 < a_2 < a_3 < ... < a_k$ is named [i]alternating [/i] if $i+a$ for $i = 1, 2, 3, ..., k$ is even. The empty set is also considered to be alternating. The number of alternating subsets of $\{1, 2, 3,..., n\}$ is denoted by $A(n)$. Develop a method to determine $A(n)$ for every $n \in N$ and calculate hence $A(33)$.

2012 Cono Sur Olympiad, 1

1. Around a circumference are written $2012$ number, each of with is equal to $1$ or $-1$. If there are not $10$ consecutive numbers that sum $0$, find all possible values of the sum of the $2012$ numbers.

1967 IMO Longlists, 57

Let $a_1,\ldots,a_8$ be reals, not all equal to zero. Let \[ c_n = \sum^8_{k=1} a^n_k\] for $n=1,2,3,\ldots$. Given that among the numbers of the sequence $(c_n)$, there are infinitely many equal to zero, determine all the values of $n$ for which $c_n = 0.$

2020 CMIMC Team, 10

Tags: team
Let $ABC$ be a triangle. The incircle $\omega$ of $\triangle ABC$, which has radius $3$, is tangent to $\overline{BC}$ at $D$. Suppose the length of the altitude from $A$ to $\overline{BC}$ is $15$ and $BD^2 + CD^2 = 33$. What is $BC$?

2021-IMOC, N5

Find all sets $S$ of positive integers that satisfy all of the following. $1.$ If $a,b$ are two not necessarily distinct elements in $S$, then $\gcd(a,b)$, $ab$ are also in $S$. $2.$ If $m,n$ are two positive integers with $n\nmid m$, then there exists an element $s$ in $S$ such that $m^2\mid s$ and $n^2\nmid s$. $3.$ For any odd prime $p$, the set formed by moduloing all elements in $S$ by $p$ has size exactly $\frac{p+1}2$.

2025 Bulgarian Spring Mathematical Competition, 11.2

Let $\alpha, \beta$ be real numbers such that $\sin\alpha\sin\beta=\frac{1}{3}$. Prove that the set of possible values of $\cos \alpha \cos \beta$ is the interval $\left[-\frac{2}{3}, \frac{2}{3}\right]$.

2022 Brazil Team Selection Test, 1

Let $a, b, c$ be positive real numbers. Show that $$a^5+b^5+c^5 \geq 5abc(b^2-ac)$$ and determine when the equality occurs.

1996 Vietnam Team Selection Test, 1

In the plane we are given $3 \cdot n$ points ($n>$1) no three collinear, and the distance between any two of them is $\leq 1$. Prove that we can construct $n$ pairwise disjoint triangles such that: The vertex set of these triangles are exactly the given 3n points and the sum of the area of these triangles $< 1/2$.

2006 Brazil National Olympiad, 5

Tags: ratio , geometry
Let $P$ be a convex $2006$-gon. The $1003$ diagonals connecting opposite vertices and the $1003$ lines connecting the midpoints of opposite sides are concurrent, that is, all $2006$ lines have a common point. Prove that the opposite sides of $P$ are parallel and congruent.