Group... If I wanted to prove that some number N is not equal to the form a^b, then wouldn't I have to start by finding the square root, the third root, the...
... Hash: SHA1 ... Sure, that's a possibility. Not the fastest either, but since you're using AKS, you don't care the least about speed after all. ... Let's...
Décio Luiz Gazzoni...
decio@...
May 1, 2004 3:41 pm
14814
... I do believe that the proposed method is the fastest known (except that you only need to check roots of prime order of course). But I am willing to see...
Hello you can see my number theory web pages; there are news. http://personal.telefonica.terra.es/web/smruiz/ In Bibliografia you can see 18 articles in...
Group. When I use about an hour of computer time to prove that 999999999999989 is prime and then see it done in milliseconds using a more modern computer and...
... Hash: SHA1 ... Asymptotically, perhaps. However, there are faster methods in practice. For instance, to detect whether an integer is a square, one can...
Décio Luiz Gazzoni...
decio@...
May 1, 2004 8:03 pm
14818
... Correct as far as it goes, though yuou can optimize by only testing primeth roots because if you've already tested for a p-th root and the test failed, you...
Paul Leyland
pleyland@...
May 2, 2004 5:52 pm
14819
... Hash: SHA1 Is there a factoring algorithm which depends on the size of the factors (and not the integer being factored itself), and is faster than trial...
Décio Luiz Gazzoni...
decio@...
May 3, 2004 4:19 am
14820
Hello Group... Can someone prove or disprove? phi( (p^2) ) = [phi(p)]^2 + phi(p) iff "p" is prime, and phi(...) is the totient function. Or is this equation...
Pollard' rho algorithm is not deterministic, It is probabilistic and could fail even with small numbers. It should not be part of discussions about "proven...
miltbrown@...
May 3, 2004 10:37 pm
14824
phi(p^2) = p*( p-1)......(1) phi(p)=p-1..........(2) Using 1 and 2 in phi( (p^2) ) = [phi(p)]^2 + phi(p) we get p*(p-1) = (p-1)^2 + p-1 I think the result is...
... Sigh. That's what the original poster said. I won't claim to be an expert but I'm not aware of any algorithm that fits the bill. X iterations of Rho, P+-1...
... that ... lower ... p+-1 for a given pair of B1 and B2 will have a lower bound, as there will be some smallest prime that doesn't fit the smoothness...
... (Remark: almost all factoring algorithms have a superpolynomial dependency on the size of N, the integer being factored. I can't, off hand, think of any...
Paul Leyland
pleyland@...
May 4, 2004 8:37 am
14828
Please try RMA, found here: http://www.15k.org/rma/ Download or open RMA.rar, to intall setup. Feedback needed. Shane F. TTn...
... RMA is a software that controls the existing LLR PRP, and NewPGen softwares. For new users they are included with RMA package. This speed increase(allbeit...
Harvey Dubner has found the smallest known CPAP-7 with a program by me: 149143516628800164802930723713131 + 210n, n=0..6 The old record from 1997 was 37 digits...
... I have not heard of Bernstein's product-tree before but it sounds like my TreeSieve: http://groups.yahoo.com/group/primeform/message/4231 The GMP based...
The question is how it can prove a lower bound for the factors of a number. I imagine this would be easy for numbers such as repunits where factors are...
Except n = 17, 19, 46, 58, 64, 67, 85 there is always a couple of prime numbers equidistant from n^2 + n, enclosed between n^2 and (n+1)^2 . Eccetto n = 17,...
Have the k-tuples web page back up http://www.opertech.com/primes/k-tuples.html Lost server link -- main page is back up and will reload individual pages this...
Is the following intuition of mine, in the final sentence of the following paragraph, determinable by trivial mathematical means? When a cubic structure is...
... I think that the fact that a^3 + b^3 <> c^3 for integers makes it seem reasonable to me that this assertion is true. I can't however, off the top of my...
Hello, This email message is a notification to let you know that a file has been uploaded to the Files area of the primenumbers group. File :...
primenumbers@yahoogro...
May 8, 2004 3:11 pm
14840
Hello, Group I have uploaded a .txt file named "formula" into the Bouris-Garcia- Ruiz Folder... take a look and try to prove it, if possible. It con- cerns my...
Except n = 17, 19, 46, 58, 64, 67, 85, 367(thanks David B.), is there always a couple of prime numbers equidistant from n^2 + n, enclosed between n^2 and...
You might be interested in the following Analytic Number Theory Conference held August 17-19, 2004. More details at: http://thor.prohosting.com/badih...
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.
