Join our FREE webinar on May 1st to learn about managing anxiety.

G
Topic
First Poster
Last Poster
Geometric inequality with Fermat point
Assassino9931   6
N 16 minutes ago by arqady
Source: Balkan MO Shortlist 2024 G2
Let $ABC$ be an acute triangle and let $P$ be an interior point for it such that $\angle APB = \angle BPC = \angle CPA$. Prove that
$$ \frac{PA^2 + PB^2 + PC^2}{2S} + \frac{4}{\sqrt{3}} \leq \frac{1}{\sin \alpha} + \frac{1}{\sin \beta} + \frac{1}{\sin \gamma}. $$When does equality hold?
6 replies
Assassino9931
Apr 27, 2025
arqady
16 minutes ago
Straight-edge is a social construct
anantmudgal09   27
N 19 minutes ago by cj13609517288
Source: INMO 2023 P6
Euclid has a tool called cyclos which allows him to do the following:
[list]
[*] Given three non-collinear marked points, draw the circle passing through them.
[*] Given two marked points, draw the circle with them as endpoints of a diameter.
[*] Mark any intersection points of two drawn circles or mark a new point on a drawn circle.
[/list]

Show that given two marked points, Euclid can draw a circle centered at one of them and passing through the other, using only the cyclos.

Proposed by Rohan Goyal, Anant Mudgal, and Daniel Hu
27 replies
+1 w
anantmudgal09
Jan 15, 2023
cj13609517288
19 minutes ago
Weighted Blocks
ilovemath04   51
N 38 minutes ago by Maximilian113
Source: ISL 2019 C2
You are given a set of $n$ blocks, each weighing at least $1$; their total weight is $2n$. Prove that for every real number $r$ with $0 \leq r \leq 2n-2$ you can choose a subset of the blocks whose total weight is at least $r$ but at most $r + 2$.
51 replies
ilovemath04
Sep 22, 2020
Maximilian113
38 minutes ago
Very easy NT
GreekIdiot   7
N 39 minutes ago by Primeniyazidayi
Prove that there exists no natural number $n>1$ such that $n \mid 2^n-1$.
7 replies
GreekIdiot
4 hours ago
Primeniyazidayi
39 minutes ago
Azer and Babek playing a game on a chessboard
Nuran2010   1
N an hour ago by Diamond-jumper76
Source: Azerbaijan Al-Khwarizmi IJMO TST
Azer and Babek have a $8 \times 8$ chessboard. Initially, Azer colors all cells of this chessboard with some colors. Then, Babek takes $2$ rows and $2$ columns and looks at the $4$ cells in the intersection. Babek wants to have all these $4$ cells in a same color, but Azer doesn't. With at least how many colors, Azer can reach his goal?
1 reply
Nuran2010
Yesterday at 5:03 PM
Diamond-jumper76
an hour ago
Something nice
KhuongTrang   27
N an hour ago by arqady
Source: own
Problem. Given $a,b,c$ be non-negative real numbers such that $ab+bc+ca=1.$ Prove that

$$\sqrt{a+1}+\sqrt{b+1}+\sqrt{c+1}\le 1+2\sqrt{a+b+c+abc}.$$
27 replies
1 viewing
KhuongTrang
Nov 1, 2023
arqady
an hour ago
Hard inequality
JK1603JK   4
N an hour ago by JK1603JK
Source: unknown?
Let $a,b,c>0$ and $a^2+b^2+c^2=2(a+b+c).$ Find the minimum $$P=(a+b+c)\left(\frac{1}{a}+\frac{1}{b}+\frac{1}{c}\right)$$
4 replies
JK1603JK
Yesterday at 4:24 AM
JK1603JK
an hour ago
Pairwise distance-one products
y-is-the-best-_   28
N an hour ago by john0512
Source: IMO 2019 SL A4
Let $n\geqslant 2$ be a positive integer and $a_1,a_2, \ldots ,a_n$ be real numbers such that \[a_1+a_2+\dots+a_n=0.\]Define the set $A$ by
\[A=\left\{(i, j)\,|\,1 \leqslant i<j \leqslant n,\left|a_{i}-a_{j}\right| \geqslant 1\right\}\]Prove that, if $A$ is not empty, then
\[\sum_{(i, j) \in A} a_{i} a_{j}<0.\]
28 replies
y-is-the-best-_
Sep 22, 2020
john0512
an hour ago
2^x+3^x = yx^2
truongphatt2668   8
N an hour ago by Tamam
Prove that the following equation has infinite integer solutions:
$$2^x+3^x = yx^2$$
8 replies
truongphatt2668
Apr 22, 2025
Tamam
an hour ago
Fibonacci...?
Jackson0423   1
N 2 hours ago by KAME06
The sequence \( F \) is defined by \( F_0 = F_1 = 2025 \) and for all positive integers \( n \geq 2 \), \( F_n = F_{n-1} + F_{n-2} \). Show that for every positive integer \( k \), there exists a suitable positive integer \( j \) such that \( F_j \) is a multiple of \( k \).
1 reply
Jackson0423
2 hours ago
KAME06
2 hours ago
4 concyclic points
buzzychaoz   18
N 2 hours ago by bjump
Source: Japan Mathematical Olympiad Finals 2015 Q4
Scalene triangle $ABC$ has circumcircle $\Gamma$ and incenter $I$. The incircle of triangle $ABC$ touches side $AB,AC$ at $D,E$ respectively. Circumcircle of triangle $BEI$ intersects $\Gamma$ again at $P$ distinct from $B$, circumcircle of triangle $CDI$ intersects $\Gamma$ again at $Q$ distinct from $C$. Prove that the $4$ points $D,E,P,Q$ are concyclic.
18 replies
buzzychaoz
Apr 1, 2016
bjump
2 hours ago
angles in triangle
AndrewTom   33
N 2 hours ago by zuat.e
Source: BrMO 2012/13 Round 2
The point $P$ lies inside triangle $ABC$ so that $\angle ABP = \angle PCA$. The point $Q$ is such that $PBQC$ is a parallelogram. Prove that $\angle QAB = \angle CAP$.
33 replies
AndrewTom
Feb 1, 2013
zuat.e
2 hours ago
Gheorghe Țițeica 2025 Grade 7 P3
AndreiVila   1
N Mar 29, 2025 by Rainbow1971
Source: Gheorghe Țițeica 2025
Out of all the nondegenerate triangles with positive integer sides and perimeter $100$, find the one with the smallest area.
1 reply
AndreiVila
Mar 28, 2025
Rainbow1971
Mar 29, 2025
Gheorghe Țițeica 2025 Grade 7 P3
G H J
G H BBookmark kLocked kLocked NReply
Source: Gheorghe Țițeica 2025
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
AndreiVila
210 posts
#1
Y by
Out of all the nondegenerate triangles with positive integer sides and perimeter $100$, find the one with the smallest area.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Rainbow1971
35 posts
#2
Y by
If degenerate triangles were allowed, the optimal choice would be a collinear triangle. For a non-degenerate triangle we want to come as close as possible to collinearity; triangles with sidelengths 25, 26, 49 or 2, 49, 49 come to mind. Let us try to produce a rigorous argument for the claim that the latter sidelengths 2, 49, 49 do indeed produce the smallest possible area.

We compare the areas of a triangle with sidelengths $a, b,c$ and a triangle with sidelengths $a, b-1, c+1$, assuming that $a \le b  \le c$ and $a + b+ c = 100$. Using Heron's formula, we see that it suffices to compare the terms
$$50 \cdot (50-a)(50-b)(50-c)$$for the first triangle and
$$50 \cdot (50-a)(50-(b-1))(50-(c+1))$$for the second triangle. As the first two factors are the same in both terms, we can reduce the comparison to the terms
$$(50-b)(50-c)$$and
$$(50-(b-1))(50-(c+1)).$$Subtracting the last term from the one before it, we get $c - b +1$, which is positive due to $c \ge b$. This shows that the area of the second triangle is smaller.

Now, if we have a non-degenerate triangle with sidelengths $a,b,c$ and $a \le b \le c$ and $a + b+ c=100$ and with minimal area, the above step from sidelengths $a,b,c$ to sidelengths $a, b-1, c+1$ must be barred for some reason (otherwise the area would not be minimal). The only possible reason for that is that a non-degenerate triangle with sidelengths $a, b-1, c+1$ does not exist due to a violation of the triangle inequalities. As the triangle inequalities for the $a$-$b$-$c$-triangle are fulfilled, the only triangle inequality which can be violated for the hypothetical triangle with the new sidelengths is $a + (b-1) > c+1$, meaning that in fact we have
$$ a + (b-1) \le c+1.$$As the triangle inequalities for the $a$-$b$-$c$-triangle are fulfilled (due to its existence), we have $a+b>c$ and therefore
$$a+b -1 \ge c.$$So, taking these inequalities together, we have
$$c \le a+b-1 \le c+1$$and, adding 1, we get
$$c+1 \le a+b \le c+2.$$Consequently, $a+b$ is equal either to $c+1$ or to $c+2$. Assuming the first case, $a+b=c+1$, we get
$$100 = a+b+c = 2c +1$$which is not possible for an integer value of $c$. So the second case must be true: $a+b=c+2$. This leads us to
$$100 = a+b+c = 2c + 2$$which means
$$c=49$$and $$a+b=51.$$We are almost done. We still need to find out what $a$ and $b$ are. As we already know that $c=49$, the Heronian formula tells us that the area of our minimal triangle only depends on the term
$$(50-a)(50-b)$$which is equivalent to $$2500 - 50 (a+b) + ab.$$As $a+b$ is already fixed ($a+b=51$), the only variable here is the product $ab$. Now
$$ab=a(51-a)=-(a-\tfrac{51}{2})^2+\tfrac{51^2}{4}.$$For the positive integer value of $a$, we need to get as far away from $\tfrac{51}{2}$ as possible to minimalize $ab$. As $a \le b$, we must investigate the lower end of the spectrum for $a$. The value $a = 1$ is forbidden, as $b$ would be $50$ then, violating $b \le c$ and the triangle inequality $a+c > b$. The best acceptable choice is obviously $a=2$. So we finally have
$$a = 2 \quad \text{and} \quad {b=49} \quad \text{and} \quad {c=49}.$$
This post has been edited 1 time. Last edited by Rainbow1971, Mar 29, 2025, 3:33 PM
Reason: Correction of minor error in the first paragraph
Z K Y
N Quick Reply
G
H
=
a