Pythagorean triples: Difference between revisions

Content added Content deleted

Inline

@@ Line 223: / Line 223: @@
         //change this to whatever perimeter limit you want;the RAM's the limit
-        BigInteger periLimit = new BigInteger("100"),
+        BigInteger periLimit = BigInteger.valueOf(100),
-                peri2 = periLimit.divide(new BigInteger("2")),
+                peri2 = periLimit.divide(BigInteger.valueOf(2)),
-                peri3 = periLimit.divide(new BigInteger("3"));
+                peri3 = periLimit.divide(BigInteger.valueOf(3));
         for(BigInteger a = ONE; a.compareTo(peri3) < 0; a = a.add(ONE)){
             BigInteger aa = a.multiply(a);
-            for(BigInteger b = new BigInteger(a.toString()).add(ONE);
+            for(BigInteger b = a.add(ONE);
                     b.compareTo(peri2) < 0; b = b.add(ONE)){
                 BigInteger bb = b.multiply(b);
@@ Line 236: / Line 236: @@
                 BigInteger aabb = aa.add(bb);
-                for(BigInteger c = new BigInteger(b.toString()).add(ONE);
+                for(BigInteger c = b.add(ONE);
                         c.compareTo(peri2) < 0; c = c.add(ONE)){
@@ Line 252: / Line 252: @@
                         //does binary GCD under the hood
-                        if(a.gcd(b).compareTo(ONE) == 0){
+                        if(a.gcd(b).equals(ONE)){
                             System.out.print(" primitive");
                             primCount++;