In a message dated 01/12/03 06:50:55 GMT Standard Time, psypher007@... ... This isn't a very clear question. The original Turing machine is equivalent to...
I've been looking into a couple of minor variations on the "perfect number"... Of course, a perfect number is equal to the sum of its proper factors. What if...
The project now has a new forum. Please visit and participate on the forum at:- http://www.b2project.com/phpBB2/index.php Thanks, Harsh Aggarwal ... found...
14105
ronhallam@...
Dec 2, 2003 8:46 am
Does any one have a quick algorithm on solving the above type of equation? More specifically, 25 + 36(R^2-N) is the problem; my current algorithm is as...
Hi all, (1) Proth's theorem states: Let n = h.2k+1 with 2k > h. If there is an integer a such that a(n-1)/2 = -1 (mod n), then n is prime. (2) Now, is there...
... a(n-1)/2 = 1 (mod n), then n is prime. ... As I indicated to the poster in a private response, disprove this statement with n=175, h=11, k=4, a=51....
hi, except 2, every prime number is always sum of consecutive integer or every prime is always staircase numbers 3, = 1 + 2 5, = 2 + 3 7, = 3 + 4 11, = 5 +...
14111
Paul Leyland
pleyland@...
Dec 3, 2003 12:22 pm
... After 2, all primes are odd and so of the form 2i+1. Your observation is then trivial. (HIBT?) Paul...
14112
Décio Luiz Gazzoni...
decio@...
Dec 3, 2003 12:27 pm
... Hash: SHA1 That is fairly obvious, and is valid not only for primes but in fact for any odd number, since such numbers can be written as 2n+1, which can be...
14113
Paul Leyland
pleyland@...
Dec 3, 2003 1:39 pm
Here is a base-2 brilliant number factored recently. Paul ... From: Jens Franke [mailto:franke@...] Sent: 03 December 2003 13:32 To:...
Congratulations to all for this amazing record breaking factorization! I cant wait the time for an efficient wide spread G(S)NFS implementation. ... ...
14115
Paul Leyland
pleyland@...
Dec 3, 2003 2:21 pm
... An efficient and widespread G(S)NFS implementation already exists. NFSNET is recruiting. Please see www.nfsnet.org for more details. Joining in is as...
14116
Ray Telford
fatray2@...
Dec 3, 2003 2:50 pm
My congratulations to Jens Franke and his cow-orkers. nice to see primenumbers having interesting posts again. fatray, silent member, nothing of interest to...
I developed three new entropy like prime functions ( two constants) to get a very good linear agreement with the primes up to 1000, based on the entropy...
... An efficient and widespread line siever already exists. There is currently no efficent and widespread G(S)NFS implementation available that one can use on...
... I'm working on my own GNFS implementation, which I've tested to about 100 digits so far, (although I'm reaching the limits of the hardware I have available...
I have been working on twin prime conjecture with this perspective -- a theorum that proves that one can find atleast one twin prime in the range of numbers...
... umm well ok, fair enough. But have you established such a theorem, or are you just thinking about it? If the result is proved, then may we see the proof?...
Hello to Primers, Xmas Quiz day is Monday December 15th. The quiz link will be posted then and available on all time zones on the 16th. The questions will...
14125
Paul Leyland
pleyland@...
Dec 4, 2003 2:57 pm
Here is a solution in integers for which b,c,n, x, y, and z are all different. There are an infinite number of solutions, of course. b = -1 c = 1 n = 0 x =...
Hello all, I need information on Lenstra's elliptic curve method. Any information would be helpful no matter how elementary or advanced. From how and why it...
This is my first post here, looks like an interesting group. I have a couple of questions I hope you all can answer : 1st, I have read that the log E of a...
Dear Andy, Phil and Paul, Thank you for your comments. Andy, you can be excused as you are new to the F.I.D.N concept. As you correctly point out, there are...
From: paulmillscv [mailto:paulmillscv@...] ... Is it time to set phasers to moderate? __________________________________________________ Virus checked...
... But that condescending answer doesn't defeat my point... You ask for three integers, A,B,C, which are in arithmetic progression, and for which xA^3, yB^3...
Using the ordinary equipment on my old home computer, I found that (13! + 2)/2 is prime. How many primes of the form (a! + n)/n [or (a! - n)/n] are actually ...
