[seqfan] Re: Is there any problems with this proof?

[John W. Nicholson]

"It's numerically unassailable"? Please, do explain, because I do not see how it is a problem when I used Ramanujan primes, the RPC, and subsutution to limit the size of the gaps. I don't see how this is different for a large maximal gap too.
 John W. Nicholson 

     On Saturday, February 21, 2015 9:43 AM, Charles Greathouse <charles.greathouse at case.edu> wrote:
   
 

 I don't know what to think of the first question. It's numerically
unassailable -- to build up evidence in the primes, one way or another,
you'd probably need to get a lot closer to a googolplex than a googol, and
even 10^20 is out of reach at the moment. The only recourse I see is
checking whether it holds in the Cramer model, flawed as it is.

It wouldn't surprise me at all if ratios > 2 occurred infinitely often. It
also wouldn't surprise me if it happened only finitely often.

Charles Greathouse
Analyst/Programmer
Case Western Reserve University

On Fri, Feb 20, 2015 at 7:58 PM, John W. Nicholson <reddwarf2956 at yahoo.com>
wrote:

> Charles,
>
> Does that mean that the proof with first question, that the ratio <=2, is
> correct and with out problems so that you are now looking at the second
> question with the limit of the ratio going to infinity =1? John W. Nicholson
>
>      On Friday, February 20, 2015 4:24 PM, Charles Greathouse <
> charles.greathouse at case.edu> wrote:
>
>
>
>  I suspect that there is some k > 1 such that the ratio is greater than k
> infinitely often. Is anyone interested in crunching the numbers here on the
> heuristic?
>
> Charles Greathouse
> Analyst/Programmer
> Case Western Reserve University
>
> On Fri, Feb 20, 2015 at 4:53 AM, John W. Nicholson <reddwarf2956 at yahoo.com
> >
> wrote:
>
> > Below is a proof based on A005250(n ) of the OEIS.  Can someone look at
> it
> > and tell me if it true?
> >
> >
> http://math.stackexchange.com/questions/1155523/is-frac-textnext-maximal-textmaximal-2-true
> > If it is true, an edit of A005250 comments is needed.
> >
> > Related:
> >
> >
> https://math.stackexchange.com/questions/831768/under-assumption-that-fracm-n1m-n-le-2-what-is-true?lq=1
> >
> >
> https://math.stackexchange.com/questions/793555/is-there-a-conjecture-with-maximal-prime-gaps?lq=1
> >
> >
> >  John W. Nicholson
> >
> > _______________________________________________
> >
> > Seqfan Mailing list - http://list.seqfan.eu/
> >
>
> _______________________________________________
>
> Seqfan Mailing list - http://list.seqfan.eu/
>
>
>
>
>
> _______________________________________________
>
> Seqfan Mailing list - http://list.seqfan.eu/
>

_______________________________________________

Seqfan Mailing list - http://list.seqfan.eu/