Lecture
Primes and Coprime
Related lectures (37)
Integers: Well Ordering and Induction
Explores well ordering, induction, Euclidean division, and prime factorization in integers.
Elementary Algebra: Numeric Sets
Explores elementary algebra concepts related to numeric sets and prime numbers, including unique factorization and properties.
Shor's algorithm: factoring integers
Covers the basics of Shor's algorithm for factoring integers and the steps involved in the quantum algorithm.
Shor's factoring algorithm: Quantum Phase Estimation
Covers Shor's factoring algorithm and the link between order finding and factoring.
Number Theory: GCD and LCM
Covers GCD, LCM, and the Euclidean algorithm for efficient computation of GCD.
Fundamental Theorem of Arithmetic
Covers prime numbers, unique decomposition of natural numbers into prime factors, and practical implications for calculations.
Number Theory: GCD and LCM
Covers GCD, LCM, and the Euclidean algorithm for efficient computation.
Shor's Factoring Algorithm
Covers Shor's factoring algorithm, aiming to find integer factors efficiently using quantum computation.
Prime Numbers and Primality Testing
Covers prime numbers, RSA cryptography, and primality testing, including the Chinese Remainder Theorem and the Miller-Rabin test.
Number Theory: History and Concepts
Explores the history and concepts of Number Theory, including divisibility and congruence relations.