Firstly I missed this one from last month: http://blog.sciencenews.org/2006/03/gauss_prime_tables_1.html (which contains exactly what it says in the URL). But...
And the graphics by AFOOL and the references to Duncan Dumber, the Banana Slug University, are surely all a dead giveaway. ... The date of publication appears...
... Thank you, Jens, for this contribution. I would like to give here some comments : 1. There is effectively an error in this mathworld's page. I am going to...
... The zoo of prime numbers did not accustom us to so much simplicity and absence of special constraints. In spite of similar formal aspects, we are far here...
... Oops, how did I get this muddled? Too many beers when I wrote the response most probably. I meant to say: k^p-(k-1)^p, where p is prime Regards Robert...
Can anyone explain to me in layman's terms what the proof of the Riemann hypothesis would say about the distribution of primes that the Prime Number Theorem...
... As you know, Gauss was the first to establish that the number of primes < x, pi(x), is approximately equal to the logarithmic integral of x, Li(x), for...
Only a comment. If you want to prove a polynomials P(x) is prime, isnt enough to determine the assoiated roots. E.g. P(x)=x^2+2 The number N is P(x) which can...
... First you need to specify the ring in which you're working. You do not do so. One cannot assume Z[x] given that many of the examples we've seen have been...
If you could prove that the convergence upon Li(x) (or even x/log(x)) becomes increasingly such (i.e., the more convergent it becomes, the more convergent it...
Hi All, The new LLR 3.7.0 Version is now available on the GIMPS directory! It contains as a new important feature an efficient primality proving test for the...
... That's great news, Jean! I had a job to find it from your instructions "on the GIMPS directory". Using google, I homed in on the file LLR370.zip at this...
... Yes, indeed! I am sorry for this too vague info... ... revived. I hope (and think) it will be the case! ... I know that! ... possibly... ... entry:- ... ...
... A modification is in order. Any prime sequence which is found in ax^2 + sx + t where s>=2a can be found in the simpler ax^2 + bx + c where b <= a and both...
... Another example: Consider the (already known) prime poly 36x^2 - 810x + 2753 which produces 45 consecutive primes (including negatives) from x=0 to x=44. ...
Has anyone looked at prime chains, parallel to Cunningham chains, of the form 2^n+/-k? Such a chain would be prp for fixed k, with n in the chain increasing by...
It appears likely that every prime can be written as the sum 1a^2 + 2b^2 + 3c^2, for a,b,c >= 0. For instance the prime 61 can be expressed in two such ways: ...
... An interesting line of inquiry, Mark. Just 3 points: 1. For these "Waring-type" problems, the answer as to whether or not a *prime* is representable in a...
mark.underwood@... ("Mark Underwood") wrote:- ... Legendre proved that all positive odd integers can be represented in that form - see e.g. page 3 of:...
... in ... has indeed been proved (several centuries ago). ... Yes, a guru has just presented me with the proof. He has also conjectured that 1a^2 + 2b^2 +...
... If we give up the restriction to *odd* integers, it is interesting to find that some (even) numbers can't be represented. This is fully in accord with the...
Looking at prime number you can see this relationship: Conjeture: "Any prime number can be written as the product of two primes plus or minus the difference...
... Pb+Pa is not the difference between Pa and Pb. ... Ditto. ... Care to disambiguate what you really mean before we invest effort in the wrong one. Did you...
... or ... requierement) ... think ... you ... *Sorry I forget to put " the sum or differences between them" as Phil Carmody said, forgive me for my mistake....
Hello all ! I have a request to all of you, and please don't laugh. What do you think about a project to find a prime 6-tuplet>1100 digits ? My calculate, we...