First 9 prime Fibonacci number: Difference between revisions
Added Go
(First 9 Prime Fibonacci Number in various BASIC dialents) |
(Added Go) |
||
Line 327:
28657
514229
</pre>
=={{header|Go}}==
{{trans|C}}
<lang go>package main
import "fmt"
func isPrime(n uint64) bool {
if n < 2 {
return false
}
if n%2 == 0 {
return n == 2
}
if n%3 == 0 {
return n == 3
}
d := uint64(5)
for d*d <= n {
if n%d == 0 {
return false
}
d += 2
if n%d == 0 {
return false
}
d += 4
}
return true
}
func main() {
f1 := uint64(1)
f2 := f1
count := 0
limit := 12 // as far as we can get without using big.Int
fmt.Printf("The first %d prime Fibonacci numbers are:\n", limit)
for count < limit {
f3 := f1 + f2
if isPrime(f3) {
fmt.Printf("%d ", f3)
count++
}
f1 = f2
f2 = f3
}
fmt.Println()
}</lang>
{{out}}
<pre>
The first 12 prime Fibonacci numbers are:
2 3 5 13 89 233 1597 28657 514229 433494437 2971215073 99194853094755497
</pre>
| |||