Pythagorean triples: Difference between revisions

m (→‎{{header|Java}}: Oops I copied in the 10K limit)
Line 223:
 
//change this to whatever perimeter limit you want;the RAM's the limit
BigInteger periLimit = new BigInteger.valueOf("100"),
peri2 = periLimit.divide(new BigInteger.valueOf("2")),
peri3 = periLimit.divide(new 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);
b.compareTo(peri2) < 0; b = b.add(ONE)){
BigInteger bb = b.multiply(b);
Line 236:
BigInteger aabb = aa.add(bb);
for(BigInteger c = new BigInteger(b.toString()).add(ONE);
c.compareTo(peri2) < 0; c = c.add(ONE)){
 
Line 252:
 
//does binary GCD under the hood
if(a.gcd(b).compareToequals(ONE) == 0){
System.out.print(" primitive");
primCount++;
Anonymous user