ConceptMathematics
Prime number
A natural number greater than 1 is prime if its only divisors are 1 and itself.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
6Each in their own terms, from the easiest level.
Terence Tao
A natural number larger than one which cannot be expressed as the product of two smaller natural numbers.Tom Leighton
A number that is not divisible by any other number besides itself and 1.Colva Roney-Dougal
A whole number, bigger than 1, such that the only numbers that divide it are 1 and itself.Herbert Gross
A number which has no factors other than itself and 1.Timothy Gowers
Numbers greater than 1 that have no positive divisors other than 1 and themselves.
Lectures that assume it
28The first 12 are shown.
- Cantor's Theory of Cardinality (Size)
- Hashing with Chaining, Simple Uniform Hashing & Universal Families
- The Complexity Class coNP
- Randomized Complexity: RP, coRP, and ZPP
- The RSA Cryptosystem and Efficient Exponentiation
- Basic Group Theory
- Randomization: Universal & Perfect Hashing
- P and NP, SAT, Poly-Time Reducibility
- Streams, Part 2 (1986)
- Number Theory for PKC: Euclidean Algorithm, Euler's Phi Function & Euler's Theorem
- Shor's Factoring Algorithm
- The Complexity Class NP
Connections
44The lectures that define it or assume it, and the concepts next to it.
Concepts10
Show 4 moreShow fewer
Lectures34
- Introduction and Proofs
- How Hard is too Hard? An Introduction to Complexity
- Foundations of University Mathematics: From Calculation to Proof
- Mathematical Induction
- Structure and Randomness in the Prime Numbers
- The Importance of Mathematics
Show 28 moreShow fewer
- Cantor's Theory of Cardinality (Size)
- Hashing with Chaining, Simple Uniform Hashing & Universal Families
- The Complexity Class coNP
- Randomized Complexity: RP, coRP, and ZPP
- The RSA Cryptosystem and Efficient Exponentiation
- Basic Group Theory
- Randomization: Universal & Perfect Hashing
- P and NP, SAT, Poly-Time Reducibility
- Streams, Part 2 (1986)
- Number Theory for PKC: Euclidean Algorithm, Euler's Phi Function & Euler's Theorem
- Shor's Factoring Algorithm
- The Complexity Class NP
- Diffie-Hellman Key Exchange and the Discrete Log Problem
- The Role of Computer Assistance in Mathematical Proofs
- Number Theory II
- Side-Channel Attacks
- Quantum Cosmology in the BKL Regime and Dual Primon Gases
- Probabilistic Computation
- 10^500 Parallel Universes
- The Shape of Knots: From DNA to Solar Flares
- Introduction to Galois Fields for the AES
- AI: Oppression or Innovation?
- Rotate, Compute, Rotate
- The Complexity of Simplicity in Mathematical Logic
- Finding L-Functions out of Nothing
- Quantum Computing Overview
- The IEANTN Project: Automation and Mathematical Understanding
- The Quantum Revolution: Advances and Personal Journey in Quantum Science