[A4E #6] Basic Number Theory - The Foundation of Early Blockchain

Hey, can you believe that blockchain, Bitcoin, and even the most advanced encryption algorithms today all originate from very basic number theory? Today, we'll explore the sixth topic in the algorithm playlist for everyone. That is basic number theory with natural numbers 1, 2, 3, up to n. Let's say l = 12. We say one number is a divisor of another. A is a divisor of B if B is divisible by A. For example, here, 2 is a divisor of 4, 6, 8, 10, 12, for instance. We also have that 5 is a divisor of 10. 5 is a divisor of 10. Why? Because 10 divided by 5 equals 2 with a remainder of 0. Numbers divisible by 2 have no remainder. With this, we have different notations. We can write this vertical bar and read it as "a divides b." What does this mean? Suppose we have 12, we have B B B things, so we can use the divisor A to divide them evenly. For example, if we have 12 cakes. With 12 cakes, we'll use the number 3 as the divisor. We can divide these 12 cakes into groups of three. And this quotient is the number of groups we can form. That is, for example, if we give each person three cakes, we can share them among four people, for instance. That's the origin of the word "divides" in B and in English. This term is pronounced slightly differently by them. They read it as "A divides B." When we have a pair of numbers where A is a divisor of B, simultaneously we also have that B is a multiple of A. For example, here we have that 6 is a multiple of 3 because 6 is divisible by 3.