We present a new elementary algorithm that takes time O ϵ x 3 5 ( log x ) 8 5 + ϵ and space O x 3 10 ( log x ) 13 10 (measured bitwise) for computing M ( x ) = ∑ n ≤ x μ ( n ) , where μ ( n ) is the Möbius f... ...

请注册登录后继续浏览