Cullen and Woodall numbers: Difference between revisions
Content added Content deleted
No edit summary |
(Cullen and Woodall numbers in various BASIC dialents) |
||
Line 101: | Line 101: | ||
Index of the 1st 12 Woodall primes: 2 3 6 30 75 81 115 123 249 362 384 462 |
Index of the 1st 12 Woodall primes: 2 3 6 30 75 81 115 123 249 362 384 462 |
||
</pre> |
</pre> |
||
=={{header|BASIC}}== |
|||
==={{header|BASIC256}}=== |
|||
{{trans|FreeBASIC}} |
|||
<lang BASIC256>print "First 20 Cullen numbers:" |
|||
for n = 1 to 20 |
|||
num = n * (2^n)+1 |
|||
print int(num); " "; |
|||
next |
|||
print : print |
|||
print "First 20 Woodall numbers:" |
|||
for n = 1 to 20 |
|||
num = n * (2^n)-1 |
|||
print int(num); " "; |
|||
next n |
|||
end</lang> |
|||
{{out}} |
|||
<pre> |
|||
Igual que la entrada de FreeBASIC. |
|||
</pre> |
|||
==={{header|FreeBASIC}}=== |
|||
<lang freebasic>Dim As Uinteger n, num |
|||
Print "First 20 Cullen numbers:" |
|||
For n = 1 To 20 |
|||
num = n * (2^n)+1 |
|||
Print num; " "; |
|||
Next |
|||
Print !"\n\nFirst 20 Woodall numbers:" |
|||
For n = 1 To 20 |
|||
num = n * (2^n)-1 |
|||
Print num; " "; |
|||
Next n |
|||
Sleep</lang> |
|||
{{out}} |
|||
<pre>First 20 Cullen numbers: |
|||
3 9 25 65 161 385 897 2049 4609 10241 22529 49153 106497 229377 491521 1048577 2228225 4718593 9961473 20971521 |
|||
First 20 Woodall numbers: |
|||
1 7 23 63 159 383 895 2047 4607 10239 22527 49151 106495 229375 491519 1048575 2228223 4718591 9961471 20971519</pre> |
|||
==={{header|PureBasic}}=== |
|||
<lang PureBasic>OpenConsole() |
|||
PrintN("First 20 Cullen numbers:") |
|||
For n.i = 1 To 20 |
|||
num = n * Pow(2, n)+1 |
|||
Print(Str(num) + " ") |
|||
Next |
|||
PrintN(#CRLF$ + "First 20 Woodall numbers:") |
|||
For n.i = 1 To 20 |
|||
num = n * Pow(2, n)-1 |
|||
Print(Str(num) + " ") |
|||
Next n |
|||
PrintN(#CRLF$ + "--- terminado, pulsa RETURN---"): Input() |
|||
CloseConsole()</lang> |
|||
{{out}} |
|||
<pre> |
|||
Igual que la entrada de FreeBASIC. |
|||
</pre> |
|||
==={{header|QBasic}}=== |
|||
{{works with|QBasic|1.1}} |
|||
{{works with|QuickBasic|4.5}} |
|||
{{works with|True BASIC}} |
|||
{{trans|FreeBASIC}} |
|||
<lang qbasic>DIM num AS LONG ''comment this line for True BASIC |
|||
PRINT "First 20 Cullen numbers:" |
|||
FOR n = 1 TO 20 |
|||
LET num = n * (2 ^ n) + 1 |
|||
PRINT num; |
|||
NEXT n |
|||
PRINT |
|||
PRINT |
|||
PRINT "First 20 Woodall numbers:" |
|||
FOR n = 1 TO 20 |
|||
LET num = n * (2 ^ n) - 1 |
|||
PRINT num; |
|||
NEXT n |
|||
END</lang> |
|||
{{out}} |
|||
<pre> |
|||
Igual que la entrada de FreeBASIC. |
|||
</pre> |
|||
==={{header|True BASIC}}=== |
|||
{{works with|QBasic}} |
|||
{{trans|FreeBASIC}} |
|||
<lang qbasic>REM DIM num AS LONG !uncomment this line for QBasic |
|||
PRINT "First 20 Cullen numbers:" |
|||
FOR n = 1 TO 20 |
|||
LET num = n * (2 ^ n) + 1 |
|||
PRINT num; |
|||
NEXT n |
|||
PRINT |
|||
PRINT |
|||
PRINT "First 20 Woodall numbers:" |
|||
FOR n = 1 TO 20 |
|||
LET num = n * (2 ^ n) - 1 |
|||
PRINT num; |
|||
NEXT n |
|||
END</lang> |
|||
{{out}} |
|||
<pre> |
|||
Igual que la entrada de FreeBASIC. |
|||
</pre> |
|||
==={{header|Yabasic}}=== |
|||
<lang yabasic>print "First 20 Cullen numbers:" |
|||
for n = 1 to 20 |
|||
num = n * (2^n)+1 |
|||
print num, " "; |
|||
next |
|||
print "\n\nFirst 20 Woodall numbers:" |
|||
for n = 1 to 20 |
|||
num = n * (2^n)-1 |
|||
print num, " "; |
|||
next n |
|||
print |
|||
end</lang> |
|||
{{out}} |
|||
<pre> |
|||
Igual que la entrada de FreeBASIC. |
|||
</pre> |
|||
=={{header|F_Sharp|F#}}== |
=={{header|F_Sharp|F#}}== |