Implement reciprocal Fibonacci constant #1619
Merged
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
A nearly useless mathematical constant, but I couldn't not implement it, just to have as a benchmark, when I realized that the preposterous series by Bill Gosper leads to a quasilinear-time algorithm (did no one else notice this before?).
In terms of speed, we have, for example, pi < reciprocal_fibonacci < log2:
Edit: 1 billion digits in 12 minutes; I need to drop down to 2 threads or I run out of memory: