Sum over primes asymtotics

  • Context: Graduate 
  • Thread starter Thread starter zetafunction
  • Start date Start date
  • Tags Tags
    Primes Sum
Click For Summary

Discussion Overview

The discussion revolves around the validity of an asymptotic approximation for sums over prime numbers, specifically examining the expression \(\sum_{p\le x}f(p) \sim \int_{2}^{x}\frac{f(x)dx}{\log(x)}\). Participants explore the conditions under which this approximation holds, considering various functions \(f(x)\) and their properties.

Discussion Character

  • Exploratory, Technical explanation, Debate/contested

Main Points Raised

  • One participant questions the validity of the asymptotic approximation, suggesting that assumptions like continuity and uniform continuity are necessary for \(f(x)\) to ensure the approximation holds.
  • Another participant provides examples of functions \(f(x)\) that do not lead to the desired asymptotic behavior, indicating that the approximation fails under certain conditions.
  • A participant clarifies that they mean the quotient between the series and the integral should tend to 1 as \(x\) approaches infinity, referencing the Prime Number Theorem as a specific case.
  • Further examples of functions are presented that demonstrate differing asymptotic behavior, suggesting that the approximation may not hold universally.
  • One participant proposes restricting \(f\) to well-behaved functions, such as polynomials or trigonometric functions, to explore if the approximation could be valid under those conditions.

Areas of Agreement / Disagreement

Participants express differing views on the conditions required for the asymptotic approximation to hold, with no consensus reached on whether it is universally valid or under what specific circumstances it may fail.

Contextual Notes

Limitations include the dependence on the properties of the function \(f(x)\), such as continuity and monotonicity, and the unresolved nature of how these properties affect the asymptotic relationship.

zetafunction
Messages
371
Reaction score
0
is the following asymptotic approximation valid whenever dealing sums over primes ?? [tex]\sum_{p\le x}f(p) \sim \int_{2}^{x}\frac{f(x)dx}{log(x)}[/tex]
 
Physics news on Phys.org
f(x)=1 if x is a prime number, 0 otherwise

You'll definitely need at least some assumptions like continuity, and probably uniform continuity, otherwise you could just make f(x) approximately zero except for at prime numbers, where it forms sharper and sharper spikes over time

Even then, if f(x) only had finite support, say f(x)=1 for x<6, f(x)=7-x if 6<x<7, 0 if x>7, then you will never get the difference to become small or the ratio of the two to become close to each other (I'm not sure exactly what you mean by ~ in this case but since for x>7 the two stop changing and are not equal to each other, it's obviously not the case that they become asymptotically close for any definition of asymptotic)
 
i mean ASYMPTOTIC that is the quotient between the series and the integral will tend to 1 for big x

for example if you set f(x)=1 you get the Prime Number Theorem
 
And if you set f(x) to be either of the examples that I gave in my post you don't get such a result
 
I assume the integral was intended to be [tex]\int_2^x\frac{f(t)dt}{\log t}[/tex].Here's a uniformly continuous function supported on x > 0 where the two differ asymptotically:

[tex]f(x) = 2^{-x}[/tex] for x a positive integer
[tex]f(x) = 1[/tex] for x a positive half-integer
[tex]f(x) = (\lfloor x\rfloor-x+1/2)f(\lfloor x\rfloor)+x-\lfloor x\rfloor[/tex] for [tex]\lfloor x\rfloor<x<\lfloor x\rfloor+1/2[/tex]
[tex]f(x) = x-\lfloor x\rfloor-1/2+(\lfloor x\rfloor+1-x)f(\lfloor x\rfloor+1)[/tex] for [tex]\lfloor x\rfloor+1/2<x<\lfloor x\rfloor+1[/tex]

[tex]\sum_{p\le x}f(p)\sim1\ldots[/tex] (actually, 0.4146825... + o(1), where the number is Sloane's A051006)
while
[tex]\int_2^x\frac{f(t)dt}{\log t}\sim\frac{x}{2\log x}[/tex]What about restricting f to monotonic functions? I mean with all the other stuff -- without uniform continuity I think I can make it fail even for monotonics.
 
Last edited:
well, how about trying it for WELL BEHAVED function ? like polynomials , trigonometric and all this stuff ..
 

Similar threads

  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 17 ·
Replies
17
Views
3K
  • · Replies 21 ·
Replies
21
Views
2K
  • · Replies 31 ·
2
Replies
31
Views
3K
Replies
7
Views
2K
Replies
17
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
4K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K