Search Results for ""

The decimal expansion of the Golomb-Dickman constant is given by lambda=0.6243299885... (OEIS A084945). Mitchell (1968) computed lambda to 53 decimal places. lambda has been ...

A regularly spaced array of points in a square array, i.e., points with coordinates (m,n,...), where m, n, ... are integers. Such an array is often called a grid or mesh, and ...

The Jacobi polynomials, also known as hypergeometric polynomials, occur in the study of rotation groups and in the solution to the equations of motion of the symmetric top. ...

The numerical value of Khinchin's constant K is given by K=2.685452001... (OEIS A002210). However, the numerical value of K is notoriously difficult to calculate to high ...

A matching, also called an independent edge set, on a graph G is a set of edges of G such that no two sets share a vertex in common. It is not possible for a matching on a ...

A function f is said to be an entire modular form of weight k if it satisfies 1. f is analytic in the upper half-plane H, 2. f((atau+b)/(ctau+d))=(ctau+d)^kf(tau) whenever [a ...

The transformation of a sequence a_1, a_2, ... with a_n=sum_(d|n)b_d (1) into the sequence b_1, b_2, ... via the Möbius inversion formula, b_n=sum_(d|n)mu(n/d)a_d. (2) The ...

The numerical value of ln10 is given by ln10=2.302585092994045684... (OEIS A002392). It was computed to 10^(11) decimal digits by S. Kondo on May 20, 2011 (Yee). The Earls ...

Given a positive integer m>1, let its prime factorization be written m=p_1^(a_1)p_2^(a_2)p_3^(a_3)...p_k^(a_k). (1) Define the functions h(n) and H(n) by h(1)=1, H(1)=1, and ...

The Pratt certificate is a primality certificate based on Fermat's little theorem converse. Prior to the work of Pratt (1975), the Lucas-Lehmer test had been regarded purely ...