I look on least k such that k*j^n-1 is prime for some j I define Sk sum of k(n) from n=1 to N and Sn sum of n from n=1 to N I define Ak=Sk/Sn , the average...
Hi alldo you know wher's mvoznyy?Why his web page is not more updated?http://home.oise.utoronto.ca/~mvoznyy/repunit.htmBye and thanks.Giovanni gio22 [Non-text...
That would be awesome. Thanks, Shane. Really to lear the system, as much as take short-cuts in all fairness. Sent from my Verizon Wireless BlackBerry ... ...
Hi Chris, Below is a format sequence from Mathematica for two "huge" proven "Prime Generalized Fermat numbers of the form 6^2^n+1. I tried to submit them...
You're saying absolute "P" values vary like fingerprints? Each user has them, they're all unique yet still the same shape. Since we know we're looking for...
Subjective middle ground is crucial for progress. Define what is useful to the form, in terms of its (the software) application. Instead of just a 1-2 sieve,...
Respectfully, I ask you to refrain from using that term. That is my email address and name, however I have not even able to login to the site, for 36 hours...
What if you turned the paradigm on its head and made it more about testing specific N or P exponents or combinations. That way you could rate the probability...
Instead of a sieve consider an overall system which creates a prime vacuum. Instead of chasing infinite factors, approach infinite factors via equally...
Bill, What you are seeing is an echo of Zeroes of the Zeta function. Your software is working fine, I would conjecture. I have computed similar empty sets in...
What happens if you get rid of the 3.5 and the beta? Sent from my Verizon Wireless BlackBerry ... From: "Shane" <divineprime@...> Date: Tue, 27 Jan 2009...
... Damned, this bug is still present in the latest version: td(p)={ for( k=1,9!, Mod(2,2*k*p+1)^p==1 & error("2kp+1 divides Mp for k=",k)) } td( 173242173089...
http://www.newmedici.com/2009/01/31/primediscovery/ Sent from my Verizon Wireless BlackBerry ... From: "David Broadhurst" <d.broadhurst@...> Date: Sat,...
Mr. Caldwell, Care to comment on Mr. Broadhursts comments on my proof (please see below)? Suppression of speech has no place in academics or technology. If you...
Additionally, Mr. Broadhurst's brilliant work proves 3 serious bugs in Pari-GP.... Again, I say to you Mr. Caldwell, withdraw your comments. Moreover,...
<Is there anything useful in the below archive? If so please post on http://primes.utm.edu and credit "Ro1126" or "Musatov" (and yourself!) as co-prover....
Man, David, you are a genius! Thank God, someone understands what I am trying to do! I enjoyed the styling and riddles on your website. Sent from my Verizon...
Professor Caldwell, with much due respect for your achievements, you may read about it in my paper "On The Nature of Primality", though I shant be sure it will...
... factors. Maybe we should remind Mr. Hasler that all factors of a composite Mersenne number are 1 mod(exp) so we need to test very few candidate factors to ...
Hi all.I hope all doing great. Is there anybody using pari in C or anybody know how to include pari.h in our C program. If include #include"pari.h",it throws...
Prabhakar Balakrishna
prabhakar.balakrishna...
Mar 10, 2009 9:20 pm
9492
Hi, I have the following (new, I think) conjecture about the Mersenne prime numbers, where: $M_q = 2^q - 1$ with $q$ prime. I've checked it up to q = 110503...