TOPICS
Search

Search Results for ""


121 - 130 of 4217 for Strong Lawof Small NumbersSearch Results
The convex hulls of the small cubicuboctahedron U_(13), small rhombihexahedron U_(18), and stellated truncated hexahedron U_(19) are all the Archimedean small ...
Pronic numbers are figurate numbers of the form P_n=2T_n=n(n+1), where T_n is the nth triangular number. The first few are 2, 6, 12, 20, 30, 42, 56, 72, 90, 110, ... (OEIS ...
A perfect partition is a partition of a number n whose elements uniquely generate any number 1, 2, ..., n. {1,1,...,1_()_(n)} is always a perfect partition of n, and every ...
By asking a small number of innocent-sounding questions about an unknown number, it is possible to reconstruct the number with absolute certainty (assuming that the questions ...
A quartic symmetric graph on 30 nodes and 60 edges corresponding to the skeleton of the Archimdean icosidodecahedron, great dodecahemidodecahedron, great icosidodecahedron, ...
The nth Suzanne set S_n is defined as the set of composite numbers x for which n|S(x) and n|S_p(x), where x = a_0+a_1(10^1)+...+a_d(10^d) (1) = p_1p_2...p_m, (2) and S(x) = ...
Consider the recurrence equation defined by a_0=m and a_n=|_sqrt(2a_(n-1)(a_(n-1)+1))_|, (1) where |_x_| is the floor function. Graham and Pollak actually defined a_1=m, but ...
Let pi_(m,n)(x) denote the number of primes <=x which are congruent to n modulo m (i.e., the modular prime counting function). Then one might expect that ...
A pseudoprime is a composite number that passes a test or sequence of tests that fail for most composite numbers. Unfortunately, some authors drop the "composite" ...
In the study of non-associative algebra, there are at least two different notions of what the half-Bol identity is. Throughout, let L be an algebraic loop and let x, y, and z ...
1 ... 10|11|12|13|14|15|16 ... 422 Previous Next

...