Finite Mathematics JZM1 task 2.docx JZM1 – Finite Mathematics Task 2: Number Theory Part A: Explain the process for determining the correct answer of a given scenario. I chose to address Scenario 2: Two intern
...
Finite Mathematics JZM1 task 2.docx JZM1 – Finite Mathematics Task 2: Number Theory Part A: Explain the process for determining the correct answer of a given scenario. I chose to address Scenario 2: Two internet videos begin at the same time and are set to continuously loop. One video is 16 minutes long and the other is 24 minutes long. How many minutes will it take before the videos begin at the same time again? The answer to scenario 2 is it will be 48 minutes before the two videos will begin at the same time again. I came to this solution by finding the least common multiple. According to Blitzer, the definition of least common multiple is “the least common multiple of two or more natural numbers is the smallest natural number that is divisible by all of the numbers (2019). To find this least common multiple, I wrote down the first 10 multiples of each number as follows: 16 – (16, 32, 48, 64, 80, 96, 112, 128, 144, 160) 24 – (24, 48, 72, 96, 120, 144, 168, 192, 216, 24) After having written down the numbers, I highlighted the numbers that were common in each set. These numbers were 48, 96 and 144. However, since the questions specifically asked how many minutes will it take before the videos begin at the same time again, the answer is 48 minutes because that is the least common (meaning the next occurring) time that is shown in both number sets. References Blitzer, R. F. Thinking Mathematically, [Western Governors University]. Retrieved from https://wgu.vitalsource.com/#/b. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . .. .. . . . . . . . . . . . . . . . . . .. . . . .
[Show More]