I found and corrected more errors w/the predicting Ii(x) function... and the last and best calculation for x= 1000 was... .... . .. .. .. .. . ...... 7918.5...
... to ... Using PFGW, I have found all those with < 10000 digits:- 2^2-2 prime by PFGW 2^3-3 prime by PFGW 2^9-9 prime by PFGW 2^13-13 prime by PFGW ...
... That's easy: 2 times the largest known prime. Check out mersenne.org among other sites if you want to know about that. Hm, no, I take it back. Maybe...
... Well, they aren't loons as they are familiar with prior work in the area; but I can't help thinking that a unary function which is defined in terms of two...
... Conjecture ... [I typed a reply on the website about 2 hours ago but must have hit the wrong key as it seems to have disappeared into the ether without ...
... After briefly looking at later parts, I guess misdefined. When defining lambda(n), they probably assume N is an already given constant (the number they...
... If you mean the largest n for which Goldbach is known to hold for all smaller values, then http://www.ieeta.pt/~tos/goldbach.html says it's currently n =...
I tried to submit the PRP 6*1*(2^216091 - 1 - 1) + 2^216091 - 1 + 2^(2*149), (digits: 65051), which is of the form p + *n*(p -1), but the submission was...
Peter Lesala
plesala@...
Mar 3, 2007 1:01 pm
18786
... To whom did you try to submit it? You should't submit PRPs to Professor Caldwell's top-5000 list of proven primes. And it's way too small anyway. Phil ()...
There is the Henri & Renaud Lifchitz page on the Prime Pages which accepts PRP records above 10000 digits. I hope I am right. Peter. ... From: Phil Carmody To:...
Peter Lesala
plesala@...
Mar 4, 2007 3:47 pm
18788
... do I get it right? You have certainly chosen an odd way to express your probable-prime (PRP), which is certainly not "of the form p + *n*(p -1)", whatever ...
Hi, The following comments were published on the On-Line Encyclopedia of Integer Sequences : A000040 : prime numbers There is a unique decomposition of the...
Thanks for approving my membership. I would like to enter the discussion of the group with the content of my website www.naturalmodeli.com There are a couple...
Below is a little program for factoring prime pairs. It should be noted that it is quite slow and doesn't always work as it sometimes get's stuck in cycle....
Dear primenumbers Group, Your silence is deafening. I am not a professional mathematician (just an amateur) but I think that my work deserves comments. The...
... I personally found next to nothing interesting in your post. If I were an editor of OEIS, I'd have had serious reservations about your submissions. ... No...
So,we must know p(n+1) to know p(n) and its unique decomposition. Est-ce que vous pensez que cette double et nécessaire connaissance, apportera vraiment un...
... What's the size of Pn#? (See http://primes.utm.edu/glossary/page.php?sort=Primorial ) Therefore what's the expected density of primes around an arbitrary...
Dear Robin and primenumbers group, Yes it is necessary to know p(n+1) to have the decomposition. I do not propose magic formula. The magic formula would be to...
Proof: You don't need Li, PNT is enough. We start with a form of PNT: sum(ln p)(p<=pn) ~ pn. ==> lim(n->inf)(sum(ln p)(p<=pn) / pn) = 1 ==> lim(n->inf)(pn /...
Let be product = 2/3 * 7/5 * 11/13 * 19/17 * ... * p(n)/p(n+1) * p(n+3)/p(n+2) * ... I thought, product would be = 1, but obviously it is not. After 2*10^7 ...
... http://www.research.att.com/~njas/sequences/A126933 Unlike many sequences forwarded to this list, it's not meaningless. However, it's wrong instead; which...
I look in a different way at primes then members here do. I am not good in math, but thats not the reason. Its interesting to look at primes as a non...
I apologize for the naivete of my question, but I am not a mathematician. Having read a few books on Riemann and prime numbers, I have this question: Does...
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.
