Good projects never die, they simply reserve the right to take a rest every so often. However, I, and others, think the factorial prime seach has rested quite...
Is the following true? For any number n with less than 20000 digits, if n+1 or n-1 is an easily factorable smooth number, then the primality/non-primality of n...
... The Prime Pages contain all sorts of useful knowledge about prime numbers. For your question, yes, it's true, it can be established with certainty, and...
Dear all: I have posted the question appearing below and there was no single answer. Best Hugo Scolnik A programming language is low level when its programs...
... If you want old contents of a URL then try the Internet Archive: http://www.archive.org http://web.archive.org/web/20040922151554/http://powersum.dhis.org/...
Tuesday, November 01, 2005 8:40 PM [GMT+1=CET], ... Hugo, If t = 0 (mod 11), a + b*t can't be multiple of 11, but in other case yes. By example, for t = 10, a...
... Yes, this and more is true. Any number n can be proven prime/composite "easily", in time O(d^2 * log d * log log d) where d = log n, _if_ enough of the...
The paper located at xxx.arXiv.org/physics/0503159 answers your question. Regards, Gordon physics/0503159 [abs, ps, pdf, other] : Title: Fast Factoring of...
... answer. Dear Hugo, Please see message 17083, where I explained why your satement about "no squares" was wrong, gave a generic formula for generating an ...
... This is equivalent to a statment that for a given prime q the preceding prime p>=2q/3. Supose it is true. Moreover, it is evident (and there is threom...
... From: "Jose Ramón Brox" <ambroxius@...> q/p < 3/2 is a simpler necessary condition that seems to hold if p>7. ... I mean it's a SUFFICIENT condition....
Actually, it doesn't seem that hard: 1/p < 1/q + 1/r q>=p+2 r>=q+2>=p+4 It must be shown that 1/p < 1/(p+2) + 1/(p+4) equivalently (p+2)(p+4)/p < 2p +6 or ...
Milton Brown
miltbrown@...
Nov 3, 2005 6:33 am
17129
... From: "Milton Brown" <miltbrown@...> Actually, it doesn't seem that hard: 1/p < 1/q + 1/r q>=p+2 r>=q+2>=p+4 It must be shown that 1/p < 1/(p+2)...
... From: "Jan van Oort" <glorifier@...> p^2 > mn which is true iff ( m < p AND n < p ) OR ( m = p + a AND n = p - b AND b > a ) ( condition i ) ... ...
... From: "Jose Ramón Brox" <ambroxius@...> Consider b = a-1, then we have m*n = (p+a)(p-b) = (p+a)(p-a+1) = p^2 +p-a(a+1) ... The final equality should...
Gauss-Legendre conjectured that the prime counting function of x is similar to x/ln(x). (Or more specifically that as x approaches infinity: pi(x)/(x/ln(x)) ->...
I don't know if it's proven. It's my own observation. 1/p < 1/q + 1/r is equivalent to: p > qr/(q+r) which means p is greater than the half of the harmonic ...
Can anyone sieve the form N= (2^k)*(2^(k+1) + 1) + 1? Mark R., can you customize Multisieve? Phil C., can you customize ksieve? Can anyone else customize a...
... I think this is implied by the Iwaniec & Pintz finding, namely that there is always a prime between x and x-x^(23/42), for any real number x > 11. The...
I am studying under what cinditions a expression of the form a + b*t generates perfect squares and when those can be written by a number of quadratic...
... b*t generates perfect squares and when those can be written by a number of quadratic polynomials (obviously a must be a quadratic residue of b) ... ...
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.
