document.write( "Question 1207613: For a positive integer $n$, $\phi(n)$ denotes the number of positive integers less than or equal to $n$ that are relatively prime to $n$.\r
\n" );
document.write( "\n" );
document.write( "What is $\phi(5)$? \n" );
document.write( "
Algebra.Com's Answer #845634 by math_tutor2020(3816)![]() ![]() ![]() You can put this solution on YOUR website! \n" ); document.write( "Answer: 4\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Explanation\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "For any prime p, we have the following: \n" ); document.write( "phi(p) = p-1\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "There are p-1 positive integers smaller than p that are relatively prime to p. \n" ); document.write( "1, 2, 3, ..., p-2, p-1 \n" ); document.write( "This intuitively makes sense because all of these values are not factors of the prime p (well except for the trivial case 1)\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Examples: \n" ); document.write( "phi(7) = 6 \n" ); document.write( "phi(11) = 10\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "If we had some value not relatively prime to p, smaller than p, then it would mean p isn't prime. \n" ); document.write( "For instance if 2 and p weren't relatively prime, then p = 2k and p is even. But at this point p is not prime.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Further Reading \n" ); document.write( "https://mathworld.wolfram.com/TotientFunction.html \n" ); document.write( "and \n" ); document.write( "https://en.wikipedia.org/wiki/Euler%27s_totient_function \n" ); document.write( " \n" ); document.write( " |