Search Results for ""

A Fibonacci prime is a Fibonacci number F_n that is also a prime number. Every F_n that is prime must have a prime index n, with the exception of F_4=3. However, the converse ...

The Gauss-Kuzmin distribution is the distribution of occurrences of a positive integer k in the continued fraction of a random (or "generic") real number. Consider xi_n ...

The great icosahedron, not to be confused with the great icosidodecahedron orgreat icosicosidodecahedron, is the Kepler-Poinsot polyhedronhose dual is the great stellated ...

Let two points x and y be picked randomly from a unit n-dimensional hypercube. The expected distance between the points Delta(n), i.e., the mean line segment length, is then ...

The Jacobi triple product is the beautiful identity product_(n=1)^infty(1-x^(2n))(1+x^(2n-1)z^2)(1+(x^(2n-1))/(z^2))=sum_(m=-infty)^inftyx^(m^2)z^(2m). (1) In terms of the ...

It is possible to perform multiplication of large numbers in (many) fewer operations than the usual brute-force technique of "long multiplication." As discovered by Karatsuba ...

The least common multiple of two numbers a and b, variously denoted LCM(a,b) (this work; Zwillinger 1996, p. 91; Råde and Westergren 2004, p. 54), lcm(a,b) (Gellert et al. ...

A line is a straight one-dimensional figure having no thickness and extending infinitely in both directions. A line is sometimes called a straight line or, more archaically, ...

Given a Jacobi theta function, the nome is defined as q(k) = e^(piitau) (1) = e^(-piK^'(k)/K(k)) (2) = e^(-piK(sqrt(1-k^2))/K(k)) (3) (Borwein and Borwein 1987, pp. 41, 109 ...

Numerical integration is the approximate computation of an integral using numerical techniques. The numerical computation of an integral is sometimes called quadrature. ...