anchor.diff:          | _    -> let a = 1 + r.Next(1000000000) |> BigInteger
                     let n' = n - one
                     let test = BigInteger.ModPow (a, n', n)
  -                  it test = one then check (iter+1) else false
  +                  if test = one then check (iter+1) else false
       check 0
   
   let isProbPrime (n: BigInteger) : bool =
  
positive.code: (* Primes *)
  
  let genBigInt (r: Random) (bits: int) : BigInteger =
      BigInteger 0
  
  let checkFactors (ps: BigInteger list) (n: BigInteger) : bool =
      let z = BigInteger 0
  
negative.code:         match n > 1000 with
          | true -> BigInteger 0
          | _    -> let g = genBigInt r bits
                    if isProbPrime g then g else loop (n+1) r
      let r = new Random()
      loop 0 r
  
  let primes = readLines "large_primes.csv" |> Seq.map BigInteger.Parse
  let testPrimes =
      primes
      |> Seq.map isProbPrime
      |> Seq.fold (fun acc p -> if acc && p then true else false) true 
  
  (* RSA *)
  
  