Search Results for ""
1121 - 1130 of 1907 for encyclopedia of lifeSearch Results
A pi-prime is a prime number appearing in the decimal expansion of pi. The known examples are 3, 31, 314159, 31415926535897932384626433832795028841, ... (OEIS A005042). The ...
A Pierpont prime is a prime number of the form p=2^k·3^l+1. The first few Pierpont primes are 2, 3, 5, 7, 13, 17, 19, 37, 73, 97, 109, 163, 193, 257, 433, 487, 577, 769, ... ...
The sequence of Fibonacci numbers {F_n} is periodic modulo any modulus m (Wall 1960), and the period (mod m) is the known as the Pisano period pi(m) (Wrench 1969). For m=1, ...
Two planes always intersect in a line as long as they are not parallel. Let the planes be specified in Hessian normal form, then the line of intersection must be ...
A point process is a probabilistic model for random scatterings of points on some space X often assumed to be a subset of R^d for some d. Oftentimes, point processes describe ...
Three-dimensional generalization of the polyominoes to n dimensions. The number of polycubes N(n) composed of n cubes are 1, 1, 2, 8, 29, 166, 1023, ... (OEIS A000162; Ball ...
Let a convex polygon be inscribed in a circle and divided into triangles from diagonals from one polygon vertex. The sum of the radii of the circles inscribed in these ...
The mean triangle area of a triangle picked inside a regular n-gon of unit area is A^__n=(9cos^2omega+52cosomega+44)/(36n^2sin^2omega), (1) where omega=2pi/n (Alikoski 1939; ...
A polyhedral nonhamiltonian graph is a graph that is simultaneously polyhedral and nonhamiltonian. The smallest possible number of vertices a nonhamiltonian polyhedral graph ...
Porter's constant is the constant appearing in formulas for the efficiency of the Euclidean algorithm, C = (6ln2)/(pi^2)[3ln2+4gamma-(24)/(pi^2)zeta^'(2)-2]-1/2 (1) = ...
...
View search results from all Wolfram sites (35508 matches)

