Join our FREE webinar on May 1st to learn about managing anxiety.

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
Great sequence problem
Assassino9931   1
N 2 minutes ago by internationalnick123456
Source: Balkan MO Shortlist 2024 N4
Let $k$ be a positive integer. Determine all sequences $(a_n)_{n\geq 1}$ of positive integers such that
$$ a_{n+2}(a_{n+1} - k) = a_n(a_{n+1} + k) $$for all positive integers $n$.
1 reply
Assassino9931
Apr 27, 2025
internationalnick123456
2 minutes ago
INMO 2018 -- Problem #3
integrated_JRC   44
N 5 minutes ago by bjump
Source: INMO 2018
Let $\Gamma_1$ and $\Gamma_2$ be two circles with respective centres $O_1$ and $O_2$ intersecting in two distinct points $A$ and $B$ such that $\angle{O_1AO_2}$ is an obtuse angle. Let the circumcircle of $\Delta{O_1AO_2}$ intersect $\Gamma_1$ and $\Gamma_2$ respectively in points $C (\neq A)$ and $D (\neq A)$. Let the line $CB$ intersect $\Gamma_2$ in $E$ ; let the line $DB$ intersect $\Gamma_1$ in $F$. Prove that, the points $C, D, E, F$ are concyclic.
44 replies
integrated_JRC
Jan 21, 2018
bjump
5 minutes ago
Very easy NT
GreekIdiot   4
N 7 minutes ago by wipid98
Prove that there exists no natural number $n>1$ such that $n \mid 2^n-1$.
4 replies
GreekIdiot
an hour ago
wipid98
7 minutes ago
Queue geo
vincentwant   0
12 minutes ago
Let $ABC$ be an acute scalene triangle with circumcenter $O$. Let $Y, Z$ be the feet of the altitudes from $B, C$ to $AC, AB$ respectively. Let $D$ be the midpoint of $BC$. Let $\omega_1$ be the circle with diameter $AD$. Let $Q\neq A$ be the intersection of $(ABC)$ and $\omega$. Let $H$ be the orthocenter of $ABC$. Let $K$ be the intersection of $AQ$ and $BC$. Let $l_1,l_2$ be the lines through $Q$ tangent to $\omega,(AYZ)$ respectively. Let $I$ be the intersection of $l_1$ and $KH$. Let $P$ be the intersection of $l_2$ and $YZ$. Let $l$ be the line through $I$ parallel to $HD$ and let $O'$ be the reflection of $O$ across $l$. Prove that $O'P$ is tangent to $(KPQ)$.
0 replies
vincentwant
12 minutes ago
0 replies
Linear colorings mod 2^n
vincentwant   0
13 minutes ago
Let $n$ be a positive integer. The ordered pairs $(x,y)$ where $x,y$ are integers in $[0,2^n)$ are each labeled with a positive integer less than or equal to $2^n$ such that every label is used exactly $2^n$ times and there exist integers $a_1,a_2,\dots,a_{2^n}$ and $b_1,b_2,\dots,b_{2^n}$ such that the following property holds: For any two lattice points $(x_1,y_1)$ and $(x_2,y_2)$ that are both labeled $t$, there exists an integer $k$ such that $x_2-x_1-ka_t$ and $y_2-y_1-kb_t$ are both divisible by $2^n$. How many such labelings exist?
0 replies
vincentwant
13 minutes ago
0 replies
sqrt(n) or n+p (Generalized 2017 IMO/1)
vincentwant   0
15 minutes ago
Let $p$ be an odd prime. Define $f(n)$ over the positive integers as follows:
$$f(n)=\begin{cases}
\sqrt{n}&\text{ if n is a perfect square} \\
n+p&\text{ otherwise}
\end{cases}$$
Let $p$ be chosen such that there exists an ordered pair of positive integers $(n,k)$ where $n>1,p\nmid n$ such that $f^k(n)=n$. Prove that there exists at least three integers $i$ such that $1\leq i\leq k$ and $f^i(n)$ is a perfect square.
0 replies
vincentwant
15 minutes ago
0 replies
Reducibility of 2x^2 cyclotomic
vincentwant   0
16 minutes ago
Let $S$ denote the set of all positive integers less than $1020$ that are relatively prime to $1020$. Let $\omega=\cos\frac{\pi}{510}+i\sin\frac{\pi}{510}$. Is the polynomial $$\prod_{n\in S}(2x^2-\omega^n)$$reducible over the rational numbers, given that it has integer coefficients?
0 replies
vincentwant
16 minutes ago
0 replies
thanks u!
Ruji2018252   0
18 minutes ago
Can you guys tell me if there is any link to look up articles on aops?
0 replies
1 viewing
Ruji2018252
18 minutes ago
0 replies
Movie Collections of Students
Eray   9
N an hour ago by complex2math
Source: Turkey TST 2016 P2
In a class with $23$ students, each pair of students have watched a movie together. Let the set of movies watched by a student be his movie collection. If every student has watched every movie at most once, at least how many different movie collections can these students have?
9 replies
Eray
Apr 10, 2016
complex2math
an hour ago
Something nice
KhuongTrang   26
N an hour ago by KhuongTrang
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}.$$
26 replies
KhuongTrang
Nov 1, 2023
KhuongTrang
an hour ago
Inspired by BMO 2024 SL A4
sqing   0
an hour ago
Source: Own
Let \(a \geq b \geq c \geq 0\) and \(ab + bc + ca = 3\). Prove that
$$2 + \left(2 - \frac{2}{\sqrt{3}}\right) \cdot \frac{(b-c)^2}{b+(\sqrt{2}-1)c} \leq a+b+c$$$$3+ 2\left(2 - \sqrt{3}\right) \cdot \frac{(b-c)^2}{a+b+2(\sqrt{3}-1)c} \leq a+b+c$$
0 replies
sqing
an hour ago
0 replies
Balkan MO Shortlist official booklet
guptaamitu1   9
N an hour ago by envision2017
These days I was trying to find the official booklet of Balkan MO Shortlist. But apparently, there's no big list of all Balkan shortlists for previous years. Through some sources, I have been able to find the official booklet for the following years. So if people have it for other years too, can they please put it on this thread, so that everything is in one place.
[list]
[*] 2021
[*] 2020
[*] 2019
[*] 2018
[*] 2017
[*] 2016
[/list]
9 replies
guptaamitu1
Jun 19, 2022
envision2017
an hour ago
IMO ShortList 2003, combinatorics problem 4
darij grinberg   37
N an hour ago by Maximilian113
Source: Problem 5 of the German pre-TST 2004, written in December 03
Let $x_1,\ldots, x_n$ and $y_1,\ldots, y_n$ be real numbers. Let $A = (a_{ij})_{1\leq i,j\leq n}$ be the matrix with entries \[a_{ij} = \begin{cases}1,&\text{if }x_i + y_j\geq 0;\\0,&\text{if }x_i + y_j < 0.\end{cases}\]Suppose that $B$ is an $n\times n$ matrix with entries $0$, $1$ such that the sum of the elements in each row and each column of $B$ is equal to the corresponding sum for the matrix $A$. Prove that $A=B$.
37 replies
darij grinberg
May 17, 2004
Maximilian113
an hour ago
Geometric inequality with Fermat point
Assassino9931   5
N an hour ago by sqing
Source: Balkan MO Shortlist 2024 G2
Let $ABC$ be an acute triangle and let $P$ be an interior point for it such that $\angle APB = \angle BPC = \angle CPA$. Prove that
$$ \frac{PA^2 + PB^2 + PC^2}{2S} + \frac{4}{\sqrt{3}} \leq \frac{1}{\sin \alpha} + \frac{1}{\sin \beta} + \frac{1}{\sin \gamma}. $$When does equality hold?
5 replies
Assassino9931
Apr 27, 2025
sqing
an hour ago
segments of midpoints of incenters and excenters perpendicular to side
parmenides51   1
N Feb 3, 2020 by GeoMetrix
Source: 2018 Oral Moscow Geometry Olympiad grades 10-11 p4
On the side $AB$ of the triangle $ABC$, point $M$ is selected. In triangle $ACM$ point $I_1$ is the center of the inscribed circle, $J_1$ is the center of excircle wrt side $CM$. In the triangle $BCM$ point $I_2$ is the center of the inscribed circle, $J_2$ is the center of excircle wrt side $CM$. Prove that the line passing through the midpoints of the segments $I_1I_2$ and $J_1J_2$ is perpendicular to $AB$.
1 reply
parmenides51
Jul 25, 2019
GeoMetrix
Feb 3, 2020
segments of midpoints of incenters and excenters perpendicular to side
G H J
G H BBookmark kLocked kLocked NReply
Source: 2018 Oral Moscow Geometry Olympiad grades 10-11 p4
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
parmenides51
30650 posts
#1 • 3 Y
Y by kiyoras_2001, Adventure10, Mango247
On the side $AB$ of the triangle $ABC$, point $M$ is selected. In triangle $ACM$ point $I_1$ is the center of the inscribed circle, $J_1$ is the center of excircle wrt side $CM$. In the triangle $BCM$ point $I_2$ is the center of the inscribed circle, $J_2$ is the center of excircle wrt side $CM$. Prove that the line passing through the midpoints of the segments $I_1I_2$ and $J_1J_2$ is perpendicular to $AB$.
This post has been edited 2 times. Last edited by parmenides51, Apr 11, 2020, 12:13 PM
Reason: typo
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
GeoMetrix
924 posts
#2 • 5 Y
Y by mueller.25, amar_04, AmirKhusrau, MamaChandu, Adventure10
Nice problem. Heres a solution found with amar_04 and mueller.25. Alter the labelling a bit i.e. make $A$ as the apex.
[asy]
 /* Geogebra to Asymptote conversion, documentation at artofproblemsolving.com/Wiki go to User:Azjps/geogebra */
import graph; size(15cm); 
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 = -15.131864028953908, xmax = 20.253735857649307, ymin = -9.714561632147108, ymax = 13.653720890369517;  /* image dimensions */
pen rvwvcq = rgb(0.08235294117647059,0.396078431372549,0.7529411764705882); pen dtsfsf = rgb(0.8274509803921568,0.1843137254901961,0.1843137254901961); pen dbwrru = rgb(0.8588235294117647,0.3803921568627451,0.0784313725490196); pen wvvxds = rgb(0.396078431372549,0.3411764705882353,0.8235294117647058); 
 /* draw figures */
draw((4.619335093416707,7.054662233638681)--(-6.64,-0.51), linewidth(0.4) + rvwvcq); 
draw((-6.64,-0.51)--(7.16,-0.39), linewidth(0.4) + rvwvcq); 
draw((7.16,-0.39)--(4.619335093416707,7.054662233638681), linewidth(0.4) + rvwvcq); 
draw((4.619335093416707,7.054662233638681)--(-0.19913787669058447,-0.45399250327557034), linewidth(0.4)); 
draw((-4.989046817214253,8.22130074168339)--(7.785421206986891,3.9545398495955895), linewidth(0.4) + dtsfsf); 
draw((-4.989046817214253,8.22130074168339)--(-1.1127166413234106,1.2006451493330466), linewidth(0.4) + dtsfsf); 
draw((7.785421206986891,3.9545398495955895)--(3.988370419640953,1.8580657592817953), linewidth(0.4) + dbwrru); 
draw((1.3981871948863192,6.087920295639489)--(1.437826889158771,1.5293554543074208), linewidth(0.4) + wvvxds); 
draw((-1.1127166413234106,1.2006451493330466)--(-0.19913787669058447,-0.45399250327557034), linewidth(0.4) + dtsfsf); 
draw((-0.19913787669058447,-0.45399250327557034)--(3.988370419640953,1.8580657592817953), linewidth(0.4) + linetype("4 4")); 
draw((-4.989046817214253,8.22130074168339)--(7.16,-0.39), linewidth(0.4) + wvvxds); 
draw((-6.64,-0.51)--(7.785421206986891,3.9545398495955895), linewidth(0.4) + wvvxds); 
draw(circle((8.053985450375514,-1.018644062623383), 4.980430200051047), linewidth(0.4) + linetype("4 4")); 
draw(circle((1.437826889158771,1.5293554543074206), 2.5716381482395336), linewidth(0.4) + linetype("4 4")); 
draw((3.083603259288729,2.4993689196212827)--(3.1090345176054646,-0.42522578680343076), linewidth(0.4) + dtsfsf); 
draw(circle((6.13011804457036,3.849612753256479), 5.2346146200537245), linewidth(0.4) + linetype("4 4")); 
draw((-1.1127166413234106,1.2006451493330466)--(3.1090345176054646,-0.42522578680343076), linewidth(0.4) + linetype("4 4") + dbwrru); 
draw((3.988370419640953,1.8580657592817953)--(3.1090345176054646,-0.42522578680343076), linewidth(0.4) + dtsfsf); 
draw((-0.19913787669058447,-0.45399250327557034)--(3.083603259288729,2.4993689196212827), linewidth(0.4) + linetype("4 4")); 
draw((7.785421206986891,3.9545398495955895)--(3.1090345176054646,-0.42522578680343076), linewidth(0.4) + dtsfsf); 
draw((7.785421206986891,3.9545398495955895)--(11.257372438088742,2.7948840655710425), linewidth(0.4) + dtsfsf); 
draw((-1.1127166413234106,1.2006451493330466)--(11.257372438088742,2.7948840655710425), linewidth(0.4) + wvvxds); 
 /* dots and labels */
dot((4.619335093416707,7.054662233638681),dotstyle); 
label("$A$", (4.720836167166338,7.28890844323372), NE * labelscalefactor); 
dot((-6.64,-0.51),dotstyle); 
label("$B$", (-6.538218342207413,-0.2707424416315403), NE * labelscalefactor); 
dot((7.16,-0.39),dotstyle); 
label("$C$", (7.248379016209425,-0.15585413031139958), NE * labelscalefactor); 
dot((-0.19913787669058447,-0.45399250327557034),dotstyle); 
label("$M$", (-0.10447290827955526,-0.22478711710348404), NE * labelscalefactor); 
dot((-4.989046817214253,8.22130074168339),linewidth(4pt) + dotstyle); 
label("$J_2$", (-4.90680432146142,8.414813894171099), NE * labelscalefactor); 
dot((-1.1127166413234106,1.2006451493330466),linewidth(4pt) + dotstyle); 
label("$I_1$", (-1.0235793988406778,1.3836492413784862), NE * labelscalefactor); 
dot((3.988370419640953,1.8580657592817953),linewidth(4pt) + dotstyle); 
label("$I_2$", (4.077461623773552,2.0500014470353025), NE * labelscalefactor); 
dot((7.785421206986891,3.9545398495955895),linewidth(4pt) + dotstyle); 
label("$J_1$", (7.868775897338183,4.140968713061864), NE * labelscalefactor); 
dot((1.3981871948863192,6.087920295639489),linewidth(4pt) + dotstyle); 
label("$M_1$", (1.480985787938381,6.277891303616482), NE * labelscalefactor); 
dot((1.437826889158771,1.5293554543074208),linewidth(4pt) + dotstyle); 
label("$M_2$", (1.5269411124664372,1.7053365130748803), NE * labelscalefactor); 
dot((3.083603259288729,2.4993689196212827),linewidth(4pt) + dotstyle); 
label("$I$", (3.181332795476458,2.6933759904280907), NE * labelscalefactor); 
dot((11.257372438088742,2.7948840655710425),linewidth(4pt) + dotstyle); 
label("$L$", (11.33840289920642,2.969107937596428), NE * labelscalefactor); 
dot((3.1090345176054646,-0.42522578680343076),linewidth(4pt) + dotstyle); 
label("$D$", (3.204310457740486,-0.24776477936751218), NE * labelscalefactor); 
clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); 
 /* end of picture */
[/asy]
Proof: (with amar_04 and mueller.25) Firstly we start of with a claim that is a kinda bazooka for this problem. We name it the incentric bazooka.
Claim: $\angle I_1DB=\angle I_2DI$.
Proof : (given by mueller.25) Let $I$ be the incentre of $ABC$. $\odot(I) \cap BC=D$ and let the incircles of $ABM$ and $ACM$ touch $BC$ at $X$ and $Y$.

[asy] 
/* Geogebra to Asymptote conversion, documentation at artofproblemsolving.com/Wiki go to User:Azjps/geogebra */
import graph; size(11cm); 
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 = -9.86, xmax = 9.86, ymin = -6.25, ymax = 6.25;  /* image dimensions */
pen sexdts = rgb(0.1803921568627451,0.49019607843137253,0.19607843137254902); pen wrwrwr = rgb(0.3803921568627451,0.3803921568627451,0.3803921568627451); pen dtsfsf = rgb(0.8274509803921568,0.1843137254901961,0.1843137254901961); 
 /* draw figures */
draw((-2.64,4.17)--(-5.46,-3.29), linewidth(0.4)); 
draw((-5.46,-3.29)--(4.42,-3.19), linewidth(0.4)); 
draw((4.42,-3.19)--(-2.64,4.17), linewidth(0.4)); 
draw((-2.64,4.17)--(-0.2003694050991509,-3.2367648725212463), linewidth(0.4)); 
draw((-2.760492710585694,-1.4042574548855635)--(-2.7416847224016037,-3.2624866874737015), linewidth(0.4) + sexdts); 
draw((-2.760492710585694,-1.4042574548855635)--(-1.6316803560008093,-3.2512518254655958), linewidth(0.4) + sexdts); 
draw((-1.6316803560008093,-3.2512518254655958)--(0.8942701578595993,-1.707487430439186), linewidth(0.4) + sexdts); 
draw((-0.2003694050991509,-3.2367648725212463)--(-6.937663844801672,1.5857145795784886), linewidth(0.6) + linetype("4 4") + wrwrwr); 
draw((-0.2003694050991509,-3.2367648725212463)--(4.983357551510355,4.005214102940234), linewidth(0.6) + linetype("4 4") + wrwrwr); 
draw((0.8942701578595993,-1.707487430439186)--(0.9096349613016435,-3.225530010513142), linewidth(0.4) + sexdts); 
draw((-5.46,-3.29)--(-1.6581684500135365,-0.6342281370081773), linewidth(0.4) + linetype("4 4") + wrwrwr); 
draw((-1.6581684500135365,-0.6342281370081773)--(4.42,-3.19), linewidth(0.4) + linetype("4 4") + wrwrwr); 
draw(circle((-0.933111276363048,-1.5558724426623756), 1.8336602767852548), linewidth(0.4) + dtsfsf); 
 /* dots and labels */
dot((-2.64,4.17),linewidth(3pt) + dotstyle); 
label("$A$", (-2.56,4.29), NE * labelscalefactor); 
dot((-5.46,-3.29),linewidth(3pt) + dotstyle); 
label("$B$", (-5.8,-3.53), NE * labelscalefactor); 
dot((4.42,-3.19),linewidth(3pt) + dotstyle); 
label("$C$", (4.5,-3.07), NE * labelscalefactor); 
dot((-0.2003694050991509,-3.2367648725212463),linewidth(3pt) + dotstyle); 
label("$M$", (-0.22,-3.63), NE * labelscalefactor); 
dot((-1.6581684500135365,-0.6342281370081773),linewidth(3pt) + dotstyle); 
label("$I$", (-1.58,-0.51), NE * labelscalefactor); 
dot((-1.6316803560008093,-3.2512518254655958),linewidth(3pt) + dotstyle); 
label("$D$", (-1.8,-3.59), NE * labelscalefactor); 
dot((-2.760492710585694,-1.4042574548855635),linewidth(3pt) + dotstyle); 
label("$I_1$", (-2.98,-1.03), NE * labelscalefactor); 
dot((0.8942701578595993,-1.707487430439186),linewidth(3pt) + dotstyle); 
label("$I_2$", (0.98,-2.15), NE * labelscalefactor); 
dot((4.983357551510355,4.005214102940234),linewidth(3pt) + dotstyle); 
label("$J_1$", (5.06,3.69), NE * labelscalefactor); 
dot((-6.937663844801672,1.5857145795784886),linewidth(3pt) + dotstyle); 
label("$J_2$", (-7.38,1.33), NE * labelscalefactor); 
dot((-2.7416847224016037,-3.2624866874737015),linewidth(3pt) + dotstyle); 
label("$X$", (-3.02,-3.65), NE * labelscalefactor); 
dot((0.9096349613016435,-3.225530010513142),linewidth(3pt) + dotstyle); 
label("$Y$", (1,-3.57), NE * labelscalefactor); 
clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); 
 /* end of picture */
[/asy]
This is the notation we use for lengths:
$$BC=a \;\;\; AC=b \;\;\; AB=c \;\;\; AM=d \;\;\; BM=m \;\;\; CM=n \;\;\; s=\frac{a+b+c}{2} \;\;\; I_1X=r_1 \;\;\; I_2Y=r_2$$
We claim that $\triangle I_1XD \sim DYI_2$.
Note that $\angle I_1XD=90^{\circ}=\angle I_2YD$.
Now, we prove $r_1 \cdot r_2 = DX \cdot DY$

$$r_1 \cdot r_2= ((\frac{m+d-c}{2}) \tan{\frac{\angle AMB}{2}}) \cdot ((\frac{n+d-b}{2}) \tan{\frac{\angle AMC}{2}})=\frac{m+d-c}{2} \cdot \frac{n+d-b}{2}=MX \cdot MY $$[The last step follows from the identity $\tan \theta=\tan{90^{\circ} -\theta}$]
$$DX=BD-BX=\frac{a+c-b}{2}-\frac{m+c-d}{2}=\frac{n+d-b}{2}=MY$$$$DY=DM+MY=DM+DX=MX$$This implies $r_1 \cdot r_2 = DX \cdot DY$ which gives us $\triangle I_1DX \sim \triangle DI_2Y$
$$\implies \angle I_1DB=\angle DI_2Y=\angle IDI_2$$$\square$.

Now back to the main problem. Clearly by the incentric bazooka we have that $I_1I_2DM$ is cyclic. By a similiar arguement as the incentric bazooka we can also show that $J_1J_2DM$ is cyclic $\implies D$ is the miquel point of $I_1I_2J_1J_2$. Now let $M_1,M_2$ be the midpoints of $I_1I_2$ and $J_1J_2$. Notice that $M_1,M_2$ are the centres of $\odot(I_1I_2MD),\odot(J_2J_1MD)$ (since $I_1I_2$,$J_1J_2$ are diameters) $\implies M_1M_2\perp DM$ since $DM$ is the radical axis. Done $\blacksquare$.
This post has been edited 3 times. Last edited by GeoMetrix, Feb 3, 2020, 12:48 PM
Z K Y
N Quick Reply
G
H
=
a