Hi. I am a little confused. Please Help! Given an integer n, prove that there exits at least one k for which n|φ(k)
Follow Math Help Forum on Facebook and Google+
Originally Posted by tret Hi. I am a little confused. Please Help! Given an integer n, prove that there exits at least one k for which n|φ(k) Dirichlet's theorem says there is a prime so that . Therefore let then is divisible by .
View Tag Cloud