Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Simple continued fraction
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===A property of the golden ratio Ο=== Because the continued fraction expansion for [[golden ratio|Ο]] doesn't use any integers greater than 1, Ο is one of the most "difficult" real numbers to approximate with rational numbers. [[Hurwitz's theorem (number theory)|Hurwitz's theorem]]{{sfn|Hardy|Wright|2008|loc=Theorem 193}} states that any irrational number {{mvar|k}} can be approximated by infinitely many rational {{sfrac|''m''|''n''}} with :<math>\left| k - {m \over n}\right| < {1 \over n^2 \sqrt 5}.</math> While virtually all real numbers {{mvar|k}} will eventually have infinitely many convergents {{sfrac|''m''|''n''}} whose distance from {{mvar|k}} is significantly smaller than this limit, the convergents for Ο (i.e., the numbers {{sfrac|5|3}}, {{sfrac|8|5}}, {{sfrac|13|8}}, {{sfrac|21|13}}, etc.) consistently "toe the boundary", keeping a distance of almost exactly <math>{\scriptstyle{1 \over n^2 \sqrt 5}}</math> away from Ο, thus never producing an approximation nearly as impressive as, for example, [[MilΓΌ|{{sfrac|355|113}}]] for [[pi|{{pi}}]]. It can also be shown that every real number of the form {{sfrac|''a'' + ''b''Ο|''c'' + ''d''Ο}}, where {{mvar|a}}, {{mvar|b}}, {{mvar|c}}, and {{mvar|d}} are integers such that {{math|1=''a''β''d'' β ''b''β''c'' = Β±1}}, shares this property with the golden ratio Ο; and that all other real numbers can be more closely approximated.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)