Cousin primes: Difference between revisions
Added Go
(Added Go) |
|||
Line 72:
{ 937 941 }
{ 967 971 }
</pre>
=={{header|Go}}==
{{trans|Wren}}
<lang go>package main
import "fmt"
func isPrime(n int) bool {
switch {
case n < 2:
return false
case n%2 == 0:
return n == 2
case n%3 == 0:
return n == 3
default:
d := 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() {
count := 0
fmt.Println("Cousin prime pairs whose elements are less than 1,000:")
for i := 3; i <= 995; i += 2 {
if isPrime(i) && isPrime(i+4) {
fmt.Printf("%3d:%3d ", i, i+4)
count++
if count%7 == 0 {
fmt.Println()
}
if i != 3 {
i += 4
} else {
i += 2
}
}
}
fmt.Printf("\n\n%d pairs found\n", count)
}</lang>
{{out}}
<pre>
Cousin prime pairs whose elements are less than 1,000:
3: 7 7: 11 13: 17 19: 23 37: 41 43: 47 67: 71
79: 83 97:101 103:107 109:113 127:131 163:167 193:197
223:227 229:233 277:281 307:311 313:317 349:353 379:383
397:401 439:443 457:461 463:467 487:491 499:503 613:617
643:647 673:677 739:743 757:761 769:773 823:827 853:857
859:863 877:881 883:887 907:911 937:941 967:971
41 pairs found
</pre>
| |||