Primes: n*2^m+1: Difference between revisions
Content added Content deleted
(Primes: n*2^m+1 in FreeBASIC) |
|||
| Line 15: | Line 15: | ||
[[oeis:A050921|A050921 - Smallest prime of form n*2^m+1]] |
[[oeis:A050921|A050921 - Smallest prime of form n*2^m+1]] |
||
=={{header|FreeBASIC}}== |
|||
<syntaxhighlight lang="freebasic">#include "isprime.bas" |
|||
Print !" N M Prime\n------------------" |
|||
For n As Integer = 1 To 45 |
|||
Dim As Ulongint m = 0 |
|||
Do |
|||
Dim As Ulongint p = n * (2 ^ m) + 1 |
|||
If isPrime(p) Then |
|||
Print Using "### #### ####"; n; m; p |
|||
Exit Do |
|||
End If |
|||
m += 1 |
|||
Loop |
|||
Next n |
|||
Sleep</syntaxhighlight> |
|||
=={{header|Julia}}== |
=={{header|Julia}}== |
||