O.K., I'll bite ... <snip> ... if all of the prime powers in the factorizations of both x and y are such that none of the p^a==-1 mod 4, then the substitutions...
This post is proof positive that moderation should be turned on by default on the list. Would you mind to leave our list alone, crackpot? Décio ... [Non-text...
I've been working since yesterday on an implementation of the number field sieve in PARI/GP. This isn't meant to the fast or anything, just a curiosity. It...
... I found the problem -- I was allowing non-coprime pairs (a,b) which of course generated trivial dependencies. I've been able to factor quite a few numbers ...
Decio, Does Pari-GP really allow you to break up things like a function name into parts? For instance, on line 3 you have "f(x)=ev al(Pol(". Does Pari know...
... Yes, PARI/GP effectively has no concept of whitespace (except in strings). For instance, a quote from the manual: `As explained above, the general way to ...
In Pari 2.2.8 I get the following error: (11:41) gp > nfs(111111) *** expected character: '=' instead of: primepi(i) ^ (11:41) gp > Do you have a formatted...
... Here is my working version (I use a shell script to obfuscate it, but obviously I don't try to patch it in 100% obfuscated form), already including the fix...
Décio, Removing the brackets around the statement "z(i)=primepi(i);" gets rid of the error. However, what is the routine supposed to return? It seems to ...
... That's weird, because I've been running the same file here. I recall GP complained when I _didn't_ have parentheses around function definitions; I believe...
... Ah, I was running on 2.2.8. I have just downloaded 2.2.10 and tried it with that, and get much more sensible behaviour with the original script. Regards, ...
A humbling addendum: I've worked out what the "three" at the end of every cycle really means. Lets just say it is far from intriguing now! Simply put, if p# =...
Hi all If we are given a prime p and r < p, can we easily find the (unique) s < p such that r*s = 1 mod p? Let's assume we can. Then of course the t < p that...
Yes, we can! You want to find the inverse of a number s modulo p. As p is prime, we have GCD(s,p) = 1 and it exists an unique inverse r<p for s (as you said...
... Yes, of course, that's the operation of modular inversion. You can use Euclid's extended algorithm to find it, or maybe compute r^(p-2) mod p since ...
Here is a demonstration that there are an infinite number of Twin Primes, and a method of finding them. Consider the following twin primes: (5,7) (11,13) (17,...
Milton Brown
miltbrown@...
May 5, 2005 10:19 pm
16552
You have not proved a thing; you merely launched a new hypothesis. You are not proving anywhere that, for a fixed factorial, it exists a twin prime that added...
... The answer is, he doesn't, because it won't work. This one didn't even need a computer search; it fell to a search by hand. I would appreciate a third ...
I found that 4!+857, 4!+859 adds (881,883) allowing the primes generated by the n factorial to go "backwards" to be checked with former factorials. But then I...
... Milton, are you really this stupid, or do you somehow enjoy being humiliated in public? In the latter case, you should seek psychiatric help. ... Emphasis...
... Moreover, a PARI/GP search plus a clever shell script using PFGW (guess I should learn PFGW's scripting language instead, but...) confirms my previous ...
... Besides being a moron, are you also unable to read? Here, let me reproduce my ... What part of this don't you understand? Just replace (59,61) by...
More addition for your computer: (479001791, 479001793) = (12!+191, 12!+193) And, again you said 12 didn't work! Milton L. Brown ... reproduce my ... of ... ...
Milton Brown
miltbrown@...
May 6, 2005 8:06 am
16561
Even a computer search does not help you! (3629027, 3629029) = (10!+227, 10!+229) Unless n=10 means something else to you. (Maybe its not the computer after...
Milton Brown
miltbrown@...
May 6, 2005 8:06 am
16562
Perhaps a computer search would be better for you. Or, see the link http://primes.utm.edu/lists/small/1ktwins.txt (7!+59, 7!+61) = (5099, 5101) is a prime...
