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

G
Topic
First Poster
Last Poster
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
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
Roots of unity problem
Ferid.---.   10
N 8 minutes ago by Avron
Source: Polish MO 2019 P4
Let $n,k,l$ be positive integers.Define injective function $f$ from $\{1,2,\dots,n\}$ to itself such that $f(i)-i\in \{k,-l\}$.Prove that $k+l$ divides $n$.
10 replies
Ferid.---.
May 19, 2019
Avron
8 minutes ago
Coloring
demmy   6
N 19 minutes ago by Kaimiaku
Source: Thailand TST 2015
What is the maximum number of squares in an $8 \times 8$ board that can be colored so that for each square in the board, at most one square adjacent to it is colored.
6 replies
demmy
Dec 2, 2023
Kaimiaku
19 minutes ago
Nice and easy FE on R+
sttsmet   21
N 24 minutes ago by bo18
Source: EMC 2024 Problem 4, Seniors
Find all functions $ f: \mathbb{R}^{+} \to \mathbb{R}^{+}$ such that $f(x+yf(x)) = xf(1+y)$
for all x, y positive reals.
21 replies
sttsmet
Dec 23, 2024
bo18
24 minutes ago
max power of 2 that divides \lceil(1+\sqrt{3})^{2n}\rceil for pos. integer n
parmenides51   2
N 33 minutes ago by Inspector_Maygray
Source: Gulf Mathematical Olympiad GMO 2017 p4
1 - Prove that $55 < (1+\sqrt{3})^4 < 56$ .

2 - Find the largest power of $2$ that divides $\lceil(1+\sqrt{3})^{2n}\rceil$ for the positive integer $n$
2 replies
parmenides51
Aug 23, 2019
Inspector_Maygray
33 minutes ago
Points in general position
AshAuktober   1
N 35 minutes ago by Rdgm
Source: 2025 Nepal ptst p1 of 4
Shining tells Prajit a positive integer $n \ge 2025$. Prajit then tries to place n points such that no four points are concyclic and no $3$ points are collinear in Euclidean plane, such that Shining cannot find a group of three points such that their circumcircle contains none of the other remaining points. Is he always able to do so?

(Prajit Adhikari, Nepal and Shining Sun, USA)
1 reply
AshAuktober
Yesterday at 2:15 PM
Rdgm
35 minutes ago
GMO 2017 #1
m2121   3
N 40 minutes ago by Inspector_Maygray
Source: GMO 2017
1- Find a pair $(m,n)$ of positive integers such that $K = |2^m-3^n|$ in all of this cases :

$a) K=5$
$b) K=11$
$c) K=19$

2-Is there a pair $(m,n)$ of positive integers such that : $$|2^m-3^n| = 2017$$3-Every prime number less than $41$ can be represented in the form $|2^m-3^n|$ by taking an Appropriate pair $(m,n)$
of positive integers. Prove that the number $41$ cannot be represented in the form $|2^m-3^n|$ where $m$ and $n$ are positive integers

4-Note that $2^5+3^2=41$ . The number $53$ is the least prime number that cannot be represented as a sum or an difference of a power of $2$ and a power of $3$ . Prove that the number $53$ cannot be represented in any of the forms $2^m-3^n$ , $3^n-2^m$ , $2^m-3^n$ where $m$ and $n$ are positive integers
3 replies
m2121
Sep 28, 2017
Inspector_Maygray
40 minutes ago
2^a + 3^b + 1 = 6^c
togrulhamidli2011   0
an hour ago
Find all positive integers (a, b, c) such that:

\[
2^a + 3^b + 1 = 6^c
\]
0 replies
togrulhamidli2011
an hour ago
0 replies
Inequality stroke
giangtruong13   0
an hour ago
Let $a,b,c$ be real positive numbers such that: $a+b+c=abc-2$. Prove that $$\sum \frac{1}{\sqrt{ab}} \leq \frac{3}{2} $$
0 replies
giangtruong13
an hour ago
0 replies
Help to prove an inequality
JK1603JK   2
N an hour ago by whwlqkd
Source: unknown
If a,b,c\ge 0: ab+bc+ca=1 then prove \frac{a\left(b+c+2\right)}{bc+2a}+\frac{b\left(c+a+2\right)}{ca+2b}+\frac{c\left(a+b+2\right)}{ab+2c}\ge 3
* Please help me convert it to latex form. Thank you.
2 replies
JK1603JK
2 hours ago
whwlqkd
an hour ago
Perfect Squares, Infinite Integers and Integers
steven_zhang123   0
an hour ago
Source: China TST 2001 Quiz 5 P1
For which integer \( h \), are there infinitely many positive integers \( n \) such that \( \lfloor \sqrt{h^2 + 1} \cdot n \rfloor \) is a perfect square? (Here \( \lfloor x \rfloor \) denotes the integer part of the real number \( x \)?
0 replies
steven_zhang123
an hour ago
0 replies
f(f(x)+y)+f(x+y)=2x+2f(y)
parmenides51   3
N an hour ago by Burmf
Source: 2015 AGCN Competition p1 by bobthesmartypants https://artofproblemsolving.com/community/c5h1128876p5232794
Find all functions $f:\mathbb{R}_{\ge 0}\to \mathbb{R}_{\ge 0}$ satisfying$$f(f(x)+y)+f(x+y)=2x+2f(y)$$
3 replies
parmenides51
Dec 5, 2023
Burmf
an hour ago
2^a + 3^b + 5^c = n!
togrulhamidli2011   2
N 2 hours ago by togrulhamidli2011
\[
\text{Find all non-negative integers } (a, b, c, n) \text{ such that}
\]\[
2^a + 3^b + 5^c = n!
\]
2 replies
togrulhamidli2011
2 hours ago
togrulhamidli2011
2 hours ago
[ELMO1] System of Functional Equations
v_Enhance   27
N 2 hours ago by NicoN9
Source: ELMO 2014, Problem 1, by Evan Chen
Find all triples $(f,g,h)$ of injective functions from the set of real numbers to itself satisfying
\begin{align*}
  f(x+f(y)) &= g(x) + h(y) \\
  g(x+g(y)) &= h(x) + f(y) \\
  h(x+h(y)) &= f(x) + g(y) 
\end{align*}
for all real numbers $x$ and $y$. (We say a function $F$ is injective if $F(a)\neq F(b)$ for any distinct real numbers $a$ and $b$.)

Proposed by Evan Chen
27 replies
v_Enhance
Jun 30, 2014
NicoN9
2 hours ago
Graph Theory in China TST
steven_zhang123   2
N 2 hours ago by steven_zhang123
Source: China TST 2001 Quiz 4 P3
For a positive integer \( n \geq 6 \), find the smallest integer \( S(n) \) such that any graph with \( n \) vertices and at least \( S(n) \) edges must contain at least two disjoint cycles (cycles with no common vertices).
2 replies
steven_zhang123
Today at 5:42 AM
steven_zhang123
2 hours ago
Concurrency in a cyclic hexagon
JustPostChinaTST   15
N May 15, 2024 by everythingpi3141592
Source: 2022 China TST, Test 1, P1 (posting for better LaTeX)
In a cyclic convex hexagon $ABCDEF$, $AB$ and $DC$ intersect at $G$, $AF$ and $DE$ intersect at $H$. Let $M, N$ be the circumcenters of $BCG$ and $EFH$, respectively. Prove that the $BE$, $CF$ and $MN$ are concurrent.
15 replies
JustPostChinaTST
Mar 24, 2022
everythingpi3141592
May 15, 2024
Concurrency in a cyclic hexagon
G H J
G H BBookmark kLocked kLocked NReply
Source: 2022 China TST, Test 1, P1 (posting for better LaTeX)
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
JustPostChinaTST
38 posts
#1 • 4 Y
Y by LoloChen, PHSH, phongzel34-vietnam, farhad.fritl
In a cyclic convex hexagon $ABCDEF$, $AB$ and $DC$ intersect at $G$, $AF$ and $DE$ intersect at $H$. Let $M, N$ be the circumcenters of $BCG$ and $EFH$, respectively. Prove that the $BE$, $CF$ and $MN$ are concurrent.
This post has been edited 1 time. Last edited by JustPostChinaTST, Mar 24, 2022, 9:03 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Tintarn
9022 posts
#2 • 6 Y
Y by kent2207, TheHimMan, Kobayashi, PHSH, Aopamy, GuvercinciHoca
Solution
This post has been edited 1 time. Last edited by Tintarn, Mar 24, 2022, 10:10 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
LoloChen
475 posts
#3
Y by
Here
https://artofproblemsolving.com/community/u800085h2807853p24762198
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
N1RAV
160 posts
#4 • 3 Y
Y by ken3k06, PHSH, Dhruv777
We Complex Bash :)

Obviously the Circumcircle is the unit circle and the Complex Affix of each point is in lower-cases.

The Circumcenter of $\triangle{BCG}$ is given by $m = \frac{bc(a-d)}{ba-cd}$ Proof Similarly $n = \frac{ef(d-a)}{ed-fa}$.

We now find $ \bar{m} = \frac{a-d}{ba-cd}$ and $ \bar{n} = \frac{d-a}{ed-fa}$

Equation of $\overline{BE}$ is $w + \bar{w} be - (b+e) = 0$ and Equation of $\overline{CF}$ is $w + \bar{w} cf - (c+f) = 0$

Equation of line $\overline{MN}$ can be found by the determinant
$$\begin{vmatrix}
w & \bar{w} & 1 \\ 
m & \bar{m} & 1 \\
n & \bar{n} & 1
\end{vmatrix} = 0$$which comes out as $w (ef - da + ba - cd) + \bar{w} ((cd-ba)ef + (da-ef)bc) + (bc(d-a) + ef(a-d)) = 0$

Now the only thing we need to check is that
$$\begin{vmatrix}
ef - da + ba - cd & (cd-ba)ef + (da-ef)bc & bc(d-a) + ef(a-d) \\ 
1 & be & -(b+e) \\
1 & cf & -(c+f)
\end{vmatrix} = 0$$
Which can be done in less than a dozen lines of algebra :blush: (I hope I haven't made any mistake in calculations :P )
This post has been edited 3 times. Last edited by N1RAV, Apr 15, 2022, 3:12 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
ashraful7525
26 posts
#5 • 1 Y
Y by farhad.fritl
Let $T=BE \cap CF$

We use pascal in $ABEDCF$ and we obtain $G, T$ and $H$ are collinear.

Now observe, $\angle MGT= \angle BGM-\angle BGT=90-\angle BCG-\angle ABT+ \angle ETH=90-\angle TED-\angle HFE+\angle ETH=\angle NHE-\angle THD=\angle NHT$

More over, $$\frac{HT}{TG}.\frac{BG}{HE}=\frac{\sin{\angle TED}}{\sin{\angle HTG}}.\frac{\sin{\angle BTG}}{\sin{\angle ABT}}=\frac{\sin{\angle BCG}}{\sin{\angle EFH}}$$$$\Rightarrow \frac{HT}{TG}=\frac{\sin{\angle BCG}}{BG.}\frac{HE}{\sin{\angle EFH}}=\frac{HN}{GM}$$
Combining the angle relation and the ration of the lengths we get $\Delta NHT \sim \Delta MGT$. That leads us to $N, T$ and $M$ being collinear.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Mogmog8
1080 posts
#6 • 2 Y
Y by centslordm, Mango247
We can let $X=\overline{BE}\cap\overline{CF}\cap\overline{GH}$ by Pascal on $ABEDCE.$ Notice \begin{align*}\angle XHN&=\angle XHE-\angle NHE\\&=(\angle BED-\angle EXH)-(90-\angle EFH)\\&=(\angle EBA-\angle BXG)-(90-\angle BCG)\\&=\angle XGB-\angle MGB\\&=\angle XGM.\end{align*}Then by LoS on $\triangle CGX,\triangle FHX$ and extended LoS on $\triangle BCG,\triangle EFH,$ $$\frac{GX}{GM}=\frac{2\sin\angle GBC\sin\angle GCD}{\sin\angle GCX}=\frac{2\sin\angle XFH\sin\angle FEH}{\sin\angle HXF}=\frac{HX}{HN}$$as $\angle CBG=\angle AFC=180-\angle EFH$ and $\angle GCX=\angle FED=180-\angle FEH.$ Hence, $\triangle GMX\sim\triangle HNX.$ $\square$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
guptaamitu1
656 posts
#7 • 5 Y
Y by Dhruv777, GuvercinciHoca, sevket12, TheHimMan, CyclicISLscelesTrapezoid
Let $T = BE \cap CF$. Consider the inversion $\Phi$ at $T$ fixing the circle. Angle chase shows $\angle BH^*C = 180^\circ - \angle BGC$ (where $H^* = \Phi(H)$), i.e. $H \in \odot(BCG)$. So $\Phi$ just swaps $\odot(EFH)$ and $\odot(BCG)$, implying points $N,T,M$ are collinear. $\blacksquare$
[asy]
size(200);
pair A=dir(110),B=dir(50),C=dir(-20),D=dir(-60),E=dir(-140),F=dir(170),T=extension(F,C,E,B),G=extension(A,B,C,D),H=extension(A,F,E,D),N=circumcenter(F,H,E),M=circumcenter(G,B,C);
draw(unitcircle);
dot("$A$",A,dir(A));
dot("$B$",B,dir(B));
dot("$C$",C,dir(C));
dot("$D$",D,dir(D));
dot("$E$",E,dir(E));
dot("$F$",F,dir(F));
dot("$G$",G,dir(G));
dot("$H$",H,dir(H));
dot("$T$",T,dir(-90));
dot("$M$",M,dir(M));
dot("$N$",N,dir(N));
draw(A--G--D--H--A,red);
draw(E--B^^F--C,blue);
draw(N--F--E--N^^M--B--C--M,brown);
draw(N--M,dotted);
[/asy]
Here's another different proof:

Claim 1: $\angle NFE + \angle MBC = \angle FTE$.

Proof: Here by $\widehat{XY}$ we will mean angle subtended by minor arc $XY$ on circumference.
\begin{align*}
\angle FHE + \angle BGC &= \angle AHD + \angle AGD \\
&= 180^\circ - (\angle DAH + \angle ADH ) + 180^\circ - (\angle DAG + \angle ADG) \\
&= 180^\circ - (\widehat{DF} + \widehat{EA}) + 180^\circ - (\widehat{DB} + \widehat{AC}) \\
&= 360^\circ - (180^\circ + \widehat{FE} + \widehat{BC}) \\
&= 180^\circ - (\angle TBF + \angle TFB) \\
&= 180^\circ - \angle FTE 
\end{align*}Since $\angle NFE = 90^\circ - \angle FHE$ and $\angle MBC = 90^\circ - \angle BGC$, so our Claim follows. $\square$


Now we can basically ignore points $A,D,H,G$ and only keep in mind that $N,M$ lie on perpendicular bisectors of segments $FE,BC$ (respectively) and our Claim 1 is satisfied.
Let $K=FN \cap BM$, $X=OM \cap FC$, $Y = ON \cap BE$ and $O$ be circumcenter of $FBCE$. Observe $X,Y \in \odot(BOF)$ as $$\angle FYB = \angle FOB= \angle FXB = \widehat{FB}$$[asy]
size(200);
pair F=dir(110),B=dir(70),C=dir(0),E=dir(-150),O=(0,0),T=extension(E,B,C,F),N=1.2*(E+F),M=extension(O,1/2*(B+C),N,T),K=extension(N,F,M,B),X=extension(O,M,F,C),Y=extension(O,N,E,B);
draw(unitcircle);
dot("$E$",E,dir(E));
dot("$F$",F,dir(F));
dot("$B$",B,dir(B));
dot("$C$",C,dir(C));
dot("$O$",O,dir(-90));
dot("$N$",N,dir(N));
dot("$M$",M,dir(M));
dot("$T$",T,dir(T));
dot("$K$",K,dir(K));
dot("$X$",X,dir(-90));
dot("$Y$",Y,dir(-90));
draw(E--F--C--B--E^^F--Y^^B--X,red);
draw(B--O--N--K--M--O--F,brown);
draw(circumcircle(F,O,B),blue);
draw(N--M,dotted);
[/asy]
Claim 2: $K \in \odot(BOF)$.

Proof: This is just angle chase combined with Claim 1,
\begin{align*}
\angle FKB &= \angle NFT + \angle MBT - \angle FTB \\
&= (\angle NFE + \angle EFT) + (\angle MBC + \angle CBT) - \angle FTB \\
&= (\angle NFE + \angle MBC) + (\angle EFT + \angle CBT) - \angle FTB \\
&= \angle ETF + 2 \angle EFT - \angle FTB \\
&= \angle ETF + \angle EFT - \angle FET \\
&= 180^\circ - 2 \angle FET \\
&= 180^\circ - \angle FOB
\end{align*}proving our Claim. $\square$

By Pascal on $FKBYOX$ w.r.t. $\odot(FOB)$, we obtain points $N,T,M$ are collinear, as desired. $\blacksquare$


Remark: Angle chase shows that this problem is equivalent to Polish Mathematical Olympiad finals 2021 P5
This post has been edited 1 time. Last edited by guptaamitu1, May 18, 2022, 9:43 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
KST2003
173 posts
#8 • 2 Y
Y by thczarif, GeoKing
Suppose that $K = BE \cap CF$, and let $BE$ and $CF$ intersect $(BCG)$ at $E'$ and $F'$. By Reim's theorem, we have $GE' \parallel HE$, $GF' \parallel HF$ and $E'F' \parallel EF$, so $K$ is the homothetic center of $\triangle GE'F'$ and $\triangle HEF$. Since $M$ and $N$ are their respective circumcenters, it follows that $M$, $N$, $K$ are collinear.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
PHSH
60 posts
#9 • 1 Y
Y by Dhruv777
We will basicaly use Pascal's Theorem. Let $A^{*}$ and $D^{*}$ be the antipodals of $A$ and $D,$ respectively, and let $P = {BA^{*}}\cap {D^{*}C} $ and $Q = {D^{*}E} \cap {FA^{*}}.$ Then $M$ and $N$ are the midpoints of $PG$ and $QH,$ respectively.

[asy]
import geometry;
import graph;
size(250);
pair A,B,C,D,E,F,G,H, Ar,Dr,P,Q,M,N,R;
A = dir(130);
B=dir(73);
C = dir(11.1);
D = dir(-70);
E=dir(-115.69);
F = dir(179.97);
G = extension(A,B,C,D);
H = extension(A,F,D,E);
Ar = -A;
Dr = -D;
Q = extension(F,Ar,E,Dr);
P = extension(B,Ar,C,Dr);
M= P*0.5+G*0.5;
N=Q*0.5+H*0.5;
R=extension(B,E,C,F);

draw(unitcircle);

draw(circumcircle(H,F,E),blue);
draw(circumcircle(B,C,G),green);
draw(A--H);
draw(D--H);
draw(A--G);
draw(C--G);
draw(H--Q, dotted+cyan);
draw(G--P, dotted + cyan);
draw(Q--P, dotted + red);
draw(G--H, dotted + red);
draw(E--Dr, dotted +magenta);
draw(F--Ar, dotted +magenta);
draw(B--Ar, dotted +magenta);
draw(C--Dr,dotted +magenta);
draw(B--E);
draw(C--F);
dot("$R$", R, dir(R));
dot("$A$", A, dir(A));
dot("$B$", B, dir(B));
dot("$C$", C, dir(-125));
dot("$D$", D, dir(D));
dot("$E$", E, dir(-70));
dot("$F$", F, dir(135));
dot("$M$", M, dir(135));
dot("$N$",N, dir(-80));
dot("$A^{*}$", Ar, dir(Ar));
dot("$D^{*}$", Dr, dir(Dr));
dot("$P$", P, dir(P));
dot("$Q$", Q, dir(Q));
dot("$G$", G, dir(G));
dot("$H$", H, dir(H));
[/asy]

Now, let $R = BE \cap CF.$ Applying Pascal's Theorem at $ABCDEF$ yelds that $R,G$ and $H$ are colinear. On the other hand, by applying Pascal's Theorem again at $BA^{*}FCD^{*}E$ we get that $P,R$ and $Q$ are colinear.

Hence, in order to show that $M,R$ and $N$ are colinear, it is sufficient(and necessary) to show that $GM \parallel NH.$ That is just angle chasing; we have
$$ \measuredangle (NH, ED) = \frac{\pi}{2} + \measuredangle (HF, FE) = \frac{\pi}{2} + \measuredangle AFE$$similarly,
$$ \measuredangle (GM, AB) = \frac{\pi}{2} - \measuredangle DCB$$Hence $$\measuredangle (NH, ED) +  \measuredangle (GM, AB) \measuredangle AFE - \measuredangle DCB = \measuredangle (AB,DE)$$and indeed $GM \parallel HN. \square$
This post has been edited 1 time. Last edited by PHSH, Jul 8, 2022, 7:09 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
S.Ragnork1729
212 posts
#11 • 1 Y
Y by farhad.fritl
Solution : Let $X=BE \cap CF$
By using Pascal's theorem in $ABEDCF$ and we shall get $G, X$ and $H$ as collinear.

Now observe that, $\angle MGX= \angle BGM-\angle BGX=90-\angle BCG-\angle ABX+ \angle EXH=90-\angle XED-\angle HFE+\angle EXH=\angle NHE-\angle XHD=\angle NHX$
Again, $$\frac{HX}{XG}.\frac{BG}{HE}=\frac{\sin{\angle XED}}{\sin{\angle HXG}}.\frac{\sin{\angle BXG}}{\sin{\angle ABX}}=\frac{\sin{\angle BCG}}{\sin{\angle EFH}}$$$$\Rightarrow \frac{HX}{XG}=\frac{\sin{\angle BCG}}{BG.}\frac{HE}{\sin{\angle EFH}}=\frac{HN}{GM}$$
Combining the angle relation and the ration of the lengths we get $\Delta NHX \sim \Delta MGX$. That leads us to $N, X$ and $M$ being collinear.
Therefore $BE,CF$ and $MN$ are concurrent.
This post has been edited 2 times. Last edited by S.Ragnork1729, Jan 3, 2023, 2:23 PM
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
#12
Y by
Let $X=BE\cap CF$ and let $O$ be the center of the circle, so our goal is to show $M,X,N$ collinear. We use moving points. Begin by keeping all points but $A$ fixed, and extend all definitions to degenerate cases through continuity.

As we slide $A$ projectively on the circle, we define $M$ to be the intersection of the perpendicular bisector of $BC$ and of $CG$. Note that $G$ varies projectively, so the perpendicular bisector of $CG$ varies projectively in the pencil through $\infty_{CD^\perp}$, so $M$ varies projectively on the perpendicular bisector of $BC$. A similar argument shows that $N$ varies projectively on the perpendicular bisector of $EF$. Thus, $XM$ and $XN$ both vary projectively on the pencil through $X$, so it suffices to check the problem for three values of $A$.

The problem is trivial when $A=D$, as $M=N=O$. Therefore, it suffices to solve it when $A=C$, as the case $A=E$ will then follow by symmetry. Thus, we have entirely reduced to the case of $A=C$.

The problem when $A=C$ reads as follows. Let $BCEF$ be a cyclic quadrilateral with center $O$, and let $X=BE\cap CF$. Let $D$ vary on the circle. Let $M$ be the intersection of the perpendicular bisector of $BC$ and the line through $C$ perpendicular to $CD$. Let $H=CF\cap DE$ and let $H$ be the intersection of the perpendicular bisectors of $EF$ and $FH$. Show that $X,M,N$ collinear.

We solve this problem by varying $D$ projectively. By the same logic as before, $N$ varies projectively, and $M$ varies projectively as the line through $C$ perpendicular to $CD$ varies projectively on the pencil through $C$. Thus, it suffices to check three values of $D$.

As before, the case $D=C$ is trivial, since $M=N=O$. When $D=B$, we see that $M=\infty_{BC^\perp}$ and $N$ is the circumcenter of $XFE$ (as $H=X$), so the problem is true by the fact that $XEF\sim XCB$ and that the circumcenter and orthocenter are isogonal conjugates.

When $D=F$, we see that $N$ is the intersection of the line through $F$ perpendicular to $CF$ and the perpendicular bisector of $EF$, and $M$ is the intersection of the line through $C$ perpendicular to $CF$ and the perpendicular bisector of $BC$. Thus, by the same similarity idea as above, the problem reduces to the following:

Let $XBC$ be a triangle, and let $M$ be the intersection of the line through $C$ perpendicular to $XC$ and the perpendicular bisector of $BC$, and let $N'$ be defined similarly with $B$ and $C$ swapped. Show $XM$ and $XN'$ are isogonal in $\angle BXC$.

This follows by $\sqrt{bc}$ inversion at $X$, since the circle through $B$ and $C$ tangent to $XB$ gets mapped to the circle through $B$ and $C$ tangent to $XC$, so their corresponding circumcenters, i.e. $M$ and $N'$, are isogonal, as desired.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
starchan
1601 posts
#13 • 1 Y
Y by mathscrazy
solution
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
CyclicISLscelesTrapezoid
371 posts
#14
Y by
I wasn't desperate enough to use inversion so I came up with this instead. Let $\measuredangle$ denote directed angles modulo $180^\circ$.

We have \[\measuredangle BGC+\measuredangle EHF=\measuredangle BAF+\measuredangle EDC=\measuredangle BCX+\measuredangle XBC=\measuredangle BXC.\]Since $XBC \sim XFE$, we can compose a reflection over a line through $X$ and a dilation at $X$ such that the resulting transformation maps $F$ to $B$ and $E$ to $C$. Suppose that this transformation maps $N$ to $N'$. It suffices to show that $\overline{XM}$ and $\overline{XN}$ are isogonal with respect to $\angle BXC$. Observe the following lemma.

Lemma: Let $P$ and $Q$ be points on the perpendicular bisector of $\triangle ABC$. Then, $P$ and $Q$ are inverses with respect to the circumcircle of $ABC$ if and only if $\overline{AP}$ and $\overline{AQ}$ are isogonal with respect to $\angle BAC$.

Proof: Let $O$ be the circumcenter of $ABC$. For the if direction, we will prove that $\measuredangle OPA=\measuredangle QAO$, which suffices. Since the $A$-altitude and $\overline{AO}$ are isogonal with respect to $ABC$, the directed angle between the $A$-altitude and $\overline{AP}$ is equal to the directed angle between $\overline{AQ}$ and $\overline{AO}$. Since $\overline{PQ}$ is parallel to the $A$-altitude, we have $\measuredangle OPA=\measuredangle QAO$, as desired. The converse is clear by uniqueness. $\square$

If $O$ is the circumcenter of $BCX$, we have \[\measuredangle BMO=\measuredangle BGC=\measuredangle BXC+\measuredangle FHE=\measuredangle BOM+\measuredangle ON'B=\measuredangle OBN',\]so $M$ and $N'$ are inverses with respect to the circumcircle of $BCX$, as desired. $\square$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
math_comb01
659 posts
#15
Y by
[asy] /* Geogebra to Asymptote conversion, documentation at artofproblemsolving.com/Wiki go to User:Azjps/geogebra */
import graph; size(12cm); 
real labelscalefactor = 0.5; /* changes label-to-point distance */
pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); /* default pen style */ 
pen dotstyle = black; /* point style */ 
real xmin = -11.846109032258052, xmax = 15.708729054374183, ymin = -7.27546163156413, ymax = 6.765737157794893;  /* image dimensions */
pen fuqqzz = rgb(0.9568627450980393,0,0.6); pen ffvvqq = rgb(1,0.3333333333333333,0); 
 /* draw figures */
draw(circle((0.45269760075919907,-1.8833432923747244), 3.7801918556637735), linewidth(2)); 
draw(circle((0.45269760075919996,-1.8833432923747244), 3.7801918556637726), linewidth(0.4)); 
draw((xmin, -0.4614874235435215*xmin-5.131959835926818)--(xmax, -0.4614874235435215*xmax-5.131959835926818), linewidth(0.4)); /* line */
draw((xmin, 0.8516129032258101*xmin + 2.3321262456524723)--(xmax, 0.8516129032258101*xmax + 2.3321262456524723), linewidth(0.4)); /* line */
draw((xmin, -0.45745723368333807*xmin + 1.3680219871147685)--(xmax, -0.45745723368333807*xmax + 1.3680219871147685), linewidth(0.4)); /* line */
draw((xmin, 0.5740907879410247*xmin-6.218526721815619)--(xmax, 0.5740907879410247*xmax-6.218526721815619), linewidth(0.4)); /* line */
draw((-2.900396276482841,-0.13788864786840901)--(-2.774749537546841,-3.851447820865748), linewidth(0.4)); 
draw((3.9451313646220614,-0.43670689346261216)--(3.375447508457395,-4.280713402031743), linewidth(0.4)); 
draw(circle((-3.6958844426792545,-2.0237088502354235), 2.0467338024799657), linewidth(0.4)); 
draw(circle((5.03418858344353,-2.5623227488821447), 2.3883652130019946), linewidth(0.4) + fuqqzz); 
draw((-3.6958844426792545,-2.0237088502354235)--(5.03418858344353,-2.5623227488821447), linewidth(0.4)); 
draw((-2.900396276482841,-0.13788864786840901)--(3.375447508457395,-4.280713402031743), linewidth(0.4)); 
draw((-2.774749537546841,-3.851447820865748)--(3.9451313646220614,-0.43670689346261216), linewidth(0.4)); 
draw((-3.6958844426792545,-2.0237088502354235)--(0.45269760075919996,-1.8833432923747244), linewidth(0.4)); 
draw((0.45269760075919996,-1.8833432923747244)--(5.03418858344353,-2.5623227488821447), linewidth(0.4)); 
draw((-0.7364802170295132,1.7049301898595939)--(1.0492369130972348,-5.616169475638818), linewidth(0.4)); 
draw((xmin, 0.03929459568935406*xmin-2.2853532031665322)--(xmax, 0.03929459568935406*xmax-2.2853532031665322), linewidth(0.4)); /* line */
draw((-5.684322766062706,-2.5087163680267555)--(-3.6958844426792545,-2.0237088502354235), linewidth(0.4)); 
draw((5.03418858344353,-2.5623227488821447)--(7.354527903590921,-1.9963600027088542), linewidth(0.4)); 
draw(circle((2.694637471341226,1.5129057014699254), 5.8334830610106), linewidth(0.4) + ffvvqq); 
 /* dots and labels */
dot((-0.7364802170295132,1.7049301898595939),dotstyle); 
label("$A$", (-0.6456152002838303,1.9162479805451729), NE * labelscalefactor); 
dot((-2.900396276482841,-0.13788864786840901),dotstyle); 
label("$B$", (-2.8167254177136165,0.06978975824507017), NE * labelscalefactor); 
dot((-2.774749537546841,-3.851447820865748),dotstyle); 
label("$C$", (-2.6949809195399834,-3.6434174360507408), NE * labelscalefactor); 
dot((1.0492369130972348,-5.616169475638818),dotstyle); 
label("$D$", (0.9370632759733968,-5.286968161394788), NE * labelscalefactor); 
dot((3.375447508457395,-4.280713402031743),dotstyle); 
label("$E$", (3.4531162382284757,-4.069523179658457), NE * labelscalefactor); 
dot((3.9451313646220614,-0.43670689346261216),dotstyle); 
label("$F$", (4.021257229705429,-0.23457148718901272), NE * labelscalefactor); 
dot((-5.684322766062706,-2.5087163680267555),linewidth(4pt) + dotstyle); 
label("$G$", (-5.596558126011566,-2.3448094555319874), NE * labelscalefactor); 
dot((7.354527903590921,-1.9963600027088542),linewidth(4pt) + dotstyle); 
label("$H$", (7.430103178567149,-1.837540713141849), NE * labelscalefactor); 
dot((-3.6958844426792545,-2.0237088502354235),linewidth(4pt) + dotstyle); 
label("$M$", (-3.60806465584223,-1.8578314628374546), NE * labelscalefactor); 
dot((5.03418858344353,-2.5623227488821447),linewidth(4pt) + dotstyle); 
label("$N$", (5.116957713268125,-2.4056817046188037), NE * labelscalefactor); 
dot((0.45269760075919996,-1.8833432923747244),linewidth(4pt) + dotstyle); 
label("$O$", (0.5312482820612873,-1.715796214968216), NE * labelscalefactor); 
dot((0.33291750702024897,-2.272271344330264),linewidth(4pt) + dotstyle); 
label("$I$", (0.12543328814917776,-2.4259724543144094), NE * labelscalefactor); 
dot((-1.6755196242868575,-2.3511920693724626),linewidth(4pt) + dotstyle); 
label("$J$", (-1.5992804359772876,-2.1824834579671433), NE * labelscalefactor); 
clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); 
 /* end of picture */[/asy]
By Pascal, $G-I-H$
Let $J = (BGC) \cap GH$
$\measuredangle BJH = \measuredangle BCD = \measuredangle BEH$, so $BJEH$ is cyclic
Invert at $I$ with radius $\sqrt{IA \cdot ID}$ the small circles swap and hence we are done.
This post has been edited 1 time. Last edited by math_comb01, Dec 3, 2023, 7:22 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
asdf334
7577 posts
#16 • 1 Y
Y by IAmTheHazard
Having seen 2021 IMO 3 makes this really easy... (the idea is literally identical making it a 1 minute solve)

Pascal's on $AFCDEB$ means that $X=BE\cap CF$ is on $GH$. Define $Y=(EFH)\cap GH$, now
\[\measuredangle FYG=\measuredangle FYH=\measuredangle FEH=\measuredangle FCD=\measuredangle FCG\]hence $F,Y,C,G$ concyclic.

The point is that there is a negative inversion at $X$ with radius
\[\sqrt{XF\cdot XC}=\sqrt{XB\cdot XE}=\sqrt{XY\cdot XG}\]hence circles $(FYE)=(EFH)$ and $(BCG)$ are swapped, so the circumcenters are collinear with $X$. Done!
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
everythingpi3141592
83 posts
#17 • 2 Y
Y by GeoKing, MihaiT
Mimics a proof shared by math_comb01 for Pascals.

Construct circumcircles of $HEF$ and $BCG$. Then, let the former intersect $CF$ and $BE$ again at $F'$ and $E'$ respectively. By Reims, $E'F'$ and $BC$ are parallel.

Also, $\measuredangle F'E'H = \measuredangle F'FH = \measuredangle AFC = \measuredangle ABC = \measuredangle GBC$, and similarly, $\measuredangle E'F'H = \measuredangle GCB$, and so the two circles are homothetic, with homotethy centre $BE \cap CF$, and we are done.
Z K Y
N Quick Reply
G
H
=
a