Lecture
Integers: Well Ordering and Induction
Related lectures (114)
Elementary Algebra: Numeric Sets
Explores elementary algebra concepts related to numeric sets and prime numbers, including unique factorization and properties.
Proofs and Logic: Introduction
Introduces logic, proofs, sets, functions, and algorithms in mathematics and computer science.
Proofs: Logic, Mathematics & Algorithms
Explores proof concepts, techniques, and applications in logic, mathematics, and algorithms.
Quantum Order Finding with QPE
Covers the Quantum Order Finding algorithm using Quantum Phase Estimation (QPE), focusing on Shor's factoring algorithm.
Prime Numbers and Primality Testing
Covers prime numbers, RSA cryptography, and primality testing, including the Chinese Remainder Theorem and the Miller-Rabin test.
Integers: Sets, Maps, and Principles
Introduces sets, maps, divisors, prime numbers, and arithmetic principles related to integers.
Algebra: Integer Numbers and Principles
Introduces integer numbers, well-ordering, induction principles, GCD, LCM, and Bezout's theorem.
Shor's Factoring Algorithm
Covers Shor's factoring algorithm, aiming to find integer factors efficiently using quantum computation.
Complexity & Induction: Algorithms & Proofs
Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.
Quantum Random Number Generation
Explores quantum random number generation, discussing the challenges and implementations of generating good randomness using quantum devices.