One should be able to show that there is a prime congruent to 1 modulo 4 between n and 2n for every sufficiently large n. Does anyone know a reference for this with an explicit bound on how large n needs to be? I would, of course, prefer it to be small.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.