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

[Charles Greathouse]

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/
>