mersenneforum.org Bertand's Postulate
 Register FAQ Search Today's Posts Mark Forums Read

2019-08-21, 23:22   #1
a1call

"Rashid Naimi"
Oct 2015
Remote to Here/There

23×3×79 Posts
Bertand's Postulate

Quote:
 This proof can be modified to prove that for any positive integer k, there is a number N such that for all n > N, there are k primes between n and 2n.
https://primes.utm.edu/glossary/page...randsPostulate

That does not sound right to me. Shouldn't that be something like:

Quote:
 This proof can be modified to prove that for any positive integer k, there is a number N such that for all n > N, there are at least k primes between n and 2n.

 2019-08-21, 23:30 #2 a1call     "Rashid Naimi" Oct 2015 Remote to Here/There 111011010002 Posts Follow up question: * Is there a (known) way to formulate N as a function of k? Thanks in advance.
2019-08-22, 08:24   #3
R. Gerbicz

"Robert Gerbicz"
Oct 2005
Hungary

11·127 Posts

Quote:
 Originally Posted by a1call https://primes.utm.edu/glossary/page...randsPostulate That does not sound right to me. Shouldn't that be something like:
That is correct wording.
You can say stronger statement (following and modifying the proof) : there is c0>0 for that there is at least c0*n/log(n) primes in [n,2n]. Using this there is c1>0 for that for N=c1*n*log(n) there is at least n primes in [N,2N].

 2019-08-24, 01:21 #4 a1call     "Rashid Naimi" Oct 2015 Remote to Here/There 23×3×79 Posts Thank you very much for the confirmation and the formulation R. Gerbicz.

 Similar Threads Thread Thread Starter Forum Replies Last Post George Other Mathematical Topics 5 2018-07-25 12:01 masser Math 1 2003-07-30 03:07

All times are UTC. The time now is 12:31.

Sat Sep 26 12:31:15 UTC 2020 up 16 days, 9:42, 1 user, load averages: 1.08, 1.55, 1.61