Free help with homework

Why join Brainly?

  • ask questions about your assignment
  • get answers with explanations
  • find similar questions




1 5 1
basically φ(n) gives you the number of positive coprime integers less than or equal to n
and it is a multiplicative function, so φ(a*b) = φ(a)*φ(b) whenever gcd(a,b)=1
can u write the formula?
φ(p^k) = p^k - p^(k-1) where p is prime
got it.thanks
The Brain
  • The Brain
  • Helper
Not sure about the answer?
Learn more with Brainly!
Having trouble with your homework?
Get free help!
  • 80% of questions are answered in under 10 minutes
  • Answers come with explanations, so that you can learn
  • Answer quality is ensured by our experts