... PFGW was exploited for the inital search for a PRP because of it's gain in speed in this respect -- for 2^n+-k (k< about 43 bits.) I used Prime95.exe to...
... Yes the signs are important for these trinomials. The most genral case I have is x^n+-x^k-1 (x,n,k all positive integers x>1,n>2,n>k>0 and discounting...
hiiiiiiiii friends i am just new member in your group and I glad to be that I am mathmatical interester from Egypt spieal in number threoy I joined since...
N=2^64695-2^15-1 is prime. Paul Underwood discovered that N is probably prime, as part of a large trawl of candidates of his favourite form f(a,b)=2^a-2^b-1 ...
... I was wondering after I wrote this, and thought maybe somebody would have an answer, or maybe I'm just crazy... Assume we have a large odd composite number...
In a message dated 9/27/02 2:30:03 PM Eastern Daylight Time, jack@... ... Reply: When you talk about limits of pi(2n)/pi(n) it seems similar to a proof...
... Err, it seems to me that it has all bits but one set to 1: ? b=binary(2^64695-2^15-1); ? print(sum(k=1,64695,b[k])) 64694 It is a "base-2 near repunit", ...
... Not really. Everyone knows that Hans is doing something huge, well above 6k digits. So why spend cycles to become a poor second in 2003 :-? David...
... That was unfortunate. I had a registered Titanix (thanks!) which did all the batch except the p1012 and then used latest Primo 2.0.0 beta3 for this, the...
... On July 2 he told that he had done 2173 bits of something big: http://groups.yahoo.com/group/primeform/message/2621 On Sept 21 he told that he had recently...
9022
Milton Brown
miltbrown@...
Oct 2, 2002 12:37 am
I have done some work with RSA numbers, You are welcome to look at my WEB-site www.csulb.edu/~mbrown10 Milton L. Brown ... From: mohamed saleh...
... and ... That's now changed and Primo/ECPP is again #1 general prime proving program/method. By "ordinary"; I thought the number does not have any special...
Thanks. My proof went along these lines: If gcd(kx,x+1)>gcd(k,x+1), then gcd(x,x+1)>1 The theorem is extensible into: gcd(kx,y)=gcd(k,y).gcd(x,y) if gcd(x,y)=1...
The general case: gcd(kx,y)=gcd(x,y).gcd(k,y/gcd(x,y)) Jon Perry perry@... http://www.users.globalnet.co.uk/~perry/maths BrainBench MVP for HTML...
9030
Max B
zen_ghost_floating@...
Oct 2, 2002 8:27 pm
"If we look at the prime factors of a Fibonacci number, there will be at least one of them that has never before appeared as a factor in any earlier Fibonacci...
Carmichael's theorem is _far_ more general than that. Knott gave only the Fibonacci case p=1,q=-1. In general consider U(p,q,n) with p>0 and d=p^2-4*q>0. Then...
... The proof is in this form: F(n)/x = characteristic factors. Observing: F(2^n)/L(2^ n-2)= all characteristic factors. x may have something to do with...
I was wandering around Andy Steward's incredible generalised repunit resource, http://www.users.globalnet.co.uk/~aads/ and something regarding KP proofs...
Anyone know why 4ab+3(a+b)+2 is never a square? It comes from looking at the 'alternative' 5-squares conjecture, find a set a,b,c,d such that ab-1=u^2 ac-1=v^2...
... Rewrite this as: N = (4*a+3) * b + (3*a+2) In order for N to be a square, we must have (3*a+2) be a quadratic residue modulo (4*a+3). Note that (3*a+2) is...
