Is there such a method that computes 'e' to 'n' correct digits with less than 'n' iterations?
136869
Fastest converging method for calculating e
119932
Generalizing $\,r(n^2) = r(n)^2,\,$ for $\,r(n) := $ reverse the digits of $n$
72223
Last non Zero digit of a Factorial
148703
Permutations with repeating digits
75734
How to make the computer consider two numbers equal up to a certain precision
48688
How do I format a number with a variable number of digits in Python?
52518
Infinite sequence of digits without consecutive repeating subsequenes
92183
Pair-wise iteration in C# or sliding window enumerator
65328
Counts and skips the numbers that have digits divisible by 3 (change in base method)
70492
What is the shortest way to compute the last 3 digits of $17^{256}$?
39969
Algorithms for computing multiplicative order modulo $n$
52499
Force R not to use exponential notation (e.g. e+10)?
129441
How do I determine the number of digits of an integer in C?
112599
What is the smallest value of n such that an algorithm running at 100*n^2 operates faster than 2^n ? [How to figure out without brute force]
42462
Use a linear approximation to estimate the number $64.07^{2/3}$
153831
Approximating $\pi$ with least digits
114764
Remove insignificant trailing zeros from a number?