Sinisalon_probleema.jl

# etsii ne n, joilla 2^(n-2) = 1 (mod n)
using Primes
#println("Anna n ")
#lukutxt = readline()
#n = parse(Int,lukutxt)
function Sinisalo(n)
    a = big(2)  # alkuarvo 2^(3-2)=2
    for i in 3 : 2 : n
        if a % i == 1
            println(i, "tekijät = ",factor(i))
        end
        a *= 4
    end
end