Number Theory: History and Concepts

Related lectures (28)

Page 2 of 3

Covers the Bombieri-Vinogradov theorem and its implications for prime gaps and multiplicative sieve inequalities.

Covers the definition of a function to determine if a given number is prime.

Covers binary addition, prime numbers, and the sieve of Eratosthenes in number theory.

Covers groups, rings, number theory, atomic bonds, and materials structure, setting the foundation for further exploration.

Covers GCD, LCM, and the Euclidean algorithm for efficient computation of GCD.

Explores Gaussian integers, prime factorization, and number theory concepts related to prime numbers.

Explores prime numbers, modular arithmetic, Wilson's theorem, and complexity analysis.

Explores well ordering, induction, Euclidean division, and prime factorization in integers.

Covers examples of modular exponentiation, complexities, Lame's Theorem, Collatz Conjecture, and prime numbers.

Covers algorithms for big numbers, Z_n, and orders in a group, explaining arithmetic operations and cryptographic concepts.