Prime number: Difference between revisions
Jump to navigation
Jump to search
categories |
add wikipedia box |
||
Line 5: | Line 5: | ||
| ja = 素数 | | ja = 素数 | ||
}} | }} | ||
{{Wikipedia|Prime number}} | |||
A '''prime number''' is an integer (whole number) greater than one that is divisible only by itself and one. There are an infinite number of prime numbers, the first few of which are 2, 3, 5, 7, 11, 13, …. | A '''prime number''' is an integer (whole number) greater than one that is divisible only by itself and one. There are an infinite number of prime numbers, the first few of which are 2, 3, 5, 7, 11, 13, …. | ||
Line 19: | Line 21: | ||
== Links == | == Links == | ||
* [http://www.arndt-bruenner.de/mathe/scripts/primzahlen.htm Die Primzahlseite] (German) by Arndt Brünner (helpful tools for prime factorization and ~test) | * [http://www.arndt-bruenner.de/mathe/scripts/primzahlen.htm Die Primzahlseite] (German) by Arndt Brünner (helpful tools for prime factorization and ~test) | ||
[[Category:Math]] | [[Category:Math]] |
Revision as of 17:00, 28 January 2022
A prime number is an integer (whole number) greater than one that is divisible only by itself and one. There are an infinite number of prime numbers, the first few of which are 2, 3, 5, 7, 11, 13, ….
Prime factorization
By the fundamental theorem of arithmetic, any ratio can be uniquely represented by a product of prime numbers through prime factorization. It enables the notation of ratios as monzos.
Prime EDO
See also
Links
- Die Primzahlseite (German) by Arndt Brünner (helpful tools for prime factorization and ~test)