Author: Bernd Paysan
Date: May 12, 2008 14:37
Albert van der Horst wrote: Euler 193 is about counting square free numbers. Find all numbers not divisable by a square under 2^50. This looks like sieving for primes, but instead of scratching multiples of primes, squares are discarded. However the problem doesn't admit of a straightforward sieving solution because the 2^50 is too great (10^15). Hm, I'm not sure if this...
|