Two formulae for L(n) (Q762190)

If n is a positive integer which exceeds 1 let its canonical, prime-power representaion be given by \(n=p_ 1^{\alpha_ 1} p_ 2^{\alpha_ 2}...p_ k^{\alpha_ k}\). The Möbius function is defined as follows: \(\mu (1)=1\), \(\mu (n)=0\) if \(\alpha_ i>1\) for some i between 1 and k, inclusive; \(\mu (n)=(-1)^ k\) if \(\alpha_ i=1\) for all i between 1 and k. The Liouville function is defined by: \(\lambda (1)=1\); \(\lambda (n)=(-1)^ m\) where \(m=\alpha_ 1+\alpha_ 2+...+\alpha_ k\). The sum functions of these two functions are given by \(M(n)=\mu (1)+\mu (2)+...+\mu (n)\) and \(L(n)=\lambda (1)+\lambda (2)+...+\lambda (n).\) In the present paper two formulas are derived for L(n). The first involves the determination of the square-free numbers less than n and then the calculation of some square roots. The second requires that a table of values of M(n) be available. We state the second formula: \(L(n)=\sum M([n/r^ 2])\) where \(r=1,2,3,...,[\sqrt{n}]\). The proofs are elementary.