10001th prime: Difference between revisions
Content added Content deleted
(Add Racket solution) |
(add golang solution) |
||
| Line 209: | Line 209: | ||
180 Q = 1 |
180 Q = 1 |
||
190 RETURN</lang> |
190 RETURN</lang> |
||
{{out}}<pre>104743</pre> |
|||
=={{header|go}}== |
|||
<lang go>package main |
|||
import "fmt" |
|||
func isPrime(n int) bool { |
|||
if n == 1 { |
|||
return false |
|||
} |
|||
i := 2 |
|||
for i*i <= n { |
|||
if n%i == 0 { |
|||
return false |
|||
} |
|||
i++ |
|||
} |
|||
return true |
|||
} |
|||
func main() { |
|||
var final, pNum int |
|||
for i := 1; pNum < 10001; i++ { |
|||
if isPrime(i) { |
|||
pNum++ |
|||
} |
|||
final = i |
|||
} |
|||
fmt.Println(final) |
|||
} |
|||
</lang> |
|||
{{out}}<pre>104743</pre> |
{{out}}<pre>104743</pre> |
||