Software, source code, etc. for problems pertaining to number theory (11-04) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Radix representation; digital problems (11A63) Numerical summation of series (65B10) Computation of special functions and constants, construction of tables (65D20)
Cites work
Cited in
(7)- Computing GCD's by normalized division
- A Justification for Applying the Principle of Minimum Relative Entropy to Information Integration Problems
- The average length of finite continued fractions with fixed denominator
- On the statistical properties of finite continued fractions
- The mean number of steps in the Euclidean algorithm with odd partial quotients
- On the asymptotic analysis of the Euclidean algorithm
- On Gauss-Kuz'min statistics for finite continued fractions
This page was built for publication: Evaluation of Porter's constant
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1244347)