mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Programming

Reply
 
Thread Tools
Old 2021-04-05, 12:41   #1
sinandredemptio
 
Apr 2021

2 Posts
Post Fast continued fraction cruncher

Zuuv is a program that can compute the regular continued fraction of a number from it's floating-point representation (a file containing hex or dec digits). It features log-linear runtime, disk-based computations (for large computations), fault tolerance, and basic multi-threading.

Zuuv can easily be used to break world records for terms of continued fractions of constants like Pi, Euler-Mascheroni 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 Euler-mascheroni 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 2021-04-05 at 17:57 Reason: (added link from below)
sinandredemptio is offline   Reply With Quote
Old 2021-04-05, 15:04   #2
xilman
Bamboozled!
 
xilman's Avatar
 
"π’‰Ίπ’ŒŒπ’‡·π’†·π’€­"
May 2003
Down not across

22×7×383 Posts
Default

Quote:
Originally Posted by sinandredemptio View Post
Zuuv is a program that can compute the regular continued fraction of a number from it's floating-point representation (a file containing hex or dec digits). It features log-linear runtime, disk-based computations (for large computations), fault tolerance, and basic multi-threading.

Zuuv can easily be used to break world records for terms of continued fractions of constants like Pi, Euler-Mascheroni 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 Euler-mascheroni 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.
Released it how and where?

Hard to give feedback without access to it.
xilman is online now   Reply With Quote
Old 2021-04-05, 15:14   #3
sinandredemptio
 
Apr 2021

2 Posts
Default

Quote:
Originally Posted by xilman View Post
Released it how and where?

Hard to give feedback without access to it.
Well, this is embarrassing. Here's the GitHub :)
sinandredemptio is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Continued product Carmichael numbers devarajkandadai Number Theory Discussion Group 2 2019-09-24 03:14
Do normal adults give themselves an allowance? (...to fast or not to fast - there is no question!) jasong jasong 35 2016-12-11 00:57
why continued fractions gives one factor for N=(4m+3)(4n+3) wsc811 Miscellaneous Math 6 2013-11-29 21:43
Continued Fraction Algorithm Raman Math 7 2009-02-27 18:01
Continued Fraction of Primes Cyclamen Persicum Miscellaneous Math 9 2003-04-13 14:56

All times are UTC. The time now is 17:50.

Sat Jun 19 17:50:52 UTC 2021 up 22 days, 15:38, 0 users, load averages: 2.41, 2.50, 2.42

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.