Let's say you have an arbitrarily long list of primes (but it is bounded). Is it always possible to make a list of multipliers, with a one-to- one...
14627
Jens Kruse Andersen
jkand71
Mar 3, 2004 4:37 am
... This is always possible for any n and any order of the primes. The problem is just solving a set of modular equations. Your example, with x for the first...
14629
mikeoakes2@...
mikeoakes2
Mar 3, 2004 9:17 am
I wrote ... For some reason I had not seen Jens's post, which is (a) neater and (b) proves the general case. So I am erasing my post - sorry for wasting your...
14630
Payam Samidoost
samidoost
Mar 3, 2004 3:04 pm
Congratulations to Dave Linton! 659*2^800516-1 is prime. http://primes.utm.edu/primes/page.php?id=69058 It was more than 1 year which he had not submitted any...
14631
Pavlos S
pavlos199
Mar 3, 2004 4:41 pm
Congratulations indeed.Beyond the size of this prime,it is also a Riesel prime! one more down:) Pavlos ... __________________________________ Do you Yahoo!? ...
14632
biwema
Mar 3, 2004 11:18 pm
I've noticed, that there are sometimes troubles with GMP-ECM running a p-1 check with bounds that are bigger than 4e9. I ran a p-1 test with B1=1e10 on 2^933+1...
14633
andrew_j_walker
Mar 4, 2004 1:37 am
While we're talking about GMP-ECM, was the trial factoring problem in version 5 ever fixed? Andrew...
14634
asposer
Mar 4, 2004 1:44 am
Thanks for your reply, I've read about the Chinese Remainder Theorem but I've struggled with understanding its implications. I'm also interested in functions...
14635
hillcino368
Mar 5, 2004 9:25 am
Mike Oakes proved ... are ... Can we also prove the case for N=a^p+b^p? ... of m, ... Cino...
14636
mikeoakes2@...
mikeoakes2
Mar 5, 2004 11:37 am
In a message dated 05/03/04 09:26:14 GMT Standard Time, ... Yes. Nowhere is the positivity of a or b used in the proof (so the Theorem should not have required...
14637
cino hilliard
hillcino368
Mar 5, 2004 1:01 pm
... But of course! Thanks. I also noticed that if p is not prime then the prime factors of p divide q-1. This applies to even numbers also. Does the even case...
14638
Edwin Clark
eclark222001
Mar 6, 2004 11:46 am
Is there a name for and/or have primes of the form (a-1)*(a^(p*q)-1)/(a^p-1)/(a^q-1) been studied? Here p and q are primes and a is any positive integer. Many...
14639
Fred Barnes
fredlb37
Mar 6, 2004 8:45 pm
Apparently many interesting prime forms have been overlooked, perhaps because there are infinitely many such forms. The past few days I've been looking at...
14640
Ben Newsam
primes@...
Mar 7, 2004 1:00 am
Just to settle an argument that is developing in a newsgroup somewhere, could anyone tell me if there is possibly any difference between the terms "co-prime";...
14641
Carl Devore
carldevore
Mar 7, 2004 1:19 am
... I've never heard of a difference. There is also "a is prime to b" and "a and b are prime to each other", which mean the same thing....
14642
Jud McCranie
judmccr
Mar 7, 2004 3:09 am
... Same thing. http://mathworld.wolfram.com/RelativelyPrime.html...
14643
yummie_55555
Mar 7, 2004 12:16 pm
What do you think, does there exist a base b such that n*b^n-1 or n*b^n+1 never is prime? I have no answer to that question, but maybe it is easy for some of ...
14644
Shiv Nandan Singh
meet_crypto
Mar 7, 2004 4:00 pm
Dear geeks , Are there any primes P of any form such that 2*K*P + 1 is never prime for any positive value of K. Or to be specific does there exist any single...
14645
Shiv Nandan Singh
meet_crypto
Mar 7, 2004 4:00 pm
Dear geeks , Are there any primes P of any form such that 2*K*P + 1 is never prime for any positive value of K. Or to be specific does there exist any single...
14646
Jens Kruse Andersen
jkand71
Mar 7, 2004 6:04 pm
... 2*P and 1 are relatively prime (whether P is prime or not). Then Dirichlet's theorem says there are always infinitely many primes. ...
14647
Jens Kruse Andersen
jkand71
Mar 7, 2004 6:04 pm
... No base b has a finite covering set of factors. If M is a finite set then let A be the product of the members. If n=k*A for any k, then n*b^n+/-1 clearly...
14648
Andy Swallow
umistphd2003
Mar 7, 2004 7:22 pm
Dear idiot, 2KP+1 is an arithmetic progression whose elements have no common factor, and so will always contain infinitely many primes, whatever P is. Andy PS...
14649
eharsh82
Mar 8, 2004 4:37 am
Thomas, Large bases are less likely to produce primes, because of the rate the series grows by, but it is impossible to say there is no prime in the series or...
14650
Pavlos S
pavlos199
Mar 8, 2004 9:41 am
Indeed,the non-existence of a finite covering set does not prove infinite number of primes.Some time ago i had constructed a "possible";-infinite covering set...
14651
paulmillscv
Mar 8, 2004 1:32 pm
Hello, I have put a link to Dario Alpern's Factorisation applet and Xiao Gang's factorisation program Factoris on the F.I.D.N website at http://www.fidn.org/...
14652
paulmillscv
Mar 8, 2004 5:54 pm
Hello, I post details of a new study on psychonumerics. This is recommended reading for persons who work daily with large numbers and will be of interest to a...
14653
Hadley, Thomas H (Tom...
kctom99
Mar 8, 2004 6:12 pm
Paul, Thank you for the paper on "psychonumerics"! It's very funny, indeed! It's good to be able to laugh at ourselves sometimes. Tom ... From: paulmillscv...
14654
Bigfoot
plano9
Mar 9, 2004 12:11 am
I will take any patterns you guys have found in primes on the interent or one that you got yourself. I WILL find the ultimate pattern for primes....
14655
paulmillscv
Mar 9, 2004 2:24 pm
Dear Tom, Hello. I am glad you like it. Remember, do not venture into the unknown, unless you know. regards Paul Mills ... indeed! It's good to be able to...
14656
H.BARGHOUT
hamedbar
Mar 10, 2004 2:06 pm
Hi all i would like to ask if any body has a way to generate a sequence of numbers that containes all prime, faster than generating all odd number thank you in...
