G
Topic
First Poster
Last Poster
k a April Highlights and 2025 AoPS Online Class Information
jlacosta   0
an hour ago
Spring is in full swing and summer is right around the corner, what are your plans? At AoPS Online our schedule has new classes starting now through July, so be sure to keep your skills sharp and be prepared for the Fall school year! Check out the schedule of upcoming classes below.

WOOT early bird pricing is in effect, don’t miss out! If you took MathWOOT Level 2 last year, no worries, it is all new problems this year! Our Worldwide Online Olympiad Training program is for high school level competitors. AoPS designed these courses to help our top students get the deep focus they need to succeed in their specific competition goals. Check out the details at this link for all our WOOT programs in math, computer science, chemistry, and physics.

Looking for summer camps in math and language arts? Be sure to check out the video-based summer camps offered at the Virtual Campus that are 2- to 4-weeks in duration. There are middle and high school competition math camps as well as Math Beasts camps that review key topics coupled with fun explorations covering areas such as graph theory (Math Beasts Camp 6), cryptography (Math Beasts Camp 7-8), and topology (Math Beasts Camp 8-9)!

Be sure to mark your calendars for the following events:
[list][*]April 3rd (Webinar), 4pm PT/7:00pm ET, Learning with AoPS: Perspectives from a Parent, Math Camp Instructor, and University Professor
[*]April 8th (Math Jam), 4:30pm PT/7:30pm ET, 2025 MATHCOUNTS State Discussion
April 9th (Webinar), 4:00pm PT/7:00pm ET, Learn about Video-based Summer Camps at the Virtual Campus
[*]April 10th (Math Jam), 4:30pm PT/7:30pm ET, 2025 MathILy and MathILy-Er Math Jam: Multibackwards Numbers
[*]April 16th (Webinar), 4:00pm PT/7:00pm ET, Competitive Programming at AoPS (USACO).[/list]
Our full course list for upcoming classes is below:
All classes run 7:30pm-8:45pm ET/4:30pm - 5:45pm PT unless otherwise noted.

Introductory: Grades 5-10

Prealgebra 1 Self-Paced

Prealgebra 1
Sunday, Apr 13 - Aug 10
Tuesday, May 13 - Aug 26
Thursday, May 29 - Sep 11
Sunday, Jun 15 - Oct 12
Monday, Jun 30 - Oct 20
Wednesday, Jul 16 - Oct 29

Prealgebra 2 Self-Paced

Prealgebra 2
Sunday, Apr 13 - Aug 10
Wednesday, May 7 - Aug 20
Monday, Jun 2 - Sep 22
Sunday, Jun 29 - Oct 26
Friday, Jul 25 - Nov 21

Introduction to Algebra A Self-Paced

Introduction to Algebra A
Monday, Apr 7 - Jul 28
Sunday, May 11 - Sep 14 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Wednesday, May 14 - Aug 27
Friday, May 30 - Sep 26
Monday, Jun 2 - Sep 22
Sunday, Jun 15 - Oct 12
Thursday, Jun 26 - Oct 9
Tuesday, Jul 15 - Oct 28

Introduction to Counting & Probability Self-Paced

Introduction to Counting & Probability
Wednesday, Apr 16 - Jul 2
Thursday, May 15 - Jul 31
Sunday, Jun 1 - Aug 24
Thursday, Jun 12 - Aug 28
Wednesday, Jul 9 - Sep 24
Sunday, Jul 27 - Oct 19

Introduction to Number Theory
Thursday, Apr 17 - Jul 3
Friday, May 9 - Aug 1
Wednesday, May 21 - Aug 6
Monday, Jun 9 - Aug 25
Sunday, Jun 15 - Sep 14
Tuesday, Jul 15 - Sep 30

Introduction to Algebra B Self-Paced

Introduction to Algebra B
Wednesday, Apr 16 - Jul 30
Tuesday, May 6 - Aug 19
Wednesday, Jun 4 - Sep 17
Sunday, Jun 22 - Oct 19
Friday, Jul 18 - Nov 14

Introduction to Geometry
Wednesday, Apr 23 - Oct 1
Sunday, May 11 - Nov 9
Tuesday, May 20 - Oct 28
Monday, Jun 16 - Dec 8
Friday, Jun 20 - Jan 9
Sunday, Jun 29 - Jan 11
Monday, Jul 14 - Jan 19

Intermediate: Grades 8-12

Intermediate Algebra
Monday, Apr 21 - Oct 13
Sunday, Jun 1 - Nov 23
Tuesday, Jun 10 - Nov 18
Wednesday, Jun 25 - Dec 10
Sunday, Jul 13 - Jan 18
Thursday, Jul 24 - Jan 22

Intermediate Counting & Probability
Wednesday, May 21 - Sep 17
Sunday, Jun 22 - Nov 2

Intermediate Number Theory
Friday, Apr 11 - Jun 27
Sunday, Jun 1 - Aug 24
Wednesday, Jun 18 - Sep 3

Precalculus
Wednesday, Apr 9 - Sep 3
Friday, May 16 - Oct 24
Sunday, Jun 1 - Nov 9
Monday, Jun 30 - Dec 8

Advanced: Grades 9-12

Olympiad Geometry
Tuesday, Jun 10 - Aug 26

Calculus
Tuesday, May 27 - Nov 11
Wednesday, Jun 25 - Dec 17

Group Theory
Thursday, Jun 12 - Sep 11

Contest Preparation: Grades 6-12

MATHCOUNTS/AMC 8 Basics
Wednesday, Apr 16 - Jul 2
Friday, May 23 - Aug 15
Monday, Jun 2 - Aug 18
Thursday, Jun 12 - Aug 28
Sunday, Jun 22 - Sep 21
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)

MATHCOUNTS/AMC 8 Advanced
Friday, Apr 11 - Jun 27
Sunday, May 11 - Aug 10
Tuesday, May 27 - Aug 12
Wednesday, Jun 11 - Aug 27
Sunday, Jun 22 - Sep 21
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)

AMC 10 Problem Series
Friday, May 9 - Aug 1
Sunday, Jun 1 - Aug 24
Thursday, Jun 12 - Aug 28
Tuesday, Jun 17 - Sep 2
Sunday, Jun 22 - Sep 21 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Monday, Jun 23 - Sep 15
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)

AMC 10 Final Fives
Sunday, May 11 - Jun 8
Tuesday, May 27 - Jun 17
Monday, Jun 30 - Jul 21

AMC 12 Problem Series
Tuesday, May 27 - Aug 12
Thursday, Jun 12 - Aug 28
Sunday, Jun 22 - Sep 21
Wednesday, Aug 6 - Oct 22

AMC 12 Final Fives
Sunday, May 18 - Jun 15

F=ma Problem Series
Wednesday, Jun 11 - Aug 27

WOOT Programs
Visit the pages linked for full schedule details for each of these programs!


MathWOOT Level 1
MathWOOT Level 2
ChemWOOT
CodeWOOT
PhysicsWOOT

Programming

Introduction to Programming with Python
Thursday, May 22 - Aug 7
Sunday, Jun 15 - Sep 14 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Tuesday, Jun 17 - Sep 2
Monday, Jun 30 - Sep 22

Intermediate Programming with Python
Sunday, Jun 1 - Aug 24
Monday, Jun 30 - Sep 22

USACO Bronze Problem Series
Tuesday, May 13 - Jul 29
Sunday, Jun 22 - Sep 1

Physics

Introduction to Physics
Wednesday, May 21 - Aug 6
Sunday, Jun 15 - Sep 14
Monday, Jun 23 - Sep 15

Physics 1: Mechanics
Thursday, May 22 - Oct 30
Monday, Jun 23 - Dec 15

Relativity
Sat & Sun, Apr 26 - Apr 27 (4:00 - 7:00 pm ET/1:00 - 4:00pm PT)
Mon, Tue, Wed & Thurs, Jun 23 - Jun 26 (meets every day of the week!)
0 replies
jlacosta
an hour ago
0 replies
k a My Retirement & New Leadership at AoPS
rrusczyk   1571
N Mar 26, 2025 by SmartGroot
I write today to announce my retirement as CEO from Art of Problem Solving. When I founded AoPS 22 years ago, I never imagined that we would reach so many students and families, or that we would find so many channels through which we discover, inspire, and train the great problem solvers of the next generation. I am very proud of all we have accomplished and I’m thankful for the many supporters who provided inspiration and encouragement along the way. I'm particularly grateful to all of the wonderful members of the AoPS Community!

I’m delighted to introduce our new leaders - Ben Kornell and Andrew Sutherland. Ben has extensive experience in education and edtech prior to joining AoPS as my successor as CEO, including starting like I did as a classroom teacher. He has a deep understanding of the value of our work because he’s an AoPS parent! Meanwhile, Andrew and I have common roots as founders of education companies; he launched Quizlet at age 15! His journey from founder to MIT to technology and product leader as our Chief Product Officer traces a pathway many of our students will follow in the years to come.

Thank you again for your support for Art of Problem Solving and we look forward to working with millions more wonderful problem solvers in the years to come.

And special thanks to all of the amazing AoPS team members who have helped build AoPS. We’ve come a long way from here:IMAGE
1571 replies
rrusczyk
Mar 24, 2025
SmartGroot
Mar 26, 2025
k i Adding contests to the Contest Collections
dcouchman   1
N Apr 5, 2023 by v_Enhance
Want to help AoPS remain a valuable Olympiad resource? Help us add contests to AoPS's Contest Collections.

Find instructions and a list of contests to add here: https://artofproblemsolving.com/community/c40244h1064480_contests_to_add
1 reply
dcouchman
Sep 9, 2019
v_Enhance
Apr 5, 2023
k i Zero tolerance
ZetaX   49
N May 4, 2019 by NoDealsHere
Source: Use your common sense! (enough is enough)
Some users don't want to learn, some other simply ignore advises.
But please follow the following guideline:


To make it short: ALWAYS USE YOUR COMMON SENSE IF POSTING!
If you don't have common sense, don't post.


More specifically:

For new threads:


a) Good, meaningful title:
The title has to say what the problem is about in best way possible.
If that title occured already, it's definitely bad. And contest names aren't good either.
That's in fact a requirement for being able to search old problems.

Examples:
Bad titles:
- "Hard"/"Medium"/"Easy" (if you find it so cool how hard/easy it is, tell it in the post and use a title that tells us the problem)
- "Number Theory" (hey guy, guess why this forum's named that way¿ and is it the only such problem on earth¿)
- "Fibonacci" (there are millions of Fibonacci problems out there, all posted and named the same...)
- "Chinese TST 2003" (does this say anything about the problem¿)
Good titles:
- "On divisors of a³+2b³+4c³-6abc"
- "Number of solutions to x²+y²=6z²"
- "Fibonacci numbers are never squares"


b) Use search function:
Before posting a "new" problem spend at least two, better five, minutes to look if this problem was posted before. If it was, don't repost it. If you have anything important to say on topic, post it in one of the older threads.
If the thread is locked cause of this, use search function.

Update (by Amir Hossein). The best way to search for two keywords in AoPS is to input
[code]+"first keyword" +"second keyword"[/code]
so that any post containing both strings "first word" and "second form".


c) Good problem statement:
Some recent really bad post was:
[quote]$lim_{n\to 1}^{+\infty}\frac{1}{n}-lnn$[/quote]
It contains no question and no answer.
If you do this, too, you are on the best way to get your thread deleted. Write everything clearly, define where your variables come from (and define the "natural" numbers if used). Additionally read your post at least twice before submitting. After you sent it, read it again and use the Edit-Button if necessary to correct errors.


For answers to already existing threads:


d) Of any interest and with content:
Don't post things that are more trivial than completely obvious. For example, if the question is to solve $x^{3}+y^{3}=z^{3}$, do not answer with "$x=y=z=0$ is a solution" only. Either you post any kind of proof or at least something unexpected (like "$x=1337, y=481, z=42$ is the smallest solution). Someone that does not see that $x=y=z=0$ is a solution of the above without your post is completely wrong here, this is an IMO-level forum.
Similar, posting "I have solved this problem" but not posting anything else is not welcome; it even looks that you just want to show off what a genius you are.

e) Well written and checked answers:
Like c) for new threads, check your solutions at least twice for mistakes. And after sending, read it again and use the Edit-Button if necessary to correct errors.



To repeat it: ALWAYS USE YOUR COMMON SENSE IF POSTING!


Everything definitely out of range of common sense will be locked or deleted (exept for new users having less than about 42 posts, they are newbies and need/get some time to learn).

The above rules will be applied from next monday (5. march of 2007).
Feel free to discuss on this here.
49 replies
ZetaX
Feb 27, 2007
NoDealsHere
May 4, 2019
April Fools Geometry
awesomeming327.   5
N 15 minutes ago by PEKKA
Let $ABC$ be an acute triangle with $AB<AC$, and let $D$ be the projection from $A$ onto $BC$. Let $E$ be a point on the extension of $AD$ past $D$ such that $\angle BAC+\angle BEC=90^\circ$. Let $L$ be on the perpendicular bisector of $AE$ such that $L$ and $C$ are on the same side of $AE$ and
\[\frac12\angle ALE=1.4\angle ABE+3.4\angle ACE-558^\circ\]Let the reflection of $D$ across $AB$ and $AC$ be $W$ and $Y$, respectively. Let $X\in AW$ and $Z\in AY$ such that $\angle XBE=\angle ZCE=90^\circ$. Let $EX$ and $EZ$ intersect the circumcircles of $EBD$ and $ECD$ at $J$ and $K$, respectively. Let $LB$ and $LC$ intersect $WJ$ and $YK$ at $P$ and $Q$. Let $PQ$ intersect $BC$ at $F$. Prove that $FB/FC=DB/DC$.
5 replies
awesomeming327.
Yesterday at 2:52 PM
PEKKA
15 minutes ago
Every rectangle is formed from a number of full squares
orl   9
N 23 minutes ago by akliu
Source: IMO ShortList 1974, Bulgaria 1, IMO 1997, Day 2, Problem 1
Consider decompositions of an $8\times 8$ chessboard into $p$ non-overlapping rectangles subject to the following conditions:
(i) Each rectangle has as many white squares as black squares.
(ii) If $a_i$ is the number of white squares in the $i$-th rectangle, then $a_1<a_2<\ldots <a_p$.
Find the maximum value of $p$ for which such a decomposition is possible. For this value of $p$, determine all possible sequences $a_1,a_2,\ldots ,a_p$.
9 replies
orl
Oct 29, 2005
akliu
23 minutes ago
Old problem :(
Drakkur   1
N 25 minutes ago by Quantum-Phantom
Let a, b, c be positive real numbers. Prove that
$$\dfrac{1}{\sqrt{a^2+bc}}+\dfrac{1}{\sqrt{b^2+ca}}+\dfrac{1}{\sqrt{c^2+ab}}\le \sqrt{2}\left(\dfrac{1}{a+b}+\dfrac{1}{b+c}+\dfrac{1}{c+a}\right)$$
1 reply
Drakkur
an hour ago
Quantum-Phantom
25 minutes ago
Determinant
S_14159   0
27 minutes ago
Source: JEE adv. 2022 P1
Let $|M|$ denote the determinant of a square matrix $M$. Let $g:\left[0, \frac{\pi}{2}\right] \rightarrow R$ be the function defined by
$$
g(\theta)=\sqrt{f(\theta)-1}+\sqrt{f\left(\frac{\pi}{2}-\theta\right)-1}
$$where $f(\theta)=\frac{1}{2}\left|\begin{array}{ccc}1 & \sin \theta & 1 \\ -\sin \theta & 1 & \sin \theta \\ -1 & -\sin \theta & 1\end{array}\right|+\left|\begin{array}{ccc}\sin \pi & \cos \left(\theta+\frac{\pi}{4}\right) & \tan \left(\theta-\frac{\pi}{4}\right) \\ \sin \left(\theta-\frac{\pi}{4}\right) & -\cos \frac{\pi}{2} & \log _e\left(\frac{4}{\pi}\right) \\ \cot \left(\theta+\frac{\pi}{4}\right) & \log _e\left(\frac{\pi}{4}\right) & \tan \pi\end{array}\right|$.

Let $p({x})$ be a quadratic polynomial whose roots are the maximum and minimum values of the function $g(\theta)$ and $p(2)=2-\sqrt{2}$. Then, which of the following is/are TRUE?

(A) $p\left(\frac{3+\sqrt{2}}{4}\right)<0$
(B) $p\left(\frac{1+3 \sqrt{2}}{4}\right)>0$
(C) $p\left(\frac{5 \sqrt{2}-1}{4}\right)>0$
(D) $p\left(\frac{5-\sqrt{2}}{4}\right)<0$
0 replies
S_14159
27 minutes ago
0 replies
Assisted perpendicular chasing
sarjinius   3
N an hour ago by ZeroHero
Source: Philippine Mathematical Olympiad 2025 P7
In acute triangle $ABC$ with circumcenter $O$ and orthocenter $H$, let $D$ be an arbitrary point on the circumcircle of triangle $ABC$ such that $D$ does not lie on line $OB$ and that line $OD$ is not parallel to line $BC$. Let $E$ be the point on the circumcircle of triangle $ABC$ such that $DE$ is perpendicular to $BC$, and let $F$ be the point on line $AC$ such that $FA = FE$. Let $P$ and $R$ be the points on the circumcircle of triangle $ABC$ such that $PE$ is a diameter, and $BH$ and $DR$ are parallel. Let $M$ be the midpoint of $DH$.
(a) Show that $AP$ and $BR$ are perpendicular.
(b) Show that $FM$ and $BM$ are perpendicular.
3 replies
sarjinius
Mar 9, 2025
ZeroHero
an hour ago
(a²-b²)(b²-c²) = abc
straight   4
N an hour ago by GreekIdiot
Find all triples of positive integers $(a,b,c)$ such that

\[(a^2-b^2)(b^2-c^2) = abc.\]
If you can't solve this, assume $gcd(a,c) = 1$. If this is still too hard assume in $a \ge b \ge c$ that $b-c$ is a prime.
4 replies
straight
Mar 24, 2025
GreekIdiot
an hour ago
Prove that there are no tuples $(x, y, z)$ sastifying $x^2+y^2-z^2=xyz-2$
Anabcde   2
N an hour ago by IMUKAT
Prove that there are no tuples $(x, y, z) \in \mathbb{Z}^3$ sastifying $x^2+y^2-z^2=xyz-2$
2 replies
1 viewing
Anabcde
3 hours ago
IMUKAT
an hour ago
Functional equations
hanzo.ei   6
N an hour ago by hanzo.ei
Source: Greekldiot
Find all $f: \mathbb R_+ \rightarrow \mathbb R_+$ such that $f(xf(y)+f(x))=yf(x+yf(x)) \: \forall \: x,y \in \mathbb R_+$
6 replies
1 viewing
hanzo.ei
Mar 29, 2025
hanzo.ei
an hour ago
Polynomial
EtacticToe   2
N 2 hours ago by yuribogomolov
Source: Own
Let $f(x)$ be a monic polynomial with integer coefficient. And suppose there exist 4 distinct integer $a,b,c,d$ such that $f(a)=…=f(d)=5$.

Find all $k$ such that $f(k)=8$
2 replies
EtacticToe
Dec 14, 2024
yuribogomolov
2 hours ago
Is this FE solvable?
Mathdreams   2
N 2 hours ago by Mathdreams
Find all $f:\mathbb{R} \rightarrow \mathbb{R}$ such that \[f(2x+y) + f(x+f(2y)) = f(x)f(y) - xy\]for all reals $x$ and $y$.
2 replies
Mathdreams
Yesterday at 6:58 PM
Mathdreams
2 hours ago
inequalities hard
Cobedangiu   3
N 2 hours ago by sqing
problem
3 replies
Cobedangiu
Mar 31, 2025
sqing
2 hours ago
Find the probability
ali3985   0
2 hours ago
Let $A$ be a set of Natural numbers from $1$ to $N$.
Now choose $k$ ($k \geq 3$) distinct elements from this set.

What is the probability of these numbers to be an increasing geometric progression ?
0 replies
ali3985
2 hours ago
0 replies
IMOC 2017 G2 , (ABC) <= (DEF) . perpendiculars related
parmenides51   7
N 3 hours ago by AshAuktober
Source: https://artofproblemsolving.com/community/c6h1740077p11309077
Given two acute triangles $\vartriangle ABC, \vartriangle DEF$. If $AB \ge DE, BC \ge EF$ and $CA \ge FD$, show that the area of $\vartriangle ABC$ is not less than the area of $\vartriangle DEF$
7 replies
parmenides51
Mar 20, 2020
AshAuktober
3 hours ago
The Sums of Elements in Subsets
bobaboby1   3
N 3 hours ago by bobaboby1
Given a finite set \( X = \{x_1, x_2, \ldots, x_n\} \), and the pairwise comparison of the sums of elements of all its subsets (with the empty set defined as having a sum of 0), which amounts to \( \binom{2}{2^n} \) inequalities, these given comparisons satisfy the following three constraints:

1. The sum of elements of any non-empty subset is greater than 0.
2. For any two subsets, removing or adding the same elements does not change their comparison of the sums of elements.
3. For any two disjoint subsets \( A \) and \( B \), if the sums of elements of \( A \) and \( B \) are greater than those of subsets \( C \) and \( D \) respectively, then the sum of elements of the union \( A \cup B \) is greater than that of \( C \cup D \).

The question is: Does there necessarily exist a positive solution \( (x_1, x_2, \ldots, x_n) \) that satisfies all these conditions?
3 replies
bobaboby1
Mar 12, 2025
bobaboby1
3 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
208 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
23 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