0:00:04.420,0:00:07.221 Imagine we are living in prehistoric times. 0:00:07.221,0:00:09.468 Now, consider the following: 0:00:09.468,0:00:12.721 How did we keep track of time without a clock? 0:00:12.721,0:00:15.315 All clocks are based on some repetitive pattern 0:00:15.315,0:00:18.890 which divides the flow of time into equal segments. 0:00:18.890,0:00:20.688 To find these repetitive patterns, 0:00:20.688,0:00:22.918 we look towards the heavens. 0:00:22.918,0:00:24.902 The sun rising and falling each day 0:00:24.902,0:00:26.184 is the most obvious [pattern]. 0:00:26.184,0:00:28.760 However, to keep track of longer periods of time, 0:00:28.760,0:00:30.811 we looked for longer cycles. 0:00:30.811,0:00:32.512 For this, we looked to the moon, 0:00:32.512,0:00:33.853 which seemed to gradually grow 0:00:33.853,0:00:36.578 and shrink over many days. 0:00:36.578,0:00:37.894 When we count the number of days 0:00:37.894,0:00:38.978 between full moons, 0:00:38.978,0:00:40.910 we arrive at the number 29. 0:00:40.910,0:00:42.833 This is the origin of a month. 0:00:42.833,0:00:45.873 However, if we try to divide 29 into equal pieces, 0:00:45.873,0:00:49.227 we run into a problem: it is impossible. 0:00:49.227,0:00:51.676 The only way to divide 29 into equal pieces 0:00:51.676,0:00:54.819 is to break it back down into [29] single units. 0:00:54.819,0:00:57.102 29 is a 'prime number.' 0:00:57.102,0:00:59.061 Think of it as unbreakable. 0:00:59.061,0:01:00.879 If a number can be broken down into 0:01:00.879,0:01:02.814 equal pieces greater than one, 0:01:02.814,0:01:04.621 we call it a 'composite number.' 0:01:04.621,0:01:06.608 Now if we are curious, we may wonder, 0:01:06.608,0:01:08.450 "How many prime numbers are there? 0:01:08.450,0:01:10.398 – and how big do they get?" 0:01:10.398,0:01:13.744 Let's start by dividing all numbers into two categories. 0:01:13.744,0:01:15.611 We list the primes on the left 0:01:15.611,0:01:17.648 and the composites on the right. 0:01:17.648,0:01:20.379 At first, they seem to dance back and forth. 0:01:20.379,0:01:23.017 There is no obvious pattern here. 0:01:23.017,0:01:24.439 So let's use a modern technique 0:01:24.439,0:01:26.077 to see the big picture. 0:01:26.077,0:01:29.047 The trick is to use a "Ulam spiral." 0:01:29.047,0:01:32.011 First, we list all possible numbers in order 0:01:32.011,0:01:34.043 in a growing spiral. 0:01:34.043,0:01:37.164 Then, we color all the prime numbers blue. 0:01:37.164,0:01:41.290 Finally, we zoom out to see millions of numbers. 0:01:41.290,0:01:42.860 This is the pattern of primes 0:01:42.860,0:01:45.365 which goes on and on, forever. 0:01:45.365,0:01:47.967 Incredibly, the entire structure of this pattern 0:01:47.967,0:01:50.314 is still unsolved today. 0:01:50.314,0:01:51.843 We are onto something. 0:01:51.843,0:01:52.987 So, let's fast forward to 0:01:52.987,0:01:55.526 around 300 BC, in ancient Greece. 0:01:55.526,0:01:58.183 A philosopher known as Euclid of Alexandria 0:01:58.183,0:01:59.411 understood that all numbers 0:01:59.411,0:02:02.607 could be split into these two distinct categories. 0:02:02.607,0:02:04.896 He began by realizing that any number 0:02:04.896,0:02:07.078 can be divided down – over and over – 0:02:07.078,0:02:10.599 until you reach a group of smallest equal numbers. 0:02:10.599,0:02:12.921 And by definition, these smallest numbers 0:02:12.921,0:02:15.760 are always prime numbers. 0:02:15.760,0:02:17.148 So, he knew that all numbers are 0:02:17.148,0:02:20.542 somehow built out of smaller primes. 0:02:20.542,0:02:23.317 To be clear, imagine the universe of all numbers – 0:02:23.317,0:02:25.674 and ignore the primes. 0:02:25.674,0:02:28.037 Now, pick any composite number, 0:02:28.037,0:02:30.518 and break it down, 0:02:30.518,0:02:33.354 and you are always left with prime numbers. 0:02:33.354,0:02:34.774 So, Euclid knew that every number 0:02:34.774,0:02:37.675 could be expressed using a group of smaller primes. 0:02:37.675,0:02:40.221 Think of these as building blocks. 0:02:40.221,0:02:41.996 No matter what number you choose, 0:02:41.996,0:02:46.157 it can always be built with an addition of smaller primes. 0:02:46.157,0:02:48.032 This is the root of his discovery, 0:02:48.032,0:02:50.759 known as the 'Fundamental Theorem of Arithmetic' – 0:02:50.759,0:02:52.013 as follows: 0:02:52.013,0:02:53.934 Take any number – say 30 – 0:02:53.934,0:02:55.501 and find all the prime numbers 0:02:55.501,0:02:57.233 it [can be divided into] equally. 0:02:57.233,0:02:59.763 This we know as 'factorization.' 0:02:59.763,0:03:01.624 This will give us the prime factors. 0:03:01.624,0:03:05.811 In this case 2, 3, and 5 are the prime factors of 30. 0:03:05.811,0:03:07.906 Euclid realized that you could then multiply 0:03:07.906,0:03:10.714 these prime factors a specific number of times 0:03:10.714,0:03:12.739 to build the original number. 0:03:12.739,0:03:13.780 In this case, you simply 0:03:13.780,0:03:16.178 multiply each factor once to build 30. 0:03:16.178,0:03:20.158 2 × 3 × 5 is the prime factorization of 30. 0:03:20.158,0:03:23.153 Think of it as a special key or combination. 0:03:23.153,0:03:24.887 There is no other way to build 30, 0:03:24.887,0:03:27.110 using some other groups of prime numbers 0:03:27.110,0:03:28.792 multiplied together. 0:03:28.792,0:03:31.276 So every possible number has one – 0:03:31.276,0:03:34.046 and only one – prime factorization. 0:03:34.046,0:03:36.299 A good analogy is to imagine each number 0:03:36.299,0:03:38.017 as a different lock. 0:03:38.033,0:03:39.722 The unique key for each lock 0:03:39.722,0:03:42.054 would be its prime factorization. 0:03:42.054,0:03:43.937 No two locks share a key. 0:03:43.937,0:03:47.889 No two numbers share a prime factorization.