Computational Number Theory (Prime Adventure part 1)

Channel:
Canada Art of the Problem
Subscribers:
175,000
Published on ● Video Link: https://www.youtube.com/watch?v=zCh4q-XoTP0


Duration: 6:13
34,856 views
153

Prime Adventure: Learn how to build algorithms (and write code!) which solve number theoretic challenges such as prime factorization. Follow the rest of this adventure on Khan Academy: http://www.khanacademy.org/cs/prime-adventure-level-1/1018672065



Other Videos By Art of the Problem


2012-11-22Information Theory part 2: History of the Alphabet
2012-11-08Discovery of Electrostatics
2012-11-02Prime Number Theorem: the density of primes (Prime Adventure part 6)
2012-10-21Sieve of Eratosthenes (Prime Adventure part 4)
2012-10-21Primality test using a sieve (Prime Adventure part 5)
2012-10-14Information Theory part 1: Origins of Cuneiform & Hieroglyphics
2012-10-04Animated history of the letter A (Aleph)
2012-09-26Algorithmic Efficiency (Prime Adventure part 3)
2012-09-26What is a computer? (Prime Adventure part 2)
2012-09-14What is Information Theory? (Information Entropy)
2012-09-11Computational Number Theory (Prime Adventure part 1)
2012-07-30Public key cryptography - Diffie-Hellman Key Exchange (full version)
2012-07-30Public Key Cryptography: RSA Encryption Algorithm
2012-07-29Gambling with Secrets: 8/8 (RSA Encryption)
2012-07-25Information Theory - Teaser
2012-06-03Gambling with Secrets: Part 7/8 (Diffie-Hellman Key Exchange)
2012-05-07Random vs. Pseudorandom Number Generators
2012-05-04Gambling with Secrets: Part 6/8 (Perfect Secrecy & Pseudorandomness)
2012-04-24The Enigma Machine (how it worked & why it was cracked)
2012-04-17Claude Shannon's Perfect Secrecy
2012-03-12Gambling with Secrets: Part 5/8 (Encryption Machines)


Tags:
prime adventure
computational number theory
number theory
primality test
prime factorization
gauss
euler
RSA
speed of factorization