The book is now available! 1
(another Prime Pages' Curiosity)
Prime Curios!
Curios: Curios Search:
 

Participate:
Share
The hardware and software on this system was updated September 4th.  Please let me know of any problem you encounter. <caldwell@utm.edu>

+ Any integer greater than one is called a prime number if (and only if) its only positive divisors (factors) are one and itself.

+ The number 1 is considered neither prime or composite but in a class of its own. It is the multiplicative identity, so it is also a unit and a divisor of unity.

+ Every natural number is the period length of at least 1 prime.

+ The number of factors of an integer can be found by adding 1 to the exponent of each prime factor and then calculating the product. For example, the prime factorization of 12 is 22 * 3 and 12 has (2 + 1)(1 + 1) = 6 factors.

+ The chance of a random integer x being prime is about 1/log(x).

+ Unlike the original proof of the Prime Number Theorem from 1896 by Hadamard and Poussin, Erdös and Selberg's proof in 1949 did not employ the square root of -1.

+ Henry Ernest Dudeney's 3-by-3 magic square contains "1" non-prime:

67143
133761
31737

+ Bertrand's postulate asserts the existence of at least one prime between n and 2n.

+ Johann H. Lambert (1728-1777), announced without proof that every prime number has at least one primitive root.

+ The only proper divisor of primes. [Beedassy]

+ Ernst Gabor Strauss (1922--1983) was said to have replied to a student's question about why 1 is not a prime: "The primes are the building bricks for arithmetic, and 1 is just not a brick!"

+ Mersenne primes can be written as unbroken strings of consecutive 1s in binary form.

+ The only number with exactly one positive divisor. [Gupta]

+ The only number whose concatenation with itself can yield primes in many cases. [Murthy]

+ There is only 1 "Prime Street" in England. It is in Stoke-on-Trent, Staffordshire. [Croll]

+ Bertrand's Postulate guarantees that in every base there is at least one prime of any given length beginning with the digit 1, and Benford's Law tells us that primes with leading digit 1 occur more often than primes beginning with any other digit in all bases. [Rupinski]

+ Carl Sagan included the number 1 in an example of prime numbers in his book Cosmos.

+ The smallest number n such that 10n + 1, 10n + 3, 10n + 7 and 10n + 9 are all primes. [Firoozbakht]

+ pi(1) = !1, where !1 denotes subfactorial 1. [Gupta]

+ The only number that is exactly 1/2 prime. [McAlee]

+ If primes were called pints, then we could say, "1 is a half-pint." [McAlee]

+ George Bernard Riemann extended Euler's Zeta function to include the sans' simple pole at s = 1. [McAlee]

+ 1 is the only positive integer whose primal code characteristic is 1. [Awbrey]

+ The number 1 is an "extinct" prime since it was once thought to be prime by many and now is no longer considered to be prime. [Hilliard]

+ The remainder of division of the Mersenne numbers 2p - 1 by p is always equal to 1. [Capelle]

+ The number of primes between two squares is never equal to 1. [Capelle]

+ Henri Lebesgue (1875-1941) is said to be the last professional mathematician to call 1 prime.

+ In his Elements of Algebra, Euler did not consider 1 a prime. [Waterhouse]

(There are 10 curios for this number that have not yet been approved by an editor.)




Prime Curios! © 2000-2014 (all rights reserved)