Caricamento...
Analysis of the subtractive algorithm for greatest common divisors
The sum of all partial quotients in the regular continued fraction expansions of m/n, for 1 ≤ m ≤ n, is shown to be 6π(-2)n(ln n)(2) + O(n log n(log log n)(2)). This result is applied to the analysis of what is perhaps the oldest non-trivial algorithm for number-theoretic computations.
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
1975
|
| Soggetti: | |
| Accesso online: | https://ncbi.nlm.nih.gov/pmc/articles/PMC388801/ https://ncbi.nlm.nih.gov/pubmed/16592294 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne! !
|