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

G
Topic
First Poster
Last Poster
k a April Highlights and 2025 AoPS Online Class Information
jlacosta   0
Apr 2, 2025
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 22nd (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
Apr 2, 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
\frac{1}{5-2a}
Havu   1
N 2 hours ago by Havu
Let $a,b,c \ge \frac{1}{2}$ and $a^2+b^2+c^2=3$. Find minimum:
\[P=\frac{1}{5-2a}+\frac{1}{5-2b}+\frac{1}{5-2c}.\]
1 reply
Havu
Yesterday at 9:56 AM
Havu
2 hours ago
<DPA+ <AQD =< QIP wanted, incircle circumcircle related
parmenides51   41
N 2 hours ago by Ilikeminecraft
Source: IMo 2019 SL G6
Let $I$ be the incentre of acute-angled triangle $ABC$. Let the incircle meet $BC, CA$, and $AB$ at $D, E$, and $F,$ respectively. Let line $EF$ intersect the circumcircle of the triangle at $P$ and $Q$, such that $F$ lies between $E$ and $P$. Prove that $\angle DPA + \angle AQD =\angle QIP$.

(Slovakia)
41 replies
parmenides51
Sep 22, 2020
Ilikeminecraft
2 hours ago
Pretty hard functional equation
vralex   5
N 2 hours ago by jasperE3
Source: National MO, 9th grade
Find all injective functions $ f:\mathbb{Z} \rightarrow \mathbb{Z} $ so that for every $n$ in $\mathbb{Z} ,  f (f (n))-f(n)-1=0$.
5 replies
vralex
Apr 29, 2020
jasperE3
2 hours ago
Parallelity and equal angles given, wanted an angle equality
BarisKoyuncu   5
N 3 hours ago by SleepyGirraffe
Source: 2022 Turkey JBMO TST P4
Given a convex quadrilateral $ABCD$ such that $m(\widehat{ABC})=m(\widehat{BCD})$. The lines $AD$ and $BC$ intersect at a point $P$ and the line passing through $P$ which is parallel to $AB$, intersects $BD$ at $T$. Prove that
$$m(\widehat{ACB})=m(\widehat{PCT})$$
5 replies
1 viewing
BarisKoyuncu
Mar 15, 2022
SleepyGirraffe
3 hours ago
Cyclic points and concurrency [1st Lemoine circle]
shobber   10
N 4 hours ago by Ilikeminecraft
Source: China TST 2005
Let $\omega$ be the circumcircle of acute triangle $ABC$. Two tangents of $\omega$ from $B$ and $C$ intersect at $P$, $AP$ and $BC$ intersect at $D$. Point $E$, $F$ are on $AC$ and $AB$ such that $DE \parallel BA$ and $DF \parallel CA$.
(1) Prove that $F,B,C,E$ are concyclic.

(2) Denote $A_{1}$ the centre of the circle passing through $F,B,C,E$. $B_{1}$, $C_{1}$ are difined similarly. Prove that $AA_{1}$, $BB_{1}$, $CC_{1}$ are concurrent.
10 replies
shobber
Jun 27, 2006
Ilikeminecraft
4 hours ago
Hard functional equation
Jessey   4
N 4 hours ago by jasperE3
Source: Belarus 2005
Find all functions $f:N -$> $N$ that satisfy $f(m-n+f(n)) = f(m)+f(n)$, for all $m, n$$N$.
4 replies
Jessey
Mar 11, 2020
jasperE3
4 hours ago
Vertices of a convex polygon if and only if m(S) = f(n)
orl   12
N 4 hours ago 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
4 hours ago
Imo Shortlist Problem
Lopes   35
N 4 hours ago by Maximilian113
Source: IMO Shortlist 2000, Problem N4
Find all triplets of positive integers $ (a,m,n)$ such that $ a^m + 1 \mid (a + 1)^n$.
35 replies
Lopes
Feb 27, 2005
Maximilian113
4 hours ago
Inspired by Humberto_Filho
sqing   0
5 hours ago
Source: Own
Let $ a,b\geq 0 $ and $a + b \leq 2$. Prove that
$$\frac{a^2+1}{(( a+ b)^2+1)^2} \geq  \frac{1}{25} $$$$\frac{(a^2+1)(b^2+1)}{((a+b)^2+1)^2} \geq  \frac{4}{25} $$$$ \frac{a^2+1}{(( a+ 2b)^2+1)^2} \geq  \frac{1}{289} $$$$ \frac{a^2+1}{((2a+ b)^2+1)^2} \geq  \frac{5}{289} $$


0 replies
sqing
5 hours ago
0 replies
Inequalities
Scientist10   2
N 5 hours ago by arqady
If $x, y, z \in \mathbb{R}$, then prove that the following inequality holds:
\[
\sum_{\text{cyc}} \sqrt{1 + \left(x\sqrt{1 + y^2} + y\sqrt{1 + x^2}\right)^2} \geq \sum_{\text{cyc}} xy + 2\sum_{\text{cyc}} x
\]
2 replies
Scientist10
Yesterday at 6:36 PM
arqady
5 hours ago
$n$ with $2000$ divisors divides $2^n+1$ (IMO 2000)
Valentin Vornicu   65
N 5 hours ago by ray66
Source: IMO 2000, Problem 5, IMO Shortlist 2000, Problem N3
Does there exist a positive integer $ n$ such that $ n$ has exactly 2000 prime divisors and $ n$ divides $ 2^n + 1$?
65 replies
Valentin Vornicu
Oct 24, 2005
ray66
5 hours ago
Find the smallest of sum of elements
hlminh   0
5 hours ago
Let $S=\{1,2,...,2014\}$ and $X=\{a_1,a_2,...,a_{30}\}$ is a subset of $S$ such that if $a,b\in X,a+b\leq 2014$ then $a+b\in X.$ Find the smallest of $\dfrac{a_1+a_2+\cdots+a_{30}}{30}.$
0 replies
hlminh
5 hours ago
0 replies
Easy IMO 2023 NT
799786   133
N 5 hours ago by Maximilian113
Source: IMO 2023 P1
Determine all composite integers $n>1$ that satisfy the following property: if $d_1$, $d_2$, $\ldots$, $d_k$ are all the positive divisors of $n$ with $1 = d_1 < d_2 < \cdots < d_k = n$, then $d_i$ divides $d_{i+1} + d_{i+2}$ for every $1 \leq i \leq k - 2$.
133 replies
799786
Jul 8, 2023
Maximilian113
5 hours ago
Complicated FE
XAN4   2
N 5 hours ago by cazanova19921
Source: own
Find all solutions for the functional equation $f(xyz)+\sum_{cyc}f(\frac{yz}x)=f(x)\cdot f(y)\cdot f(z)$, in which $f$: $\mathbb R^+\rightarrow\mathbb R^+$
Note: the solution is actually quite obvious - $f(x)=x^n+\frac1{x^n}$, but the proof is important.
Note 2: it is likely that the result can be generalized into a more advanced questions, potentially involving more bash.
2 replies
XAN4
Yesterday at 11:53 AM
cazanova19921
5 hours ago
50 points in plane
pohoatza   12
N Apr 6, 2025 by de-Kirschbaum
Source: JBMO 2007, Bulgaria, problem 3
Given are $50$ points in the plane, no three of them belonging to a same line. Each of these points is colored using one of four given colors. Prove that there is a color and at least $130$ scalene triangles with vertices of that color.
12 replies
pohoatza
Jun 28, 2007
de-Kirschbaum
Apr 6, 2025
50 points in plane
G H J
Source: JBMO 2007, Bulgaria, problem 3
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
pohoatza
1145 posts
#1 • 13 Y
Y by Adventure10, Mathlover_1, OronSH, aidan0626, Blue_banana4, PikaPika999, and 7 other users
Given are $50$ points in the plane, no three of them belonging to a same line. Each of these points is colored using one of four given colors. Prove that there is a color and at least $130$ scalene triangles with vertices of that color.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
bodan
267 posts
#2 • 24 Y
Y by amirmath1995, Catalanfury, Nguyenhuyhoang, silouan, raven_, DepressedCubic, Adventure10, Mathlover_1, Mango247, aidan0626, Blue_banana4, Funcshun840, PikaPika999, kiyoras_2001, and 10 other users
Lemma. Among $n$ points in a plane positioned generally (no three collinear) we have at least $\frac{n(n-1)(n-8)}{6}$ scalene triangles.
Proof. Suppose that $n$ points are fixed and the number of isosceles triangles is $\alpha$. Set $\beta$ to be the number of bases of these triangles (we count three bases for each equilateral and one for each nonequilateral isosceles triangle). Clearly $\beta\geq \alpha$. Then each segment connecting a pair of points can be a base of at most two triangles, as if this is not the case three points will lie on this pairs' perpendicular bisector. Thus there are at most $2{n\choose 2}$ isosceles triangles, yielding that there are at least ${n\choose 3}-2{n\choose 2}=\frac{n(n-1)(n-8)}{6}$ scalene triangles. $\square$


In the problem there are at least $13$ points of the same color and we apply the lemma.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
reveryu
218 posts
#3 • 3 Y
Y by Adventure10, Mango247, PikaPika999
why the fact "there are at most $2{n\choose 2}$ isosceles triangles"
does not imply "#scalene triangle + #acute triangle(except isosceles and equilateral triangle) is at least ${n\choose 3}-2{n\choose 2}=\frac{n(n-1)(n-8)}{6}$ " ??
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
huashiliao2020
1292 posts
#4 • 1 Y
Y by PikaPika999
bodan wrote:
Lemma. Among $n$ points in a plane positioned generally (no three collinear) we have at least $\frac{n(n-1)(n-8)}{6}$ scalene triangles.
Proof. Suppose that $n$ points are fixed and the number of isosceles triangles is $\alpha$. Set $\beta$ to be the number of bases of these triangles (we count three bases for each equilateral and one for each nonequilateral isosceles triangle). Clearly $\beta\geq \alpha$. Then each segment connecting a pair of points can be a base of at most two triangles, as if this is not the case three points will lie on this pairs' perpendicular bisector. Thus there are at most $2{n\choose 2}$ isosceles triangles, yielding that there are at least ${n\choose 3}-2{n\choose 2}=\frac{n(n-1)(n-8)}{6}$ scalene triangles. $\square$


In the problem there are at least $13$ points of the same color and we apply the lemma.


Thanks. I had almost the exact same solution, except one question. Why do you care about “ we count three bases for each equilateral and one for each nonequilateral isosceles triangle”? It seems that already 2 bases of triangles at most x n choose 2 pairs of points to form an isosceles triangle is enough.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
megarnie
5594 posts
#5 • 2 Y
Y by OronSH, PikaPika999
We solve the following problem first:

Given are $13$ points in the plane, no three of them belonging to a same line. Prove that there are at least $130$ scalene triangles with vertices in the plane.

Notice that any edge between two points in the plane can be a base of at most two isosceles triangles (because otherwise we would have $3$ points on the perpendicular bisector). Hence there are at most $\binom{13}{2} \cdot 2 = 256$ isosceles triangles, so at lesat $\binom{13}{3} - 256 = 130$ scalene triangles.



This solves the original problem because there must exist a color with at least $\left\lceil \frac{50}{4} \right\rceil = 13$ points of that color.
This post has been edited 3 times. Last edited by megarnie, Aug 9, 2023, 9:11 PM
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
#6 • 1 Y
Y by PikaPika999
We prove that given 13 points in standard position, there are 130 scalene triangles. This clearly solves the original question.

Note that every base (i.e. two points) gives at most two isosceles triangles, else we have three points along the perpendicular bisector.

Therefore there are at most $\binom{13}{2}\cdot 2=156$ isosceles triangles. At the same time there are $\binom{13}{3}=286$ triangles in total, making 130 non-isosceles AKA scalene triangles. $\blacksquare$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
dolphinday
1325 posts
#8 • 1 Y
Y by PikaPika999
By pigeonhole, there is a color that has at least $13$ points of the same color. This means there are $\binom{13}{3} = 286$ triangles that can be formed.
Let $I$ be the number of isosceles triangles in the $13$ points.
Then each pair of two points can contribute at most $2$ to $I$(due to the collinear condition), so $\binom{13}{2} \cdot 2 = 156$ is the maximum number of isosceles triangles. Then the minimum number of scalene triangles is $130$.
This post has been edited 1 time. Last edited by dolphinday, Dec 9, 2023, 3:09 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
mannshah1211
651 posts
#9 • 1 Y
Y by PikaPika999
By Pigeonhole, some color has at least $13$ points of that color. So, assume there are exactly $13$ points, we'll show that we can find at least $130$ scalene triangles whose vertices all belong to those $13$. First, the total number of triangles is $\binom{13}{3} = 286$. Also, note that for each pair of points $(A, B)$, there are at most two isosceles triangles $ABC$ which have $\overline{AB}$ as a base, since in order for that to happen, $C$ must lie on the perpendicular bisector of $\overline{AB}$, but if three or more $C$ exist, this is a contradiction to the fact that no three points are collinear. So, there are at most $2 \cdot \binom{13}{2} = 156$ isosceles triangles, thus at least $130$ scalene triangles among those $13$ points (basically at least $130$ of that color), so done.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
InterLoop
274 posts
#10 • 1 Y
Y by PikaPika999
smol
solution
This post has been edited 1 time. Last edited by InterLoop, May 1, 2024, 5:00 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
RedFireTruck
4221 posts
#11 • 1 Y
Y by PikaPika999
https://cdn.aops.com/images/b/8/2/b824a1d2347b72751984bb68d01bd220d96d5d63.png
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
kotmhn
58 posts
#12 • 1 Y
Y by PikaPika999
On each base at most 2 isosceles can lie else the collinearity condition is violated.
By PHP 13 dots of same color exist. then at most $2{13 \choose 2} = 156$ isosceles triangles and total triangles equal ${13 \choose 3}=286$ so at least $286-156=50$ triangles.
done
This post has been edited 1 time. Last edited by kotmhn, Aug 13, 2024, 11:14 AM
Reason: arithmetic skill issue
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
ihategeo_1969
205 posts
#13 • 1 Y
Y by PikaPika999
Start with a claim.

Claim: For any $x$ points in the plane (no three collinear), there are atleast \[\binom{x}{3}-2\binom{x}2\]scalene triangles formed by it.
Proof: The maximum number of isosceles triangles by choosing a fixed base is atmost $2$ or else there will be $3$ points on the perpendicular bisector of the base.$\blacksquare$.

And hence choose the colour with atleast $\left \lceil \frac{50}4 \right \rceil=13$ points and the number of scalene triangles it form are atleast \[\binom{13}3-2\binom{13}2=130\]as desired.
This post has been edited 1 time. Last edited by ihategeo_1969, Sep 11, 2024, 8:20 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
de-Kirschbaum
196 posts
#14 • 1 Y
Y by PikaPika999
Note that by pigeonhole there exists a color that repeats at least $13$ times. Then, since there are no three points that are colinear, each line segment drawn in these $13$ points can be the base for at most $2$ isoceles triangles, thus there are at least $\binom{13}{3}-\binom{13}{2}2=130$ scalene triangles with same colored vertices.
Z K Y
N Quick Reply
G
H
=
a