Primes: n*2^m+1: Difference between revisions
→{{header|jq}}
Line 577:
{{works with|jq}}
'''Works with gojq, the Go implementation of jq.'''
gojq supports unbounded-precision integer arithmetic but the following
algorithm for prime number detection is not up to the stretch tasks.
| |||