Abstract

CMO functions multiplicative functions f for which sum _{n=1}^infty f(n) =0. Such functions were first defined and studied by Kahane and Saïas [14]. We generalised these to Beurling prime systems with the aim to investigate the theory of the extended functions and we shall call them CMO_{mathcal {P}} functions. We give some properties and find examples of CMO_{mathcal {P}} functions. In particular, we explore how quickly the partial sum of these classes of functions tends to zero with different generalised prime systems. The findings of this paper may suggest that for all CMO_{mathcal {P}} functions f over mathcal{{N}} with abscissa 1, we have ∑n≤xn∈Nf(n)=Ω(1x).\\documentclass[12pt]{minimal}\t\t\t\t\\usepackage{amsmath}\t\t\t\t\\usepackage{wasysym}\t\t\t\t\\usepackage{amsfonts}\t\t\t\t\\usepackage{amssymb}\t\t\t\t\\usepackage{amsbsy}\t\t\t\t\\usepackage{mathrsfs}\t\t\t\t\\usepackage{upgreek}\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\t\t\t\t\\begin{document}$$\\begin{aligned} \\sum _{\\tiny \\begin{array}{c} n \\le x \\\\ n\\in \\mathcal {N} \\end{array}} f(n) = \\Omega \\Big (\\frac{1}{\\sqrt{x}} \\Big ). \\end{aligned}$$\\end{document}

Highlights

  • 1.1 Completely multiplicative function with sum zeroA function f : N −→ C is called a completely CMO function if it satisfies the two following conditions: ∞f is a completely multiplicative function and f (n) = 0. n=1Such functions were first introduced by Kahane and Saïas [14]

  • F is a completely multiplicative function and f (n) = 0

  • 1.2 Beurling generalised prime systems The concept of generalised primes and generalised integers was introduced by Beurling [3] in the 1930s and has been studied by many researchers since

Read more

Summary

Completely multiplicative function with sum zero

A function f : N −→ C is called a completely CMO function if it satisfies the two following conditions:. The Generalised Riemann Hypothesis as discussed below. They gave some properties and examples of such functions. They discussed various examples of CMO functions including f (n) λ(n) n. This study led them to consider the question of how quickly n≤x f (n) can tend to zero. Riemann Hypothesis (GRH–RH) would follow if their statement is true.

45 Page 2 of 21
45 Page 4 of 21
45 Page 6 of 21
45 Page 8 of 21
45 Page 10 of 21
45 Page 12 of 21
45 Page 14 of 21
45 Page 16 of 21
Hence ζP
Results for Euler’s example over N
45 Page 20 of 21
Open problem

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.