Kongruenssip2.jl

# etsitään ensin kelvolliset q
# q = 6168827 + k * 12323610 = (1757+k*3510)*3511
# p1 = 3511
# n = q*p1 = kongruenssin 2^(n-2) = 1 (mod n) ratkaisu
# ehtona q = 1 tai 7 (mod 8) ja ord(2,q) odd
# tulostetaan ratkaisut n
using Primes
function p2kongr(knumber)
    s = 0
    nnumbers = BigInt[]
    for k in 1 : knumber
        q = big(6168827 + 12323610*k)
        residue = q % 8
        if (residue == 1 || residue == 7) && isodd(multorder(2,q))
            n = q * 3511
            if powermod(2,n-2,n) == 1
                s += 1
                println(s," ",n)
                push!(nnumbers,n)
            end
        end
    end
    return nnumbers
end
#open("kongr2.dat", "w") do io writedlm(io,nnumbers) end