Perfect numbers: Difference between revisions

m (Remove blank lines after FutureBasic entry)
Line 2,819:
 
=={{header|PARI/GP}}==
===Using built-in method===
Uses built-in method. Faster tests would use the LL test for evens and myriad results on OPNs otherwise.
<syntaxhighlight lang="parigp">isPerfect(n)=sigma(n,-1)==2</syntaxhighlight>
Show perfect numbers
Line 2,825:
if(isprime(2^p-1),
print(p"\t",(2^p-1)*2^(p-1))))</syntaxhighlight>
===Faster with Lucas-Lehmer test===
<syntaxhighlight lang="parigp">p=2;n=3;n1=2;
while(p<2281,
117

edits