Sign Changes of the Liouville Function on Quadratics

From MaRDI portal
Publication:4921863



Abstract: Let lambda(n) denote the Liouville function. Complementary to the prime number theorem, Chowla conjectured that vspace{1mm}

oindent {�f Conjecture (Chowla).} {em �egin{equation} label{a.1} sum_{nle x} lambda (f(n)) =o(x) end{equation} for any polynomial f(x) with integer coefficients which is not of form bg(x)2. } vspace{1mm} oindent The prime number theorem is equivalent to eqref{a.1} when f(x)=x. Chowla's conjecture is proved for linear functions but for the degree greater than 1, the conjecture seems to be extremely hard and still remains wide open. One can consider a weaker form of Chowla's conjecture, namely, vspace{1mm}

oindent {�f Conjecture 1 (Cassaigne, et al).} {em If and is not in the form of bg2(x) for some , then lambda(f(n)) changes sign infinitely often.} Clearly, Chowla's conjecture implies Conjecture 1. Although it is weaker, Conjecture 1 is still wide open for polynomials of degree >1. In this article, we study Conjecture 1 for the quadratic polynomials. One of our main theorems is {�f Theorem 1.} {em Let f(x)=ax2+bx+c with a>0 and l be a positive integer such that al is not a perfect square. Then if the equation f(n)=lm2 has one solution , then it has infinitely many positive solutions (n,m)inN2.} As a direct consequence of Theorem 1, we prove some partial results of Conjecture 1 for quadratic polynomials are also proved by using Theorem 1.












This page was built for publication: Sign Changes of the Liouville Function on Quadratics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4921863)