Happy Memorial Day! Please note that AoPS Online is closed May 24-26th.

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

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

Summer camps are starting next month at the Virtual Campus in math and language arts that are 2 - to 4 - weeks in duration. Spaces are still available - don’t miss your chance to have an enriching summer experience. There are middle and high school competition math camps as well as Math Beasts camps that review key topics coupled with fun explorations covering areas such as graph theory (Math Beasts Camp 6), cryptography (Math Beasts Camp 7-8), and topology (Math Beasts Camp 8-9)!

Be sure to mark your calendars for the following upcoming events:
[list][*]May 9th, 4:30pm PT/7:30pm ET, Casework 2: Overwhelming Evidence — A Text Adventure, a game where participants will work together to navigate the map, solve puzzles, and win! All are welcome.
[*]May 19th, 4:30pm PT/7:30pm ET, What's Next After Beast Academy?, designed for students finishing Beast Academy and ready for Prealgebra 1.
[*]May 20th, 4:00pm PT/7:00pm ET, Mathcamp 2025 Qualifying Quiz Part 1 Math Jam, Problems 1 to 4, join the Canada/USA Mathcamp staff for this exciting Math Jam, where they discuss solutions to Problems 1 to 4 of the 2025 Mathcamp Qualifying Quiz!
[*]May 21st, 4:00pm PT/7:00pm ET, Mathcamp 2025 Qualifying Quiz Part 2 Math Jam, Problems 5 and 6, Canada/USA Mathcamp staff will discuss solutions to Problems 5 and 6 of the 2025 Mathcamp Qualifying Quiz![/list]
Our full course list for upcoming classes is below:
All classes run 7:30pm-8:45pm ET/4:30pm - 5:45pm PT unless otherwise noted.

Introductory: Grades 5-10

Prealgebra 1 Self-Paced

Prealgebra 1
Tuesday, May 13 - Aug 26
Thursday, May 29 - Sep 11
Sunday, Jun 15 - Oct 12
Monday, Jun 30 - Oct 20
Wednesday, Jul 16 - Oct 29

Prealgebra 2 Self-Paced

Prealgebra 2
Wednesday, May 7 - Aug 20
Monday, Jun 2 - Sep 22
Sunday, Jun 29 - Oct 26
Friday, Jul 25 - Nov 21

Introduction to Algebra A Self-Paced

Introduction to Algebra A
Sunday, May 11 - Sep 14 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Wednesday, May 14 - Aug 27
Friday, May 30 - Sep 26
Monday, Jun 2 - Sep 22
Sunday, Jun 15 - Oct 12
Thursday, Jun 26 - Oct 9
Tuesday, Jul 15 - Oct 28

Introduction to Counting & Probability Self-Paced

Introduction to Counting & Probability
Thursday, May 15 - Jul 31
Sunday, Jun 1 - Aug 24
Thursday, Jun 12 - Aug 28
Wednesday, Jul 9 - Sep 24
Sunday, Jul 27 - Oct 19

Introduction to Number Theory
Friday, May 9 - Aug 1
Wednesday, May 21 - Aug 6
Monday, Jun 9 - Aug 25
Sunday, Jun 15 - Sep 14
Tuesday, Jul 15 - Sep 30

Introduction to Algebra B Self-Paced

Introduction to Algebra B
Tuesday, May 6 - Aug 19
Wednesday, Jun 4 - Sep 17
Sunday, Jun 22 - Oct 19
Friday, Jul 18 - Nov 14

Introduction to Geometry
Sunday, May 11 - Nov 9
Tuesday, May 20 - Oct 28
Monday, Jun 16 - Dec 8
Friday, Jun 20 - Jan 9
Sunday, Jun 29 - Jan 11
Monday, Jul 14 - Jan 19

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

Intermediate: Grades 8-12

Intermediate Algebra
Sunday, Jun 1 - Nov 23
Tuesday, Jun 10 - Nov 18
Wednesday, Jun 25 - Dec 10
Sunday, Jul 13 - Jan 18
Thursday, Jul 24 - Jan 22

Intermediate Counting & Probability
Wednesday, May 21 - Sep 17
Sunday, Jun 22 - Nov 2

Intermediate Number Theory
Sunday, Jun 1 - Aug 24
Wednesday, Jun 18 - Sep 3

Precalculus
Friday, May 16 - Oct 24
Sunday, Jun 1 - Nov 9
Monday, Jun 30 - Dec 8

Advanced: Grades 9-12

Olympiad Geometry
Tuesday, Jun 10 - Aug 26

Calculus
Tuesday, May 27 - Nov 11
Wednesday, Jun 25 - Dec 17

Group Theory
Thursday, Jun 12 - Sep 11

Contest Preparation: Grades 6-12

MATHCOUNTS/AMC 8 Basics
Friday, May 23 - Aug 15
Monday, Jun 2 - Aug 18
Thursday, Jun 12 - Aug 28
Sunday, Jun 22 - Sep 21
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)

MATHCOUNTS/AMC 8 Advanced
Sunday, May 11 - Aug 10
Tuesday, May 27 - Aug 12
Wednesday, Jun 11 - Aug 27
Sunday, Jun 22 - Sep 21
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)

AMC 10 Problem Series
Friday, May 9 - Aug 1
Sunday, Jun 1 - Aug 24
Thursday, Jun 12 - Aug 28
Tuesday, Jun 17 - Sep 2
Sunday, Jun 22 - Sep 21 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Monday, Jun 23 - Sep 15
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)

AMC 10 Final Fives
Sunday, May 11 - Jun 8
Tuesday, May 27 - Jun 17
Monday, Jun 30 - Jul 21

AMC 12 Problem Series
Tuesday, May 27 - Aug 12
Thursday, Jun 12 - Aug 28
Sunday, Jun 22 - Sep 21
Wednesday, Aug 6 - Oct 22

AMC 12 Final Fives
Sunday, May 18 - Jun 15

AIME Problem Series A
Thursday, May 22 - Jul 31

AIME Problem Series B
Sunday, Jun 22 - Sep 21

F=ma Problem Series
Wednesday, Jun 11 - Aug 27

WOOT Programs
Visit the pages linked for full schedule details for each of these programs!


MathWOOT Level 1
MathWOOT Level 2
ChemWOOT
CodeWOOT
PhysicsWOOT

Programming

Introduction to Programming with Python
Thursday, May 22 - Aug 7
Sunday, Jun 15 - Sep 14 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Tuesday, Jun 17 - Sep 2
Monday, Jun 30 - Sep 22

Intermediate Programming with Python
Sunday, Jun 1 - Aug 24
Monday, Jun 30 - Sep 22

USACO Bronze Problem Series
Tuesday, May 13 - Jul 29
Sunday, Jun 22 - Sep 1

Physics

Introduction to Physics
Wednesday, May 21 - Aug 6
Sunday, Jun 15 - Sep 14
Monday, Jun 23 - Sep 15

Physics 1: Mechanics
Thursday, May 22 - Oct 30
Monday, Jun 23 - Dec 15

Relativity
Mon, Tue, Wed & Thurs, Jun 23 - Jun 26 (meets every day of the week!)
0 replies
jlacosta
May 1, 2025
0 replies
k i Adding contests to the Contest Collections
dcouchman   1
N Apr 5, 2023 by v_Enhance
Want to help AoPS remain a valuable Olympiad resource? Help us add contests to AoPS's Contest Collections.

Find instructions and a list of contests to add here: https://artofproblemsolving.com/community/c40244h1064480_contests_to_add
1 reply
dcouchman
Sep 9, 2019
v_Enhance
Apr 5, 2023
k i Zero tolerance
ZetaX   49
N May 4, 2019 by NoDealsHere
Source: Use your common sense! (enough is enough)
Some users don't want to learn, some other simply ignore advises.
But please follow the following guideline:


To make it short: ALWAYS USE YOUR COMMON SENSE IF POSTING!
If you don't have common sense, don't post.


More specifically:

For new threads:


a) Good, meaningful title:
The title has to say what the problem is about in best way possible.
If that title occured already, it's definitely bad. And contest names aren't good either.
That's in fact a requirement for being able to search old problems.

Examples:
Bad titles:
- "Hard"/"Medium"/"Easy" (if you find it so cool how hard/easy it is, tell it in the post and use a title that tells us the problem)
- "Number Theory" (hey guy, guess why this forum's named that way¿ and is it the only such problem on earth¿)
- "Fibonacci" (there are millions of Fibonacci problems out there, all posted and named the same...)
- "Chinese TST 2003" (does this say anything about the problem¿)
Good titles:
- "On divisors of a³+2b³+4c³-6abc"
- "Number of solutions to x²+y²=6z²"
- "Fibonacci numbers are never squares"


b) Use search function:
Before posting a "new" problem spend at least two, better five, minutes to look if this problem was posted before. If it was, don't repost it. If you have anything important to say on topic, post it in one of the older threads.
If the thread is locked cause of this, use search function.

Update (by Amir Hossein). The best way to search for two keywords in AoPS is to input
[code]+"first keyword" +"second keyword"[/code]
so that any post containing both strings "first word" and "second form".


c) Good problem statement:
Some recent really bad post was:
[quote]$lim_{n\to 1}^{+\infty}\frac{1}{n}-lnn$[/quote]
It contains no question and no answer.
If you do this, too, you are on the best way to get your thread deleted. Write everything clearly, define where your variables come from (and define the "natural" numbers if used). Additionally read your post at least twice before submitting. After you sent it, read it again and use the Edit-Button if necessary to correct errors.


For answers to already existing threads:


d) Of any interest and with content:
Don't post things that are more trivial than completely obvious. For example, if the question is to solve $x^{3}+y^{3}=z^{3}$, do not answer with "$x=y=z=0$ is a solution" only. Either you post any kind of proof or at least something unexpected (like "$x=1337, y=481, z=42$ is the smallest solution). Someone that does not see that $x=y=z=0$ is a solution of the above without your post is completely wrong here, this is an IMO-level forum.
Similar, posting "I have solved this problem" but not posting anything else is not welcome; it even looks that you just want to show off what a genius you are.

e) Well written and checked answers:
Like c) for new threads, check your solutions at least twice for mistakes. And after sending, read it again and use the Edit-Button if necessary to correct errors.



To repeat it: ALWAYS USE YOUR COMMON SENSE IF POSTING!


Everything definitely out of range of common sense will be locked or deleted (exept for new users having less than about 42 posts, they are newbies and need/get some time to learn).

The above rules will be applied from next monday (5. march of 2007).
Feel free to discuss on this here.
49 replies
ZetaX
Feb 27, 2007
NoDealsHere
May 4, 2019
Serbian selection contest for the IMO 2025 - P4
OgnjenTesic   1
N 13 minutes ago by nataliaonline75
Source: Serbian selection contest for the IMO 2025
For a permutation $\pi$ of the set $A = \{1, 2, \ldots, 2025\}$, define its colorfulness as the greatest natural number $k$ such that:
- For all $1 \le i, j \le 2025$, $i \ne j$, if $|i - j| < k$, then $|\pi(i) - \pi(j)| \ge k$.
What is the maximum possible colorfulness of a permutation of the set $A$? Determine how many such permutations have maximal colorfulness.

Proposed by Pavle Martinović
1 reply
OgnjenTesic
May 22, 2025
nataliaonline75
13 minutes ago
Another OI geometry problem
chengbilly   7
N 14 minutes ago by MathLuis
Source: own
Let $ABC$ be a triangle with incenter $I$ and circumcenter $O$. $H$ the orthocenter of triangle $BIC$ . The incircle of $ABC$ touches side $AC,AB$ at $E,F$ respectively. Suppose that $\odot (AEF)$ and $\odot (AIO)$ intersects $\odot (ABC)$ at $S$ and $T$ respectively (differ from $A$). Prove that $T,H,I,S$ lies on a circle.

($\odot (ABC)$ denote the circumcircle of $ABC$)
7 replies
chengbilly
Apr 14, 2021
MathLuis
14 minutes ago
Serbian selection contest for the IMO 2025 - P6
OgnjenTesic   2
N 21 minutes ago by nataliaonline75
Source: Serbian selection contest for the IMO 2025
For an $n \times n$ table filled with natural numbers, we say it is a divisor table if:
- the numbers in the $i$-th row are exactly all the divisors of some natural number $r_i$,
- the numbers in the $j$-th column are exactly all the divisors of some natural number $c_j$,
- $r_i \ne r_j$ for every $i \ne j$.

A prime number $p$ is given. Determine the smallest natural number $n$, divisible by $p$, such that there exists an $n \times n$ divisor table, or prove that such $n$ does not exist.

Proposed by Pavle Martinović
2 replies
OgnjenTesic
May 22, 2025
nataliaonline75
21 minutes ago
Infinite Pairs of Integers
steven_zhang123   0
34 minutes ago
Source: 2025 Spring NSMO P6
Given a positive integer \( k \), prove that there exist infinitely many pairs of positive integers \((m, n)\) (\(m < n\)) such that
\[
\tau(m^k) \tau(m^k + 1) \cdots \tau(n^k - 1) \tau(n^k)
\]is a perfect square, where \(\tau(n)\) denotes the number of positive divisors of \(n\).
Proposed by Dong Zhenyu
0 replies
steven_zhang123
34 minutes ago
0 replies
power sum system of equations in 3 variables
Stear14   0
38 minutes ago
Given that
$x^2+y^2+z^2=8\ ,$
$x^3+y^3+z^3=15\ ,$
$x^5+y^5+z^5=100\ .$

Find the value of $\ x+y+z\ .$
0 replies
Stear14
38 minutes ago
0 replies
Game on 6 by 6 grid
billzhao   26
N an hour ago by Sleepy_Head
Source: USAMO 2004, problem 4
Alice and Bob play a game on a 6 by 6 grid. On his or her turn, a player chooses a rational number not yet appearing in the grid and writes it in an empty square of the grid. Alice goes first and then the players alternate. When all squares have numbers written in them, in each row, the square with the greatest number in that row is colored black. Alice wins if she can then draw a line from the top of the grid to the bottom of the grid that stays in black squares, and Bob wins if she can't. (If two squares share a vertex, Alice can draw a line from one to the other that stays in those two squares.) Find, with proof, a winning strategy for one of the players.
26 replies
billzhao
Apr 29, 2004
Sleepy_Head
an hour ago
USA GEO 2003
dreammath   21
N 2 hours ago by lpieleanu
Source: TST USA 2003
Let $ABC$ be a triangle and let $P$ be a point in its interior. Lines $PA$, $PB$, $PC$ intersect sides $BC$, $CA$, $AB$ at $D$, $E$, $F$, respectively. Prove that
\[ [PAF]+[PBD]+[PCE]=\frac{1}{2}[ABC]  \]
if and only if $P$ lies on at least one of the medians of triangle $ABC$. (Here $[XYZ]$ denotes the area of triangle $XYZ$.)
21 replies
dreammath
Feb 16, 2004
lpieleanu
2 hours ago
Balkan Mathematical Olympiad
ABCD1728   0
2 hours ago
Can anyone provide the PDF version of the book "Balkan Mathematical Olympiads" by Mircea Becheanu and Bogdan Enescu (published by XYZ press in 2014), thanks!
0 replies
ABCD1728
2 hours ago
0 replies
An amazing functional equation over positive reals
ariopro1387   0
2 hours ago
Source: Iran Team selection test 2025 - P6
Find all functions $f:\mathbb{R}^+ \rightarrow \mathbb{R}^+$, such that:
$f(f(f(xy))+x^2)=f(y)(f(x)-f(x+y))$
for all $x, y>0$.
0 replies
ariopro1387
2 hours ago
0 replies
Nice "if and only if" function problem
ICE_CNME_4   10
N 2 hours ago by maromex
Let $f : [0, \infty) \to [0, \infty)$, $f(x) = \dfrac{ax + b}{cx + d}$, with $a, d \in (0, \infty)$, $b, c \in [0, \infty)$. Prove that there exists $n \in \mathbb{N}^*$ such that for every $x \geq 0$
\[
f_n(x) = \frac{x}{1 + nx}, \quad \text{if and only if } f(x) = \frac{x}{1 + x}, \quad \forall x \geq 0.
\](For $n \in \mathbb{N}^*$ and $x \geq 0$, the notation $f_n(x)$ represents $\underbrace{(f \circ f \circ \dots \circ f)}_{n \text{ times}}(x)$. )

Please do it at 9th grade level. Thank you!
10 replies
ICE_CNME_4
Friday at 7:23 PM
maromex
2 hours ago
Inequality olympiad algebra
Foxellar   0
3 hours ago
Given that \( a, b, c \) are nonzero real numbers such that
\[
\frac{1}{abc} + \frac{1}{a} + \frac{1}{c} = \frac{1}{b},
\]let \( M \) be the maximum value of the expression
\[
\frac{4}{a^2 + 1} + \frac{4}{b^2 + 1} + \frac{7}{c^2 + 1}.
\]Determine the sum of the numerator and denominator of the simplified fraction representing \( M \).
0 replies
Foxellar
3 hours ago
0 replies
Integers on a cube
Rushil   6
N 3 hours ago by SomeonecoolLovesMaths
Source: Indian RMO 2004 Problem 2
Positive integers are written on all the faces of a cube, one on each. At each corner of the cube, the product of the numbers on the faces that meet at the vertex is written. The sum of the numbers written on the corners is 2004. If T denotes the sum of the numbers on all the faces, find the possible values of T.
6 replies
Rushil
Feb 28, 2006
SomeonecoolLovesMaths
3 hours ago
Tangents to circle concurrent on a line
Drytime   9
N 3 hours ago by Autistic_Turk
Source: Romania TST 3 2012, Problem 2
Let $\gamma$ be a circle and $l$ a line in its plane. Let $K$ be a point on $l$, located outside of $\gamma$. Let $KA$ and $KB$ be the tangents from $K$ to $\gamma$, where $A$ and $B$ are distinct points on $\gamma$. Let $P$ and $Q$ be two points on $\gamma$. Lines $PA$ and $PB$ intersect line $l$ in two points $R$ and respectively $S$. Lines $QR$ and $QS$ intersect the second time circle $\gamma$ in points $C$ and $D$. Prove that the tangents from $C$ and $D$ to $\gamma$ are concurrent on line $l$.
9 replies
Drytime
May 11, 2012
Autistic_Turk
3 hours ago
Quadratic
Rushil   8
N 3 hours ago by SomeonecoolLovesMaths
Source: Indian RMO 2004 Problem 3
Let $\alpha$ and $\beta$ be the roots of the equation $x^2 + mx -1 = 0$ where $m$ is an odd integer. Let $\lambda _n = \alpha ^n + \beta ^n , n \geq 0$
Prove that
(A) $\lambda _n$ is an integer
(B) gcd ( $\lambda _n , \lambda_{n+1}$) = 1 .
8 replies
Rushil
Feb 28, 2006
SomeonecoolLovesMaths
3 hours ago
two lines concurrent with a circumcircle
parmenides51   2
N Apr 25, 2022 by Mahdi_Mashayekhi
Source: 2019 Oral Moscow Geometry Olympiad grades 10-11 p5
On sides $AB$ and $BC$ of a non-isosceles triangle $ABC$ are selected points $C_1$ and $A_1$ such that the quadrilateral $AC_1A_1C$ is cyclic. Lines $CC_1$ and $AA_1$ intersect at point $P$. Line $BP$ intersects the circumscribed circle of triangle $ABC$ at the point $Q$. Prove that the lines $QC_1$ and $CM$, where $M$ is the midpoint of $A_1C_1$, intersect at the circumscribed circles of triangle $ABC$.
2 replies
parmenides51
May 22, 2019
Mahdi_Mashayekhi
Apr 25, 2022
two lines concurrent with a circumcircle
G H J
Source: 2019 Oral Moscow Geometry Olympiad grades 10-11 p5
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
parmenides51
30653 posts
#1 • 2 Y
Y by Adventure10, Mango247
On sides $AB$ and $BC$ of a non-isosceles triangle $ABC$ are selected points $C_1$ and $A_1$ such that the quadrilateral $AC_1A_1C$ is cyclic. Lines $CC_1$ and $AA_1$ intersect at point $P$. Line $BP$ intersects the circumscribed circle of triangle $ABC$ at the point $Q$. Prove that the lines $QC_1$ and $CM$, where $M$ is the midpoint of $A_1C_1$, intersect at the circumscribed circles of triangle $ABC$.
This post has been edited 2 times. Last edited by parmenides51, Jul 29, 2019, 2:52 PM
Reason: source
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 • 8 Y
Y by amar_04, Pakistan, buratinogigle, thczarif, mueller.25, Kimchiks926, Pluto04, Adventure10
This was a really nice problem . Here is a solution that I and amar_04 found.
[asy]
  /* Geogebra to Asymptote conversion, documentation at artofproblemsolving.com/Wiki go to User:Azjps/geogebra */
import graph; size(10cm); 
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 = -1.52, xmax = 29.28, ymin = -15.3, ymax = 5.04;  /* image dimensions */
pen dtsfsf = rgb(0.8274509803921568,0.1843137254901961,0.1843137254901961); 
 /* draw figures */
draw((8.44,2.98)--(5.58,-6.24), linewidth(0.8) + dtsfsf); 
draw((5.58,-6.24)--(19.12,-6.08), linewidth(0.8) + dtsfsf); 
draw((19.12,-6.08)--(8.44,2.98), linewidth(0.8) + dtsfsf); 
draw(circle((12.359919441201725,-6.99943271169598), 6.822319669495047), linewidth(1.4)); 
draw((6.340428295488688,-3.788549341116885)--(19.12,-6.08), linewidth(0.8)); 
draw((5.58,-6.24)--(12.164915848398643,-0.17990052307974658), linewidth(0.8)); 
draw(circle((12.315918707971942,-3.275870662125787), 7.35925699864144), linewidth(1.4)); 
draw((8.44,2.98)--(7.585828269060439,-8.913681231111852), linewidth(0.8)); 
draw((6.340428295488688,-3.788549341116885)--(12.164915848398643,-0.17990052307974658), linewidth(0.8)); 
draw((5.5260993251428205,-0.4373822755701926)--(19.12,-6.08), linewidth(0.8)); 
draw((5.5260993251428205,-0.4373822755701926)--(7.585828269060439,-8.913681231111852), linewidth(0.8)); 
draw((2.3215520114998403,-6.278504555255542)--(6.340428295488688,-3.788549341116885), linewidth(0.8)); 
draw((2.3215520114998403,-6.278504555255542)--(5.58,-6.24), linewidth(0.8) + dtsfsf); 
draw((8.44,2.98)--(9.252672071943666,-1.9842249320983159), linewidth(0.8)); 
draw((9.252672071943666,-1.9842249320983159)--(10.637108098235617,-10.441082348369939), linewidth(0.8)); 
draw((2.3215520114998403,-6.278504555255542)--(10.637108098235617,-10.441082348369939), linewidth(0.8)); 
draw(circle((11.30461833939784,-5.296139196043708), 5.1880641825949905), linewidth(0.8) + linetype("4 4")); 
draw(circle((13.524465434065673,-5.626656640637814), 5.613869189787343), linewidth(0.8) + linetype("4 4")); 
 /* dots and labels */
dot((8.44,2.98),dotstyle); 
label("B", (8.52,3.18), NE * labelscalefactor); 
dot((5.58,-6.24),dotstyle); 
label("A", (5.22,-6.58), NE * labelscalefactor); 
dot((19.12,-6.08),dotstyle); 
label("$C$", (19.26,-6.2), NE * labelscalefactor); 
dot((12.164915848398643,-0.17990052307974658),dotstyle); 
label("$A_1$", (12.16,0.08), NE * labelscalefactor); 
dot((6.340428295488688,-3.788549341116885),linewidth(4pt) + dotstyle); 
label("$C_1$", (5.82,-3.66), NE * labelscalefactor); 
dot((7.933388312510872,-4.074176227915555),linewidth(4pt) + dotstyle); 
label("$P$", (7.44,-4.3), NE * labelscalefactor); 
dot((7.585828269060439,-8.913681231111852),linewidth(4pt) + dotstyle); 
label("$Q$", (7.66,-8.76), NE * labelscalefactor); 
dot((5.5260993251428205,-0.4373822755701926),linewidth(4pt) + dotstyle); 
label("$T$", (5.7,-0.46), NE * labelscalefactor); 
dot((9.252672071943666,-1.9842249320983159),linewidth(4pt) + dotstyle); 
label("$M$", (9.36,-2.38), NE * labelscalefactor); 
dot((2.3215520114998403,-6.278504555255542),linewidth(4pt) + dotstyle); 
label("$D$", (2.28,-6.12), NE * labelscalefactor); 
dot((10.637108098235617,-10.441082348369939),linewidth(4pt) + dotstyle); 
label("$E$", (10.72,-10.28), NE * labelscalefactor); 
clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); 
 /* end of picture */
[/asy]
Solution(with amar_04): Firstly we'll give a defination of a few points. Let $A_1C_1 \cap AC=D$. And let $BM \cap \odot(ABC)=E$ and $QC_1\cap \odot(ABC)=T$. We'll continue with a phantom points based approach i.e. assume $TC \cap A_1C_1=M$ . Then we'll prove that $M$ is infact the midpoint of $A_1C_1$.

Firstly note that to prove $BM$ is the median in $\Delta BC_1A_1$ we need to prove that its the $B$-symmedian of $\Delta BAC$ since they are oppositely similiar so the median and the symmedian get swapped. So we can restate the problem as follows.
Restated problem wrote:
In a triangle $\Delta ABC$ Let $C_1$ be any random point on $AB$. Let $\odot(AC_1C) \cap BC=A_1$. Now let $A_1A \cap CC_1=P$ and let $BP \cap \odot(ABC)=Q$.Let $QC_1 \cap \odot(ABC)=T$ and finally let $TC \cap A_1C_1=M$. Then prove that $BM$ is the $B$-symmedian in $\Delta ABC$.
By well known property of symmedians we need to prove $(B,E;A,C)=-1$. Taking perpsectivity at $Q$ we have $(B,E;A,C) \overset{Q}{=} (BQ \cap AC,QE \cap AC;A,C)$. Now note that we already have $(D,QB \cap AC;A,C)=-1$ . So we just need to prove $D-Q-E$ collinear. Note that by radical axis theorem we are left to prove $A_1C_1QE$ cyclic. Now we have that since $\angle CEM\equiv \angle CEB =\angle CAB \equiv \angle CAC_1=180^\circ - \angle CA_1C\equiv 180^\circ-\angle CA_1M \implies CA_1ME$ cyclic. Now note that $\angle C_1QE \equiv \angle TQE=180^\circ -\angle TCE=180^\circ-\angle MCE=180^\circ-\angle MA_1E \equiv 180^\circ-\angle C_1A_1E \implies C_1A_1QE$ cyclic as desired.$\blacksquare$
This post has been edited 9 times. Last edited by GeoMetrix, Dec 26, 2019, 12:49 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Mahdi_Mashayekhi
696 posts
#3
Y by
Let $QC_1$ meet circumscribed circle at $T$ and Let $CT$ meet $A_1C_1$ at $M$. Let $BM$ meet circumscribed circle at $S$. Note that $BA_1C_1$ and $BCA$ are similar so we need to prove $BM$ is symmedian in $BAC$. Note that $AC_1A_1C$ is cyclic so we need to prove $C_1QSA_1$ is cyclic.
Note that $\angle CA_1M = \angle CA_1C_1 = \angle 180 - \angle CAB = \angle 180 - \angle CSB = \angle 180 - \angle CSM \implies CSMA_1$ is cyclic so $\angle SA_1C_1 = \angle SA_1M = \angle SCM = \angle SCT = \angle 180 - \angle SQT = \angle 180 - \angle SQC_1 \implies SQC_1A_1$ is cyclic.
we're Done.
Z K Y
N Quick Reply
G
H
=
a