A natural number greater than 1 that has no positive divisors other than 1 and itself.

Principle

Primes serve as the multiplicative building blocks of the positive integers: every integer greater than 1 factors uniquely (up to order) into primes in the integers, making primes the atoms of the multiplicative monoid of N.

Demonstration

Examples include 2, 3, 5, 7, 11; for instance 13 is prime because its only positive divisors are 1 and 13, while 14 is not because 14 = 2×7.

Misapplication

Counting 1 as a prime (historical confusion) or conflating primality in Z with irreducibility or primality notions in arbitrary rings without checking definitions can mislead; assuming naive density results without precise statements is also a misuse.

Consequence

Primes underpin the Fundamental Theorem of Arithmetic, analytic results on distribution of primes (e.g., prime number theorem), and applications such as public-key cryptography; properties of primes drive multiplicative number-theoretic functions and factorization algorithms.

Reversal

The logical complement of a prime is a composite number (or 1, which is neither prime nor composite); reversing the definition yields the class of integers that do have nontrivial divisors.

Boundary

Definition applies to positive integers (natural numbers) >1; in other rings or algebraic contexts one must distinguish prime elements, irreducible elements, and prime ideals—these are related but not identical notions.

Semantic Tension

Tension appears between elementary integer primality and abstract algebraic notions: in general rings an element can be irreducible but not prime; the word 'prime' thus carries ring-dependent technical differences.

Synthesis

A prime number is a positive integer greater than 1 that cannot be factored nontrivially; primes are the atomic multiplicative constituents of the integers and the basis for factorization, distribution theorems, and many applications.