Pythagorean triples: Difference between revisions

Content deleted Content added

Inline

@@ Line 1,286: / Line 1,286: @@
 This version is reasonably efficient and can handle inputs like a million quickly.
 <lang parigp>do(lim)={
-  my(prim,total);
+  my(prim,total,P);
   lim\=1;
-  for(m=2,sqrtint(lim-1),
+  for(m=2,sqrtint(lim\2),
     forstep(n=1+m%2,min(sqrtint(lim-m^2),m-1),2,
-      if(gcd(m,n)==1,
+      P=2*m*(m+n);
+      if(gcd(m,n)==1 && P<=lim,
         prim++;
-        total+=lim\(m^2+n^2)
+        total+=lim\P
       )
     )