Here floor is floor function or greatest integer function and phi is Euler totient function.
For n < 10^4 i tried to find the f(n), and turn out to a simple expression :
Can you provide a proof or some argument related to this expression
Here floor is floor function or greatest integer function and phi is Euler totient function.
For n < 10^4 i tried to find the f(n), and turn out to a simple expression :
Can you provide a proof or some argument related to this expression
Auto comment: topic has been updated by sobhagyaSD (previous revision, new revision, compare).
It's correct, here's my proof.
Got it, Thank you so much.
And the "famous lemma" indeed can be proven easily with induction over.