Search Results for ""

A modification of Legendre's formula for the prime counting function pi(x). It starts with |_x_| = (1) where |_x_| is the floor function, P_2(x,a) is the number of integers ...

Simplemindedly, a number theoretic transform is a generalization of a fast Fourier transform obtained by replacing e^(-2piik/N) with an nth primitive root of unity. This ...

A Stoneham number is a number alpha_(b,c) of the form alpha_(b,c)=sum_(k=1)^infty1/(b^(c^k)c^k), where b,c>1 are relatively prime positive integers. Stoneham (1973) proved ...

When p is a prime number, then a p-group is a group, all of whose elements have order some power of p. For a finite group, the equivalent definition is that the number of ...

The regular polygon of 17 sides is called the heptadecagon, or sometimes the heptakaidecagon. Gauss proved in 1796 (when he was 19 years old) that the heptadecagon is ...

A curvilinear polygon built up of circular arcs. The Reuleaux polygon is a generalization of the Reuleaux triangle and, for an odd number of sides, is a curve of constant ...

An algorithm for multiplying two 32-bit integers modulo a 32-bit constant without using any intermediates larger than 32 bits. It is also useful in certain types of random ...

A two-graph (V,Delta) on nodes V is a collection Delta of unordered triples of the vertices (the so-called "odd triples") such that each 4-tuple of V contains an even number ...

C_4 is one of the two groups of group order 4. Like C_2×C_2, it is Abelian, but unlike C_2×C_2, it is a cyclic. Examples include the point groups C_4 (note that the same ...

The continued fraction of A is [1; 3, 1, 1, 5, 1, 1, 1, 3, 12, 4, 1, 271, 1, ...] (OEIS A087501). A plot of the first 256 terms of the continued fraction represented as a ...