Pisano period: Difference between revisions

→‎{{header|Go}}: Replaced 'isPrime' function with a more efficient one.
(Added Go)
(→‎{{header|Go}}: Replaced 'isPrime' function with a more efficient one.)
Line 71:
}
 
// OK for 'small' numbers.
// Not particularly efficient but suffices here.
func isPrime(n uint) bool {
if n%2 == 0switch {
ifcase n%3 ==< 0 {2:
return false
case n%2 == 0:
return n == 2
}case n%3 == 0:
if n%3 == 0 {
return n == 3
}default:
primes d := getPrimesuint(n5)
if len(primes) == 1 &&for primes[0]d*d =<= n {
if n%d == 0 {
return false
}
d += 2
if n%d == 0 {
return false
}
d += 4
}
return true
}
return false
}
 
9,488

edits