In: Advanced Math
discrete math
Each different prime number represents a different colored block. For example, 2 represents a yellow block, 3 represents a red block, 5 represents a green block , and so on...
a. How many blocks would we need to build the smallest number that is divisible by all natural numbers from 1 to 30? From 1 to 50? From 1 to 100?
b. I’m thinking of a number n . It takes exactly 50 blocks to build the number that is the smallest number divisible by all natural numbers from 1 to n. What is n? Hint: there are actually several numbers that n could be. Can you find all of them?