start restructuring project

HaskellMath.hs

@@ -0,0 +1,5 @@
+
+
+import Primes.SoloveyStrassen (soloveyStrassen)
+import Primes.MillerRabin (millerRabin)
+import Primes.FermatPrimeTest (fermatPrimeTest)

README.md

@@ -1,25 +1,24 @@
 # haskell-math
 
-## Modular square roots algorithms
+## running project from CLI
+```
+$ ghci -i./src
+ghci> :load HaskellMath.hs
+```
 
-### Tonelli Shanks
-file: `TonelliShanks.hs`
+## algorithms
 
-## primality test algorithms
+### Modular square roots algorithms
 
-### Fermat's prime test
-file: `fermat-prime-test.hs`
++ Tonelli Shanks
 
-### Miller Rabin's prime test
-file: `miller-rabin-prime-test.hs`
+### primality test algorithms
 
-### Solovey Strassen's prime test
-file: `SoloveyStrassen.hs`
++ Fermat's prime test
++ Miller Rabin's prime test
++ Solovey Strassen's prime test
 
-## factorization algorithms
+### factorization algorithms
 
-### Fermat's factorization
-file: `fermat-factorization.hs`
-
-### Pollard's p-1
-file: `PollardPminus1.hs`
++ Fermat's factorization
++ Pollard's p-1

src/Primes/FermatPrimeTest.hs

@@ -1,3 +1,5 @@
+module Primes.FermatPrimeTest (fermatPrimeTest) where
+
 import System.Random (randomRIO)
 import ModularArithmeticUtils (modExp)
 

src/Primes/MillerRabin.hs

@@ -1,3 +1,5 @@
+module Primes.MillerRabin (millerRabin) where
+
 import System.Random (randomRIO)
 import ModularArithmeticUtils (modExp, factorOutTwos)
 

src/Primes/SoloveyStrassen.hs

@@ -1,4 +1,4 @@
-module SoloveyStrassen (soloveyStrassen) where
+module Primes.SoloveyStrassen (soloveyStrassen) where
 
 import ModularArithmeticUtils (modExp, jacobi)
 import System.Random (randomRIO)