词条 | Porter's constant |
释义 |
In mathematics, Porter's constant C arises in the study of the efficiency of the Euclidean algorithm.[1][2] It is named after J. W. Porter of University College, Cardiff. Euclid's algorithm finds the greatest common divisor of two positive integers {{mvar|m}} and {{mvar|n}}. Hans Heilbronn proved that the average number of iterations of Euclid's algorithm, for fixed {{mvar|m}} and averaged over all choices of relatively prime integers {{mvar|n}}, is Porter showed that the error term in this estimate is a constant, plus a polynomially-small correction, and Donald Knuth evaluated this constant to high accuracy. It is: where is the Euler–Mascheroni constant is the Riemann zeta function is the Glaisher–Kinkelin constant{{OEIS|A086237}} See also
References1. ^{{citation | last = Knuth | first = Donald E. | authorlink = Donald E. Knuth | doi = 10.1016/0898-1221(76)90025-0 | issue = 2 | journal = Computers & Mathematics with Applications | pages = 137–139 | title = Evaluation of Porter's constant | volume = 2 | year = 1976}} 2. ^{{citation | last = Porter | first = J. W. | doi = 10.1112/S0025579300004459 | issue = 1 | journal = Mathematika | mr = 0498452 | pages = 20–28 | title = On a theorem of Heilbronn | volume = 22 | year = 1975}}. 2 : Mathematical constants|Analytic number theory |
随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。