On the multiplicative Erdős discrepancy problem

Details On the multiplicative Erdős discrepancy problem On the multiplicative Erdős discrepancy problem

2010-03-28

arxiv.org/abs/1003.5388v4

Mathematics

Number Theory

10 pages, newest version contains references

Scientific paper

As early as the 1930s, P\'al Erd\H{o}s conjectured that: {\em for any multiplicative function $f:\mathbb{N}\to\{-1,1\}$, the partial sums $\sum_{n\leq x}f(n)$ are unbounded.} Considering this conjecture, in this paper we consider multiplicative functions $f$ satisfying $$\sum_{p\leq x}f(p)=c\cdot\frac{x}{\log x}(1+o(1)).$$ We prove that if $c>0$ then the partial sums of $f$ are unbounded, and if $c<0$ then the partial sums of $\mu f$ are unbounded. Extensions of this result are also discussed.

Affiliated with

Also associated with

No associations

Rating

On the multiplicative Erdős discrepancy problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the multiplicative Erdős discrepancy problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the multiplicative Erdős discrepancy problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-127830