Search Results for ""
81 - 90 of 1497 for Prime FactorizationSearch Results
There exist a variety of formulas for either producing the nth prime as a function of n or taking on only prime values. However, all such formulas require either extremely ...
A Wilson prime is a prime satisfying W(p)=0 (mod p), where W(p) is the Wilson quotient, or equivalently, (p-1)!=-1 (mod p^2). The first few Wilson primes are 5, 13, and 563 ...
A prime partition of a positive integer n>=2 is a set of primes p_i which sum to n. For example, there are three prime partitions of 7 since 7=7=2+5=2+2+3. The number of ...
When the group order h of a finite group is a prime number, there is only one possible group of group order h. Furthermore, the group is cyclic.
A ring for which the product of any pair of ideals is zero only if one of the two ideals is zero. All simple rings are prime.
The unique even prime number 2. All other primes are odd primes. Humorously, that means 2 is the "oddest" prime of all. The sequence 2, 4, 6, 10, 14, 22, 26, 34, 38, ... ...
The prime subfield of a field F is the subfield of F generated by the multiplicative identity 1_F of F. It is isomorphic to either Q (if the field characteristic is 0), or ...
The prime number theorem gives an asymptotic form for the prime counting function pi(n), which counts the number of primes less than some integer n. Legendre (1808) suggested ...
A Smarandache prime is a prime Smarandache number, i.e., a prime number of the form 1234...n. Surprisingly, no Smarandache primes are known as of Nov. 2015. Upper limits on ...
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 ...
...
View search results from all Wolfram sites (7615 matches)

