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

G
Topic
First Poster
Last Poster
k a April Highlights and 2025 AoPS Online Class Information
jlacosta   0
Apr 2, 2025
Spring is in full swing and summer is right around the corner, what are your plans? At AoPS Online our schedule has new classes starting now through July, so be sure to keep your skills sharp and be prepared for the Fall school year! Check out the schedule of upcoming classes below.

WOOT early bird pricing is in effect, don’t miss out! If you took MathWOOT Level 2 last year, no worries, it is all new problems this year! Our Worldwide Online Olympiad Training program is for high school level competitors. AoPS designed these courses to help our top students get the deep focus they need to succeed in their specific competition goals. Check out the details at this link for all our WOOT programs in math, computer science, chemistry, and physics.

Looking for summer camps in math and language arts? Be sure to check out the video-based summer camps offered at the Virtual Campus that are 2- to 4-weeks in duration. There are middle and high school competition math camps as well as Math Beasts camps that review key topics coupled with fun explorations covering areas such as graph theory (Math Beasts Camp 6), cryptography (Math Beasts Camp 7-8), and topology (Math Beasts Camp 8-9)!

Be sure to mark your calendars for the following events:
[list][*]April 3rd (Webinar), 4pm PT/7:00pm ET, Learning with AoPS: Perspectives from a Parent, Math Camp Instructor, and University Professor
[*]April 8th (Math Jam), 4:30pm PT/7:30pm ET, 2025 MATHCOUNTS State Discussion
April 9th (Webinar), 4:00pm PT/7:00pm ET, Learn about Video-based Summer Camps at the Virtual Campus
[*]April 10th (Math Jam), 4:30pm PT/7:30pm ET, 2025 MathILy and MathILy-Er Math Jam: Multibackwards Numbers
[*]April 22nd (Webinar), 4:00pm PT/7:00pm ET, Competitive Programming at AoPS (USACO).[/list]
Our full course list for upcoming classes is below:
All classes run 7:30pm-8:45pm ET/4:30pm - 5:45pm PT unless otherwise noted.

Introductory: Grades 5-10

Prealgebra 1 Self-Paced

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

Prealgebra 2 Self-Paced

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

Introduction to Algebra A Self-Paced

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

Introduction to Counting & Probability Self-Paced

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

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

Introduction to Algebra B Self-Paced

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

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

Intermediate: Grades 8-12

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

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

Intermediate Number Theory
Friday, Apr 11 - Jun 27
Sunday, Jun 1 - Aug 24
Wednesday, Jun 18 - Sep 3

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

Advanced: Grades 9-12

Olympiad Geometry
Tuesday, Jun 10 - Aug 26

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

Group Theory
Thursday, Jun 12 - Sep 11

Contest Preparation: Grades 6-12

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

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

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

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

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

AMC 12 Final Fives
Sunday, May 18 - Jun 15

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

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


MathWOOT Level 1
MathWOOT Level 2
ChemWOOT
CodeWOOT
PhysicsWOOT

Programming

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

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

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

Physics

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

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

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

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


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


More specifically:

For new threads:


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

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


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

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


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


For answers to already existing threads:


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

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



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


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

The above rules will be applied from next monday (5. march of 2007).
Feel free to discuss on this here.
49 replies
ZetaX
Feb 27, 2007
NoDealsHere
May 4, 2019
For positive integers \( a, b, c \), find all possible positive integer values o
Jackson0423   9
N 16 minutes ago by SpeedCuber7
For positive integers \( a, b, c \), find all possible positive integer values of
\[
\frac{a}{b} + \frac{b}{c} + \frac{c}{a}.
\]
9 replies
Jackson0423
Apr 13, 2025
SpeedCuber7
16 minutes ago
24 Aug FE problem
nicky-glass   3
N 19 minutes ago by pco
Source: Baltic Way 1995
$f:\mathbb R\setminus \{0\} \to \mathbb R$
(i) $f(1)=1$,
(ii) $\forall x,y,x+y \neq 0:f(\frac{1}{x+y})=f(\frac{1}{x})+f(\frac{1}{y}) : P(x,y)$
(iii) $\forall x,y,x+y \neq 0:(x+y)f(x+y)=xyf(x)f(y) :Q(x,y)$
$f=?$
3 replies
nicky-glass
Aug 24, 2016
pco
19 minutes ago
Simply equation but hard
giangtruong13   1
N 20 minutes ago by anduran
Find all integer pairs $(x,y)$ satisfy that: $$(x^2+y)(y^2+x)=(x-y)^3$$
1 reply
1 viewing
giangtruong13
2 hours ago
anduran
20 minutes ago
Number Theory
AnhQuang_67   0
25 minutes ago
Find all pairs of positive integers $(m,n)$ satisfying $2^m+21^n$ is a perfect square
0 replies
AnhQuang_67
25 minutes ago
0 replies
Hard Polynomial Problem
MinhDucDangCHL2000   1
N an hour ago by Tung-CHL
Source: IDK
Let $P(x)$ be a polynomial with integer coefficients. Suppose there exist infinitely many integer pairs $(a,b)$ such that $P(a) + P(b) = 0$. Prove that the graph of $P(x)$ is symmetric about a point (i.e., it has a center of symmetry).
1 reply
MinhDucDangCHL2000
2 hours ago
Tung-CHL
an hour ago
IMO LongList 1985 CYP2 - System of Simultaneous Equations
Amir Hossein   13
N an hour ago by cubres
Solve the system of simultaneous equations
\[\sqrt x - \frac 1y - 2w + 3z = 1,\]\[x + \frac{1}{y^2} - 4w^2 - 9z^2 = 3,\]\[x \sqrt x - \frac{1}{y^3} - 8w^3 + 27z^3 = -5,\]\[x^2 + \frac{1}{y^4} - 16w^4 - 81z^4 = 15.\]
13 replies
Amir Hossein
Sep 10, 2010
cubres
an hour ago
Centroid Distance Identity in Triangle
zeta1   5
N an hour ago by DottedCaculator
Let M be any point inside triangle ABC, and let G be the centroid of triangle ABC. Prove that:

\[
|MA|^2 + |MB|^2 + |MC|^2 = |GA|^2 + |GB|^2 + |GC|^2 + 3|MG|^2
\]
5 replies
zeta1
5 hours ago
DottedCaculator
an hour ago
Numbers not power of 5
Kayak   34
N an hour ago by cursed_tangent1434
Source: Indian TST D1 P2
Show that there do not exist natural numbers $a_1, a_2, \dots, a_{2018}$ such that the numbers \[ (a_1)^{2018}+a_2, (a_2)^{2018}+a_3, \dots, (a_{2018})^{2018}+a_1 \]are all powers of $5$

Proposed by Tejaswi Navilarekallu
34 replies
Kayak
Jul 17, 2019
cursed_tangent1434
an hour ago
Number Theory Chain!
JetFire008   58
N an hour ago by Primeniyazidayi
I will post a question and someone has to answer it. Then they have to post a question and someone else will answer it and so on. We can only post questions related to Number Theory and each problem should be more difficult than the previous. Let's start!

Question 1
58 replies
JetFire008
Apr 7, 2025
Primeniyazidayi
an hour ago
Silly Sequences
whatshisbucket   25
N 2 hours ago by bin_sherlo
Source: ELMO 2018 #2, 2018 ELMO SL N3
Consider infinite sequences $a_1,a_2,\dots$ of positive integers satisfying $a_1=1$ and $$a_n \mid a_k+a_{k+1}+\dots+a_{k+n-1}$$for all positive integers $k$ and $n.$ For a given positive integer $m,$ find the maximum possible value of $a_{2m}.$

Proposed by Krit Boonsiriseth
25 replies
whatshisbucket
Jun 28, 2018
bin_sherlo
2 hours ago
Advanced topics in Inequalities
va2010   8
N 2 hours ago by sqing
So a while ago, I compiled some tricks on inequalities. You are welcome to post solutions below!
8 replies
va2010
Mar 7, 2015
sqing
2 hours ago
Divisibility NT FE
CHESSR1DER   12
N 2 hours ago by internationalnick123456
Source: Own
Find all functions $f$ $N \rightarrow N$ such for any $a,b$:
$(a+b)|a^{f(b)} + b^{f(a)}$.
12 replies
CHESSR1DER
Monday at 7:07 PM
internationalnick123456
2 hours ago
Let \( a_1, a_2, \dots, a_n \) and \( b_1, b_2, \dots, b_n \) be nonzero real nu
Jackson0423   0
2 hours ago
Let \( a_1, a_2, \dots, a_n \) and \( b_1, b_2, \dots, b_n \) be nonzero real numbers satisfying
\[
a_1^2 b_1^2 (a_1 + b_1) + a_2^2 b_2^2 (a_2 + b_2) + \cdots + a_n^2 b_n^2 (a_n + b_n) \leq 7,
\]\[
\frac{1}{a_1} + \cdots + \frac{1}{a_n} = \frac{1}{4}, \quad \frac{1}{b_1} + \cdots + \frac{1}{b_n} = \frac{1}{3}.
\]Find the maximum value of
\[
a_1 b_1 + a_2 b_2 + \cdots + a_n b_n.
\]
0 replies
Jackson0423
2 hours ago
0 replies
Let \[ P(x) = a_0 + a_1 x^2 + a_2 x^4 + \cdots + a_{10} x^{20} \] be a polynom
Jackson0423   0
2 hours ago
Let
\[
P(x) = a_0 + a_1 x^2 + a_2 x^4 + \cdots + a_{10} x^{20}
\]be a polynomial of degree 20 with only even powers of \( x \).
Let the roots of \( P(x) \) be \( x_1, x_2, \dots, x_{20} \).
Given that
\[
(x_1^2 + 1)(x_2^2 + 1) \cdots (x_{20}^2 + 1) = 2025,
\]find the **minimum value** of \( P(1) \).
``
0 replies
Jackson0423
2 hours ago
0 replies
IMO Shortlist 2010 - Problem G3
Amir Hossein   15
N Jan 9, 2025 by HamstPan38825
Let $A_1A_2 \ldots A_n$ be a convex polygon. Point $P$ inside this polygon is chosen so that its projections $P_1, \ldots , P_n$ onto lines $A_1A_2, \ldots , A_nA_1$ respectively lie on the sides of the polygon. Prove that for arbitrary points $X_1, \ldots , X_n$ on sides $A_1A_2, \ldots , A_nA_1$ respectively,
\[\max \left\{ \frac{X_1X_2}{P_1P_2}, \ldots, \frac{X_nX_1}{P_nP_1} \right\} \geq 1.\]
Proposed by Nairi Sedrakyan, Armenia
15 replies
Amir Hossein
Jul 17, 2011
HamstPan38825
Jan 9, 2025
IMO Shortlist 2010 - Problem G3
G H J
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Amir Hossein
5452 posts
#1 • 5 Y
Y by Davi-8191, anantmudgal09, Adventure10, Mango247, Funcshun840
Let $A_1A_2 \ldots A_n$ be a convex polygon. Point $P$ inside this polygon is chosen so that its projections $P_1, \ldots , P_n$ onto lines $A_1A_2, \ldots , A_nA_1$ respectively lie on the sides of the polygon. Prove that for arbitrary points $X_1, \ldots , X_n$ on sides $A_1A_2, \ldots , A_nA_1$ respectively,
\[\max \left\{ \frac{X_1X_2}{P_1P_2}, \ldots, \frac{X_nX_1}{P_nP_1} \right\} \geq 1.\]
Proposed by Nairi Sedrakyan, Armenia
This post has been edited 1 time. Last edited by djmathman, Nov 22, 2016, 5:20 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
RSM
736 posts
#2 • 7 Y
Y by Pythagorasauras, Mobashereh, Pluto1708, amar_04, Adventure10, Mango247, Funcshun840
$ P_iP_{i+1}=X_iX_{i+1}.\frac {PA_i}{2R_{\Delta A_iX_iX_{i+1}}} $ where $ R_{\Delta XYZ} $ denotes the circumradius of $ \Delta XYZ $.
Claim:-
We will get some $ k $ such that $ P $ lies within $ \odot A_kX_kX_{k+1} $.

Proof:-
Suppose, there does not exist such $ k $. Then $ \angle X_iPX_{i+1}<180-\angle X_iA_iX_{i+1} $ for all $ 1\le i \le k $.
So $ \sum_{i=1}^{n} \angle X_iPX_{i+1}< \sum_{i=1}^{n} 180-\angle X_iA_iX_{i+1} $
So $ 360<360 $ which is not possible.

So our claim is proved. So $ PA_k\le 2R_{A_kX_kX_{k+1}} $
So $ \frac {X_kX_{k+1}}{P_kP_{k+1}}\ge 1 $
So done.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
JuanOrtiz
366 posts
#3 • 4 Y
Y by Mobashereh, Mprog., Adventure10, Mango247
What an excellent problem!

Let $R(DEF)$ denote the circumdiameter of triangle $DEF$.

Firstly notice $ X_1X_2/P_1P_2 \ge 1 \Leftrightarrow X_1X_2 \ge P_1P_2 \Leftrightarrow X_1X_2/sin(\angle A_1A_2A_3) \ge P_1P_2/sin(\angle A_1A_2A_3) \Leftrightarrow R(X_1A_2X_2) \ge R(P_1A_2P_2) = A_2P$, which happens iff $P$ lies inside circle $X_1A_2X_2$, which happens iff $\angle X_1PX_2 \ge 180-\angle A_1A_2A_3$.

Now if this were false always then add all the $n$ equations, and we get that $360 = \sum \angle X_iPX_{i+1} < \sum (180 - \angle A_{i-1}A_iA_{i+1}) = 360 $, impossible!
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
va2010
1276 posts
#4 • 1 Y
Y by Adventure10
The problem statement is wrong as stated. Could someone correct it? Thank you.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
wu2481632
4233 posts
#6 • 1 Y
Y by Adventure10
va2010 wrote:
The problem statement is wrong as stated. Could someone correct it? Thank you.

EDIT: should be $P_1P_2$

Fixed ~dj
This post has been edited 3 times. Last edited by djmathman, Nov 22, 2016, 5:20 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
anantmudgal09
1979 posts
#7 • 5 Y
Y by Pluto1708, amar_04, Adventure10, Mango247, Funcshun840
We should see this type of problems more often in math olympiads :)
IMO ShortList 2010 G3 wrote:
Let $A_1A_2 \ldots A_n$ be a convex polygon. Point $P$ inside this polygon is chosen so that its projections $P_1, \ldots , P_n$ onto lines $A_1A_2, \ldots , A_nA_1$ respectively lie on the sides of the polygon. Prove that for arbitrary points $X_1, \ldots , X_n$ on sides $A_1A_2, \ldots , A_nA_1$ respectively,
\[\max \left\{ \frac{X_1X_2}{P_1P_2}, \ldots, \frac{X_nX_1}{P_nP_1} \right\} \geq 1.\]
Proposed by Nairi Sedrakyan, Armenia

Notice that $$\sum^n_{i=1} \measuredangle X_iA_iX_{i+1}+\sum^n_{i=1} \measuredangle X_iPX_{i+1}=(n-2)\pi+2\pi=n\pi,$$with indices mod $n$, so by pigeon-hole principle, there exists an index $i$ for which $\measuredangle X_iA_iX_{+1}+\measuredangle X_iPX_{i+1} \geqslant \pi$.

Claim: $X_iX_{i+1} \geqslant P_iP_{i+1}$.

(Proof) Let $X$ be the antipodes of $A$ in $\triangle X_iAX_{i+1}$; then, $$\measuredangle X_iAX_{i+1}+ \measuredangle X_iPX_{i+1} \geqslant \pi \implies AX \cdot \, \sin X_iAX_{i+1} \geqslant AP\cdot \, \sin P_iAP_{i+1} \implies  X_iX_{i+1} \geqslant P_iP_{i+1}. \, \blacksquare$$
Hence, the statement of the initial problem is proved. $\blacksquare$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
william122
1576 posts
#9
Y by
Note that if $X_iX_{i+1}<P_iP_{i+1}$, then the circle $(X_iA_{i+1}X_{i+1})$ has a smaller diameter than $(P_iA_{i+1}P_{i+1})$, and therefore does not contain $P$. Hence, $\angle X_iPX_{i+1}<\angle P_iPP_{i+1}$. However, since $\sum \angle X_iPX_{i+1}=\sum\angle P_iPP_{i+1}=360^o$, this cannot hold for all values of $i$, which gives the desired result.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Idio-logy
206 posts
#10
Y by
Here is a different solution:

For points $U,V$ on directed segment $\stackrel{\longrightarrow}{AB}$, we say $U$ is on the left side of $V$ if $A,U,V,B$ are aligned in that order, and $U$ is on the right side of $V$ if $A,V,U,B$ are in order. All indices are taken modulo $n$, and direct all segments in $A_iA_{i+1}$ from $A_i$ to $A_{i+1}$.

First notice that $\angle A_iP_{i-1}P_i , \angle A_iP_iP_{i-1}$ are both acute because of the existence of $P$. If there exists an index $i$, such that $X_i$ and $X_{i+1}$ are respectively on the left and right side of $P_i$ and $P_{i+1}$, then we can prove that $X_iX_{i+1}>P_iP_{i+1}$. (Draw a line through $X_i$ parallel to $P_iP_{i+1}$ and let this line cut $A_{i+1}A_{i+2}$ at point $X'$ between $P_{i+1}$ and $X_{i+1}$. Then $X_iX_{i+1} \ge X_iX' > P_iP_{i+1}$.) Therefore, we can WLOG suppose all $X_i$ lie on the right side of $P_i$.

Let $P_iX_i = d_i$. We claim that $\frac{d_i}{PP_i} > \frac{d_{i+1}}{PP_{i+1}}$. Take $i=1$ for example: fix $X_1$, and suppose another point $X_2'$ lies on the right side of $P_2$ and satisfies $\frac{P_1X_1}{PP_1} > \frac{P_2X_2'}{PP_{2}}$. If $X_2$ does not lie on the left side of $X_2'$, then because $\measuredangle(X_1X_2',A_2A_3) > \frac{\pi}{2}$, $$X_1X_2 \ge X_1X_2' = P_1P_2 \cdot \frac{P_2X_2'}{PP_2} > P_1P_2.$$So $X_2$ lies between $P_2$ and $X_2'$, which proves the claim.

Now $\frac{d_1}{PP_1} > \frac{d_2}{PP_2} > \dots >\frac{d_n}{PP_n} > \frac{d_1}{PP_1}$, a contradiction.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
anser
572 posts
#11
Y by
Incorrect

@below
This post has been edited 1 time. Last edited by anser, Dec 8, 2020, 3:23 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
N0_NAME
112 posts
#12
Y by
@anser
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
#13
Y by
Two different solutions: (though, not as elegant as some previous one)

Solution 1:

Whenever we would write segment in our solution, we will also consider the two endpoints of the segment (unless specified).
We consider two cases:


CASE 1: There exist a index $i$ such that both of $P_{i},P_{i+1}$ do not lie on segments $\overline{A_{i+1}P_{i}},\overline{A_{i+1}P_{i+1}}$, respectively.
[asy]
pair A2=dir(90),P=dir(-90),P1=dir(-150),P2=dir(-40),X1=1.5*P1-0.5*A2,X2=1.8*P2-0.8*A2,T=foot(P,P1,P2),T1=foot(X1,P,T),Y1=extension(X1,T1,A2,X2),Y2=extension(X2,foot(X2,P,T),A2,X1);
dot("$A_2$",A2,dir(A2));
dot("$P$",P,dir(P));
dot("$P_1$",P1,dir(-180));
dot("$P_2$",P2);
dot("$X_1$",X1,dir(-180));
dot("$X_2$",X2,dir(0));
dot("$Y_1$",Y1,dir(0));
dot("$Y_2$",Y2,dir(-180));
draw(P1--P2^^X1--Y1^^X2--Y2,red);
draw(Y2--A2--X2,green);
draw(P2--P--P1,purple);
D(X1--X2);
markscalefactor=0.03;
draw(rightanglemark(P,P2,A2),darkblue);
draw(rightanglemark(P,P1,A2),darkblue);
[/asy]
We will prove that $X_{i}X_{i+1} \ge P_{i}P_{i+1}$. For the sake of simplicity, let $i=1$. The main thing to note is that both the angles $\angle AP_1P_2, \angle AP_2P_1$ are acute. Now, let $Y_1,Y_2$ be points on lines $\overline{AP_2},\overline{AP_1}$ such that $\overline{P_1P_2} \parallel \overline{X_1Y_1} \parallel \overline{X_2Y_2}$. Note that it cannot happen that $Y_1,Y_2$ both do not lie on segments $\overline{AX_1},\overline{AX_2}$, respectively (otherwise, the parallel lines $\overline{X_1Y_1},\overline{X_2Y_2}$ would intersect). So WLOG $Y_1$ does not lie on segment $\overline{AX_2}$. Then, $\angle X_1Y_1X_2 = 180^\circ  - \angle AP_2P_1 \ge 90^\circ$. Hence, $X_1X_2 \ge X_1Y_1 \ge P_1P_2$. $\square$


CASE 2: WLOG assume $X_1$ lies on segment $\overline{A_2P_1}$. Then for all $i$, we have that $X_i$ lies on segment $\overline{P_iA_{i+1}}$.

Then at least one of the following inequalities must hold:
$$\angle X_1PP_1 \le \angle X_2PP_2 ~,~ \angle X_2PP_2 \le \angle X_3PP_3 ~, ~ \ldots ~,~ \angle X_nPP_n \le \angle X_1PP_1$$WLOG, suppose $\angle X_1PP_1 \le \angle X_2PP_2$. We will prove that $X_1X_2 \ge P_1P_2$.
[asy]
pair A2=dir(90),P=dir(-90),P1=dir(-150),P2=dir(-40),X1=0.7*P1+0.3*A2,X2=1.45*P2-0.45*A2,X2p=2*foot(circumcenter(A2,X1,P),A2,P2)-A2;
path c1=circumcircle(A2,P1,P2),c2=circumcircle(A2,X1,P);
dot("$A_2$",A2,dir(A2));
dot("$P$",P,dir(P));
dot("$P_1$",P1,dir(-180));
dot("$P_2$",P2);
dot("$X_1$",X1,dir(-180));
dot("$X_2$",X2,dir(-50));
dot("$X_2'$",X2p,dir(-30));
draw(c1^^c2,red);
draw(P1--A2--X2,green);
draw(P1--P--X1^^P2--P--X2p^^X2--P,purple);
D(X2p--X1--X2);
D(P1--P2);
markscalefactor=0.02;
draw(rightanglemark(P,P2,A2),darkblue);
draw(rightanglemark(P,P1,A2),darkblue);
markscalefactor=0.03;
filldraw(anglemark(X1,P,P1),fuchsia);
filldraw(anglemark(X2p,P,P2),fuchsia);
[/asy]
Let $X_2'$ be a point on segment $\overline{X_2P_2}$ such that $\angle X_1PP_1 = \angle X_2'PP_2$. As projection of $X_1$ onto line $\overline{A_2P_2}$ does not lie on segment $\overline{X_2X_2'}$, so $\angle X_1X_2'X_2 \ge 90^\circ$ implying $X_1X_2 \ge X_1X_2$ and hence it suffices to show $X_1X_2' \ge P_1P_2$. Note that both the quadrilateral $AP_1PP_2$ and $AX_1PX_2'$ are cyclic so by Ptolemy's theorem,
\begin{align*}
PA_2 \cdot X_1X_2' &= PX_1 \cdot AX_2' + PX_2' \cdot A_2X_1 \ge PP_1 \cdot AX_2' + PP_2 \cdot A_2X_1 \\
 &= (PP_1 \cdot P_2X_2' - PP_2 \cdot P_1X_1) + PP_1 \cdot A_2P_2 + PP_2 \cdot A_2P_1 = PA_2 \cdot P_1P_2
\end{align*}where the equality $PP_1 \cdot P_2X_2' = PP_2 \cdot P_1X_1$ follows from $\triangle PP_1X_1 \sim \triangle PP_2X_2'$. $\square$


This completes the proof of the problem. $\blacksquare$


Solution 2:

Whenever we would write segment in our solution, we will also consider the two endpoints of the segment (unless specified).
Following is the key lemma:


Lemma: Given a triangle $LMN$ with $\angle M , \angle N \le 90^\circ$ let $R,S$ be any two points on lines $\overline{LM},\overline{LN}$ such that points $M,N$ lie on segments $\overline{LR},\overline{LS}$, respectively. Then $RS \ge MN$.
[asy]
pair A2=dir(90),P=dir(-90),P1=dir(-150),P2=dir(-40),X1=1.5*P1-0.5*A2,X2=1.8*P2-0.8*A2,T=foot(P,P1,P2),T1=foot(X1,P,T),Y1=extension(X1,T1,A2,X2),Y2=extension(X2,foot(X2,P,T),A2,X1);
dot("$L$",A2,dir(A2));
dot("$M$",P1,dir(-180));
dot("$N$",P2);
dot("$R$",X1,dir(-180));
dot("$S$",X2,dir(0));
dot("$R_0$",Y1,dir(0));
dot("$S_0$",Y2,dir(-180));
draw(P1--P2^^X1--Y1^^X2--Y2,red);
draw(Y2--A2--X2,green);
D(X1--X2);
[/asy]
proof: Let $R_0,S_0$ be points on lines $\overline{LN},\overline{LM}$ such that $\overline{MN} \parallel \overline{RR_0} \parallel \overline{SS_0}$. At least (in fact exactly) one of $R_0,S_0$ must lie on segments $\overline{NS},\overline{MR}$, respectively (otherwise, the two parallel lines $\overline{RR_0},\overline{SS_0}$ would intersect). WLOG, $R_0$ lies on segment $NS$. Now, $\angle RR_0S = \angle MNS \ge 90^\circ$ and thus
$$RS \ge RR_0 \ge MN$$This proves our Lemma. $\square$


Now if there would be a index $i$ such that both of $P_{i},P_{i+1}$ do not lie on segments $\overline{A_{i+1}P_{i}},\overline{A_{i+1}P_{i+1}}$, respectively ; then our Lemma would directly give $X_{i}X_{i+1} \ge P_{i}P_{i+1}$.


Now WLOG assume $X_1$ lies on segment $\overline{A_2P_1}$ and the consider the case when $X_i$ lies on segment $\overline{P_iA_{i+1}}$ for all $i$.

Then at least one of the following inequalities must hold:
$$\angle X_1PP_1 \le \angle X_2PP_2 ~,~ \angle X_2PP_2 \le \angle X_3PP_3 ~, ~ \ldots ~,~ \angle X_nPP_n \le \angle X_1PP_1$$WLOG, suppose $\angle X_1PP_1 \le \angle X_2PP_2$. We will prove that $X_1X_2 \ge P_1P_2$
[asy]
pair A2=dir(90),P=dir(-90),P1=dir(-150),P2=dir(-40),X1=0.7*P1+0.3*A2,X2=1.45*P2-0.45*A2,X2p=2*foot(circumcenter(A2,X1,P),A2,P2)-A2;
path c1=circumcircle(A2,P1,P2),c2=circumcircle(A2,X1,P);
dot("$A_2$",A2,dir(A2));
dot("$P$",P,dir(P));
dot("$P_1$",P1,dir(-180));
dot("$P_2$",P2);
dot("$X_1$",X1,dir(-180));
dot("$X_2$",X2,dir(-50));
dot("$X_2'$",X2p,dir(-30));
draw(c1^^c2,red);
draw(P1--A2--X2,green);
draw(P1--P--X1^^P2--P--X2p^^X2--P,purple);
D(X2p--X1--X2);
D(P1--P2);
markscalefactor=0.02;
draw(rightanglemark(P,P2,A2),darkblue);
draw(rightanglemark(P,P1,A2),darkblue);
markscalefactor=0.03;
filldraw(anglemark(X1,P,P1),fuchsia);
filldraw(anglemark(X2p,P,P2),fuchsia);
[/asy]
Let $X_2'$ be a point on segment $\overline{X_2P_2}$ such that $\angle X_1PP_1 = \angle X_2'PP_2$. As projection of $X_1$ onto line $\overline{A_2P_2}$ does not lie on segment $\overline{X_2X_2'}$, so $\angle X_1X_2'X_2 \ge 90^\circ$ implying $X_1X_2 \ge X_1X_2$ and hence it suffices to show $X_1X_2' \ge P_1P_2$.

Consider the rotation $\mathcal R$ at $P$ with angle $X_1PP_1 = \angle X_2'PP_2$ in anti-clockwise direction. Since $PX_1 \ge PP_1$ and $PX_2' \ge PP_2$ ; so $\mathcal R$ will map $X_1,X_2'$ to two points lying on lines $\overline{PP_1},\overline{PP_2}$ beyond $P_1,P_2$ (or equal to $P_1$ or $P_2$), respectively. Now since $\angle P_1,\angle P_2 \le 90^\circ$ in $\triangle PP_1P_2$ and since rotation preserves lengths of segments, so we are again done by our Lemma.


This completes the proof of the problem. $\blacksquare$
This post has been edited 1 time. Last edited by guptaamitu1, Aug 9, 2021, 8:13 AM
Reason: .
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
lazizbek42
548 posts
#14 • 1 Y
Y by MerlinLegion07
HINT
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
awesomeming327.
1696 posts
#15
Y by
Remarkable.

Pick $X_n$, $X_{n+1}$ such that $\angle X_nPX_{n+1} \le \angle P_nPP_{n+1}$, which must exist. Then, $P$ lies inside of the circle $(AX_nX_{n+1})$. Let its radius be $r$. Note that
\[\frac{X_nX_{n+1}}{P_nP_{n+1}}=\frac{2r\sin(\angle P_nA_nP_{n+1})}{PA_n\sin(\angle P_nA_nP_{n+1})}=\frac{2r}{PA_n}\ge 1\]since $P$ lies inside the circle.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
asdf334
7586 posts
#16
Y by
pain

hello,
The circumdiameter of $A_iX_{i-1}X_i$ is always less than that of $A_iP_{i-1}P_i$, which is $A_iP$. Now since the smallest circle passing through $A_i$ which contains $P$ has diameter at least $A_iP$ it follows that $P$ lies outside $A_iX_{i-1}X_i$'s circumcircle, which is not possible since it implies $\measuredangle X_{i-1}PX_i<\measuredangle P_{i-1}PP_i$ or by summing $360^{\circ}<360^{\circ}$.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
smileapple
1010 posts
#17
Y by
[asy]
unitsize(2cm);
pair Ai,Ai1,Ai2,P,Pi,Pi1,Xi,Xi1;
Ai=(0,0);
Ai1=(3,1.5);
Ai2=(7,0);
P=(2.5,-2);
Pi=(1.2,0.6);
Pi1=(3.7123287671233,1.2328767123288);
Xi=(2.3336071475857,1.1668035737929);
Xi1=(4.5524681642484,0.9178244384069);
draw(circle((2.75,-0.25),sqrt(3.125)));
draw(circle((3.3274402002021,0.0121285340779),sqrt(2.3209785838135)));
draw(Ai--Ai1--Ai2--cycle);
draw(P--Pi--Pi1--cycle);
draw(Xi--Xi1);
label("$P$",P,S);
label("$P_i$",Pi,NW);
label("$P_{i+1}$",Pi1,N);
label("$A_i$",Ai,W);
label("$A_{i+1}$",Ai1,N);
label("$A_{i+2}$",Ai2,E);
label("$X_i$",Xi,NW);
label("$X_{i+1}$",Xi1,NE);
[/asy]

Suppose by contradiction that there exist some configuration of the points $X_1,X_2,\cdots,X_n$ chosen respectively on the sides $A_1A_2, A_2A_3,\cdots , A_nA_1$ such that $\frac{X_iX_{i+1}}{P_iP_{i+1}}<1$ and thus $X_iX_{i+1}<P_iP_{i+1}$ for all $i$, where indices are taken modulo $n$.

Since $\angle PP_iA_{i+1}=\angle PP_{i+1}A_{i+1}=90^\circ$ by construction, we find that the quadrilateral $PP_iA_{i+1}P_{i+1}$ must always be cyclic, so that the circumcircle of $\triangle P_iA_{i+1}P_{i+1}$ has radius $\frac{PA_{i+1}}2$. Hence, using the Law of Sines, we find that $\frac{P_iP_{i+1}}{\sin\angle P_iA_{i+1}P_{i+1}}=PA_{i+1}$ and thus $$P_iP_{i+1}=PA_{i+1}\sin\angle A_{i+1}.$$Similarly, applying the Law of Sines on $\triangle X_iA_{i+1}X_{i+1}$ gives $$X_iX_{i+1}=2R_i\sin\angle A_{i+1},$$where $R_i$ is the radius of the circumcircle of $\triangle X_iA_{i+1}X_{i+1}$, so that our initial assumption gives
\begin{align*}
2R_i&=\frac{X_iX_{i+1}}{\sin\angle A_{i+1}}\\
&<\frac{P_iP_{i+1}}{\sin\angle A_{i+1}}\\
&=PA_{i+1}
\end{align*}for all $i$. In particular, it follows that $P$ must be strictly outside the circumcircle $(X_iA_{i+1}X_{i+1})$. The points $P$ and $A_{i+1}$ are on opposite sides of the segment $X_iX_{i+1}$, so it follows for all $i$ that $$\angle X_iA_{i+1}X_{i+1}+\angle X_iPX_{i+1}<180^\circ.$$
Summing the above inequality then yields
\begin{align*}
180n^\circ&>(\angle X_1A_2X_2+\angle X_2A_3X_3+\cdots+\angle X_nA_1X_1)+(\angle X_1PX_2+\angle X_2PX_3+\cdots+\angle X_nPX_1)\\
&=(\angle A_1A_2A_3+\angle A_2A_3A_4+\cdots+\angle A_nA_1A_2)+(\angle X_1PX_2+\angle X_2PX_3+\cdots+\angle X_nPX_1)\\
&=180(n-2)^\circ+360^\circ\\
&=180n^\circ,
\end{align*}a contradiction. Hence our original assumption was wrong, thus completing the proof. $\blacksquare$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
HamstPan38825
8857 posts
#18 • 1 Y
Y by dolphinday
This is really cute.

Claim: There exists an index $i$ such that $\angle X_i PX_{i+1} \geq 180^\circ - \angle X_i A_{i+1}X_{i+1}$, where indices are taken modulo $n$.

Proof: Notice that for $\alpha_i = \angle X_i P X_{i+1}$ and $\beta_i = 180^\circ - \angle X_i A_{i+1} X_{i+1}$ for each $i$, we have $\sum_{i=1}^n \alpha_i = 360^\circ = \sum_{i=1}^n \beta_i$. Thus by Pigeonhole, there exists an $i$ with $\alpha_i \geq \beta_i$, as needed. $\blacksquare$

For this $i$, it follows that $P$ lies inside $(X_iA_{i+1}X_{i+1})$ as $P$ and $A_{i+1}$ are on opposite sides of $\overline{X_i X_{i+1}}$. Thus $PA_{i+1} \leq 2R_{(X_iA_{i+1}X_{i+1})} = \frac{X_iX_{i+1}}{\sin \beta_i}$. But on the other hand, $P_i$ and $P_{i+1}$ lie on $(PA_{i+1})$, so $P_iP_{i+1} = PA_{i+1} \sin \beta_i \leq X_iX_{i+1}$, as needed.
Z K Y
N Quick Reply
G
H
=
a