///Name: Prooz Fereydouni ///Period: 7 ///Project Name: Finding Prime Numbers ///File Name: P.java ///Date: 3/31/2016 public class P { public static void main( String[] args ) { for (int i = 0; i < 20; i++) { System.out.println((i + 1) +" "+ (isPrime(i + 1) ? "<" : "")); } } public static boolean isPrime(int n) { for (int i = 2;i < n;i++) if (n%i==0) return false; return true; } }