Primes: n*2^m+1: Difference between revisions

m
A little more specific with the "Stretch harder" goal
m (oops, forgot draft task markup)
m (A little more specific with the "Stretch harder" goal)
Line 9:
 
;Stretch harder
* Find and display the first 400 ('''n''') primes of the form '''n × 2<sup>m</sup> + 1''' where '''m''' is the smallest valid non-negative integer. ''Specifically term 383.''
 
 
10,327

edits