Not much action on two of the conjectures, and time grows short, so I will do the obvious and increase the purse. Maybe even DB himself will swoop out of the...
Hello prime fans, BTW, I look for a 13 tuplet. Today I have luck and found it :-) The lucky bonus was: 14th condition also true. The numbers have 46 digits and...
Before asking my question let me specify my credentials: high school maths. (so please spare me if the question is too easy/too absurd) Q. What is the...
Here goes a nice problem... IT would be nice if someone can give me links/references where I can find more details about this problem. Given a prime P its easy...
Let x1, x2, . . ., xm, be a list of positive integers in increasing order. The following algorithm is proposed for testing if any of the x1,x2,. . . xm are...
Who has worked on developing a sieve algorithm to find primes for which all the integers in a pre-specified set are modulus square residues? To find for what...
I believe that it is possible to use the first conjecture from CONTEST++ as a starting point for a new factoring method, and that even if it is found to be not...
I offer a $51 prize to the first person who can submit a verifiable counterexample by New Year's day either for the following conjectures. (x,A,B,c,k,f :...
I offer a $50 prize to the first person who can submit a verifiable counterexample or proof by New Year's day for the following primality conjecture: ...
1. number of prime powers Posted by: "Werner D. Sand" Theo.3.1415@... theo2357 Date: Tue Dec 18, 2007 4:00 pm ((PST)) Who knows a good approximate formula...
Here is a simple theorem related to twin primes. I wonder how many times it's been replicated. If the positive integer d cannot be equal to abs( [ (3* m + 1)...
Who knows a good approximate formula for the number of prime powers up to x (without simple prime numbers): N = sum(1)(p^n <= x), p prime, n>1 ? Suggestion:...
http://www.mathreference.com/num,inf.html impressed me with this concise proof that there are Infinitely Many Primes Suppose there is a finite list of primes. ...
Suppose that z is a composite odd integer for which we wish to know factors z = x y. Set x = 2^0 + 2^c2 + 2^c3 + . . . + 2^cm Notice that the subscripts...
I discovered that certain primes have an elegant property. For convenience, call this type of prime Q. I think I can best explain what I mean by the following...
Hi all, It is time to show that prime numbers are related. No kidding, string sequences of prime numbers do exist and they are related. See an example and...
Take a decimal r belonging to R. Es. 13.77, Ok now raise the square and to do so using a linear combination: (13.77) ^ 2 = 13 ^ 2 + 13 * 0.77 + 13.77 * 0.77 /...
Hi All, The new version, 3.7.1c of the LLR program is now available. The zipped binaries can be downloaded from the GIMPS site : http://www.mersenne.org/gimps/...
Hi, I have just completed a nine page document (MS Word document) proving non-existence of odd perfect numbers. I would like to mail the document to this group...
Hi, all Some weeks ago I changed the motherboard of a computer Pentium 4 3.20Ghz, 1,00 GB RAM, with Windows XP 2002 SP2. Using Proth.exe, after a while I get...
I suppose... if GCD(n! , n + 1) = 1 if GCD(n! , n + 1 ) != 1 also (n+1)+1 so I do GCD(n!, n+2) = 1? if yes I do the sum n! + n+2 also I do another GCD with n+3...
Hmmmmm... 3 | 1562533*2^6250134-1, but what for 1562533*2^6250134+1 ? At first sight, this Cullen candidate has no small divisor... Mr Karsten Haesslich, I...
Hi, Group, et al. the famous Fermat function: F(x) = 2^(2^x) +1 let x be from the set of whole numbers: Does F(x) have Q= 2*floor(sqrt((x+3)/2)) number of...
Hi all! I am using Proth.exe version 7.1 to search for Keller primes. I am a little concerned about the ranges of numbers I'm testing though. Will Proth.exe...
PQ? Cito un passo del discorso di H.W. Lenstra jr. al Congresso Internazionale di Matematica, tenutosi a Berkley (USA) nel 1986: "Supponiamo di avere...
