Asymptotic equivalents of partial sums of the reciprocals of prime numbers via the von Mangoldt function

Abstract

In this paper, we discuss an alternative approach to determine an asymptotic equivalent of the partial sum of the reciprocals of prime numbers. This well-known result, related to Merten's second theorem, is usually derived through methods similar to those found in Hardy and Wright's book ``An introduction to the theory of numbers'', involving comparisons with integrals. The present proof differs in several respects, combining an equivalent for the partial sum of (m)/m, where denotes the von Mangoldt function, with an application of Abel's summation formula and properties of the second Chebyshev function (x)=Σn x(n). A simple application to the study of integers with large prime factors is also presented. Beyond the pedagogical aspect of this work, the aim is to highlight the complementarity of arithmetic functions and to show that interesting (and nontrivial) results can be obtained by means of elementary methods.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…