Sheela
Sheela
Home
Add
Questions
Thinkers
Claims
People
Concepts
Jargon
Sources
Health
Predictions
Collections
Domain Landscape
Contribute
Review
Dedup
Topic requests
Settings
Help

← Jargon

Jargonnumber theory· 2 claims· 1 episode

prime number

An integer p greater than 1 whose only positive integer divisors are 1 and p itself; by definition, 1 is not considered prime.

As defined in Introduction to mathematical thinking complete course


Where it comes up · 1
  • Introduction to mathematical thinking complete course2 claims

Most important claims · 2 of 2Search all claims for “prime number” →
  • Euler's polynomial p(n) = n² + n + 41 generates prime values for n = 1, 2, ..., 40, but p(41) = 41² is composite; this is a cautionary example showing that checking many cases does not constitute a proof.Introduction to mathematical thinking complete course
  • Euclid's proof that there are infinitely many primes works by constructing the number N = (product of first n primes) + 1 and showing that either N is prime itself (and thus larger than all primes in the list) or N has a prime divisor not in the original list (since N leaves remainder 1 when divided by any prime in the list), so the list can always be extended, proving infinitude.Introduction to mathematical thinking complete course