Hi everyone...I am John Vincent from the Philippines, I am looking for some number theory conjectures over the internet and this site was one of the results I...
19780
Phil Carmody
thefatphil
Jan 2, 2009 11:51 am
... I.e. for every natural number k>=4, 2k is the sum of 2 primes. This is just a reformulation of Goldbach's conjecture. High-performing computers will...
19781
Kermit Rose
kermit1941
Jan 2, 2009 1:00 pm
Factor Theorem and Conjecture Let z be a positive odd integer. Define n_z and m_z by 2** n_z < z < 2** (n_z + 1) 2** m_z < sqrt(z) < 2** (m_z + 1) For k =...
19782
Kermit Rose
kermit1941
Jan 3, 2009 6:28 pm
Factor Theorem Let z be an odd positive integer. Let 2**n be the largest power of 2 < z. Let 1 + 2 d1 + 2**2 d2 + 2**3 d3 + . . . + 2**n d_n be the base 2...
19783
Kermit Rose
kermit1941
Jan 5, 2009 4:30 pm
I am working on programming this algorithm in python. I expect to be able to prove that this algorithm works and is a polynomial time algorithm by factoring ...
19784
Mark Underwood
marku606
Jan 6, 2009 8:28 pm
... Good luck Kermit. At least, the proof will be in the pudding. I hope you are rewarded for your work. I found out about python when I was exploring ways to...
19785
Ken Davis
kradenken
Jan 7, 2009 1:49 am
Hi All, Last year I completed an unsuccessful search for a 7725 digit triplet (CPAP3). I did 2 searches using numbers of the form ...
19786
Alex Petty
hdcalex
Jan 7, 2009 1:50 am
it appears that the RSA challenge is no longer open. is this true? -alex ... -- alex petty alexander.petty@... skype: alex.petty skypein:...
19787
Ken Davis
kradenken
Jan 7, 2009 5:58 am
Hi all, Jens Anderson, in a personal email, kindly pointed out a number of errors in my original post so here it is again corrected. "Last year I completed an...
19788
Phil Carmody
thefatphil
Jan 7, 2009 6:01 am
... Given that that's a stand-alone question, why did you not trim the couple of dozens of lines of cruft that followed it and was no longer required for...
19789
jarek372000
Jan 8, 2009 5:11 pm
Here is the new AP19 with the smallest known start. 1358498353 + 16584560*19#*n, n=0,..,18 (BOINC@Poland, Jaroslaw Wroblewski) The discovery was made by a...
19790
warren_d_smith31
warren_d_smi...
Jan 9, 2009 3:17 am
Greetings prime-ologists. I just wrote a paper "Concise Prime-Rich Polynomials and Proth sequences". It for the moment is available at this URL ...
19791
Alex Petty
hdcalex
Jan 9, 2009 5:02 am
My colleague has settled the long outstanding question of Reimann's Hypothesis and shown conclusively that all non trivial zeros of the zeta function do indeed...
19792
Alan Eliasen
aeliasen
Jan 9, 2009 10:20 am
... I don't want to spend a lot of time on this, so I'll be brief and point out a couple major places where it's incorrect. The paper claims some amazing...
19793
Sebastian Martin Ruiz
s_m_ruiz
Jan 9, 2009 11:46 pm
Hello all: Let: F[n]= Sum[n - i*j, {i, 1, n}, {j, 1, n/i}] n is prime if and only if: F[n + 1] - 2F[n] + F[n - 1]=2 More: F[n + 1] - 2F[n] + F[n - 1]=d(n) ...
19794
Olden
alden_parent
Jan 10, 2009 6:03 am
Prime numbers are derivatives of a " progenitor formula " that is also an exponential function! [Non-text portions of this message have been removed]...
19795
Jeffrey N Cook
antidyne
Jan 11, 2009 8:15 am
Alan, Yesterday I accidently replied to only you. I was wondering if you could repost what I wrote to the group as well? Thanks, Jeff...
19798
Kermit Rose
kermit1941
Jan 12, 2009 4:45 am
I have been a piece of broken pottery. A kind generous sensitive person has pointed out to me the flaw in my supposed polynomial time factoring algorithm. At...
19799
Billy Hamathi
hamathib
Jan 12, 2009 4:55 am
Welcome to my club!!! ... From: Kermit Rose <kermit@...> Subject: [PrimeNumbers] Broken Pottery To: primenumbers@yahoogroups.com Date: Monday, 12...
19800
David Broadhurst
djbroadhurst
Jan 12, 2009 9:11 am
... Certainly not. I believe that the sum exceeds 1.6366. To see this, do the sum over primes p <= N explicitly and then use the prime number theorem to...
19801
David Broadhurst
djbroadhurst
Jan 12, 2009 12:13 pm
... Steve Finch gives the value ... in http://tinyurl.com/9x29z2 David Broadhurst ... The Open University is incorporated by Royal Charter (RC 000391), an...
... And http://www.research.att.com/~njas/sequences/A137245 of course. Best, Andrey...
19804
Alan Eliasen
aeliasen
Jan 12, 2009 9:06 pm
By the author's request, I'm forwarding the reply (without comment) from Jeffrey Cook, the author of the Riemann Hypothesis paper I discussed earlier. ... ...
19805
miltbrown@...
Jan 13, 2009 11:30 am
10^35257-601269 and 10^35257+13561 produce a prime number GAP of 614830. Milton L. Brown...
19806
Sam Shahrokhi
sam_jenetik26
Jan 15, 2009 9:13 am
Fermatt's last theorem is a huge corollary of the rationality of elliptic curves over rational numbers where states every elliptic curve over rational numbers...
19807
Billy Hamathi
hamathib
Jan 15, 2009 1:54 pm
A light moment for the team, please I know I am wrong but I am just having fun. Â OK, observe that: Â a) 0.111... = 1/9 = 1/10 + 1/100 + 1/1000 + ... Â Â ...
19808
Chris Caldwell
primemogul
Jan 15, 2009 2:08 pm
... Yes. The decimal representation of "terminating" rationals are not unique. This has to be adjusted for when doing things like using Cantor's diagonal...
19809
aldrich617
Jan 15, 2009 3:31 pm
As per request, at the bottom of this message is a sample of equations that can be derived from Dr. B's Fabulous Fibonacci Formula. I have never seen this...
19810
jbrennen
Jan 15, 2009 11:03 pm
Just a silly little thought I had... It is almost certainly possible to find a positive non-integer A > 1 such that for all integer n, floor(A^n) is not prime....
