i want to solve this problem

A Pythagorean triplet is a set of three natural numbers, a b c, for which,

a2 + b2 = c2

For example, 32 + 42 = 9 + 16 = 25 = 52.

There exists exactly one Pythagorean triplet for which a + b + c = 1000.

Find the product abc.

my code

Quote:

public class Euler {

public static void main(String[] args) {

int i = 0;

int j = 1;

int k = 2;

while (Math.pow(i, 2) + Math.pow(j, 2) != Math.pow(k, 2) && i * j * k != 1000) {

i = j;

j = k;

++k;

}

System.out.println(i*j*k);

}

}

the out always 60 although && i * j * k == 1000 in while loop:eek:

i need help