úÎ,õ     portable experimentalleon@melding-monads.com The upper limit of the sieve Calculate Euler'2s Totient for every integer up to the given limit %Retrieves the totient from the sieve Is the given number prime? portable experimentalleon@melding-monads.com$Returns the upper limit of a sieve. Is a number prime? CReturns the smallest prime divisor of a given number in the sieve. FFinds the smallest prime divisor of every number up to a given limit. 0Factors a number completely using a sieve, e.g. 0 factor (sieve 1000) 360 == [(2,3),(3,2),(5,1)]    portable experimentalleon@melding-monads.com !"#$%&'()* An infinite stream of primes An infinite stream of primes Returns the first n primes  Returns primes up to some limit 7The first argument specifies which number to start at, C the second argument is a wheel of deltas for skipping composites.  For example, primes could be defined as  2 : 3 : sieve 5 (cycle [2,4])     +      !"#$%&'()NumberSieves-0.0NumberTheory.Sieve.PhiNumberTheory.Sieve.FactorNumberTheory.Sieve.ONeill sieveBoundsievephiisPrime FactorSieve findFactorfactor calcPrimesprimes primesToNth primesToLimitPhiSieve sieveBound'ix initArraydecpowszerosHybridQ PriorityQBrLfemptyPQ isEmptyPQ minKeyValuePQminKeyPQ minValuePQinsertPQsiftdowndeleteMinAndInsertPQleftrem deleteMinPQinitHQinsertHQdeleteMinAndInsertHQminKeyHQ minKeyValueHQwheel