úÎ E `GModule with functions to calculate Primme Numbers. Implements 3 sieves.(c) Luis Rodrigues Soares, 2015MITluis@decomputed.com experimental Safe-InferredThe " function checks whether a number a` is prime by successively checking the remainder of the integer division with all numbers up to a-1.The ƒ function calculates prime numbers up to a certain limit by using the traditional (and very inneficient) trial and division method.<This is a naïve implementation of the Sieve of Erastothenes.+An implementation of the Sieve of Sundaram.(An implementation of the sieve of Atkin.        euler-0.4.0Numeric.Euler.PrimesisPrimetrialAndDivision erastothenessundaramatkineSieveinitialSundaramSieveremoveCompositesinitialAtkinSieveaFlipflipAll firstStep secondStep thirdStepunmarkMultiples unmarkAllaSieve