Category:Prime Numbers: Difference between revisions

m
added more types of Rosetta Code tasks that involve primes, factorization of integers, generation of various number sequences, ...
(added Encyclopedia tag)
m (added more types of Rosetta Code tasks that involve primes, factorization of integers, generation of various number sequences, ...)
Line 6:
Primality is frequently used for instructional purposes in computer science. Naive algorithms for calculating it are usually complex enough to be a test for a new programmer (barring algorithms built into languages), but simple enough that they can be used as parts of problems to follow.
 
Below is a list of tasks which involve the calculation or use of prime numbers.:
:::*   the calculation (or generation) of primes   or   ''types''   of primes
:::*   the use of primes in finding other types of numbers
:::*   the factorization of integers
:::*   the use of various algorithms in finding or detecting primes   or   types of primes
:::*   the coding of various types of primality tests
:::*   the use of primes in generating various (number) sequences
:::*   etc.