Plan ahead for the next school year. Schedule your class today!

G
Topic
First Poster
Last Poster
k a July Highlights and 2025 AoPS Online Class Information
jwelsh   0
Jul 1, 2025
We are halfway through summer, so be sure to carve out some time to keep your skills sharp and explore challenging topics at AoPS Online and our AoPS Academies (including the Virtual Campus)!

[list][*]Over 60 summer classes are starting at the Virtual Campus on July 7th - check out the math and language arts options for middle through high school levels.
[*]At AoPS Online, we have accelerated sections where you can complete a course in half the time by meeting twice/week instead of once/week, starting on July 8th:
[list][*]MATHCOUNTS/AMC 8 Basics
[*]MATHCOUNTS/AMC 8 Advanced
[*]AMC Problem Series[/list]
[*]Plus, AoPS Online has a special seminar July 14 - 17 that is outside the standard fare: Paradoxes and Infinity
[*]We are expanding our in-person AoPS Academy locations - are you looking for a strong community of problem solvers, exemplary instruction, and math and language arts options? Look to see if we have a location near you and enroll in summer camps or academic year classes today! New locations include campuses in California, Georgia, New York, Illinois, and Oregon and more coming soon![/list]

MOP (Math Olympiad Summer Program) just ended and the IMO (International Mathematical Olympiad) is right around the corner! This year’s IMO will be held in Australia, July 10th - 20th. Congratulations to all the MOP students for reaching this incredible level and best of luck to all selected to represent their countries at this year’s IMO! Did you know that, in the last 10 years, 59 USA International Math Olympiad team members have medaled and have taken over 360 AoPS Online courses. Take advantage of our Worldwide Online Olympiad Training (WOOT) courses
and train with the best! Please note that early bird pricing ends August 19th!
Are you tired of the heat and thinking about Fall? You can plan your Fall schedule now with classes at either AoPS Online, AoPS Academy Virtual Campus, or one of our AoPS Academies around the US.

Our full course list for upcoming classes is below:
All classes start 7:30pm ET/4:30pm PT unless otherwise noted.

Introductory: Grades 5-10

Prealgebra 1 Self-Paced

Prealgebra 1
Wednesday, Jul 16 - Oct 29
Sunday, Aug 17 - Dec 14
Tuesday, Aug 26 - Dec 16
Friday, Sep 5 - Jan 16
Monday, Sep 8 - Jan 12
Tuesday, Sep 16 - Jan 20 (4:30 - 5:45 pm ET/1:30 - 2:45 pm PT)
Sunday, Sep 21 - Jan 25
Thursday, Sep 25 - Jan 29
Wednesday, Oct 22 - Feb 25
Tuesday, Nov 4 - Mar 10
Friday, Dec 12 - Apr 10

Prealgebra 2 Self-Paced

Prealgebra 2
Friday, Jul 25 - Nov 21
Sunday, Aug 17 - Dec 14
Tuesday, Sep 9 - Jan 13
Thursday, Sep 25 - Jan 29
Sunday, Oct 19 - Feb 22
Monday, Oct 27 - Mar 2
Wednesday, Nov 12 - Mar 18

Introduction to Algebra A Self-Paced

Introduction to Algebra A
Tuesday, Jul 15 - Oct 28
Sunday, Aug 17 - Dec 14
Wednesday, Aug 27 - Dec 17
Friday, Sep 5 - Jan 16
Thursday, Sep 11 - Jan 15
Sunday, Sep 28 - Feb 1
Monday, Oct 6 - Feb 9
Tuesday, Oct 21 - Feb 24
Sunday, Nov 9 - Mar 15
Friday, Dec 5 - Apr 3

Introduction to Counting & Probability Self-Paced

Introduction to Counting & Probability
Wednesday, Jul 2 - Sep 17
Sunday, Jul 27 - Oct 19
Monday, Aug 11 - Nov 3
Wednesday, Sep 3 - Nov 19
Sunday, Sep 21 - Dec 14 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Friday, Oct 3 - Jan 16
Sunday, Oct 19 - Jan 25
Tuesday, Nov 4 - Feb 10
Sunday, Dec 7 - Mar 8

Introduction to Number Theory
Tuesday, Jul 15 - Sep 30
Wednesday, Aug 13 - Oct 29
Friday, Sep 12 - Dec 12
Sunday, Oct 26 - Feb 1
Monday, Dec 1 - Mar 2

Introduction to Algebra B Self-Paced

Introduction to Algebra B
Friday, Jul 18 - Nov 14
Thursday, Aug 7 - Nov 20
Monday, Aug 18 - Dec 15
Sunday, Sep 7 - Jan 11
Thursday, Sep 11 - Jan 15
Wednesday, Sep 24 - Jan 28
Sunday, Oct 26 - Mar 1
Tuesday, Nov 4 - Mar 10
Monday, Dec 1 - Mar 30

Introduction to Geometry
Monday, Jul 14 - Jan 19
Wednesday, Aug 13 - Feb 11
Tuesday, Aug 26 - Feb 24
Sunday, Sep 7 - Mar 8
Thursday, Sep 11 - Mar 12
Wednesday, Sep 24 - Mar 25
Sunday, Oct 26 - Apr 26
Monday, Nov 3 - May 4
Friday, Dec 5 - May 29

Paradoxes and Infinity
Mon, Tue, Wed, & Thurs, Jul 14 - Jul 16 (meets every day of the week!)
Sat & Sun, Sep 13 - Sep 14 (1:00 - 4:00 PM PT/4:00 - 7:00 PM ET)

Intermediate: Grades 8-12

Intermediate Algebra
Sunday, Jul 13 - Jan 18
Thursday, Jul 24 - Jan 22
Friday, Aug 8 - Feb 20
Tuesday, Aug 26 - Feb 24
Sunday, Sep 28 - Mar 29
Wednesday, Oct 8 - Mar 8
Sunday, Nov 16 - May 17
Thursday, Dec 11 - Jun 4

Intermediate Counting & Probability
Sunday, Sep 28 - Feb 15
Tuesday, Nov 4 - Mar 24

Intermediate Number Theory
Wednesday, Sep 24 - Dec 17

Precalculus
Wednesday, Aug 6 - Jan 21
Tuesday, Sep 9 - Feb 24
Sunday, Sep 21 - Mar 8
Monday, Oct 20 - Apr 6
Sunday, Dec 14 - May 31

Advanced: Grades 9-12

Calculus
Sunday, Sep 7 - Mar 15
Wednesday, Sep 24 - Apr 1
Friday, Nov 14 - May 22

Contest Preparation: Grades 6-12

MATHCOUNTS/AMC 8 Basics
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)
Sunday, Aug 17 - Nov 9
Wednesday, Sep 3 - Nov 19
Tuesday, Sep 16 - Dec 9
Sunday, Sep 21 - Dec 14 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Monday, Oct 6 - Jan 12
Thursday, Oct 16 - Jan 22
Tues, Thurs & Sun, Dec 9 - Jan 18 (meets three times a week!)

MATHCOUNTS/AMC 8 Advanced
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)
Sunday, Aug 17 - Nov 9
Tuesday, Aug 26 - Nov 11
Thursday, Sep 4 - Nov 20
Friday, Sep 12 - Dec 12
Monday, Sep 15 - Dec 8
Sunday, Oct 5 - Jan 11
Tues, Thurs & Sun, Dec 2 - Jan 11 (meets three times a week!)
Mon, Wed & Fri, Dec 8 - Jan 16 (meets three times a week!)

AMC 10 Problem Series
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)
Sunday, Aug 10 - Nov 2
Thursday, Aug 14 - Oct 30
Tuesday, Aug 19 - Nov 4
Mon & Wed, Sep 15 - Oct 22 (meets twice a week!)
Mon, Wed & Fri, Oct 6 - Nov 3 (meets three times a week!)
Tue, Thurs & Sun, Oct 7 - Nov 2 (meets three times a week!)

AMC 10 Final Fives
Friday, Aug 15 - Sep 12
Sunday, Sep 7 - Sep 28
Tuesday, Sep 9 - Sep 30
Monday, Sep 22 - Oct 13
Sunday, Sep 28 - Oct 19 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Wednesday, Oct 8 - Oct 29
Thursday, Oct 9 - Oct 30

AMC 12 Problem Series
Wednesday, Aug 6 - Oct 22
Sunday, Aug 10 - Nov 2
Monday, Aug 18 - Nov 10
Mon & Wed, Sep 15 - Oct 22 (meets twice a week!)
Tues, Thurs & Sun, Oct 7 - Nov 2 (meets three times a week!)

AMC 12 Final Fives
Thursday, Sep 4 - Sep 25
Sunday, Sep 28 - Oct 19
Tuesday, Oct 7 - Oct 28

AIME Problem Series A
Thursday, Oct 23 - Jan 29

AIME Problem Series B
Tuesday, Sep 2 - Nov 18

F=ma Problem Series
Tuesday, Sep 16 - Dec 9
Friday, Oct 17 - Jan 30

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, Aug 14 - Oct 30
Sunday, Sep 7 - Nov 23
Tuesday, Dec 2 - Mar 3

Intermediate Programming with Python
Friday, Oct 3 - Jan 16

USACO Bronze Problem Series
Wednesday, Sep 3 - Dec 3
Thursday, Oct 30 - Feb 5
Tuesday, Dec 2 - Mar 3

Physics

Introduction to Physics
Tuesday, Sep 2 - Nov 18
Sunday, Oct 5 - Jan 11
Wednesday, Dec 10 - Mar 11

Physics 1: Mechanics
Sunday, Sep 21 - Mar 22
Sunday, Oct 26 - Apr 26
0 replies
jwelsh
Jul 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
sumdigits
teomihai   0
32 minutes ago
Find sum digits all number 1 to 2001.
0 replies
teomihai
32 minutes ago
0 replies
IMO ShortList 2001, combinatorics problem 1
orl   35
N 43 minutes ago by ItsBesi
Source: IMO ShortList 2001, combinatorics problem 1
Let $A = (a_1, a_2, \ldots, a_{2001})$ be a sequence of positive integers. Let $m$ be the number of 3-element subsequences $(a_i,a_j,a_k)$ with $1 \leq i < j < k \leq 2001$, such that $a_j = a_i + 1$ and $a_k = a_j + 1$. Considering all such sequences $A$, find the greatest value of $m$.
35 replies
1 viewing
orl
Sep 30, 2004
ItsBesi
43 minutes ago
Complex Polynomial
Oksutok   1
N an hour ago by Oksutok
Let $P(z)=a_0+a_1z+...+a_nz^n$ be a complex polynomial, where $a_0$ is real and $|\operatorname{Re} P(z)| \le 1$ for $|z| \le 1$. Then, for $|z| \le 1$,
$|\operatorname{Im} P(z)| \le \frac{2}{n+1} \sum_{k=1}^{\lfloor \frac{n+1}{2} \rfloor}\cot \frac{(2k-1) \pi}{2n+2}$.
1 reply
Oksutok
Oct 10, 2024
Oksutok
an hour ago
Stable Configuration
Amir Hossein   1
N an hour ago by rstather
Source: Turkey National Olympiad 2002 - D1 - P1
Let $(a_1, a_2,\ldots , a_n)$ be a permutation of $1, 2, \ldots , n,$ where $n  \geq 2.$ For each $k = 1, \ldots , n$, we know that $a_k$ apples are placed at the point $k$ on the real axis. Children named $A,B,C$ are assigned respective points $x_A, x_B, x_C \in  \{1, \ldots , n\}.$ For each $k,$ the children whose points are closest to $ k$ divide $a_k$ apples equally among themselves. We call $(x_A, x_B, x_C)$ a stable configuration if no child’s total share can be increased by assigning a new point to this child and not changing the points of the other two. Determine the values of $n$ for which a stable configuration exists for some distribution $(a_1, \ldots, a_n)$ of the apples.
1 reply
Amir Hossein
Mar 11, 2011
rstather
an hour ago
Azerbaijan NMO 2015
IstekOlympiadTeam   9
N an hour ago by Just1
Source: 2015 Azerbaijan National Mathematical Olympiad
Natural number $M$ has $6$ divisors, such that sum of them are equal to $3500$.Find the all values of $M$.
9 replies
IstekOlympiadTeam
Oct 21, 2015
Just1
an hour ago
Problem3
samithayohan   121
N an hour ago by Baimukh
Source: IMO 2015 problem 3
Let $ABC$ be an acute triangle with $AB > AC$. Let $\Gamma $ be its circumcircle, $H$ its orthocenter, and $F$ the foot of the altitude from $A$. Let $M$ be the midpoint of $BC$. Let $Q$ be the point on $\Gamma$ such that $\angle HQA = 90^{\circ}$ and let $K$ be the point on $\Gamma$ such that $\angle HKQ = 90^{\circ}$. Assume that the points $A$, $B$, $C$, $K$ and $Q$ are all different and lie on $\Gamma$ in this order.

Prove that the circumcircles of triangles $KQH$ and $FKM$ are tangent to each other.

Proposed by Ukraine
121 replies
samithayohan
Jul 10, 2015
Baimukh
an hour ago
Minimum Rows Required
prMoLeGend42   1
N an hour ago by prMoLeGend42
Source: China 1990

An arena has rows of \(199\) seats each.
A total of \(1990\) students are coming to watch a match.
It is known that no school sends more than \(39\) students.
Students belonging to the same school must sit in the same row.

Determine the minimum number of rows that must be reserved so that,
regardless of how the schools distribute their students (within the
given limits), all \(1990\) students can be seated under the rule above.
1 reply
prMoLeGend42
3 hours ago
prMoLeGend42
an hour ago
Find the value of angle C (pure geometry if possible)
markosa   1
N 2 hours ago by sunken rock
Given a triangle ABC with base BC

angle ABC = 3x
angle ACB = x
AP is the bisector of base BC (i.e.) BP = PC
angle APB = 45 degrees

Find x

I know there are multiple methods to solve this problem using cosine law, coord geo
But is there any pure geometrical solution?
1 reply
markosa
Today at 2:25 AM
sunken rock
2 hours ago
Easy Geometry Problem
Euler_Gauss   1
N 2 hours ago by RANDOM__USER
Let \( J \) be the excenter opposite vertex \( B \) of \(\triangle ABC\), and \( S \) be the midpoint of the arc \( BC \) not containing \( A \). \( JS \) intersects \(\odot  (ABC)\) at \( K \), and \( BK \) meets \( AC \) at \( L \). Suppose \( W \) is the second intersection point of \(\odot (ABJ)\) and \(\odot (JKL)\).

Prove that \(\odot (BJK)\) is tangent to \(\odot (ALW)\).

Proposed by Yuhan Zhang, Guangxi Nanning No.3 High School
1 reply
Euler_Gauss
Jul 24, 2025
RANDOM__USER
2 hours ago
A delicious geometry in Taiwan TST
Li4   8
N 2 hours ago by wassupevery1
Source: 2023 Taiwan TST Round 2 Mock P3
Let $\Omega$ be the circumcircle of an acute triangle $ABC$. Points $D$, $E$, $F$ are the midpoints of the inferior arcs $BC$, $CA$, $AB$, respectively, on $\Omega$. Let $G$ be the antipode of $D$ in $\Omega$. Let $X$ be the intersection of lines $GE$ and $AB$, while $Y$ the intersection of lines $FG$ and $CA$. Let the circumcenters of triangles $BEX$ and $CFY$ be points $S$ and $T$, respectively. Prove that $D$, $S$, $T$ are collinear.

Proposed by kyou46 and Li4.
8 replies
Li4
Apr 7, 2023
wassupevery1
2 hours ago
Inequality
SunnyEvan   5
N 2 hours ago by erzhane
Source: Own
Let $ a,b,c>0 ,$ such that: $ abc=1 .$ Prove that :
$$ \sqrt{64a^2+225}+\sqrt{64b^2+225}+\sqrt{64c^2+225} \leq (7\sqrt3-4)(a+b+c)+21(3-\sqrt3) $$
5 replies
SunnyEvan
Yesterday at 11:45 PM
erzhane
2 hours ago
Subsets of size 3 intersecting at exactly one element
Demetres   2
N 2 hours ago by TigerOnion
Source: Cyprus 2022 TST-2 Problem 4
Let
\[M=\{1, 2, 3, \ldots, 2022\}\]Determine the least positive integer $k$, such that for every $k$ subsets of $M$ with the cardinality of each subset equal to $3$, there are two of these subsets with exactly one common element.
2 replies
Demetres
Feb 21, 2022
TigerOnion
2 hours ago
Bulldozer bouncing off walls
v_Enhance   25
N 2 hours ago by fearsum_fyz
Source: USA TSTST 2016 Problem 5, by Linus Hamilton and David Stoner
In the coordinate plane are finitely many walls; which are disjoint line segments, none of which are parallel to either axis. A bulldozer starts at an arbitrary point and moves in the $+x$ direction. Every time it hits a wall, it turns at a right angle to its path, away from the wall, and continues moving. (Thus the bulldozer always moves parallel to the axes.)

Prove that it is impossible for the bulldozer to hit both sides of every wall.

Proposed by Linus Hamilton and David Stoner
25 replies
v_Enhance
Jun 29, 2016
fearsum_fyz
2 hours ago
Easy induction
Sadigly   2
N 2 hours ago by Just1
Source: Azerbaijan Senior MO 2025 P1
Alice creates a sequence: For the first $2025$ terms of this sequence, she writes a random permutation of $\{1;2;3;...;2025\}$. To define the following terms, she does the following: She takes the last $2025$ terms of the sequence, and takes its median. How many values could this sequence's $3000$'th term could get?

(Note: To find the median of $2025$ numbers, you write them in an increasing order,and take the number in the middle)
2 replies
Sadigly
May 8, 2025
Just1
2 hours ago
Computing functions
BBNoDollar   8
N May 24, 2025 by wh0nix
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)$. )
8 replies
BBNoDollar
May 18, 2025
wh0nix
May 24, 2025
Computing functions
G H J
G H BBookmark kLocked kLocked NReply
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
BBNoDollar
15 posts
#1
Y by
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)$. )
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
alinazarboland
172 posts
#2
Y by
Here's a sketch of a method which solves every single mobius tranform problem I saw.
Let $z_1,z_2$ be the two complex roots of $f(z)=z$. Then, since a mobius transform is just a combination of shifting,scaling,rotating, and inversion, for any complex number $z$ we have:
$$(z , \infty ; z_1,z_2) = (f(z) , \frac{a}{c} ; z_1,z_2)$$If you write this $n$ times you'd get:
$$k^n .\frac{z-z_1}{z-z_2} = \frac{f_n - z_1}{f_n - z_2}$$Where $k = \frac{a/c - z_1}{a/c - z_2}$.Now let $f_n(x) = \frac{x}{1 + nx}$ for some $n$. One can easily get $k^n=1$(by comparing the coefficient of $x$ in the respective polynomial identity) and so $x_1=x_2$(comparing $x^2$s).
Now, $x_1=x_2$ means we have a double root for $f(x)=x$ and delta=0 so $(d-a)^2+4bc=0$. Combining with the fact that $x_1,x_2$ are fix points of every $f_k$ , we'll get $(n-1)^2+0=0$ and $n=1$
This post has been edited 2 times. Last edited by alinazarboland, May 18, 2025, 7:42 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
alinazarboland
172 posts
#3
Y by
Here are two old problems one from $2012$ IMC and one from Iranian Olympiad which are trivial with this method
https://artofproblemsolving.com/community/c7h491145p2754513
https://artofproblemsolving.com/community/c6h368215p2026678
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
BBNoDollar
15 posts
#4
Y by
alinazarboland wrote:
Here's a sketch of a method which solves every single mobius tranform problem I saw.
Let $z_1,z_2$ be the two complex roots of $f(z)=z$. Then, since a mobius transform is just a combination of shifting,scaling,rotating, and inversion, for any complex number $z$ we have:
$$(z , \infty ; z_1,z_2) = (f(z) , \frac{a}{c} ; z_1,z_2)$$If you write this $n$ times you'd get:
$$k^n .\frac{z-z_1}{z-z_2} = \frac{f_n - z_1}{f_n - z_2}$$Where $k = \frac{a/c - z_1}{a/c - z_2}$.Now let $f_n(x) = \frac{x}{1 + nx}$ for some $n$. One can easily get $k^n=1$(by comparing the coefficient of $x$ in the respective polynomial identity) and so $x_1=x_2$(comparing $x^2$s).
Now, $x_1=x_2$ means we have a double root for $f(x)=x$ and delta=0 so $(d-a)^2+4bc=0$. Combining with the fact that $x_1,x_2$ are fix points of every $f_k$ , we'll get $(n-1)^2+0=0$ and $n=1$

Thank you very much, i appreciate this solution ! I can understand it, but i need a 9th grade solution. I solved the ''reciprocal'' implication by induction, now i need to demonstrate the ''direct'' one. Can you or anyone help me ?
This post has been edited 1 time. Last edited by BBNoDollar, May 18, 2025, 10:15 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
ICE_CNME_4
22 posts
#5
Y by
Bumping this
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
ICE_CNME_4
22 posts
#6
Y by
Bump. Bump
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
BBNoDollar
15 posts
#7
Y by
BUMPING for 9th grade solution
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
ICE_CNME_4
22 posts
#8
Y by
Someone for this?
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
wh0nix
27 posts
#9
Y by
Hint
Z K Y
N Quick Reply
G
H
=
a