Category:Prime Numbers: Difference between revisions
Content added Content deleted
(Blurb about the instructional nature of prime algorithms) |
(added Encyclopedia tag) |
||
Line 1: | Line 1: | ||
[[Category:Mathematical operations]] |
[[Category:Mathematical operations]] |
||
[[Category:Classic CS problems and programs]] |
[[Category:Classic CS problems and programs]] |
||
[[Category:Encyclopedia]] |
|||
A '''prime number''' is defined as a positive integer which has exactly two factors: one and itself. A factor of a number is an integer which divides evenly into it--that is, divides with a remainder of zero. By this definition one and zero are not prime. One only has one factor (which is itself), and zero divided by any number always has a remainder of zero, so it effectively has an infinite number of factors. |
A '''prime number''' is defined as a positive integer which has exactly two factors: one and itself. A factor of a number is an integer which divides evenly into it--that is, divides with a remainder of zero. By this definition one and zero are not prime. One only has one factor (which is itself), and zero divided by any number always has a remainder of zero, so it effectively has an infinite number of factors. |
||