Assignemnt #106 Finding Prime Numbers

Code

    ///Name: Morgan Kaplan
    ///Period: 5
    ///Project Name: PrimeMeth
    ///File Name: PrimeMeth.java
    
public class PrimeMeth 
{
    public static void main( String[] args )
    {
        
        for ( int n=2; n<= 20; n=n+1)
        {
            if (n%2==0) //even
            {
               isEven(n);
            }
            if (n%2!=0)
            {
                Prime(n);
            }
  
        }
        
    }
public static boolean isEven( int n )
{
   System.out.println(" "+n+" ");
    return false;
}
public static boolean Prime( int n )
{
   for(int i=2;2*i
    
    
Picture of Output