A&DS S04E10. Number Theory Algorithms

5,219 views

About this video

Hand-picked by a BrighterTube curator · found via Reddit r/compsci thread: Any recommendations of youtube channels for programming and computer science stuff? · 82% confidence

Works through the core number-theory algorithms (Euclid and extended Euclid, modular inverses, fast exponentiation, primality testing and factorisation) with proofs of correctness and complexity.

Number-theory algorithms: Euclid, modular arithmetic, primality and factoring basics.

Programming & CS Lectures

Video by Pavel Mavrin, played through YouTube's embedded player.

Part of A&DS English Course