Live Discussion!
Game Jam: Tame the Groofle is going on now!

Stay ahead of learning milestones! Enroll in a class over the summer!

G
Topic
First Poster
Last Poster
k a May Highlights and 2025 AoPS Online Class Information
jlacosta   0
May 1, 2025
May is an exciting month! National MATHCOUNTS is the second week of May in Washington D.C. and our Founder, Richard Rusczyk will be presenting a seminar, Preparing Strong Math Students for College and Careers, on May 11th.

Are you interested in working towards MATHCOUNTS and don’t know where to start? We have you covered! If you have taken Prealgebra, then you are ready for MATHCOUNTS/AMC 8 Basics. Already aiming for State or National MATHCOUNTS and harder AMC 8 problems? Then our MATHCOUNTS/AMC 8 Advanced course is for you.

Summer camps are starting next month at the Virtual Campus in math and language arts that are 2 - to 4 - weeks in duration. Spaces are still available - don’t miss your chance to have an enriching summer experience. 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 upcoming events:
[list][*]May 9th, 4:30pm PT/7:30pm ET, Casework 2: Overwhelming Evidence — A Text Adventure, a game where participants will work together to navigate the map, solve puzzles, and win! All are welcome.
[*]May 19th, 4:30pm PT/7:30pm ET, What's Next After Beast Academy?, designed for students finishing Beast Academy and ready for Prealgebra 1.
[*]May 20th, 4:00pm PT/7:00pm ET, Mathcamp 2025 Qualifying Quiz Part 1 Math Jam, Problems 1 to 4, join the Canada/USA Mathcamp staff for this exciting Math Jam, where they discuss solutions to Problems 1 to 4 of the 2025 Mathcamp Qualifying Quiz!
[*]May 21st, 4:00pm PT/7:00pm ET, Mathcamp 2025 Qualifying Quiz Part 2 Math Jam, Problems 5 and 6, Canada/USA Mathcamp staff will discuss solutions to Problems 5 and 6 of the 2025 Mathcamp Qualifying Quiz![/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
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
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, 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
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
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
Tuesday, May 6 - Aug 19
Wednesday, Jun 4 - Sep 17
Sunday, Jun 22 - Oct 19
Friday, Jul 18 - Nov 14

Introduction to Geometry
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

Paradoxes and Infinity
Mon, Tue, Wed, & Thurs, Jul 14 - Jul 16 (meets every day of the week!)

Intermediate: Grades 8-12

Intermediate Algebra
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
Sunday, Jun 1 - Aug 24
Wednesday, Jun 18 - Sep 3

Precalculus
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
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
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

AIME Problem Series A
Thursday, May 22 - Jul 31

AIME Problem Series B
Sunday, Jun 22 - Sep 21

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
Mon, Tue, Wed & Thurs, Jun 23 - Jun 26 (meets every day of the week!)
0 replies
jlacosta
May 1, 2025
0 replies
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
Property of the divisors of k^3 - 2
Scilyse   2
N 9 minutes ago by Assassino9931
Source: KoMaL A. 892
Given two integers, $k$ and $d$ such that $d$ divides $k^3 - 2$. Show that there exists integers $a$, $b$, $c$ satisfying $d = a^3 + 2b^3 + 4c^3 - 6abc$.

Proposed by Csongor Beke and László Bence Simon, Cambridge
2 replies
Scilyse
Jan 13, 2025
Assassino9931
9 minutes ago
Inequality with a,b,c
GeoMorocco   6
N 23 minutes ago by GeoMorocco
Source: Morocco Training
Let $   a,b,c   $ be positive real numbers such that : $   ab+bc+ca=3   $ . Prove that : $$\frac{\sqrt{1+a^2}}{1+ab}+\frac{\sqrt{1+b^2}}{1+bc}+\frac{\sqrt{1+c^2}}{1+ca}\ge \sqrt{\frac{3(a+b+c)}{2}}$$
6 replies
GeoMorocco
Apr 11, 2025
GeoMorocco
23 minutes ago
Centroid, altitudes and medians, and concyclic points
BR1F1SZ   1
N 23 minutes ago by sami1618
Source: Austria National MO Part 1 Problem 2
Let $\triangle{ABC}$ be an acute triangle with $BC > AC$. Let $S$ be the centroid of triangle $ABC$ and let $F$ be the foot of the perpendicular from $C$ to side $AB$. The median $CS$ intersects the circumcircle $\gamma$ of triangle $\triangle{ABC}$ at a second point $P$. Let $M$ be the point where $CS$ intersects $AB$. The line $SF$ intersects the circle $\gamma$ at a point $Q$, such that $F$ lies between $S$ and $Q$. Prove that the points $M,P,Q$ and $F$ lie on a circle.

(Karl Czakler)
1 reply
BR1F1SZ
2 hours ago
sami1618
23 minutes ago
Something nice
KhuongTrang   31
N 28 minutes ago by NguyenVanHoa29
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}.$$
31 replies
KhuongTrang
Nov 1, 2023
NguyenVanHoa29
28 minutes ago
Nordic 2025 P3
anirbanbz   8
N an hour ago by lksb
Source: Nordic 2025
Let $ABC$ be an acute triangle with orthocenter $H$ and circumcenter $O$. Let $E$ and $F$ be points on the line segments $AC$ and $AB$ respectively such that $AEHF$ is a parallelogram. Prove that $\vert OE \vert = \vert OF \vert$.
8 replies
anirbanbz
Mar 25, 2025
lksb
an hour ago
another functional inequality?
Scilyse   32
N an hour ago by ihategeo_1969
Source: 2023 ISL A4
Let $\mathbb R_{>0}$ be the set of positive real numbers. Determine all functions $f \colon \mathbb R_{>0} \to \mathbb R_{>0}$ such that \[x \big(f(x) + f(y)\big) \geqslant \big(f(f(x)) + y\big) f(y)\]for every $x, y \in \mathbb R_{>0}$.
32 replies
Scilyse
Jul 17, 2024
ihategeo_1969
an hour ago
Mount Inequality erupts in all directions!
BR1F1SZ   1
N an hour ago by sami1618
Source: Austria National MO Part 1 Problem 1
Let $a$, $b$ and $c$ be pairwise distinct nonnegative real numbers. Prove that
\[
(a + b + c) \left( \frac{a}{(b - c)^2} + \frac{b}{(c - a)^2} + \frac{c}{(a - b)^2} \right) > 4.
\](Karl Czakler)
1 reply
BR1F1SZ
2 hours ago
sami1618
an hour ago
Division involving difference of squares
BR1F1SZ   1
N an hour ago by grupyorum
Source: Austria National MO Part 1 Problem 4
Determine all integers $n$ that can be written in the form
\[
n = \frac{a^2 - b^2}{b},
\]where $a$ and $b$ are positive integers.

(Walther Janous)
1 reply
BR1F1SZ
2 hours ago
grupyorum
an hour ago
Erasing the difference of two numbers
BR1F1SZ   0
2 hours ago
Source: Austria National MO Part 1 Problem 3
Consider the following game for a positive integer $n$. Initially, the numbers $1, 2, \ldots, n$ are written on a board. In each move, two numbers are selected such that their difference is also present on the board. This difference is then erased from the board. (For example, if the numbers $3,6,11$ and $17$ are on the board, then $3$ can be erased as $6 - 3=3$, or $6$ as $17 - 11=6$, or $11$ as $17 - 6=11$.)

For which values of $n$ is it possible to end with only one number remaining on the board?

(Michael Reitmeir)
0 replies
BR1F1SZ
2 hours ago
0 replies
4 wise men and 100 hats. 3 must guess their numbers
NO_SQUARES   2
N 2 hours ago by NO_SQUARES
Source: 239 MO 2025 10-11 p5
There are four wise men in a row, each sees only those following him in the row, i.e. the $1$st sees the other three, the $2$nd sees the $3$rd and $4$th, and the $3$rd sees only the $4$th. The devil has $100$ hats, numbered from $1$ to $100$, he puts one hat on each wise man, and hides the extra $96$ hats. After that, each wise man (in turn: first the first, then the second, etc.) loudly calls a number, trying to guess the number of his hat. The numbers mentioned should not be repeated. When all the wise men have spoken, they take off their hats and check which one of them has guessed. Can the sages to act in such a way that at least three of them knowingly guessed?
2 replies
NO_SQUARES
6 hours ago
NO_SQUARES
2 hours ago
\sqrt{2-a}+\sqrt{2-b}+\sqrt{2-c}\geqslant 2+\sqrt{(2-a)(2-b)(2-c)}
NO_SQUARES   2
N 2 hours ago by ektorasmiliotis
Source: 239 MO 2025 8-9 p4
Positive numbers $a$, $b$ and $c$ are such that $a^2+b^2+c^2+abc=4$. Prove that \[\sqrt{2-a}+\sqrt{2-b}+\sqrt{2-c}\geqslant 2+\sqrt{(2-a)(2-b)(2-c)}.\]
2 replies
NO_SQUARES
Today at 5:06 PM
ektorasmiliotis
2 hours ago
BMO 2024 SL A4
MuradSafarli   2
N 2 hours ago by GreekIdiot
A4.
Let \(a \geq b \geq c \geq 0\) be real numbers such that \(ab + bc + ca = 3\).
Prove that:
\[
3 + (2 - \sqrt{3}) \cdot \frac{(b-c)^2}{b+(\sqrt{3}-1)c} \leq a+b+c
\]and determine all the cases when the equality occurs.
2 replies
MuradSafarli
Apr 27, 2025
GreekIdiot
2 hours ago
Aime type Geo
ehuseyinyigit   0
2 hours ago
Source: Turkish First Round 2024
In a scalene triangle $ABC$, let $M$ be the midpoint of side $BC$. Let the line perpendicular to $AC$ at point $C$ intersect $AM$ at $N$. If $(BMN)$ is tangent to $AB$ at $B$, find $AB/MA$.
0 replies
ehuseyinyigit
2 hours ago
0 replies
1996 St. Petersburg City Mathematical Olympiad
Sadece_Threv   2
N 3 hours ago by reni_wee
Source: 1996 St. Petersburg City Mathematical Olympiad
Find all positive integers $n$ such that $3^{n-1}+5^{n-1}$ divides $3^{n}+5^{n}$
2 replies
Sadece_Threv
Jul 29, 2024
reni_wee
3 hours ago
Vertices of a convex polygon if and only if m(S) = f(n)
orl   12
N Apr 24, 2025 by Maximilian113
Source: IMO Shortlist 2000, C3
Let $ n \geq 4$ be a fixed positive integer. Given a set $ S = \{P_1, P_2, \ldots, P_n\}$ of $ n$ points in the plane such that no three are collinear and no four concyclic, let $ a_t,$ $ 1 \leq t \leq n,$ be the number of circles $ P_iP_jP_k$ that contain $ P_t$ in their interior, and let \[m(S)=a_1+a_2+\cdots + a_n.\]Prove that there exists a positive integer $ f(n),$ depending only on $ n,$ such that the points of $ S$ are the vertices of a convex polygon if and only if $ m(S) = f(n).$
12 replies
orl
Aug 10, 2008
Maximilian113
Apr 24, 2025
Vertices of a convex polygon if and only if m(S) = f(n)
G H J
Source: IMO Shortlist 2000, C3
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
orl
3647 posts
#1 • 6 Y
Y by Adventure10, junioragd, and 4 other users
Let $ n \geq 4$ be a fixed positive integer. Given a set $ S = \{P_1, P_2, \ldots, P_n\}$ of $ n$ points in the plane such that no three are collinear and no four concyclic, let $ a_t,$ $ 1 \leq t \leq n,$ be the number of circles $ P_iP_jP_k$ that contain $ P_t$ in their interior, and let \[m(S)=a_1+a_2+\cdots + a_n.\]Prove that there exists a positive integer $ f(n),$ depending only on $ n,$ such that the points of $ S$ are the vertices of a convex polygon if and only if $ m(S) = f(n).$
This post has been edited 1 time. Last edited by djmathman, Oct 3, 2016, 3:25 AM
Reason: changed formatting to match imo compendium
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Thjch Ph4 Trjnh
205 posts
#2 • 4 Y
Y by Adventure10, Mango247, and 2 other users
$ f(n) = 2.(_4^n)$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Myth
4464 posts
#3 • 4 Y
Y by Ali3085, Adventure10, Mango247, and 1 other user
It is strange to see such an easy and evident problem in IMO SL.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
SnowEverywhere
801 posts
#4 • 12 Y
Y by Catalanfury, Vaijan_Mama, k12byda5h, DCMaths, Adventure10, Mango247, Stuffybear, winniep008hfi, and 4 other users
We claim that the function $f(n)=2 \binom{n}{4}$ satisfies the requirements.

Let the score $s(a,b,c,d)$ of the four points $P_a$, $P_b$, $P_c$ and $P_d$ be the number of points $P_i$ where $i \in \{a,b,c,d \}$ such that $P_i$ is properly contained in the circle passing through the remaining three points. Observe that

\[m(S) = \sum_{1 \le a<b<c<d \le n} s(a,b,c,d)\]

First we prove the following lemma.

Lemma 1. The score of a convex quadrilateral $2$.

Proof. Let the vertices of the convex quadrilateral be denoted as $A, B, C$ and $D$. We have that point $D$ lies within the circumcircle of $\triangle{ABC}$ if and only if

\[\angle{ABC} > 180 - \angle{ADC} \quad \Leftrightarrow \quad \angle{ABC} + \angle{ADC} > 180\]

Therefore if $D$ lies within the circumcircle of $\triangle{ABC}$, it also follows by symmetry that $B$ lies within the circumcircle of $\triangle{ADC}$. If not, then since the sum of the interior angles of $ABCD$ is $360$,

\[\angle{ABC} + \angle{ADC} < 180 \quad \Rightarrow \quad \angle{BAD} + \angle{ACD} > 180\]

Therefore $A$ lies within the circumcircle of $\triangle{BCD}$ and $C$ lies within the circumcircle of $\triangle{ABD}$. In both cases, the score of $ABCD$ is equal to $2$.

Lemma 2. The score of a concave quadrilateral is $1$.

Proof. Let $ABCD$ denote the concave quadrilateral. Without the loss of generality, let $A$ be such that interior angle $\angle{BAC} > 180$. It follows that $A$ lies in the interior of triangle $\triangle{BCD}$. Therefore, the circumcircle of $\triangle{BCD}$ contains $A$. However, none of the remaining three circles passing through three of the points $A, B, C$ and $D$ contain the remaining point. Hence the score of $ABCD$ is equal to $1$.

If Direction. If the vertices of $S$ form a convex $n$-gon, then each quadrilateral formed by four distinct points in $S$ is a convex quadrilateral and therefore

\[m(S) = \sum_{1 \le a<b<c<d \le n} s(a,b,c,d) = 2 \binom{n}{4}\]

Only If Direction. If the vertices of $S$ form a concave $n$-gon, then at least one of the quadrilaterals formed by four distinct points in $S$ is a concave quadrilateral and therefore

\[m(S) = \sum_{1 \le a<b<c<d \le n} s(a,b,c,d) < 2 \binom{n}{4}\]

The function $f(n)=2 \binom{n}{4}$ therefore satisfies that $m(S)=f(n)$ if and only if the points in $S$ are the vertices of a convex polygon.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
JackXD
151 posts
#5 • 1 Y
Y by Adventure10
Lemma Every quadrilateral $S$ satisfies $m(S) \le 2$ with equality if and only if it is convex,

Proof:If a quadrilateral $ABCD$ is convex then one out of $\angle{ABC}+\angle{ADC}$ and $\angle{DAB}+\angle{DCB}$ is greater than $\pi$ and the other is less than $\pi$.This implies $m(S)=2$.One the other hand if it is concave then clearly $m(S)=1$


Back to our main problem.If S forms a convex polygon then every quadrilateral $P_{i}P_{j}P_{k}P_{l}$ contributes $1$ to two of $a_{i},a_{j},a_{k}$ and $a_{l}$ (from the lemma) and thus contributes two to $m(S)$.This immediately implies $f(n)=2\binom{n}{4}$

Now let $m(S)=f(n)=2\binom{n}{4}$.Each quadrilateral $P_{i}P_{j}P_{k}P_{l}$ contributes atmost $2$ to $f(n)$ and thus $m(S) \le 2\binom{n}{4}$.As there is equality,we have that each quadrilateral contributes exactly $2$ to $f(n)$,hence from the lemma every quadrilateral is convex,implying that $S$ forms a convex polygon.
This post has been edited 3 times. Last edited by JackXD, Jan 7, 2016, 4:22 PM
Reason: xx
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
william122
1576 posts
#6 • 2 Y
Y by Adventure10, Mango247
Note that given any 4 points, they add 2 to the count if their convex hull is a quadrilateral, and 1 otherwise. So, $f(n)=2\binom{n}{2}$, with equality achieved iff all quadruplets of points form convex quadrilaterals. However, if there exists a point $P_i$ inside the convex hull $Q_1,Q_2,\ldots,Q_k$, then it must be in one of the triangles $Q_1Q_2Q_3$, $Q_1Q_3Q_4,\ldots Q_1Q_{k-1}Q_k$, which cover the convex hull. So, there exist 4 points whose convex hull is a triangle. Therefore, the only way equality is reached is if all points are on the convex hull, as desired.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
niyu
830 posts
#7
Y by
The key idea is to consider four-tuples.

Lemma: If $ABCD$ is a non-cyclic convex quadrilateral, $m(ABCD) = 2$.

Proof: Suppose $ABCD$ is convex and non-cyclic. Note that $\angle ABC + \angle ADC \neq \angle BCD + \angle BAD \neq 180^\circ$. Hence, exactly one of these two sums is greater than $180^\circ$. WLOG, suppose $\angle ABC + \angle ADC > 180^\circ$ and $\angle BCD + \angle BAD < 180^\circ$. Since $\angle ABC > 180^\circ - \angle ADC$ it follows that $B$ lies within $(ADC)$. Similarly, $D$ lies within $(ABC)$. Meanwhile, since $\angle BCD < 180^\circ - \angle BAD$, it follows that $A$ does not lie within $(BCD)$, and similarly, $C$ does not lie within $(ABD)$. This implies that $m(ABCD) = 2$, proving the lemma. $\blacksquare$

Lemma: If $ABCD$ is a concave quadrilateral, $m(ABCD) = 1$.

Proof: Say $\angle BAD > 180^\circ$. Since $A$ and $C$ both lie on the same side of $\overline{BD}$, and $\angle BCD < \angle BAD$, it follows that $C$ does not lie within $(ABD)$, while $A$ lies within $(BCD)$. Meanwhile, since $\angle ABC + \angle ADC < 180^\circ$, by the same argument as in the previous lemma we find that $B$ does not lie within $(ACD)$ and that $D$ does not lie within $(ABC)$. Hence, $m(ABCD) = 1$. $\blacksquare$

We now return to the given problem. We claim that $m(S) \leq 2\binom{n}{4}$, and that equality holds iff the points of $S$ form a convex quadrilateral. Indeed, as no four points in $S$ are concyclic, we have
\begin{align*}
	m(S) &= \sum_{1 \leq w < x < y < z \leq n} m(P_wP_xP_yP_z) \\
	&\leq \sum_{1 \leq w < x < y < z \leq n} 2 \\
	&\leq 2\binom{n}{4}.
\end{align*}Equality holds here iff each of the quadrilaterals $P_wP_xP_yP_z$ is convex, which occurs iff the points of $S$ form a cyclic quadrilateral. This completes the proof. $\Box$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
bluelinfish
1449 posts
#8
Y by
Rather easy for a C3.

All angles are in degrees.

Claim: Suppose $Q$ consists of four points $A,B,C,D$. Then $m(Q)$ is $2$ if $A,B,C,D$ form a convex quadrilateral and $1$ otherwise.
Proof. Notice that if $A,B,C,D$ form a convex quadrilateral, then $D$ appears inside the circumcircle of $ABC$, $\angle D$ must be greater than $180-\angle B$, which is equivalent to $\angle B + \angle D >180$. Since exactly one opposite pair of angles sum to greater than $180$ degrees, there will be exactly two points that are contained in the circumcircle of the other three.

If $A,B,C,D$ are not convex, WLOG let $A,B,C$ be the convex hull. Then it is clear that the only point that is contained in the circumcircle of the other three is $D$. $\blacksquare$

The key step is to notice that $$m(S)=\sum_{1\le a<b<c<d\le n} m\left(\{P_a,P_b,P_c,P_d\}\right)$$because both quantities count the amount of ordered pairs containing a single point of $S$ and a set of three points in $S$, with all four points distinct, such that the single point is inside the circumcircle of the three points.

Using our claim, $m(S)$ must be equal to twice the number of four-point subsets of $S$ that consist of points forming a convex quadrilateral plus the four-point subsets of $S$ that do not. Moreover, every subset of four points form a convex quadrilateral iff $S$ does, so $m(S)=2\binom{n}{4}$ iff $S$ forms a convex quadrilateral. We are done.
This post has been edited 1 time. Last edited by bluelinfish, Jan 18, 2022, 10:45 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
awesomeming327.
1712 posts
#9 • 3 Y
Y by Mango247, Mango247, Mango247
Let $m(\{a,b,c,d\})$ be the number $m(S)$ for the quadrilateral $P_aP_bP_cP_d.$ It is easy to see that $m(S)$ is the sum of $m(\{a,b,c,d\})$ for all choices of subset $\{a,b,c,d\} \subseteq S$. Note that $(P_aP_bP_c)$ contains $P_d$ if only $P_d$ lies inside of the angle $P_aP_bP_c$ and $\angle P_b+\angle P_d> 180^\circ.$ Clearly, when $P_aP_bP_cP_d$ then $m(a,b,c,d)=2$ and when it is nonconvex $m(a,b,c,d)=1$. Therefore, $m(S)=2\tbinom{n}4$ if and only if $S$ is convex.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
john0512
4186 posts
#10
Y by
Note that by swapping the order of summation, $m(S)$ is equal to the number of quadruples of points $(A,B,C,D)$ where $D$ is inside $(ABC)$ and $A,B,C$ are unordered.

Claim: Each set of 4 points contributes $2$ if they are convex, and $1$ if they are not.

If $ABCD$ is convex and non-cyclic, then we either have $\angle A+\angle C>180$ or $\angle B+\angle D>180$ but not both. However, since $A$ is inside $(BCD)$ if and only if $\angle A+\angle C>180$, etc, the convex quadriateral contributes $2$. If $D$ is inside $\triangle ABC$, then $D$ will be inside $(ABC)$ but nothing else works.

Thus, the maximum possible value of $m(S)$ is $2{n\choose 4}$, with equality if and only if each quadrilateral is convex, which is the same as saying the entire set is convex. We are done as $f(n)=2{n\choose 4}$.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
asdf334
7585 posts
#11
Y by
For any four points $S'=\{P_a,P_b,P_c,P_d\}$ count the value $m(S')$. Notice this is either $2$ if the convex hull is a quadrilateral (i.e. the points form a convex polygon) and $1$ if the convex hull is a triangle (i.e. there is an interior point).
Clearly $f(n)$ is the sum of $m(S')$ over all such $S'$. Hence the maximum occurs if every convex hull of four points is a quadrilateral. If the points of $S$ are the vertices of a convex polygon this occurs. If the points of $S$ are not the vertices of a convex polygon then triangulate the convex hull. Any interior point is contained in a triangle and for these four points we have $m(S')=1$. $\blacksquare$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
onyqz
195 posts
#12
Y by
storage
solution
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Maximilian113
575 posts
#13
Y by
Observe that in any $4$ points $A, B, C, D,$ if they form a convex polygon there are $2$ pairs of the form $(i, \omega)$ where $i$ is a point from $A, B, C, D$ and $\omega$ is the circumcircle of the other points. However if they form a non-convex polygon there is $1$ only.

Clearly, if we consider all quadruples of points from our $n$ points, and sum up the number of valid pairs, every point, along with a circumcircle it lies in, is counted. In addition, the point and circumcircle pair uniquely determines which quadruple it was counted in, meaning that this count yields a injection and surjection to $m(S),$ so there is a bijection.

Therefore if $x$ quadruples are convex and $y$ are concave, $$m(S) = 2x+y.$$But $x+y=\binom{n}{4}$ so $$m(S)=\binom{n}{4}+x,$$and the desired result follows. QED
Z K Y
N Quick Reply
G
H
=
a