!  SafeUModule with functions to calculate Primme Numbers. Implements 3 sieves.(c) Luis Rodrigues Soares, 2015MITluis@decomputed.com experimentalSafe eulerThe " function checks whether a number a` is prime by successively checking the remainder of the integer division with all numbers up to a-1.hseulerThe  function calculates prime numbers up to a certain limit by using the traditional (and very inneficient) trial and division method.euler<This is a nave implementation of the Sieve of Erastothenes.euler+An implementation of the Sieve of Sundaram.euler(An implementation of the sieve of Atkin. #euler-0.10.1-EoZZJGEBIVjJR5OLF1tIuWNumeric.Euler.IntegersNumeric.Euler.Primesmultiple multipleOfisPrimetrialAndDivision erastothenessundaramatkin