Check if Euler Totient Function is same for a given number and twice of that number | Java program of the above approach ; Function to check if phi ( n ) is equals phi ( 2 * n ) ; Return if N is odd ; Driver code ; Function call
class GFG { static int sameEulerTotient ( int N ) { return ( N & 1 ) ; } public static void main ( String [ ] args ) { int N = 13 ; if ( sameEulerTotient ( N ) == 1 ) System . out . print ( " Yes " ) ; else System . out . print ( " No " ) ; } }