On the Sum of Consecutive Primes

1963/05/01 by L. Moser, Leo Moser · 2 citations
Mathematics · #Analytic Number Theory Research

paper · pdf · doi:10.4153/cmb-1963-013-1

Abstract

Let A: a 1 < a 2 < … be a sequence of positive integers and let f(A:n) = f(n) denote the number of representations of n as the sum of one or more consecutive a's. Although f(n) will usually oscillate rapidly, an asymptotic estimate for its average value can be obtained for many sequences A.

Cited by

• Analysis of Algorithms for Moser's Problems on Sums of Consecutive Primes
• Explicit Bounds and Parallel Algorithms for Counting Multiply Gleeful Numbers

Related

• The average number of representations of an integer as a sum of two prime powers over multiples of a fixed integer
• The Average Number of Goldbach Representations
• Sums of Consecutive Prime Squares
• On the average number of representationsof an integer as a sum of like prime powers
• Asymptotic formula for the sum of a prime and a square-full number in short intervals shorter than X^1/2