booleans

[kevin Noronha]

umm...anyone know how i can check, if when i divide 2 integers, if they are integers or not?

here is the code

import java.util.*;

class Factors{
public static HashSet primes(int high){
HashSet primeset=new HashSet();
for(int i=0;i>high;i++){
if ((i/2)!=Integer){
primeset.add(i);
}
}
}
}

[Clayton]

Check if the value returned is equal to the value returned casted to an int?

[A.J]

to check if x is an integer, round(x) must equal to x.

[HeavenAgain]

why not just

code:

if (i%2 == 0) // if is 0 then there is no remainder (decimal), or else is 1

Integer is a reference type, you cannot compare a int (data type); (i/2), with a reference type; Integer.