mersenneforum.org Factorial and Goldbach conjecture.
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

2018-01-28, 19:21   #12
CRGreathouse

Aug 2006

32×5×7×19 Posts

Quote:
 Originally Posted by a1call Can you please provide links to the references that you mentioned. My googling did not return any relevant hits.
Strange, Googleing the authors gave me references on the first page of the search results.

R. K. Guy, C. B. Lacampagne and J. L. Selfridge, Primes at a glance, Math. Comp. 48 (1987), 183-202.

Agoh, Erdos, and Granville, Primes at a (somewhat lengthy) glance, The American Mathematical Monthly Vol. 104, No. 10, Dec., 1997, pages 943 to 945

2018-01-28, 20:03   #13
a1call

"Rashid Naimi"
Oct 2015
Remote to Here/There

22·503 Posts

Quote:
 Originally Posted by science_man_88 Depends on n if odd neither will n!-(n+1) as it will be even. If n is 2 mod 3 then n+1 is 0 mod 3 and the result of subtracting it if n is more than 3 will be 0 mod 3.
Can you please provide an example for n, m where m is a prime number such that
n!-n <= m < n! -1

Last fiddled with by a1call on 2018-01-28 at 20:04

2018-01-28, 20:08   #14
science_man_88

"Forget I exist"
Jul 2009
Dumbassville

20C016 Posts

Quote:
 Originally Posted by a1call Can you please provide an example for n, m where m is a prime number such that n!-n <= m < n! -1 Thanks in advance.
Not what was claimed. I claimed your lower bound, is not the lowest without being prime it could go in some cases.

 2018-01-28, 20:11 #15 a1call     "Rashid Naimi" Oct 2015 Remote to Here/There 22×503 Posts What is the correct lower bound in your opinion? Noting that the difference in your quoted post is only in the upper bounds. Last fiddled with by a1call on 2018-01-28 at 20:14
2018-01-28, 20:16   #16
science_man_88

"Forget I exist"
Jul 2009
Dumbassville

26·131 Posts

Quote:
 Originally Posted by a1call What is the correct lower bound in your opinion?
Like I said it depends on n, you can go as low as n!-nextprime(n) at least. That follows from the fact that all numbers under nextprime(n) have a factor under n.

Last fiddled with by science_man_88 on 2018-01-28 at 20:21

2018-01-28, 20:31   #17
a1call

"Rashid Naimi"
Oct 2015
Remote to Here/There

22·503 Posts

Quote:
 Originally Posted by science_man_88 Like I said it depends on n, you can go as low as n!-nextprime(n) at least. That follows from the fact that all numbers under nextprime(n) have a factor under n.
So this is sum of the series all over again.

Last fiddled with by a1call on 2018-01-28 at 20:31

2018-01-29, 00:50   #18
CRGreathouse

Aug 2006

32·5·7·19 Posts

Quote:
 Originally Posted by a1call Actually it seems to me that the correct optimised range is neither n!-n^2 < P < n! Nor n!-n^2 < P < n!-1 But rather n!-n^2 < P < n!-n Since none of the integers m such that n!-n <= m < n! -1 Can be prime.
Right, you can take the upper bound as n!-n or n!-1.

Either way you have ~ n^2 numbers of size roughly n! which are divisible by none of the primes up to n. Heuristically this makes them
$\prod_{p\le n}\frac{p}{p-1} \approx e^{-\gamma}\log n$
times more likely to be prime than the average prime of its size, for an overall probability of
$\frac{e^{-\gamma}\log n}{\log n!} \approx \frac{e^{-\gamma}\log n}{n\log n} = \frac{e^{-\gamma}}{n}$
and an expected
$\frac{n^2}{\log(n^2)}\cdot\frac{e^{-\gamma}}{n} = \frac{e^{-\gamma}n}{2\log n}$
primes in the interval. The chance of having none is then
$\exp\left(-\frac{e^{-\gamma}n}{2\log n}\right)$
and since
$\int\exp\left(-\frac{e^{-\gamma}n}{2\log n}\right)$
converges there should be only finitely many you'd expect only finitely many intervals without primes. A quick check shows that the first 500 have primes, making the odds of any being empty around
$\int_{500.5}^{\infty}\exp\left(-\frac{e^{-\gamma}n}{2\log n}\right) \approx 4\cdot10^{-9}.$

 Similar Threads Thread Thread Starter Forum Replies Last Post MattcAnderson MattcAnderson 1 2017-03-18 23:32 MattcAnderson MattcAnderson 3 2017-03-17 15:34 Patrick123 Miscellaneous Math 242 2011-03-15 14:28 vector Miscellaneous Math 5 2007-12-01 14:43 Citrix Puzzles 3 2005-09-09 13:58

All times are UTC. The time now is 17:19.

Tue Apr 20 17:19:57 UTC 2021 up 12 days, 12 hrs, 1 user, load averages: 4.37, 3.82, 3.46