### Meta

### Categories

- algebra (46)
- arithmetic (74)
- books (30)
- calculus (7)
- challenges (56)
- combinatorics (21)
- complex numbers (6)
- computation (76)
- convergence (9)
- counting (32)
- famous numbers (48)
- fibonacci (18)
- fractals (13)
- games (34)
- geometry (71)
- golden ratio (8)
- group theory (28)
- humor (7)
- induction (7)
- infinity (19)
- iteration (24)
- links (76)
- logic (9)
- meta (43)
- modular arithmetic (27)
- number theory (101)
- open problems (11)
- paradox (1)
- pascal's triangle (8)
- pattern (98)
- people (21)
- pictures (71)
- posts without words (32)
- primes (55)
- probability (6)
- programming (20)
- proof (83)
- puzzles (18)
- recursion (16)
- review (21)
- sequences (28)
- solutions (30)
- teaching (14)
- trig (3)
- Uncategorized (6)
- video (19)

### Archives

- March 2019 (2)
- February 2019 (3)
- January 2019 (4)
- November 2018 (3)
- October 2018 (4)
- September 2018 (4)
- August 2018 (6)
- July 2018 (2)
- June 2018 (5)
- May 2018 (3)
- April 2018 (5)
- March 2018 (4)
- February 2018 (3)
- January 2018 (4)
- December 2017 (3)
- November 2017 (3)
- October 2017 (1)
- September 2017 (1)
- July 2017 (4)
- June 2017 (4)
- May 2017 (9)
- April 2017 (7)
- March 2017 (5)
- February 2017 (4)
- January 2017 (3)
- December 2016 (4)
- November 2016 (6)
- October 2016 (6)
- September 2016 (2)
- August 2016 (5)
- July 2016 (2)
- June 2016 (4)
- May 2016 (4)
- April 2016 (2)
- March 2016 (3)
- February 2016 (9)
- January 2016 (8)
- December 2015 (5)
- November 2015 (29)
- August 2015 (3)
- June 2015 (2)
- April 2015 (1)
- May 2014 (1)
- December 2013 (1)
- October 2013 (1)
- July 2013 (1)
- June 2013 (1)
- May 2013 (1)
- April 2013 (3)
- March 2013 (3)
- February 2013 (2)
- January 2013 (5)
- December 2012 (3)
- November 2012 (4)
- October 2012 (5)
- September 2012 (1)
- August 2012 (4)
- July 2012 (1)
- June 2012 (6)
- May 2012 (2)
- April 2012 (3)
- March 2012 (1)
- February 2012 (4)
- January 2012 (5)
- December 2011 (1)
- November 2011 (7)
- October 2011 (4)
- September 2011 (6)
- July 2011 (2)
- June 2011 (4)
- May 2011 (5)
- April 2011 (2)
- March 2011 (4)
- February 2011 (1)
- January 2011 (1)
- December 2010 (1)
- November 2010 (4)
- October 2010 (2)
- September 2010 (1)
- August 2010 (1)
- July 2010 (1)
- June 2010 (2)
- May 2010 (3)
- April 2010 (1)
- February 2010 (6)
- January 2010 (3)
- December 2009 (8)
- November 2009 (7)
- October 2009 (3)
- September 2009 (3)
- August 2009 (1)
- June 2009 (4)
- May 2009 (5)
- April 2009 (4)
- March 2009 (2)
- February 2009 (1)
- January 2009 (7)
- December 2008 (1)
- October 2008 (2)
- September 2008 (7)
- August 2008 (1)
- July 2008 (1)
- June 2008 (1)
- April 2008 (5)
- February 2008 (4)
- January 2008 (4)
- December 2007 (3)
- November 2007 (12)
- October 2007 (2)
- September 2007 (4)
- August 2007 (3)
- July 2007 (1)
- June 2007 (3)
- May 2007 (1)
- April 2007 (4)
- March 2007 (3)
- February 2007 (7)
- January 2007 (1)
- December 2006 (2)
- October 2006 (2)
- September 2006 (6)
- July 2006 (4)
- June 2006 (2)
- May 2006 (6)
- April 2006 (3)
- March 2006 (6)

## Post without words #23

Image
This entry was posted in pattern, pictures, posts without words and tagged algorithm, Calkin-Wilf, Euclidean, tree. Bookmark the permalink.

Clearly related to Euclid’s Orchard and PWW 20 ( https://mathlesstraveled.com/2017/07/08/post-without-words-20/ ) but the meaning of the steps is not clear. (Blue dots are those added since the last step.)

Is a sort of reverse Euclid algorithm? If (a,b) are coprime then at the next step you can add (a+b,b) and (a,a+b), since those also must be coprime.

Wow, that was fast! You got it. =) See also https://mathlesstraveled.com/2008/01/07/recounting-the-rationals-part-ii-fractions-grow-on-trees/ .

For some reason the Calkin-Wilf tree and the Euclidean Algorithm is one of my favorite topics. I keep coming back to it!

Oh, nice. I was briefly wondering if it was something about only adding dots that are directly above or to the right of known dots, which was actually close since if you drew the lines of the tree on this map they’d be vertical and horizontal strokes.

You can even rephrase this graphically: start with a point at 1,1 and at every step, each point adds two points by taking two steps: a +y step equal in length to its x coordinate and the reverse.

Yes, that’s a nice way to think of it.

So what causes the “fingers” we can see in the diagram? I don’t think they’re features of the orchard itself (which has a “uniform” density of ) so they must be to do with the order in which this algorithm plants the trees.

Based on the graphical version of the algorithm, the biggest additions come from the farthest-out points so the (1,n) and (n,1) lines creep along while the more central points take large jumps at every step. The x=y line is excluded by the nature of the orchard, and likewise the other divisions between fingers. It might be interesting to see this colored by position of the tree, with the farthest left and farthest right branches in red and the rest in the appropriate hue.

Interesting idea, but I’m not sure it turned out to be all that enlightening:

The fingers are arranged along lines with slopes which are ratios of Fibonacci numbers, or sums of Fibonacci numbers. I think Denis has a good explanation of what causes this.

The “anti-fingers” (the radial “gaps” with no dots) are arranged along lines with slopes that are simple fractions like 1/2, 1/3, 2/3, etc.

Cool! This is related to Problems 43 and 44 from my problem solving course. The problems are here:

http://danaernst.com/teaching/mat220f18/220ProblemCollection.pdf

Note: This list of problems grows as the semester progresses.

Yes, very nice! So what I have shown can be thought of as a graph of all the points you can reach with your hyperdrive after at most 10 jumps.