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

G
Topic
First Poster
Last Poster
k a March Highlights and 2025 AoPS Online Class Information
jlacosta   0
Mar 2, 2025
March is the month for State MATHCOUNTS competitions! Kudos to everyone who participated in their local chapter competitions and best of luck to all going to State! Join us on March 11th for a Math Jam devoted to our favorite Chapter competition problems! Are you interested in training for MATHCOUNTS? Be sure to check out our AMC 8/MATHCOUNTS Basics and Advanced courses.

Are you ready to level up with Olympiad training? Registration is open with early bird pricing available for our WOOT programs: MathWOOT (Levels 1 and 2), CodeWOOT, PhysicsWOOT, and ChemWOOT. What is WOOT? WOOT stands for Worldwide Online Olympiad Training and is a 7-month high school math Olympiad preparation and testing program that brings together many of the best students from around the world to learn Olympiad problem solving skills. Classes begin in September!

Do you have plans this summer? There are so many options to fit your schedule and goals whether attending a summer camp or taking online classes, it can be a great break from the routine of the school year. Check out our summer courses at AoPS Online, or if you want a math or language arts class that doesn’t have homework, but is an enriching summer experience, our AoPS Virtual Campus summer camps may be just the ticket! We are expanding our locations for our AoPS Academies across the country with 15 locations so far and new campuses opening in Saratoga CA, Johns Creek GA, and the Upper West Side NY. Check out this page for summer camp information.

Be sure to mark your calendars for the following events:
[list][*]March 5th (Wednesday), 4:30pm PT/7:30pm ET, HCSSiM Math Jam 2025. Amber Verser, Assistant Director of the Hampshire College Summer Studies in Mathematics, will host an information session about HCSSiM, a summer program for high school students.
[*]March 6th (Thursday), 4:00pm PT/7:00pm ET, Free Webinar on Math Competitions from elementary through high school. Join us for an enlightening session that demystifies the world of math competitions and helps you make informed decisions about your contest journey.
[*]March 11th (Tuesday), 4:30pm PT/7:30pm ET, 2025 MATHCOUNTS Chapter Discussion MATH JAM. AoPS instructors will discuss some of their favorite problems from the MATHCOUNTS Chapter Competition. All are welcome!
[*]March 13th (Thursday), 4:00pm PT/7:00pm ET, Free Webinar about Summer Camps at the Virtual Campus. Transform your summer into an unforgettable learning adventure! From elementary through high school, we offer dynamic summer camps featuring topics in mathematics, language arts, and competition preparation - all designed to fit your schedule and ignite your passion for learning.[/list]
Our full course list for upcoming classes is below:
All classes run 7:30pm-8:45pm ET/4:30pm - 5:45pm PT unless otherwise noted.

Introductory: Grades 5-10

Prealgebra 1 Self-Paced

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

Prealgebra 2 Self-Paced

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


Introduction to Algebra A Self-Paced

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

Introduction to Counting & Probability Self-Paced

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

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

Introduction to Algebra B Self-Paced

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

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

Intermediate: Grades 8-12

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

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

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

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

Advanced: Grades 9-12

Olympiad Geometry
Wednesday, Mar 5 - May 21
Tuesday, Jun 10 - Aug 26

Calculus
Sunday, Mar 30 - Oct 5
Tuesday, May 27 - Nov 11
Wednesday, Jun 25 - Dec 17

Group Theory
Thursday, Jun 12 - Sep 11

Contest Preparation: Grades 6-12

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

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

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

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

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

AMC 12 Final Fives
Sunday, May 18 - Jun 15

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

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


MathWOOT Level 1
MathWOOT Level 2
ChemWOOT
CodeWOOT
PhysicsWOOT

Programming

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

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

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

Physics

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

Physics 1: Mechanics
Tuesday, Mar 25 - Sep 2
Thursday, May 22 - Oct 30
Monday, Jun 23 - Dec 15

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

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


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


More specifically:

For new threads:


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

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


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

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


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


For answers to already existing threads:


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

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



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


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

The above rules will be applied from next monday (5. march of 2007).
Feel free to discuss on this here.
49 replies
ZetaX
Feb 27, 2007
NoDealsHere
May 4, 2019
Area problem
MTA_2024   1
N 4 minutes ago by Curious_Droid
Let $\omega$ be a circle inscribed inside a rhombus $ABCD$. Let $P$ and $Q$ be variable points on $AB$ and $AD$ respectively, such as $PQ$ is always the tangent line to $\omega$.
Prove that for any position of $P$ and $Q$ the area of triangle $\triangle CPQ$ is the same.
1 reply
MTA_2024
an hour ago
Curious_Droid
4 minutes ago
Graph Theory in China TST
steven_zhang123   1
N 7 minutes ago by Photaesthesia
Source: China TST Quiz 4 P3
For a positive integer \( n \geq 6 \), find the smallest integer \( S(n) \) such that any graph with \( n \) vertices and at least \( S(n) \) edges must contain at least two disjoint cycles (cycles with no common vertices).
1 reply
1 viewing
steven_zhang123
4 hours ago
Photaesthesia
7 minutes ago
Apollonius Circle's Isogonal Conjugate Image
luosw   7
N 14 minutes ago by drmzjoseph
How to prove: the isogonal image of the Apollonius circle of $\triangle ABC$ passing through point $A$ is an oblique strophoid.

IMAGE
7 replies
luosw
Jun 6, 2021
drmzjoseph
14 minutes ago
Squares on harmonic quadrilateral
Tkn   1
N 17 minutes ago by EeEeRUT
Let $ABCD$ be a cyclic quadrilateral for which $AB\cdot CD=AD\cdot BC$. Construct two squares $BCEF$ and $DCGH$ externally on the sides $\overline{BC}$ and $\overline{DC}$ respectively.
Suppose that $\overleftrightarrow{BD}$ meets $\overleftrightarrow{AC}$ at $X$, $\overleftrightarrow{BE}$ meets $\overleftrightarrow{DG}$ at $Z$ and $O$ denotes circumcenter of $ABCD$. Prove that $(ZEG)$ and $(ZBD)$ meets again on $\overleftrightarrow{OX}$.
1 reply
Tkn
5 hours ago
EeEeRUT
17 minutes ago
Expression is a perfect square implies the polynomial is constant
Popescu   3
N 26 minutes ago by luutrongphuc
Source: IMSC Day 2 Problem 3
Let $a\equiv 1\pmod{4}$ be a positive integer. Show that any polynomial $Q\in\mathbb{Z}[X]$ with all positive coefficients such that
$$Q(n+1)((a+1)^{Q(n)}-a^{Q(n)})$$is a perfect square for any $n\in\mathbb{N}^{\ast}$ must be a constant polynomial.

Proposed by Vlad Matei, Romania
3 replies
+1 w
Popescu
Jun 29, 2024
luutrongphuc
26 minutes ago
Midpoint of bisector; prove that B, E, F, C cyclic
v_Enhance   8
N 26 minutes ago by ihategeo_1969
Source: Taiwan 2014 TST1, Problem 4
Let $ABC$ be an acute triangle and let $D$ be the foot of the $A$-bisector. Moreover, let $M$ be the midpoint of $AD$. The circle $\omega_1$ with diameter $AC$ meets $BM$ at $E$, while the circle $\omega_2$ with diameter $AB$ meets $CM$ at $F$. Assume that $E$ and $F$ lie inside $ABC$. Prove that $B$, $E$, $F$, $C$ are concyclic.
8 replies
v_Enhance
Jul 18, 2014
ihategeo_1969
26 minutes ago
p^2+3*p*q+q^2
mathbetter   2
N 26 minutes ago by togrulhamidli2011
\[
\text{Find all prime numbers } (p, q) \text{ such that } p^2 + 3pq + q^2 \text{ is a fifth power of an integer.}
\]
2 replies
mathbetter
Yesterday at 6:47 PM
togrulhamidli2011
26 minutes ago
P(a+1)=1 for every root a
MTA_2024   1
N an hour ago by pco
Find all real polynomials $P$ of degree $K$ having $k$ distinct real roots ($k \in \mathbb N$), such that for every root $a$ : $P(a+1)=1$.
1 reply
MTA_2024
an hour ago
pco
an hour ago
Functional equation
socrates   30
N an hour ago by NicoN9
Source: Baltic Way 2014, Problem 4
Find all functions $f$ defined on all real numbers and taking real values such that \[f(f(y)) + f(x - y) = f(xf(y) - x),\] for all real numbers $x, y.$
30 replies
socrates
Nov 11, 2014
NicoN9
an hour ago
Algebra Functions
pear333   1
N an hour ago by whwlqkd
Let $P(z)=z-1/z$. Prove that there does not exist a pair of rational numbers $x,y$ such that $P(x)+P(y)=4$.
1 reply
pear333
Today at 12:20 AM
whwlqkd
an hour ago
Polynomial equation with rational numbers
Miquel-point   2
N an hour ago by Assassino9931
Source: Romanian TST 1979 day 2 P1
Determine the polynomial $P\in \mathbb{R}[x]$ for which there exists $n\in \mathbb{Z}_{>0}$ such that for all $x\in \mathbb{Q}$ we have: \[P\left(x+\frac1n\right)+P\left(x-\frac1n\right)=2P(x).\]
Dumitru Bușneag
2 replies
Miquel-point
Apr 15, 2023
Assassino9931
an hour ago
Geometry
srnjbr   0
2 hours ago
In triangle ABC, D is the leg of the altitude from A. l is a variable line passing through D. E and F are points on l such that AEB=AFC=90. Find the locus of the midpoint of the line segment EF.
0 replies
srnjbr
2 hours ago
0 replies
Geometry
srnjbr   0
2 hours ago
in triangle abc, l is the leg of bisector a, d is the image of c on line al, and e is the image of l on line ab. take f as the intersection of de and bc. show that af is perpendicular to bc
0 replies
srnjbr
2 hours ago
0 replies
<QBC =<PCB if BM = CN, <PMC = <MAB, <QNB = < NAC
parmenides51   1
N 2 hours ago by dotscom26
Source: 2005 Estonia IMO Training Test p2
On the side BC of triangle $ABC$, the points $M$ and $N$ are taken such that the point $M$ lies between the points $B$ and $N$, and $| BM | = | CN |$. On segments $AN$ and $AM$, points $P$ and $Q$ are taken so that $\angle PMC = \angle  MAB$ and $\angle QNB = \angle NAC$. Prove that $\angle QBC = \angle PCB$.
1 reply
parmenides51
Sep 24, 2020
dotscom26
2 hours ago
Rational Numbers
Omid Hatami   3
N Sep 7, 2020 by Steve12345
Source: Iranian National Olympiad (3rd Round) 2007
Look at these fractions. At firs step we have $ \frac{0}{1}$ and $ \frac{1}{0}$, and at each step we write $ \frac{a+b}{c+d}$ between $ \frac{a}{b}$ and $ \frac{c}{d}$, and we do this forever
\[ \begin{array}{ccccccccccccccccccccccccc}\frac{0}{1}&&&&&&&&\frac{1}{0}\\ \frac{0}{1}&&&&\frac{1}{1}&&&&\frac{1}{0}\\ \frac{0}{1}&&\frac{1}{2}&&\frac{1}{1}&&\frac{2}{1}&&\frac{1}{0}\\ \frac{0}{1}&\frac{1}{3}&\frac{1}{2}&\frac{2}{3}&\frac{1}{1}&\frac{3}{2}&\frac{2}{1}&\frac{3}{1}&\frac{1}{0}\\ &&&&\dots\end{array}\]
a) Prove that each of these fractions is irreducible.
b) In the plane we have put infinitely many circles of diameter 1, over each integer on the real line, one circle. The inductively we put circles that each circle is tangent to two adjacent circles and real line, and we do this forever. Prove that points of tangency of these circles are exactly all the numbers in part a(except $ \frac{1}{0}$).
IMAGE
c) Prove that in these two parts all of positive rational numbers appear.
If you don't understand the numbers, look at here.
3 replies
Omid Hatami
Sep 10, 2007
Steve12345
Sep 7, 2020
Source: Iranian National Olympiad (3rd Round) 2007
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Omid Hatami
1275 posts
#1 • 3 Y
Y by Adventure10, Mango247, and 1 other user
Look at these fractions. At firs step we have $ \frac{0}{1}$ and $ \frac{1}{0}$, and at each step we write $ \frac{a+b}{c+d}$ between $ \frac{a}{b}$ and $ \frac{c}{d}$, and we do this forever
\[ \begin{array}{ccccccccccccccccccccccccc}\frac{0}{1}&&&&&&&&\frac{1}{0}\\ \frac{0}{1}&&&&\frac{1}{1}&&&&\frac{1}{0}\\ \frac{0}{1}&&\frac{1}{2}&&\frac{1}{1}&&\frac{2}{1}&&\frac{1}{0}\\ \frac{0}{1}&\frac{1}{3}&\frac{1}{2}&\frac{2}{3}&\frac{1}{1}&\frac{3}{2}&\frac{2}{1}&\frac{3}{1}&\frac{1}{0}\\ &&&&\dots\end{array}\]
a) Prove that each of these fractions is irreducible.
b) In the plane we have put infinitely many circles of diameter 1, over each integer on the real line, one circle. The inductively we put circles that each circle is tangent to two adjacent circles and real line, and we do this forever. Prove that points of tangency of these circles are exactly all the numbers in part a(except $ \frac{1}{0}$).
//cdn.artofproblemsolving.com/images/f8ca50c91d67a99bdb77dd5dab3d66101f71815a.png
c) Prove that in these two parts all of positive rational numbers appear.
If you don't understand the numbers, look at here.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
shape_shift2005
17 posts
#2 • 2 Y
Y by Adventure10, Mango247
Hint for a
Click to reveal hidden text
very nice solution for b
Click to reveal hidden text
Hint for c
Click to reveal hidden text
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Omid Hatami
1275 posts
#3 • 2 Y
Y by Adventure10, Mango247
Official Solution:
For part (a) we use induction. If $ bc-ad=1$ then $ b(a+c)-a(b+d)=ba+bc-ab-ad=bc-ad=1$ and $ (b+d)c-(a+d)c=bc+dc-ad-dc=bc-ad=1$ which proves the induction step. It is obvious that it is true at the beginning of the process.
Now if $ bc-ad=1$ then $ (a,b)=1$. So every fraction appearing in this process is simplified.
We will show that if $ x$ is a number generated in one of the processes, then $ \frac 1x,x+1,x-1$ are also produced.
For the first operation: If the $ i^{th}$ number, counting from the beginning of the sequence, is $ \frac ab$, then the $ i^{th}$ number, counting from the end of the sequence, would be $ \frac ba$. This is true at the beginning. ($ \frac 10,\frac 01$) And using induction, it is no hard to prove it.
Now note that the sequence generated by $ a+1,b+1$ as the first and the last fraction is exactly the sequence generated by $ a,b$ as the first and the last fraction, plus $ 1$. (that is a $ 1$ is added to each term of the sequence) Again this is easy to prove using induction. At the beginning it is true. If $ \frac ab,\frac cd$ are generated somewhere in the second sequence, then $ \frac {a+b}b,\frac {c+d}d$ are generated in the first sequence. The next fraction appearing between them is $ \frac{a+c+b+d}{c+d}$ which is one unit more than $ \frac{a+c}{b+d}$ (the one appearing in the second sequence)
Now note that, in the $ 1^{st}$ step of the process, the number appearing just before $ \frac 10$ is $ \frac 11$. Therefor the numbers appearing between $ \frac 11,\frac 10$ are exactly one unit more than the numbers appearing between $ \frac 01,\frac 10$. (which are all the numbers appearing in the process) So if $ x$ appears in the process, $ x+1$ does, and if $ x+1$ does, then so does $ x$.
Now for the second process: It is obvious that if $ x$ appears, then so does $ x+1$, because the first circles are one unit apart from each other. A unit inversion from the $ 0$ of the x axis, maps circles to circles, and tangent ones to tangent ones. The circle above $ 0$ is mapped to the line $ y=1$. So the circles tangent to it, are mapped to the circles tangent to $ y=0$ and $ y=1$. Each two consecutive circles among these ones are mapped to tangent circles. Therefor these circles are mapped to circles above natural numbers, with diameter $ 1$. (the first circles of the process)
Since the inverse of inversion is itself, the circles above natural numbers are mapped to circles appearing in the process and tangent to the circle above $ 0$.
This inversion maps the point $ x$ of the real line to $ \frac 1x$. Therefor if $ x$ appears in the process, $ \frac 1x$ appears in the image of the process under the inversion which also appears in the first sequence itself.
So in both processes, if $ x$ appears, then so does $ \frac 1x$ and $ x+1$ and $ x-1$. (if it's not negative)
Now consider the Euclidean algorithm for a pair of relatively prime numbers $ (a,b)$. In each step if our pair is $ (a,b)$ consider the fraction $ \frac ab$. Then a step consisting of swapping the numbers is the same as replacing our fraction $ x$ by $ \frac 1x$. A step consisting of replacing $ (a,b)$ by $ (a-b,b)$ is the same as replacing $ x$ by $ x-1$. Therefor after some number of moves of the form $ x\rightarrow\frac 1x$ and $ x\rightarrow x-1$, $ x$ becomes $ \frac 01$. (because $ (a,b)$ were relatively prime)
Using the inverse operations, which are $ x\rightarrow\frac 1x$ and $ x\rightarrow x+1$, we see that we can reach each rational number from $ \frac 01$ which is present in both processes.
So all the rational numbers appear in both processes. What remains to prove, is to show that only rational numbers appear in the second process. But it is a straightforward induction. Assume that two tangent circles $ C_1,C_2$ appeared in the process and we know that their tangency points with the x axis are rational numbers.
Using some unit translations and inversion from $ 0$, we can map $ C_1$ to the circle above $ 0$. We have already shown that these operations and their inverse maps, map circles appearing in the process to circles appearing in the process. So now we have two circles appearing in the process, and one of them is the one above $ 0$. We know that the circles tangent to this one are the circles above $ \frac 1n$'s. So the circle between $ C_1,C_2$ is mapped to a circle above $ \frac 1n$ for some $ n$ which has a rational tangency point. Since our operations map rational numbers to rational numbers, the original tangency point should have been a rational number; which completes the proof.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Steve12345
618 posts
#4
Y by
Farey sequences; https://www.youtube.com/watch?v=0hlvhQZIOQw&ab_channel=Numberphile
Z K Y
N Quick Reply
G
H
=
a