Sequence of primes by trial division: Difference between revisions
Sequence of primes by trial division (view source)
Revision as of 21:14, 28 March 2022
, 2 years agoSequence of primes by trial division in BASIC256
m (→{{header|AsciiDots}}: removed accidental # in code block) |
(Sequence of primes by trial division in BASIC256) |
||
Line 430:
25 prime numbers found in range 1-100
</pre>
=={{header|BASIC256}}==
<lang freebasic>function isPrime(v)
if v < 2 then return False
if v mod 2 = 0 then return v = 2
if v mod 3 = 0 then return v = 3
d = 5
while d * d <= v
if v mod d = 0 then return False else d += 2
end while
return True
end function
for i = 101 to 999
if isPrime(i) then print string(i); " ";
next i
end</lang>
{{out}}
<pre>Igual que la entrada de FreeBASIC.</pre>
=={{header|Batch File}}==
| |||