Sign inSign in
ConceptMathematics

Prime number theorem

A theorem stating that the fraction of n-bit numbers that are prime is big-Omega of 1/n1/n.
as Ryan O'Donnell defines itCarnegie Mellon UniversityThe wording closest to all 4 definitions
Watch it explained

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

3

Each in their own terms, from the easiest level.

  • Terence Tao

    UCLA · Introductory

    A theorem stating that the n-th prime pnp_n is approximately equal to nln⁡nn \ln n.
    • 13:34Structure and Randomness in the Prime Numbers
  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    The Prime Number Theorem implies that if you pick mm-digit numbers at random, there's about a 1m\frac{1}{m} chance it is prime.
    • 52:16Shor's Factoring Algorithm
  • Kannan Soundararajan

    Clay Mathematics Institute · Graduate

    An asymptotic description of the distribution of prime numbers among the positive integers, stating that π(x)∼xlog⁡x\pi(x) \sim \frac{x}{\log x}.
    • 5:30Progress on Zeta and L-Functions Motivated by the Riemann Hypothesis

Connections

8

The lectures that define it or assume it, and the concepts next to it.

3 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.