A positive odd prime integer which is equal to 1 mod 4, is uniquely represented as the sum of two squares. Let p be the name of a prime equal to 1 mod 4. Let...
... It is known that for an odd positive integer A, the following two statements are equivalent: - A is a sum of two squares. - In the prime factorization of...
... Hello Jack. I overlooked that multiplying a sum of squares times a square also yields a sum of squares. Thus I wish to amend my Function that maps the...
Hi All 82751511*16229#+n*20333209*16229#+1 (n=0-4) describes an AP5 of primes sieved n=10000000-15000000 17742343 tests 52888 prps 739001 ap3's 528 ap4's 0...
... Congratulations! http://users.cybercity.dk/~dsl522332/math/aprecords.htm#records is updated. Ken now has the AP4 to AP7 records. -- Jens Kruse Andersen...
Will somebody please throw our silly website censor a dictionary, and maybe a sandwich. Thanks. The message of ENCRYPT3, hidden in a stream of 1009 integers...
Further to my work on Pat(f(n),n) http://www.rankyouragent.com/primes/primes_simple.htm http://www.rankyouragent.com/primes/primes.htm which is a recursive...
Hi everyone, Apologies if the subject has been raised before. (1) What should we call numbers that stay prime for all permutations of their digits (if the name...
Peter Lesala
plesala@...
Mar 7, 2009 6:38 am
19882
... See http://primes.utm.edu/glossary/page.php?sort=PermutablePrime . Names include permutable prime, and absolute prime. CC...
Let P(z) be the set of all the primes whose squares do not exceed an integer z. Can anyone point me towards (or provide me with) a proof that pi(z) converges...
Hi -- I am ust wondering why the last eight posts of mine to this group, over a period of 2 years, have produced precisely zero replies. I know there's no...
Your notations are a bit confusing. "z" usually stands for a complex variable. Please clarify also what you mean with "converges to". This term has a precise...
... It was suggested to me by a topologist that I use z to denote an integer; I had aleady used a great many others to denote other things. I'll give it some...
Hi, Until no, I have received no help on this topic from this group as well as the openpfgw group. I there really no one using openpfgw on NX enabled Linux...
... That's odd, I remember at least 2 people giving you some assistance. ... I don't remember you reporting back on whether the versions from 2003 worked for...
... Hi Phil, Your reply surprises me : what assistance are you talking about? If some people here sent me answers, it seems that I never received them or else...
Hi Phil, Thank you for your binary. Unfortunately, your version gives the same result as the ones I tested; that is "segmentation fault" (SIGSEGV) on...
Hi Steven Yes, I've got the same crash with statically linked binaries. I recompiled v1.2 source code with -g to have debugging information and now I...
Companion Primes. If p is an odd positive prime, and q is a prime >p, define q to be a companion to p if and only if there exist a divisor d1 of (q+p) and a...
Hi Peter, You know what ? I'm happy ! ;-) I've tried to modify george woltman's elf objects with _TEXT32=code,alloc,load as you propose and then the...
I discovered an iterative algorithm for finding the factors of a positive integer. Unfortunately, it has two serious flaws. (1) It is usually less efficient...
... nice start... ... Then I suggest to use rather that, at least it terminates. ... and most often gets stuck after the first iteration. ... values, ... with...
Hello all: Sqrt[(p^2-1)/24] is integer for the primes p=5 and p=4801. Find the next Sincerely Sebastian Martin Ruiz [Non-text portions of this message have...
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.
