Note: (Restricted functionality due to obvious reasons!)
Minimal Code ( Raw-View ) :
class Pm
{
public static void main(String z[])
{
int a,num=5749, flag=0;
int n = num-1;
System.out.println("\n check_DivideByNo) Max_number to check divisibility = Max_number ");
for(a=2; a<=n; a++)
{
if((num%a)==0)
{
System.out.println(num+" is NOT prime! Bcoz "+num+" is divisible by "+a);
flag=1;
//break;
}
else
{
n=num/a;
}
System.out.println(" "+a+") mxNo:\t"+n);
}
if(flag!=0)
{
System.out.println(num+" is NOT PRIME");
}
else
{
System.out.println(num+" is PRIME");
}
}
}