Some trivia: As it turns out, for a tuple of the form x-32, x-16, x-8, x-4, x-2, x+2, x+4, x+8, x+16, x+32 x must indeed have a factor of 3,5,7 and 11 And for...
Hello Cletus! ... This conjecture doesn't seem to be valid. For example, order of 68 modulo 113 is 112, just like order of 68 modulo 113^2 (and even modulo...
... I have computed the 4 smallest x such that these 14 are all primes: x +/- 2, 4, 8, 16, 32, 64, 128 A PrimeForm/GW input file with x values in {. . . .} : ...
Hello, ... Thankyou for providing counter examples,a special case of this conjecture is proved to be true as follows: If p is an odd prime and p(doesnot divide...
When making an generalized Woodall prime record history i noticed the prime 187·2^47877-1 in Chris' Database. (http://primes.utm.edu/primes/page.php?id=13129)...
... I get this often; folks sometimes even object that their own primes are not generalized Woodalls. I'll add a note to the top-20 page and maybe the...
Hi all After the symmetrical k +/- 2^n tuple I thought I would try a symmetrical k +/- 2^n*3^m tuple to achieve a somewhat greater density. That is, k +/-...
After doing some reading on the subject I am now firmly convinced that prime constellations with densities exceeding that of the early primes do exist. And...
The only change is to add x^y-y^x sieve. Previous to this change x<y, now x>y to ensure that x^y-y^x > 0 except when x=2 and y=3. You can download it from...
... The smallest admissable 168-tuplet is 1033 wide according to an exhaustive search by Thomas J. Engelsma: http://www.opertech.com/primes/k-tuples.html His...
I have been looking at the following chains of GFN. And would be interested if anybody else has lloked at these and if a longer chain is known or could be...
... <garychaffey2@y...> ... chain is ... sequence ... Hi Gary, I've checked prime factors up to 23, and 13 is the only one which gets in the way of a long...
... Then also look at http://www.primepuzzles.net/puzzles/puzz_137.htm It says Yves Gallot found the smallest chain of 6 before Mike: 7072833120^1+1 ...
... Thx for tip, Jens. I was unaware of Yves's work, but it seems google is indeed getting quite "intelligent" these days, if it can respond to a single...
Found a good news article at http://www.nist.gov/public_affairs/releases/fourier.htm part of which is below. The whole article goes into more detail regarding...
hi, Shoup presents us with a polynomial time factoring algorithm using quantum computers. Its still not known if such a powerful computer can be made but...
All twin primes after (29,31) are built as 30*k + (11,13) or +(17,19) or +(29,31) Attached is a table for k from 1 to 20 showing their construction. The...
Milton Brown
miltbrown@...
Jun 8, 2005 10:12 pm
16750
... Isn't that the same thing as saying that they are either 11 & 13, or 17 & 19, or 29 & 31 mod 30?...
Is there any method for predecting exact the next one after any given prime(may be integer.If so then notify . also m new in your group there fore plz help me....
I am happy to report the finding of record CC4 today: 953477584*5501#-1 Cunningham chain (8p+7) (2355 digits) 476738792*5501#-1 Cunningham chain (4p+3) (2354...
Here are some interesting Twin Primes greater than one million (first of pair listed): 1210019 1210037 1210049 Consider the first one: (30*1210019-1,...
Milton Brown
miltbrown@...
Jun 10, 2005 10:04 am
16758
All twin primes can be constructed by 30*P +(11,13) or +(17,19) or +(29,31) or 30*P + 30f +(11,13) or +(17,19) or +(29,31) where P is a prime and f is a...
Having problems with message search?
Fill out this form to ensure your group is one of the first to be migrated to the new message search system.
