... Hash: SHA1 I see. Thank you Paul, as well as Décio for saving me countless hours of unnecessarily wasted effort. As I understand it then, the real problem...
Greetings, I have updated (finally!) the tables at the Proth Prime site (http://www.prothsearch.net/index.html). Sorry for the delay. Thank you for the support...
Hello everyone, I was wondering if there was a way to use power residues to factor numbers. Let me give an example: Lets say we happen to know that: 2^23 ==...
Sorry, what is the purpose of n1 = a1 ^ 1 and a1 = n1 ^ 1 ? Aren't these just n1 = a1 and a1 = n1 ? It would be helpful to explain these, or have...
Milton Brown
miltbrown@...
Jun 2, 2004 10:33 pm
14933
... No they are not. When he uses the ^ operator, he means the xor (exclusive or) operator. If you don't know about the xor operator, here's a quick tut: 0^0...
... Hash: SHA1 Justin asked me for a real life example of how this technique can be used to find factors, so at the risk of boring everyone else, I thought I'd...
... Actually one can solve the system eqn with Maple (in two ways): First way: (note in this case one has free variables b1,b2,c1,c4 so we allow them to be...
It has been suggested to me that Chebyshev (I am not sure which one- apparently there are many)has a theory that says something like there is always one prime...
In a message dated 04/06/04 05:54:15 GMT Daylight Time, ... I think you must be thinking of Bertrand's postulate, which "is that, for every n > 3, there is a...
... Hash: SHA1 Very perceptive Edwin. I didn't know we had any Maple users in this group. You are correct that if you copy/paste the following lines into a...
Hi Ron, R> Justin asked me for a real life example of how this technique R> can be used to find factors, so at the risk of boring everyone R> else, I thought...
Hi all, it was really time to update my list of Cunningham Chain records which you can find in the file Cunningham_Chain_records.txt located in "Files > Prime...
Hi, Prime numbers written out in english as such two, three, four, seven, ten, eleven, twelve, fourteen, seventeen, ... Are blind primes because the have no...
Hi cino, ch> Prime numbers written out in english as such ch> two, three, four, seven, ten, eleven, twelve, fourteen, seventeen, ... ch> Are blind primes...
It depends on the English rules for writing a large number. If one may use thousand thousand instead of a million then blind primes are infinite. [Non-text...
... numbers. ... From this we know that 2^48 == 1 mod 1071 and I believe that the vast majority of the time, once you know the non-trivial order of any number...
... Yeah, it looks like this method will not work when the numbers is of the form ((2^prime) - 1). However, this may be the only class of numbers that this...
... As I implied, any strong base 2 psuedoprime will do. So from http://www.research.att.com/cgi- bin/access.cgi/as/njas/sequences/eisA.cgi?Anum=A001262 ...
Residues for the Powers of Prime numbers are discussed in detail in "Elementary Number Theory" by Jones and Jones with a separate section on page 135. You...
Milton Brown
miltbrown@...
Jun 8, 2004 10:50 pm
14951
Milton, Your first paragraph is very helpful. Your second paragraph has an unfortunate condescending tone. I know people are frequently thinking they have...
I have found this new prime conjecture n is a prime number only when k is a hole number ((2^n)-2)/n = k Discovered by: Eduardo Mourey López Negrete Torreón...
If n is a prime number then ((2^n)-2)/n is always an integer. This follows from Fermats Little Theorem, one of the first things one learns about in number...
... Hi, this is the fermat-test for base 2: n is prime only if 2^(n-1) = 1 mod (n) ==> (2^(n-1)-1)/n is an integer ==> 2*(2^(n-1)-1)/n=(2^n-2)/n is an integer....
I believe Fermat "discovered" this centuries ago (or possibly even Euclid?). This is simply a Fermat-2 PRP test. Yes, all primes certainly ARE shown by k...
... It looks like the apology is separate from the proof. The apology is 23 pages and gives a lot of personal history and other mathematical details which I...
Hi: I found a simple sieve method, somewhat similar to the sieve of Erathostenes, which allows to directly sieve twin primes. I would like to know, if this...
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.
