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...
... 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...
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 ...
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...
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...
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...
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)...
... From: "Jose Ramón Brox" <ambroxius@...> If they exist, you have several solutions, since your number can have 3 digits in several bases x. [...] ... ...
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...
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...
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...
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...
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...
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...
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...
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>;...
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...
... 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...
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...
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...
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...
... 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...
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...
- 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...
