n is prime iff n divides F(n-1).F(n+1) fibprod(n)=fibonacci(n+1)*fibonacci(n-1) for (n=3,500,if (fibprod(n)%n==0, write("fibprod.txt";,n))) Except for n=5. Jon...
... Paul, George, someone, please: does that mean "you are foolish to use this program to try to factorize Phi(8*29*109,2) when an aficionado would know to use...
Hint: Let x=2^37933 and N=(x+1)^4-2 Then N+1 is divisible by x and by x+2=2*(1-(-16)^(3*29*109)) so x+2 may contain useful known Cunningham and Wedginton...
Guys, After 877,615 'P'values (assuming that the largest known prime is Mersenne 39), we have 39 Mersenne Primes. But after 100,000 'k' values (checked by ...
I've just discovered a new constant: Consider zetaFibonacci(s) = sigma{n=1,infinity, of 1/fibonacci(n)^s} When does zeta(s)=zetaFibonacci(s)? For s real, the...
Hypothetically, if the zeroes of the Riemann zeta function were known in their entirity, and hence psi(x) could be mathematically recreated [psi(x) is the...
In the double large prime versions of the quadratic sieve we have to find cycles amongst the list of partial (one large prime) and double partial relations...
There's an interesting puzzle on http://www.mathpuzzle.com/ at the moment. Erich Friedman has done a computer search for squares whose digits repeat in blocks...
Phil's Spoiler below ... I think this "proof" is rather too compressed to actually be a proof (like what is b?), although I did understand what you were...
i was wondering which parts of mathematics might be independent of which numbers are prime. for example, it seems to me that much of linear algebra would work...
A new prime-based sieve: Begin with 2. The next natural sieved number is 4, so knock-out 4+1=5. The next naturally sieved number, using 5, is 10, so knockout...
Hello phil, I am a member of yahoo's Primenumber group! From past several days I am not receiving any mails from Primenumbers. Not just from this group, but...
Guys, How do I find the number of digits in a number using PFGW? The 'pfgwdoc' file is saying use len(x), however, i don't know the full syntax. What I ...
Hi - I just started using proth.exe and newpgen.exe to find large (5000+ digit) Sophie Germain primes, and since it's easy to find how many primes are found...
Bouk de Water and I have proven the primality of N=690645*2^213751-5521791*2^148228 +41744655735*2^65524-667507226827 with 64352 decimal digits. Q1: How could...
Hi, Conjecture: If d_i = p_(i+1) - p_i , where p_i denotes the i-th prime, then d_i <= (log i + 1)^2, for all i. (the equal case is only for i=1) I tested...
http://www.ams.org/journal-getitem?pii=S0025-5718-02-01419-9 Colin A Percival of SFU, came out in March, requires no affiliation or registration to download. ...
An interesting puzzle for anyone into the P=NP conjecture: Consider a m*n rectangular grid. Fill the grid with random numbers, integers, primes, rationals,...
Two very big names - Arjen and Adi - and 2 others I've not heard of, have finally published an analysis Professor Bernstein's somewhat novel NFS scheme. <<< ...
Hi, Let p & q be primes such that q devides p-1. I want to find r & x when I know y, t in the following equation. y = r(x+t) mod q, Here, r,x,t all belong to...
New's Flash from dual Sierpinski search On June 4, 2002 David Broadhurst found the 91518 digit PRP 64133+2^304015. This is the 2nd greatest PRP and the...
More of an interesting fact actually, but if n has two consecutive ads 3 apart (e.g.4,7), then n is not prime. This can be (visually) extended to any odd...
... In my youth, "who" was thought "colloquial" in the objective case. My father gave me a copy of the "King's English" (shows how old I am) where I read: << ...
