

A174220


On the Infinitude of Regular Primes.


0



1, 2, 2, 4, 3, 8, 2, 6, 8, 5, 22, 15, 7, 10, 23, 21, 6, 26, 19, 7, 34, 18, 33, 38, 27, 18, 27, 12, 30, 95, 29, 59, 14, 79, 11, 59, 58, 37, 61, 59, 23, 96, 22, 43, 19, 131, 143, 50, 31, 55, 84, 30, 134, 86, 88, 77, 24, 87, 60, 28, 162, 227, 73, 37, 55, 248, 104, 174, 39, 65, 104, 143
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

If you graph a(n) versus n, an interesting pattern with randomlooking fluctuations emerges.
As you go farther along the naxis, greater are the number of Regular primes, on average, within each interval obtained.
The smallest count of 1 occurs only once at the very beginning.
I suspect all numbers in this sequence are > 0.
If one could prove that there is at least 1 Regular prime within each interval, this would imply that Regular primes are infinite.
This would be very significant since "Kummer was able to prove Fermat's Last Theorem in the case where the exponent is a regular prime, a result that prior to Wiles's recent work was the only demonstration of Fermat's Last Theorem for a large class of exponents." (see D. Jao).


LINKS

Table of n, a(n) for n=1..72.
C. K. Caldwell, The Prime Glossary, Regular prime
D. Jao, PlanetMath.Org, Regular prime


FORMULA

Used the table of irregular primes by T.D. Noe in A000928 to extract a longer list of regular primes from a list of odd primes.


EXAMPLE

Take any pair of consecutive primes. Say the first (2,3). Square the first term, and then take the product of the two to obtain an interval (4,6). Within this interval, there is 1 Regular prime, which is 5. Hence the very first term of the sequence above is 1. Similarly, the second term, 2, refers to the two Regular primes 11 and 13.


CROSSREFS

Cf. A007703, A000928.
Sequence in context: A283502 A324756 A324754 * A048675 A162474 A285330
Adjacent sequences: A174217 A174218 A174219 * A174221 A174222 A174223


KEYWORD

nonn,uned


AUTHOR

Jaspal Singh Cheema, Mar 12 2010


STATUS

approved



