Go Back > Great Internet Mersenne Prime Search > Math

Thread Tools
Old 2013-06-01, 12:42   #1
literka's Avatar
Mar 2010

26×3 Posts
Default Bertrand's Theorem for Arithmetic Progression

Recently I have proved the following theorem:

Let n>1. In the interval [n+1,4n+1] there is a prime number of the form 4k+1.

I already uploaded the proof. It is on the page of Literka

Some time ago I asked about this theorem on this forum. Silverman suggested computation but I don't think this would give small constant as I achieved now.
literka is offline   Reply With Quote

Thread Tools

Similar Threads
Thread Thread Starter Forum Replies Last Post
Exponent Progression storm5510 Information & Answers 15 2017-07-26 18:02
Basic Number Theory 15: Lagrange's theorem, cyclic groups and modular arithmetic Nick Number Theory Discussion Group 0 2017-01-07 13:15
nth prime number in an arithmetic progression Unregistered Information & Answers 1 2010-04-04 22:06
Arithmetic and Polynomial Progression of Primes? drake2 Math 13 2006-10-10 00:43
Bertrand's Postulate masser Math 1 2003-07-30 03:07

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

Sat Dec 4 13:19:21 UTC 2021 up 134 days, 7:48, 0 users, load averages: 1.66, 1.19, 1.10

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.