Given two natural numbers n and k, can you tell me approximately how many of the
integers <= n are not divisble by the kth power of an integer? this must be
done in such a way that your formula/approximation gets arbitrarily close to the
correct answer as n increases.
(example: if n=10, k=2, then we must find all of the integers <=10 that are not
divisible by a square. these are 2,3,5,6,7,10.)