20 lines
292 B
Text
20 lines
292 B
Text
|
sub semiprime$ (n)
|
||
|
|
a = 2
|
||
|
|
c = 0
|
||
|
|
while c < 3 and n > 1
|
||
|
|
if mod(n, a) = 0 then
|
||
|
|
n = n / a
|
||
|
|
c = c + 1
|
||
|
|
else
|
||
|
|
a = a + 1
|
||
|
|
end if
|
||
|
|
wend
|
||
|
|
if c = 2 then return "True" : fi
|
||
|
|
return "False"
|
||
|
|
end sub
|
||
|
|
|
||
|
|
for i = 0 to 64
|
||
|
|
print i, chr$(9), semiprime$(i)
|
||
|
|
next i
|
||
|
|
end
|