Let denote the least common multiple of and . If the sum of all positive integers such that and is for then find .
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.
The key idea is to note that the condition holds if and only if x is odd. We present one of many arguments for why this is true: One can show that for positive integers a,b, gcd(a,b) · lcm(a,b) = ab. From this, it follows that gcd(16,x) = 1, so x must be odd. We thus need to compute the sum of the odd numbers less than 100, which is K^2= 50^2 = 2500. In a general form, the fact key fact for the above explanation is that gcd(a,b) = 1 if and only if lcm(a,b) = ab.