Numbers 0.1 → 0.2
raw patch · 4 files changed
+12/−3 lines, 4 filesdep +random
Dependencies added: random
Files
- Changelog +3/−0
- Data/Numbers.hs +1/−0
- Numbers.cabal +5/−3
- test.hs +3/−0
+ Changelog view
@@ -0,0 +1,3 @@+0.2 Added Miller Rabin Test+0.1 Adaptive prime wheels for primes+0.0 Initial version
Data/Numbers.hs view
@@ -3,6 +3,7 @@ ( primes, isPrime,+ isProbablyPrime, primeFactors, numOfFactors, factorSum,
Numbers.cabal view
@@ -1,5 +1,5 @@ Name: Numbers-Version: 0.1+Version: 0.2 Cabal-Version: >= 1.2 Synopsis: An assortment of number theoretic functions Description: Functions for finding prime numbers, checking whether a number is prime, finding the factors of a number etc.@@ -8,12 +8,14 @@ Author: Adrian Neumann Category: Algorithms, Number Theory Maintainer: aneumann@inf.fu-berlin.de+Homepage: http://page.mi.fu-berlin.de/aneumann/numbers/index.html stability: alpha build-type: Simple-extra-source-files: README, test.hs, lgpl-3.0.txt+extra-source-files: README, Changelog, test.hs, lgpl-3.0.txt Library exposed-modules: Data.Numbers build-depends: - base+ base,+ random >= 1.0.0.1 GHC-Options: -O2
test.hs view
@@ -1,5 +1,6 @@ import Data.Numbers import Data.List+import System.Random test_primes = take 1000 primes == take 1000 check where check = sieve [2..]@@ -9,3 +10,5 @@ test_isprime = and $ map (isPrime) $ take 1000 primes test_primeFactors = let l = take 5 primes in sort (primeFactors (product l)) == sort l++test_millerRabin =and $ map (fst.flip isProbablyPrime (mkStdGen 42)) (take 5000 primes)