Twin primes are a pair of prime numbers that differ by 2. For example, 3 and 5 are twin primes, 5 and 7 are twin primes, and 11 and 13 are twin primes. Write a program to find all twin primes less than 1,000

Code:

public class TwinPrime 

{

    public static void main(String[] args) 

    {

        for( int i=1; i<1000; i++) 

        { 

            if( prime( i) && prime( i+2)) 

            System.out.println(" ("+i+","+( i+2 )+")"); 

        }

     }

static boolean prime(int p) 

{ 

     if( p<2 ) 

         return false; 

        //int i = 2000;

     for(int j=2; j<=(p/2); j++) 

     { 

          if((p%j) == 0) 

          return false; 

        }

          //else 

            return true; 

     } 

}

Output: