Assignemnt #106 Finding Prime

Code

    ///Name: Joshua Pell
    ///Period: 6
    ///Project Name: Finding Prime
    ///File Name: prime.java
    ///Date: 3/31/2015
    
public class prime
{
        public static void main( String[] args )
        {
            
                for ( int x = 2; x < 21; x++ )
                {
                        
                        boolean prime = isPrime(x);
                        if ( prime == true )
                            System.out.println( x + "<" );
                        else
                            System.out.println(x);
                    
                }
        }
    
        public static boolean isPrime( int n )
        {
            boolean i = true;    
            int j = 2;
           while ( i == true && j < n )
           {
                if ( n%j == 0 )
                    i = false;
                j++;
                    
           }
            return i;
        }
}
    

Picture of the output