Revision as of 22:20, 3 April 2020 (view source) Simonjsaunders (talk \| contribs) (Added C++ solution) ← Older edit		Revision as of 07:14, 4 April 2020 (view source) Simonjsaunders (talk \| contribs) m (C++ solution made faster) Newer edit →
Line 355: bool square_free(const sieve_of_eratosthenes& sieve, integer n) { ~~for~~if (~~integer~~n p% =4 ~~2; p * p <~~== ~~n; ++p~~0) return false; for (integer p = 3; p * p <= n; p += 2) { if (!sieve.is_prime(p) && n % (p * p) == 0) ~~continue;~~ ~~integer m = n, count = 0;~~ ~~for (; m % p == 0; ++count)~~ ~~m /= p;~~ ~~if (count > 1)~~ return false; }

Square-free integers: Difference between revisions

Square-free integers (view source)