Back to search

Lethbridge, Alta. : Universtiy of Lethbridge, Department of Mathematics and Computer Science

Perron's formula and resulting explicit bounds on sums

Abstract

dc:description.abstract

By working with Perron’s formula we prove an explicit bound on ∑n≤x an/ns, where an,s ∈ C. We then prove a second explicit bound on this sum for the special case where s = 0: These bounds apply to specific sums that are involved in the Prime Number Theorem. Moreover, they are particularly useful in cases where a variant of the Riemann von-Mangoldt explicit formula is not unconditionally available. We choose to implement our bounds on M(x) =∑n≤x μ(n) and m(x) =∑n≤x μ(n/)n (with μ(n) denoting the Möbius function). This gives constants C > 0; c > 0 and x0 > 0 for which |M(x)|≤Cxexp(−c√logx) if x > x0 and a similar kind of bound for m(x): We believe that explicit bounds for M(x) and m(x) like these have never before been published.

Degree

thesis:*
Level thesis:degree_level
Masters
Grantor dc:publisher
Lethbridge, Alta. : Universtiy of Lethbridge, Department of Mathematics and Computer Science
Year dc:date.issued
2019

Author and committee

dc:creator, dc:contributor.*
Authors dc:creator
  • Chalker, Kirsty A.
  • University of Lethbridge. Faculty of Arts and Science
Advisor dc:contributor.supervisor
  • Akbary, Amir

Subjects

dc:subject × 10

Rights

Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Handle dc:identifier.uri
https://hdl.handle.net/10133/5441

Chain of custody

source
Harvested from
University of Lethbridge
Base URL
opus.uleth.ca/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Chalker, Kirsty A.; University of Lethbridge. Faculty of Arts and Science. Perron's formula and resulting explicit bounds on sums. Masters thesis, Lethbridge, Alta. : Universtiy of Lethbridge, Department of Mathematics and Computer Science, 2019. https://hdl.handle.net/10133/5441