A series sum

Правка en2, от sobhagyaSD, 2021-01-21 11:32:09

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

Теги sequences and series, expression, brute force, eular phi

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский sobhagyaSD 2021-01-21 11:32:09 0 (published)
en1 Английский sobhagyaSD 2021-01-21 11:29:17 415 Initial revision (saved to drafts)