A prime number is a positive number with only two numbers. A composite has more than two.
The pattern is every other number. Like most odds are prime and all evens are composite. Besides two which is the only prime number.
2006-07-31 14:16:57
·
answer #1
·
answered by so... 2
·
0⤊
0⤋
There is no pattern
A prime is a number that has exactly 2 factors, 1 and itself.
A composite is a product of at least 2 primes. This means that a composite cannot be prime. (1 and 0 are not prime numbers).
There is no pattern for primes. By the way, Eratosthene's sieve is as follows:
Make a grid (I'm not sure if dimensions matter). Let's say it is a 10*10 grid. Then, you cross out all the composite numbers, starting from factors of 2. First, cross out everything divisible by 2, except for 2. Then do the same with 3. Then the next prime number. So on. The ones not crossed out are the primes. (except for number 1), and the ones crossed out are composites. To this and you'll find the 25 primes less than 100 (which my math teacher made me memorize...it's useful somtimes).
By the way, those 25 numbers are, for starters:
2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, and 97.
All the other numbers less than 100 (except for the negatives, 0, and 1) are composite.
Hope this helps you out!
2006-07-31 14:36:28
·
answer #2
·
answered by shikexue2 3
·
0⤊
0⤋
Prime numbers are integers that are only divisible by 1 and the number.
1 , by definition is not a prime
2 is prime 1*2 =2
3 is prime 1*3 =3
4 is not prime 1*2*2 =4
5 is prime 1*5 =5
6 is not prime 1*2*3 =6
There is no known pattern for prime numbers. If you can find one, you will be famous.
There are also an infinite number of prime numbers. This can be proven by the following.
Take a prime number (x). Multiple x by all of the prime numbers less than x. Now add 1 to this product. This number(because 1 was added ) will not be divisible by any of the prime numbers 2 thru x(there will be a remainder of 1) So either
1-this larger number will be a prime, or
2- if it's not prime, all of it's prime divisors will be larger than x
2006-07-31 14:52:30
·
answer #3
·
answered by PC_Load_Letter 4
·
0⤊
0⤋
A prime number is a number than can only be divided by itself and by the unity (1).
A composite number is one that has more divisor than itself and the unity.
The first prime is 2 and it is the only even number that is prime. All other primes are odd. The first primes are:
2 3 5 7 11 13 17 19 23 ....
There is an infinite number of primes.
Primes are very interesting, they are one of the most complex problems of number theory. Finding a pattern of primes is a very old problem that hasn't been solved. Actually you may have heard about 'Riemann Hypothesis'. Roughly, it can be said that this hypothesis attempts to find a 'pattern' in the appearance of primes.
2006-07-31 14:31:03
·
answer #4
·
answered by azt009 2
·
0⤊
0⤋
A prime number is any number that is divisible only by 1 and itself.
There are many deep and important results concerning prime numbers and I shall give only a taste:
- The Fundamental Theorem of Arithmetic states that all numbers can be uniquely factorised into primes.
- There exists an infinitude of primes. The proof of this is simple and everyone with an interest in mathematics should understand this proof.
- Bertrand's Postulate: "Chebyshev said it, but I'll say it again: There's always a prime between n and 2n."
There are many unsolved problems in prime number theory too, one of the most famous is the "Twin prime conjecture."
2006-07-31 14:57:41
·
answer #5
·
answered by Anonymous
·
0⤊
0⤋
A PRIME NUMBER IS A NUMBER THAT CAN BE DIVIDED EXACTLY ONLY BY ITSELF AND ONE. FOR EXAMPLE, 11 IS A PRIME NUMBER THAT CAN BE DIVIDED EXACTLY ONLY BY ITSELF AND ONE. THERE IS NO KNOWN PATTERN OR FORMULA TO FIND A PRIME NUMBER, IF YOU FIND ONE YOU WILL WIN A FIELDS MEDAL.
A COMPOSITE NUMBER IS THE PRODUCT OR ADDITION OF PRIME NUMBERS. ANY NUMBER THAT IS NOT A PRIME CAN BE REPRESENTED OR COMPOSED BY A COMBINATION OF PRIMES, FOR EXAMPLE: 4=2^2, 18=3^2*2, ETC.
YOU CAN CHOOSE A PATTERN FOR COMPOSITE NUMBERS, FOR EXAMPLE ALL THE EVENS GREATER THAN TWO.
2006-07-31 14:24:59
·
answer #6
·
answered by Breheme 2
·
0⤊
0⤋
There is no pattern. This is why very large prime numbers are used in encryption. As numbers get larger, it takes longer to find the next prime number.
2006-07-31 14:29:59
·
answer #7
·
answered by Anonymous
·
0⤊
0⤋
There isn't a pattern. You just have to see if a number has more than 2 different counting number divisors (composite), or exactly 2 different counting number divisors (prime).
1 has only 1 different c.n. divisor, 1, so it is neither
2 has exactly 2 c.n. divisors, 1 and 2, so it's prime
4 has 3 different c.n. divisors: 1, 2, and 4, so it's composite
etc...
2006-07-31 14:17:11
·
answer #8
·
answered by hayharbr 7
·
0⤊
0⤋
Sure, just look up the sieve of Eratosthenes.
2006-07-31 14:19:33
·
answer #9
·
answered by Pascal 7
·
0⤊
0⤋