Let n be the smallest positive integer that is divisible by every number in the set 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 , 1 0 . Find the digital sum of n .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Every given between 1 and 10 has prime factorization of the form 2 α 2 3 α 3 5 α 5 7 α 7 where. Since n is the least common multiple of all these integers, n = 2 max ( α 2 ) 3 max ( α 3 ) 5 max ( α 5 ) 7 max ( α 7 ) = 2 3 3 2 5 1 7 1 = 2 5 2 0 and 2 + 5 + 2 + 0 = 9 .
Good, but I think you made a mistake in your boxed answer. Please correct it soon. Thanks.
Problem Loading...
Note Loading...
Set Loading...
We'll start with 10.
If a number is divisible by 10, it is divisible by 2 and 5 also.
If a number is divisible by 9, it is divisible by 3 too.
If a number is divisible by 8, it is divisible by 4 too.
And since the number is now divisible by 2 and 3, it's divisible by 6 as well.
So what we're looking for is the LCM (least common multiple) of 7, 9, 8, 10 = 7×9×8×5 = 2520.