20210405, 12:41  #1 
Apr 2021
2 Posts 
Fast continued fraction cruncher
Zuuv is a program that can compute the regular continued fraction of a number from it's floatingpoint representation (a file containing hex or dec digits). It features loglinear runtime, diskbased computations (for large computations), fault tolerance, and basic multithreading.
Zuuv can easily be used to break world records for terms of continued fractions of constants like Pi, EulerMascheroni etc. even on regular PCs with enough dedication. For example, Zuuv took four hours on my poor Intel i5 9th gen laptop to churn out 2.4 billion terms of Eulermascheroni constant's continued fraction (the world record is just ~4.8 billion) I just released the first alpha version of Zuuv yesterday, so feedback would be much appreciated. Here's the GitHub :) Last fiddled with by Batalov on 20210405 at 17:57 Reason: (added link from below) 
20210405, 15:04  #2  
Bamboozled!
"πΊππ·π·π"
May 2003
Down not across
3×37×97 Posts 
Quote:
Hard to give feedback without access to it. 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Continued product Carmichael numbers  devarajkandadai  Number Theory Discussion Group  2  20190924 03:14 
Do normal adults give themselves an allowance? (...to fast or not to fast  there is no question!)  jasong  jasong  35  20161211 00:57 
why continued fractions gives one factor for N=(4m+3)(4n+3)  wsc811  Miscellaneous Math  6  20131129 21:43 
Continued Fraction Algorithm  Raman  Math  7  20090227 18:01 
Continued Fraction of Primes  Cyclamen Persicum  Miscellaneous Math  9  20030413 14:56 