Find the number of positive integers such that is divisble by , but not by .
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.
Consider the number 3 × 4 7 3 = 3 1 1 4 6 9 . The number of factor 47 present in it is 3 1 1 4 6 9 / 4 7 + 3 1 1 4 6 9 / 4 7 2 + 3 1 1 4 6 9 / 4 7 3 = 6 7 7 1 . Note that this is the minimum value of n that results in it being divisible by 4 7 6 7 7 1 . However, observe that 3 1 1 4 6 8 ! = 3 1 1 4 6 9 ! / 3 1 1 4 6 9 which results in elimination of 3 powers of 47 from its prime factorization. 311468! and factorials of positive integers smaller than 311468 are now at most divisible by 4 7 6 7 6 8 . Hence the conditions stated in the question cannot be satisfied by any natural number so the answer is 0.