We have your learning goals covered with Spring and Summer courses available. Enroll today!

G
Topic
First Poster
Last Poster
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 a March Highlights and 2025 AoPS Online Class Information
jlacosta   0
Mar 2, 2025
March is the month for State MATHCOUNTS competitions! Kudos to everyone who participated in their local chapter competitions and best of luck to all going to State! Join us on March 11th for a Math Jam devoted to our favorite Chapter competition problems! Are you interested in training for MATHCOUNTS? Be sure to check out our AMC 8/MATHCOUNTS Basics and Advanced courses.

Are you ready to level up with Olympiad training? Registration is open with early bird pricing available for our WOOT programs: MathWOOT (Levels 1 and 2), CodeWOOT, PhysicsWOOT, and ChemWOOT. What is WOOT? WOOT stands for Worldwide Online Olympiad Training and is a 7-month high school math Olympiad preparation and testing program that brings together many of the best students from around the world to learn Olympiad problem solving skills. Classes begin in September!

Do you have plans this summer? There are so many options to fit your schedule and goals whether attending a summer camp or taking online classes, it can be a great break from the routine of the school year. Check out our summer courses at AoPS Online, or if you want a math or language arts class that doesn’t have homework, but is an enriching summer experience, our AoPS Virtual Campus summer camps may be just the ticket! We are expanding our locations for our AoPS Academies across the country with 15 locations so far and new campuses opening in Saratoga CA, Johns Creek GA, and the Upper West Side NY. Check out this page for summer camp information.

Be sure to mark your calendars for the following events:
[list][*]March 5th (Wednesday), 4:30pm PT/7:30pm ET, HCSSiM Math Jam 2025. Amber Verser, Assistant Director of the Hampshire College Summer Studies in Mathematics, will host an information session about HCSSiM, a summer program for high school students.
[*]March 6th (Thursday), 4:00pm PT/7:00pm ET, Free Webinar on Math Competitions from elementary through high school. Join us for an enlightening session that demystifies the world of math competitions and helps you make informed decisions about your contest journey.
[*]March 11th (Tuesday), 4:30pm PT/7:30pm ET, 2025 MATHCOUNTS Chapter Discussion MATH JAM. AoPS instructors will discuss some of their favorite problems from the MATHCOUNTS Chapter Competition. All are welcome!
[*]March 13th (Thursday), 4:00pm PT/7:00pm ET, Free Webinar about Summer Camps at the Virtual Campus. Transform your summer into an unforgettable learning adventure! From elementary through high school, we offer dynamic summer camps featuring topics in mathematics, language arts, and competition preparation - all designed to fit your schedule and ignite your passion for learning.[/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, Mar 2 - Jun 22
Friday, Mar 28 - Jul 18
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
Tuesday, Mar 25 - Jul 8
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
Sunday, Mar 23 - Jul 20
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
Sunday, Mar 16 - Jun 8
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
Monday, Mar 17 - Jun 9
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
Sunday, Mar 2 - Jun 22
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
Tuesday, Mar 4 - Aug 12
Sunday, Mar 23 - Sep 21
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
Sunday, Mar 16 - Sep 14
Tuesday, Mar 25 - Sep 2
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
Sunday, Mar 23 - Aug 3
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
Sunday, Mar 16 - Aug 24
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
Wednesday, Mar 5 - May 21
Tuesday, Jun 10 - Aug 26

Calculus
Sunday, Mar 30 - Oct 5
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
Sunday, Mar 23 - Jun 15
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
Tuesday, Mar 4 - May 20
Monday, Mar 31 - Jun 23
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
Monday, Mar 24 - Jun 16
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
Sunday, Mar 30 - Jun 22
Wednesday, May 21 - Aug 6
Sunday, Jun 15 - Sep 14
Monday, Jun 23 - Sep 15

Physics 1: Mechanics
Tuesday, Mar 25 - Sep 2
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
Mar 2, 2025
0 replies
A number theory problem from the British Math Olympiad
Rainbow1971   11
N 4 minutes ago by Rainbow1971
Source: British Math Olympiad, 2006/2007, round 1, problem 6
I am a little surprised to find that I am (so far) unable to solve this little problem:

[quote]Let $n$ be an integer. Show that, if $2 + 2 \sqrt{1+12n^2}$ is an integer, then it is a perfect square.[/quote]

I set $k := \sqrt{1+12n^2}$. If $2 + 2 \sqrt{1+12n^2}$ is an integer, then $k (=\sqrt{1+12n^2})$ is at least rational, so that $1 + 12n^2$ must be a perfect square then. Using Conway's topograph method, I have found out that the smallest non-negative pairs $(n, k)$ for which this happens are $(0,1), (2,7), (28,97)$ and $(390, 1351)$, and that, for every such pair $(n,k)$, the "next" such pair can be calculated as
$$
\begin{bmatrix}
7 & 2 \\
24 & 7 
\end{bmatrix} \begin{bmatrix}
n \\
k 
\end{bmatrix}
.$$The eigenvalues of that matrix are irrational, however, so that any calculation which uses powers of that matrix is a little cumbersome. There must be an easier way, but I cannot find it. Can you?

Thank you.




11 replies
Rainbow1971
Yesterday at 8:39 PM
Rainbow1971
4 minutes ago
f( - f (x) - f (y))= 1 -x - y , in Zxz
parmenides51   6
N 11 minutes ago by Chikara
Source: 2020 Dutch IMO TST 3.3
Find all functions $f: Z \to Z$ that satisfy $$f(-f (x) - f (y))= 1 -x - y$$for all $x, y \in Z$
6 replies
parmenides51
Nov 22, 2020
Chikara
11 minutes ago
Hard limits
Snoop76   2
N 39 minutes ago by maths_enthusiast_0001
$a_n$ and $b_n$ satisfies the following recursion formulas: $a_{0}=1, $ $b_{0}=1$, $ a_{n+1}=a_{n}+b_{n}$$ $ and $ $$ b_{n+1}=(2n+3)b_{n}+a_{n}$. Find $ \lim_{n \to \infty} \frac{a_n}{(2n-1)!!}$ $ $ and $ $ $\lim_{n \to \infty} \frac{b_n}{(2n+1)!!}.$
2 replies
Snoop76
Mar 25, 2025
maths_enthusiast_0001
39 minutes ago
A number theory about divisors which no one fully solved at the contest
nAalniaOMliO   21
N 41 minutes ago by nAalniaOMliO
Source: Belarusian national olympiad 2024
Let's call a pair of positive integers $(k,n)$ interesting if $n$ is composite and for every divisor $d<n$ of $n$ at least one of $d-k$ and $d+k$ is also a divisor of $n$
Find the number of interesting pairs $(k,n)$ with $k \leq 100$
M. Karpuk
21 replies
nAalniaOMliO
Jul 24, 2024
nAalniaOMliO
41 minutes ago
No more topics!
IMO ShortList 2002, geometry problem 5
orl   8
N Jun 11, 2024 by awesomeming327.
Source: IMO ShortList 2002, geometry problem 5
For any set $S$ of five points in the plane, no three of which are collinear, let $M(S)$ and $m(S)$ denote the greatest and smallest areas, respectively, of triangles determined by three points from $S$. What is the minimum possible value of $M(S)/m(S)$ ?
8 replies
orl
Sep 28, 2004
awesomeming327.
Jun 11, 2024
IMO ShortList 2002, geometry problem 5
G H J
Source: IMO ShortList 2002, geometry problem 5
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
orl
3647 posts
#1 • 2 Y
Y by Adventure10, Mango247
For any set $S$ of five points in the plane, no three of which are collinear, let $M(S)$ and $m(S)$ denote the greatest and smallest areas, respectively, of triangles determined by three points from $S$. What is the minimum possible value of $M(S)/m(S)$ ?
Attachments:
This post has been edited 1 time. Last edited by orl, Oct 25, 2004, 12:16 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
orl
3647 posts
#2 • 2 Y
Y by Adventure10, Mango247
Please post your solutions. This is just a solution template to write up your solutions in a nice way and formatted in LaTeX. But maybe your solution is so well written that this is not required finally. For more information and instructions regarding the ISL/ILL problems please look here: introduction for the IMO ShortList/LongList project and regardingsolutions :)
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
grobber
7849 posts
#3 • 3 Y
Y by Adventure10, Mango247, and 1 other user
I think it's achieved for the regular pentagon, so it's $\phi=\frac{1+\sqrt 5}2$.

First of all, let's notice that if it's not a convex pentagon, then we have a point inside a triangle, so that point is inside a triangle formed by the centroid and two vertices of the triangle, so the ratio would be at least $3>\phi$. This means that the pentagons which reach the minimal value are convex.

Furthermore, it's easy to see that, since the pentagon is convex, the triangle with the minimal area is formed by three consecutive vertices, while the one with the largest area is formed by three vertices which are not consecutive.

Assume our pentagon is $ABCDE$, and the triangle with minimal area is $BAE$. Since we can apply an affine transformation which maps $A,B,E$ to three consecutive vertices of a regular pentagon and this transformation preserves the ratios of areas, we may assume there is a regular pentagon $ABC'D'E$. Take $X$ s.t. $C'X\|BD',\ D'X\|EC'$. Since $S(C'AE)\le S(CAE),\ S(D'AB)\le S(DAB)$, and given the convexity of $ABCDE$, at least one of $C,D$ lies inside $C'XD'$ (just draw a picture to see why). Assume it's $D$. We can move $C,D$ along lines parallel to $BD$ s.t. the area of $BCD$ increases, and this time $C,D$ lie on the union of the two segments math=inline]$XC'$[/math, math=inline]$XD'$[/math. It's easy now to see that we can enlarge the area of $BDC$ even more by moving $C,D$ s.t. they reach positions $C',D'$, but this means that the initial area of $BCD$ was smaller that that of $BAE$, and this is a contradiction, so the minimal ratio is reached for regular pentagons.

I know the argument is a bit murky, but it's not that hard to see why it works if you draw a picture.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
math154
4302 posts
#4 • 2 Y
Y by Adventure10, Mango247
grobber wrote:
Furthermore, it's easy to see that, since the pentagon is convex, the triangle with the minimal area is formed by three consecutive vertices, while the one with the largest area is formed by three vertices which are not consecutive.
While this is not necessarily true, the case in which the triangle with largest area consists of three consecutive vertices easily gives a ratio of $\ge 2$.

BTW, another way to deal with this convex case is to affine transform the largest triangle into the golden triangle.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
polya78
105 posts
#5 • 2 Y
Y by Adventure10, Mango247
Indeed, if $ABC$ is the maximal triangle, then if $B'$ is selected so that $ABCB'$ is a parallelogram, then $D,E$ must lie within $AB'C$, which means that $[ADC]+[DEC]\le[ABC]$.

No suppose $ABD$ is the maximal triangle. Take any line $g$ which passes through $B$ and intersects the interior of segment $AD$. Since $ABD$ is maximal, $E$ must lie within $ADB'$, where $ABDB'$ is a parallelogram. So the line through $E$ parallel to $g$ intersects the interior of $AD$ as well. Let $x,y$ be the distances from $B,E$ to $AD$ along an axis parallel to $g$, and let $a,b, y+z$ be the distances from $A,D,E$ to $BC$ along the same axis (positive distances). For the purposes of this problem, we can assume WLOG, $a \le b$. So $x,z \ge a$.

If $\theta$ is the maximal area ratio, then $y/x = [AED]/[ABD] \ge \frac{1}{\theta}$. Also $(z+y)/a =[EBC]/[ABC] \le \theta$, which means that $1+ \frac{1}{\theta}  \le \theta$, and we get the golden ratio solution, with equality in the case of the regular pentagon.

While not really any shorter than the other solutions, I thought I'd post this solution because it does give a sense why the golden ratio is the answer.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
bobthesmartypants
4337 posts
#6 • 3 Y
Y by JasperL, Adventure10, Mango247
Solution with coordinate
solution
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
yayups
1614 posts
#7 • 2 Y
Y by hakN, Mango247
The answer is $\phi=\frac{1+\sqrt{5}}{2}$, achieved for example at a regular pentagon. Suppose for sake of contradiction that we had a set $S$ such that for any two triangle areas $\alpha$ and $\beta$, we have \[\alpha/\beta \in (1/\phi,\phi).\]We have the following claim.

Claim: The convex hull of $S$ has exactly five points.

Proof: First, suppose that it had only three points, say $ABC$, and $DE$ were inside triangle $ABC$. Then, one of $[DAB],[DBC],[DCA]$ is at most $\frac{1}{3}[ABC]$, so we can get a triangle area ratio of at least $3$, which is a contradiction.

Now, suppose that it had four points, say $ABCD$ in that order, with $E$ inside the quadrilateral. One of $[EAB],[EBC],[ECD],[EDA]$ is at most $\frac{1}{4}[ABCD]$, and one of $[ABC]$ and $[CDA]$ is at least $\frac{1}{2}[ABCD]$, so we have a triangle area ratio of at least $2$, which is a contradiction. Thus, the convex hull must have at exactly five points. $\blacksquare$

Suppose the points form a convex pentagon $ABCDE=A_1A_2A_3A_4A_5$ in that order.

Claim: The minimal area triangle is $\triangle A_iA_{i+1}A_{i+2}$ for some $i$ (indices mod $5$).

Proof: Suppose that WLOG $\triangle ABD$ was instead of minimal area, so in particular, $[ABD]\le [ABC],[ABE]$. Let $AB$ be the $x$-axis, with $A$ to the right of $B$. The condition is then saying that the $y$-coordinate of $D$ is at most that of $C$ and $E$.
Figure 1
Note that $D$ has to be in the region bounded by the half plane with line $BC$ on the same side as $A$, the half plane with line $AE$ on the same side as $C$, and the half plane with line $CE$ on the opposite side as $A,B$. This is a convex region, and by cutting with the line $y=N$ for large enough $N$ so that it is above $D$, we get a convex polygon that $D$ must lie in. Thus, the point in this polygon with smallest $y$-coordinate must be one of its vertices, and not on $y=N$ (or potentially $BC\cap AE$, as that is further along ray $BC$ than $C$), so it must be $C$ or $E$. Thus, one of $C$ or $E$ has a lower $y$-coordinate than $D$, which is the desired contradiction. $\blacksquare$

WLOG, let $\triangle ABC$ be of minimal area. Affine transform the picture so that $AB=BC$ and $\angle ABC=3\pi/5$. Note that affine transformations preserve ratios of signed areas, so it preserves that $ABCDE$ is a convex pentagon in that order, that $\triangle ABC$ is of minimal area, and all the unsigned triangle area ratios still lie in $(1/\phi,\phi)$.

So we have a convex pentagon $ABCDE$ in that order such that $AB=BC$ and $\angle ABC=3\pi/5$,$[ABC]$ is the minimal area triangle, and that all triangle area ratios are in $(1/\phi,\phi)$. We will derive a contradiction.
Figure 2
Indeed, complete $ABC$ to a regular pentagon $ABCD'E'$. We see that $[ABD],[ABE]\ge [ABC]$, so $D$ and $E$ lie on the opposite side of $CE'$ as $A,B$, and similarly $D,E$ lie on the opposite side of $AD'$ as $B,C$. Furthermore, $[ABD],[ABE]\le[ABD']$ (else we have an area ratio of $>\phi$), so they lie on the same side of $\ell_1$ as $A,B$, where $\ell_1$ is the line through $D'$ parallel to $AB$. Similarly, $D,E$ lie on the same side of $\ell_2$ as $A,B$ where $\ell_2$ is the line through $E'$ parallel to $BC$. Let $X=AD'\cap CE'$ and $Y=\ell_1\cap\ell_2$.

All of this shows that $D$ and $E$ are in the region $XD'YE'$. For now, imagine that $D$ and $E$ vary over this region. We show that $[ADE]$ is maximized at when $\{D,E\}=\{D',E'\}$. Imagine fixing $D$, and consider a varying line parallel to $AD$. We see that $E$ must be on a line as far from $AD$ as possible, and since the direction of $AD$ is between that of $AD'$ and $AE'$, this implies that $E$ must be one of $D'$ or $E'$ (the direction is to eliminate the possibility of $X$ or $Y$). Now, holding $E$ fixed at that location, varying $D$ shows it must be at the other one of $D'$ or $E'$. Now, going back to the original locations of $D$ and $E$, this shows that \[[ADE]\le[AD'E'] = [ABC],\]so equality must hold (as $\triangle ABC$ is of minimal area), so $\{D,E\}=\{D',E'\}$, so $ABCDE$ is a convex pentagon. The ratio value is now $\phi\not\in(1/\phi,\phi)$, so we have our desired contradiction (finally!).
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
test20
988 posts
#8
Y by
The source of this problem is the following article:

MR0286678
Paul Erdős, Amram Meir, Vera T. Sós, Pál Turán:
On some applications of graph theory. II.
Studies in Pure Mathematics (Presented to Richard Rado) pp. 89–99
Academic Press, London, 1971.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
awesomeming327.
1677 posts
#9
Y by
Clearly, $M(S)/m(S)$ achieves $\tfrac{1+\sqrt{5}}{2}$ when the set $S$ are the vertices of a regular pentagon. Suppose that we can do better. If $S$ is concave, then there exists a point $P$ inside $S'$, the convex hull of $S$. Triangulate $S'$ and find that $P$ lies inside triangle $ABC$. Then, either $[APB],[BPC],$ or $[CPA]$ is at most one-third $[ABC]$ so $M(S)/m(S)>3$.

If $S$ is convex, let the points be $A$, $B$, $C$, $D$, $E$ in counterclockwise order. Let $[ABC]$ be the smallest area out of the five areas
$[ABC],[BCD],[CDA],[DEA],[EAB]$. Then, take the affine transform that takes $A$ to $(-1,0)$, $B$ to $(-1,-1)$ and $C$ to $(0,-1)$. Clearly, $[BCD]\ge 0.5$ implies that $D$ is on or above the $x$-axis. Similarly, $E$ must be on or to the right of the $y$-axis. Now, since convexity is conserved by affine transforms, if $D$ were to the left of the $y$-axis then $E$ would be to the left of the $y$-axos. This can only mean that $D$ and $E$ are both in the first quadrant.

We have
\[\frac{M(S)}{m(S)}<\frac{1+\sqrt5}{2}\implies [ACD],[ACE]<\frac{1+\sqrt5}{4}\]so the distance from $D$ and $E$ to $AC$ is less than $\tfrac{\sqrt{2}+\sqrt{10}}{4}$. That is, both lie below the line $\ell=x+y=\tfrac{\sqrt5-1}{2}$. Let $\ell$ intersect the $x$ and $y$ axes at $X$ and $Y$, respectively. We have $[CDE]<[CXY]<1$ from calculations, which is absurd.
This post has been edited 1 time. Last edited by awesomeming327., Jun 11, 2024, 6:57 PM
Z K Y
N Quick Reply
G
H
=
a