Other Free Encyclopedias » Science Encyclopedia » Science & Philosophy: Nicotinamide adenine dinucleotide phosphate (NADP) to Ockham's razor » Number Theory - Prime And Composite Numbers, Fermat's Theorem, Gauss And Congruence, Fermat's Failed Prime Number Formula - Famous formulas in number theory, Famous problems in number theory

Number Theory - Prime And Composite Numbers

formula divided primes generates

One of the most important distinctions in number theory is between prime and composite numbers. Prime numbers can only be divided evenly (with nothing left over) by 1 and themselves. Prime numbers include 2, 3, 5, 7, 11, 13, 17, and so on to infinity. The number 1 is not considered a prime. All primes are odd numbers except for 2, because any even number can be divided evenly by 2.

A composite number can be divided, or factored, into two or more prime numbers in addition to 1 and itself. Ten is a composite number because it can be divided by 2, 5, 1, and itself. The numbers 2 and 5 are the prime factors of 10. Any whole number that is not a prime is a composite.

One difference between prime and composite numbers is that it takes relatively little time to determine if a number is prime, but far longer to determine the prime factors of a composite number, especially if the composite is very large (100 digits or more). This discrepancy in computation time is important in developing computer security systems.

Prime numbers do not occur in a predictable way. There are sequences of primes which can be partially described in a formula, but sooner or later the formula breaks down. One formula, invented by Marin Mersenne (1588-1648) is 2p - 1, where p is a prime number. Although this formula generates many primes, it also misses many primes. Another formula, invented by Leonhard Euler (1707-1783), generates prime numbers regularly for the series of consecutive numbers from 0 to 15 and then stops. The formula is x2 + x + 17, in which x is any number from 0 to 15.

Number Theory - Fermat's Theorem [next]

User Comments

Your email address will be altered so spam harvesting bots can't read it easily.
Hide my email completely instead?

Cancel or

Vote down Vote up

over 2 years ago

I propose the following formula of prime numbers:
Positive integers not contained in any one of two arrays P1 (i,j)=6i^2-1+(6i-1)(j-1), P2 (i,j)=6i^2-1+(6i+1)(j-1), are indexes P of all prime numbers in sequence S1 (P)=6P+5; positive integers not contained in any one of two arrays P3 (i,j)=6i^2-1-2i+(6i-1)(j-1)), P4 (i,j)=6i^2-1+2i+(6i+1)(j-1)) are indexes P of all prime numbers in sequence S2(P)=6P+7; i,j=1,2,3,...; P=0,1,2,3,...

See: http://ijmcr.in/index.php/current-issue/86-title-matrix-sieve-new-algorithm-for-finding-prime-numbers
and http://ijmcr.in/index.php/archive/43-volume-3-issue-5-may-2015/91-proof-of-goldbach-s-conjecture

Vote down Vote up

over 9 years ago

this website saved my life!!!!!!!!