
Ep 194: David Deutsch’s ”The Fabric of Reality” Chapter 9 ”Quantum Computers” Part 4: Shor’s Algorithm
ToKCast
How to Find the Greatest Common Divisor of Large Numbers
Euclid figured out that rather than starting at 2 and seeing if that divides into our big number And then 3 and then 5, sequentially going through all the prime numbers Up until you eventually find p By a process of just brute force So to speak We're instead going to guess Basically randomly Any old number Okay, because we're going to find the factors of n We'regoing to find p and q We're going to pick any old number Smaller than n Recall that A equals x mod n We want to know if A and n are relatively prime Do they share factors? That's a question Of what their greatest common divisories The greatestcommon divisories is a term used
00:00
Transcript
Play full episode
Remember Everything You Learn from Podcasts
Save insights instantly, chat with episodes, and build lasting knowledge - all powered by AI.