Numbers of the form kf(k)

Abstract

For a function f N, define N×f(x)=\#\n≤ x: n=kf(k) for some k \. Let τ(n)=Σd|n1 be the divisor function, ω(n)=Σp|n1 be the prime divisor function, and (n)=\#\1≤ k≤ n: (k,n)=1 \ be Euler's totient function. We prove that gather* \!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\! 1) N×τ(x) x( x)1/2; \\ 2) N×ω(x) = (1+o(1))x x; \\ \!\!\!\!\!\!\!\!\! 3) N×(x) = (c0+o(1))x1/2, gather* where c0=1.365...\,.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…