Unavailable. Nobody can download this version any more, with elm or with the Lamdera compiler: github.com/HAN-ASD-DT/rsa is gone (deleted or private); Software Heritage has not archived the repo; no fork with tag 1.1.0 found (60 same-name repos checked); no cached copy. Use another version.
Provides a lazy, infinite list of primes.
A lazy list. Makes it possible to create infinite lists.
Determines if the argument is prime.
The following code snippets will result in the same list. Notice that with the primes example we do not need to know the upper bound.
take 50 primesreturns the same list as
List.filter isPrime <| List.range 2 230Type to determine in which category a number falls.
A number is either a Prime, a Composite number or a Probable prime.
Determines if the input is a prime, a composite or a probably prime.
the isPrime function is expansive. Especially for large numbers you want to avoid using it. Instead you want to check if a number is a probably prime.
isProbablyPrime 52439Will answer Composite <| Just 41
A lazy list of prime numbers.