private void findPythagorean(){
		int targetSum = 1000;
		for (int i = 1; i<targetSum;i++){
			for(int j = i+1;j<targetSum;j++){
				for(int k=j;k<targetSum;k++){
					if((i+j+k)==targetSum){
						if(isPythagorian(i,j,k)){
							System.out.println(i*j*k);
						}
					}
				}
			}
		}
	}