On 9/25/2013 7:03 AM, firstname.lastname@example.org
> question on (un)boundedness
> Posted by: "James Merickel"moralforce120@... moralforce120
> Date: Tue Sep 24, 2013 11:17 am ((PDT))
> Dear group members:
> Does anybody know of anything solid to point to indicating whether or not there is a bound on the smallest N(b) for which there is no prime between b^N(b)-b and b^N(b)? I imagine I may be able to address this heuristically myself without much bother (and the answer is there is no bound, but of course until I actually try I won't be too sure), but I wonder if there is anything stronger than heuristics on this or it's 'the usual for such number theory questions'.
It is not an easy question to answer.
(2^2-2,2^2) = (2,4)
(2^3-2,2^3) = (6,8)
(2^4-2,2^4) = (14,16) N(2) = 4
(3^2-3,3^2) = (6,9)
(3^3-3,3^3) = (24,27) N(3) = 3
(4^2-4,4^2) = (12,16)
(4^3-4,4^3) = (60,64)
(4^4-4,4^4) = (252,256) N(4) = 4