Factoring 21 with Shor's algorithm: qubits, periods, and retries
Follow a normalized order-finding example, understand Fourier interference and its limits, and see why base five fails before base two yields the factors three and seven.
Topics beyond the school curriculum, from algebraic number theory to quantum algorithms.
Follow a normalized order-finding example, understand Fourier interference and its limits, and see why base five fails before base two yields the factors three and seven.
Prove the prime representation criterion using Eisenstein integers, polynomial quotients over finite fields, Euclidean division, and norms.