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

m
oops. correct range.
m (clarify slightly)
m (oops. correct range.)
Line 1:
 
;Task
* Find and display the first 45 ('''n''') primes of the form '''n × 2<sup>m</sup> + 1''' where '''m''' is the smallest valid positivenon-negative integer.
 
 
;Stretch
* Find and display the first 50 ('''n''') primes of the form '''n × 2<sup>m</sup> + 1''' where '''m''' is the smallest valid positivenon-negative integer.
 
 
;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 positivenon-negative integer.
 
 
10,333

edits