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.
@Lars Ninh , thanks for the problem. I discover (without proof) a general formula to solve this type of problem.
For a range of consecutive positive integers starting with a and ending with l , then the number of multiples of m < l is given by:
n ( m ) = ⌊ m l ⌋ − ⌈ m a ⌉ + 1
where ⌊ ⋅ ⌋ denotes the floor function and ⌈ ⋅ ⌉ denotes the ceiling function .
For a = 1 0 0 0 , l = 9 9 9 9 , and m = 1 4 , we have n ( 1 4 ) = ⌊ 1 4 9 9 9 9 ⌋ − ⌈ 1 4 1 0 0 0 ⌉ + 1 = 7 1 4 − 7 2 + 1 = 6 4 3