Hi everyone... I just joined the list. I wrote a little paper on primes recently, offering an informal proof of Brocard's Conjecture. a few notes on twin...
17057
Patrick Capelle
conjectureprime
Oct 7, 2005 3:09 pm
... Hello Jeremy, At the beginning of your proof of Brocard's conjecture,you wrote : "Well if d-b >= k, and a >= b and c >= d, then surely c-a >= k ". Surely...
17058
Jeremy Wood
mickleness
Oct 7, 2005 4:21 pm
Thanks. Hmmm... yeah I was suspect of that one. Back to square one. It still seems like the earlier expression involving pi((p(i+1)^2) really should lend ...
17059
Jeremy Wood
mickleness
Oct 7, 2005 4:31 pm
After work I'll revisit everything again. In the meantime I kept the file online, but put red notes around the incorrect section. But the paper still points...
17060
Cletus Emmanuel
cemmanu
Oct 7, 2005 5:09 pm
Here is a new Kynea Prime.... (2^281621+1)^2-2. This number has 169553 digits. Steven, please update the Carol/Kynea page. Thank you.... ... Yahoo! for Good...
17061
Jeremy Wood
mickleness
Oct 7, 2005 5:36 pm
Sigh. Nevermind... taking the link down. The other expression is also flawed... it fails badly when i exceeds 35 (that is, (p(i))^2=22201). Back to the...
17065
Gordon Chalmers
gordon_as_nu...
Oct 11, 2005 2:39 pm
I have a question, maybe someone could answer. Given a number and a base expansion in base x, N=a x^2 + b x + c , with c known, is there a (convenient)...
17066
Jose Ramón Brox
ambroxius
Oct 11, 2005 11:20 pm
... From: "Gordon Chalmers" <gordon_as_number@...> Given a number and a base expansion in base x, N=a x^2 + b x + c , with c known, is there a...
17067
Jose Ramón Brox
ambroxius
Oct 11, 2005 11:52 pm
... From: "Jose Ramón Brox" <ambroxius@...> If they exist, you have several solutions, since your number can have 3 digits in several bases x. [...] ... ...
17068
Jose Ramón Brox
ambroxius
Oct 12, 2005 12:35 am
... From: "gordon_as_number" <gordon_as_number@...> To: "Jose Ramón Brox" <ambroxius@...> What I intend is an algorithm for finding a solution to x...
17069
henridelille
Oct 12, 2005 11:11 am
Dear all, I invite you to visit my website http://henri.voici.org It is dedicated to RH (in french) Opinions and advises are welcome. Sincerely...
17070
Thomas Hadley
kctom99
Oct 12, 2005 12:07 pm
I will be out of the office starting 10/12/2005 and will not return until 10/17/2005. I will respond to your message when I return. [Non-text portions of this...
17072
kradenken
Oct 12, 2005 12:55 pm
All, I have removed the RSA etc thread and the originator has removed himself from the group. I moderated him after the initial post and rejected a subsequent...
17074
jan harm van der walt
imnotjan
Oct 14, 2005 9:08 am
About a year and a half ago Louis de Branges put a proposes proof of the Riemann Hypothesis on his website and it was immediately dismissed, without a second...
17075
bhelmes_1
Oct 16, 2005 8:42 pm
A beautifull evening, i would like to present you a square sieve algorithm to sieve prime numbers. The algorithm is more efficent than the sieve of...
17076
Phil Carmody
thefatphil
Oct 17, 2005 11:07 am
From: "bhelmes_1" <bhelmes@...> ... This is pretty much the same as any sieve along a polynomial. I suspect it will fail for some polynomials, as you simply...
17077
Jan van Oort
sanctushilarius
Oct 17, 2005 1:13 pm
Moreover, the base of the algorithm is *only* a conjecture. It might pretty well fail for large k, even if this is counterintuitive. ... -- Non sunt...
17078
Jens Kruse Andersen
jkand71
Oct 20, 2005 1:56 am
Congratulations to Richard Hassler and Seventeen Or Bust for finding another one - in a double check: http://www.seventeenorbust.com That's 9 of 17. Halfway...
17079
Phil Carmody
thefatphil
Oct 20, 2005 10:25 am
From: "Jens Kruse Andersen" <jens.k.a@...> ... This is indeed great news for the project. (It's a shame it's not a million-digiter - *so* close,...
17080
Christ van Willegen
cvwillegen
Oct 20, 2005 1:36 pm
Hi, call me stupid, but for the life of me I can't seem to find if there's a program for sieving k*2^n-1 for fixed k... I expect that Proth can handle this...
17081
John Dilick
johndilick
Oct 20, 2005 7:05 pm
I believe NewPGen can sieve on k*2^n+-1 for fixed k or fixed n. ... From: "Christ van Willegen" <cvwillegen@...> To: <primenumbers@yahoogroups.com>;...
17082
scolnik (fibertel)
scolnik2003
Oct 20, 2005 7:28 pm
I am interested in knowing proven results regarding the possibility of generating perfect squares with expressions like a + bt 1) it is obvious that not always...
17083
elevensmooth
Oct 20, 2005 11:15 pm
... The parenthesized expression only need be 11 times a square. This happens whenever t is of the form 510510*u^2 + 4642*u + 10, plus several other forms. I...
17084
gordon_as_number
gordon_as_nu...
Oct 21, 2005 2:08 am
Here is just a comment. It is possible to compile a data image as a number, as in xxx.arXiv.org/physics/0510148. That number, when factored in primes, can be...
17085
gordon_as_number
gordon_as_nu...
Oct 21, 2005 2:12 am
Here is just a comment. It is possible to compile a data image as a number, as in xxx.arXiv.org/physics/0510148. That number, when factored in primes, can be...
17086
andrew_j_walker
Oct 21, 2005 2:46 am
I've got a comment, stop wasting our time with such nonsense! Andrew...
17087
Jan van Oort
sanctushilarius
Oct 21, 2005 9:10 am
At my former employer, a French software outfit, we already had that idea. In a modified way, we incorporated it into a piece of software that compresses...
17088
thefatphil
Oct 21, 2005 9:30 am
... Finite images (about which I assume you speak) are just countable data, so can be mapped to and from N. ... Not my kind of place. Better than arxiv's GM...
17089
Jan van Oort
sanctushilarius
Oct 21, 2005 10:03 am
Makes me think back of that announcement, some years ago, by a US corporation that it was working on a data compression algorithm that would yield the same...
17090
Jacques Tramu
echolalie
Oct 21, 2005 12:10 pm
- I have designed a new (i think it is new) and quite simple compression algorithm which can compress a string of ANY length into a string of 666 bytes (using...
