Metraipolis › archive › dc_cd32660d4020
Prime number — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Prime_number
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-15T14:34:10.510Z
- SHA-256 of the archived text
1e3e5a5f8693e7bd48435abe5e750461d87494929815a0d17a3096d9c27ffaba- Stable URL of this page
https://metraipolis.com/documento/dc_cd32660d4020
How to cite
Prime number — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Prime_number (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_cd32660d4020 (Metraipolis archive dc_cd32660d4020, sha256 1e3e5a5f8693e7bd48435abe5e750461d87494929815a0d17a3096d9c27ffaba)
BibTeX
@misc{dccd32660d4020,
title = {Prime number — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Prime_number},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_cd32660d4020; sha256 1e3e5a5f8693e7bd48435abe5e750461d87494929815a0d17a3096d9c27ffaba},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Prime_number. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways of writing it as a product, 1 × 5 or 5 × 1, involve 5 itself. However, 4 is composite because it is a product (2 × 2) in which both numbers are smaller than 4. Primes are central in number theory because of the fundamental theorem of arithmetic: every natural number greater than 1 is either a prime itself or can be factorized as a product of primes that is unique up to their order. The property of being prime is called primality. A simple but slow method of checking the primality of a given number n {\displaystyle n} , called trial division, tests whether n {\displaystyle n} is a multiple of any integer between 2 and n {\displaystyle {\sqrt {n}}} . Faster algorithms include the Miller–Rabin primality test, which is fast but has a small chance of error, and the AKS primality test, which always produces the correct answer in polynomial time but is too slow to be practical. Particularly fast methods are available for numbers of special forms, such as Mersenne primes, and these have been used to find large prime numbers. There are infinitely many primes, as demonstrated by Euclid around 300 BC. No known simple formula separates prime numbers from composite numbers. However, the distribution of primes within the natural numbers in the large can be statistically modelled. The first result in that direction is the prime number theorem, proven at the end of the 19th century, which says roughly that the probability of a randomly chosen large number being prime is inversely proportional to its number of digits, that is, to its logarithm. Several historical questions regarding prime numbers are still unsolved. These include Goldbach's conjecture, that every even integer greater than 2 can be expressed as the sum of two primes, and the twin prime conjecture, that there are infinitely many pairs of primes that differ by two. Such questions spurred the development of various branches of number theory, focusing on analytic or algebraic aspects of numbers. Primes are used in several routines in information technology, such as public-key cryptography, which relies on the difficulty of factoring large numbers into their prime factors. In abstract algebra, objects that behave in a generalized way like prime numbers include prime elements and prime ideals.
Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «number theory»).
Fonte: Wikipedia in inglese, voce «Prime number» — https://en.wikipedia.org/wiki/Prime_number
Wikidata Q49008 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q49008
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Prime_number?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1376977902, consultata il 2026-10-15T13:57:01.557Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 09d6bd4e52b1ee97237f43fe934ba854255fc26acce9a7aa80c63d6e2a4120f7