Search Results for ""
171 - 180 of 1800 for Prime powerSearch Results
A set of residues {a_1,a_2,...,a_(k+1)} (mod n) such that every nonzero residue can be uniquely expressed in the form a_i-a_j. Examples include {1,2,4} (mod 7) and {1,2,5,7} ...
A Woodall number is a number of the form W_n=2^nn-1. Woodall numbers are therefore similar to Mersenne numbers 2^n-1 but with an additional factor of n multiplying the power ...
An n-manifold which cannot be "nontrivially" decomposed into other n-manifolds.
Find the m×n array of single digits which contains the maximum possible number of primes, where allowable primes may lie along any horizontal, vertical, or diagonal line. For ...
A power of 10.
A generalization of the Kronecker decomposition theorem which states that every finitely generated Abelian group is isomorphic to the group direct sum of a finite number of ...
Let E be the largest and e the smallest power of l in the HOMFLY polynomial of an oriented link, and i be the braid index. Then the Morton-Franks-Williams inequality holds, ...
The number two (2) is the second positive integer and the first prime number. It is even, and is the only even prime (the primes other than 2 are called the odd primes). The ...
3 is the only integer which is the sum of the preceding positive integers (1+2=3) and the only number which is the sum of the factorials of the preceding positive integers ...
SNTP(n) is the smallest prime such that p#-1, p#, or p#+1 is divisible by n, where p# is the primorial of p. Ashbacher (1996) shows that SNTP(n) only exists 1. If there are ...
...
View search results from all Wolfram sites (323922 matches)

