code for prime number with out using any count variable
i forgot the square root and took time to optimise the code, later got the hit from interviwer and optimised it.
further optimized code is requested then again elemenated 0 & 1 & -ve numbers
futher optimised code is requested again got hit w.r.t even numbers and furhter optimized elemenating even numbers
static boolean primNumber(int num) {
int i = 2;
if (num <= 1) {
return false;
} else {
while (i%2 !=0 || i <= Math.sqrt(num)) {
if ( num % i == 0) {
return false;
}
i++;
}
return true;

	}

}