Prime Adam Program
package Class12 ; import java.util.Scanner ; public class primeAdam { boolean prime ( int n){ int counter = 0 ; for ( int i = 1 ; i <= n ; i ++ ) { if (n % i == 0) { counter ++; } } if ( counter == 2) return true ; else return false ; } int reverse ( int n){ String t = Integer . toString (n) ; String rev = "" ; for ( int i = t . length () - 1 ; i >= 0 ; i -- ) { rev += t . charAt ( i ) ; } return Integer . parseInt ( rev ) ; } boolean checkAdam ( int n){ int sq = n * n ; boolean flag ; int temp = reverse (n) ; temp = temp * temp ; if ( reverse ( sq ) == temp ) return true ; else return false ; } public static void main ( String [] args) { primeAdam pr = new primeAdam () ; Scanner in = new Scanner ( System . in) ; System . out . ...