Created
March 28, 2025 10:43
-
-
Save MurageKibicho/3ba3b702bb68759f3fa5d6a689ed5e63 to your computer and use it in GitHub Desktop.
LeetArxiv Journal Template
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| <!DOCTYPE html> | |
| <html lang="en"> | |
| <head> | |
| <meta charset="UTF-8"> | |
| <meta name="viewport" content="width=device-width, initial-scale=1.0"> | |
| <title>Asymptotically Fast Factorization</title> | |
| <style> | |
| body { | |
| font-family: "Times New Roman", Times, serif; | |
| max-width: 800px; | |
| margin: 40px auto; | |
| padding: 20px; | |
| text-align: center; | |
| line-height: 1.6; | |
| } | |
| h1 { | |
| font-size: 24px; | |
| font-weight: bold; | |
| margin-top: 40px; | |
| } | |
| h2 { | |
| font-size: 18px; | |
| font-weight: bold; | |
| } | |
| .abstract { | |
| text-align: justify; | |
| font-size: 16px; | |
| } | |
| .bold { | |
| font-weight: bold; | |
| } | |
| .journal { | |
| text-transform: uppercase; | |
| font-size: 14px; | |
| text-align: left; | |
| font-weight: bold; | |
| } | |
| .author { | |
| font-size: 18px; | |
| font-weight: bold; | |
| } | |
| </style> | |
| </head> | |
| <body> | |
| <div class="journal"> | |
| <p>LEETARXIV COMPUTATIONAL ARITHMETIC<br> | |
| VOLUME 3, NUMBER 2<br> | |
| JANUARY 2023</p> | |
| </div> | |
| <h1>What every AI programmer should know about <br/>Stern Brocot Fractions</h1> | |
| <h3>Stern Brocot Fractions for Floating Point arithmetic in AI</h3> | |
| <p class="author">By Murage Kibicho*</p> | |
| <p class="abstract"> | |
| <span class="bold">Abstract.</span> <i>Floating-point</i> and <i>fixed-point</i> representations of fractions are well-studied in computer science. | |
| This article explores the <b>Stern-Brocot Tree of Mediants</b> as an alternative to fixed-point and floating-point arithmetic. | |
| Esoteric treaties explore deeply the use of continued fractions, and by extension, continued logarithms as efficient representations of | |
| fractions in computing. | |
| This article introduces the motivated programmer the relativley-obscure Stern-Brocot tree | |
| <br/> | |
| </p> | |
| </body> | |
| </html> |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment