Sample Code On Prime

import java.util.*;
import java.lang.Math;
public class Prime {
public static void main(String[] args)
{
for (int i = 1; i < 1500; i++)
if (isPrime(i))
System.out.println(i);
}
public static boolean isPrime(int n)
{
for (int i = 2; i <= Math.sqrt(n); i++)
{
if (n % i == 0)
return false;
}
return true;
}
}