Check if Euler Totient Function is same for a given number and twice of that number | C ++ 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
#include <bits/stdc++.h> NEW_LINE using namespace std ; bool sameEulerTotient ( int N ) { return ( N & 1 ) ; } int main ( ) { int N = 13 ; if ( sameEulerTotient ( N ) ) cout << " Yes " ; else cout << " No " ; }