_S_S_D_'s blog

By _S_S_D_, history, 6 weeks ago, In English

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

 
 
 
 
  • Vote: I like it
  • +21
  • Vote: I do not like it

»
6 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by _S_S_D_ (previous revision, new revision, compare).

»
6 weeks ago, # |
Rev. 4   Vote: I like it +14 Vote: I do not like it

It's correct, here's my proof.

  • »
    »
    6 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Got it, Thank you so much.

  • »
    »
    6 weeks ago, # ^ |
      Vote: I like it +3 Vote: I do not like it

    And the "famous lemma" indeed can be proven easily with induction over.