Thanks David Broadhurst and Jens Kruse Andersen. Yes, what I wanted was primes whose reversal is a prime regardless if it is the same. I appreciate the prompt...
Ok, here is a candidate for you n=355123458947088287910728102022491221313512433361090901023680542391857683716658073 It is the product of two primes p and q,...
David, I would help if you could give Sum of the digits of the number you have given along with the number of digits. With this--I should be able to work on...
... I wrote 3 lines of PARI just to notice that the first possibility it tested (N=product of 5 smallest primes > 12) already works : ? cc(p=12,P)={ p=[p];...
... Obviously, if P is prime then P+1 or P-1 is divisible by 3 and by 2 thus of the form 6N. Your question is, more or less, if any N is of the form p^n q^m *...
I remember an xam where negative marks was high and a similar type of problem. the best solution is all 0;s or all 1's. you r definite to get atleast 50. On...
almost on similar lines- I am working on 2 possibilities: what's the best way to approach- 1. ax^2+bx+c=0 mod(?) where a ,b,c is given. to determine ? where...
Hello Everyone, I need your help again. I did a lot of research including using Google about this subject but without success. In the generation of prime ...
I have Pari with me. But where do I get the Lenstra function ? Yes, David's puzzles help us hone our fundamentals. We need time to work it out...and learn as...
... than ... will ... gave ... 1])} ... ******************************************* I found that for the first 1000000 primes only 43 are not of the form ...
... I already remarked that OpenLenstra.gp is in the posting http://tech.groups.yahoo.com/group/primeform/message/2492 For the supercritical case, with n >...
CrossOver Mac software <http://www.codeweavers.com/products/cxmac/> might allow you to run the Windows version of PFGW on a Mac. Codeweavers.com had a free...
... Did you try "prime generating polynomial", http://www.google.com/search?q=prime-generating-polynomial ? ... I agree ... do you mean : using only primes for...
 Hi Dear Max i am gio22 (giovanni). how are you?  Have you the list of candidates repunit from 780,000 to 800,000 ? If yes, can you assign to me the...
I hope all doing well. Recently I come across with a pattern for Mersenne Prime numbers. for any Prime, Mp=(2^p -1) , where p >=5 , We can form a perfect...
Prabhakar Balakrishna
prabhakar.balakrishna...
Nov 17, 2008 3:11 pm
9258
Hey, Math Prof. here! I just downloaded the free software from your site and read all .doc/.txt files. Question: Is there a way to re-write the PRP function so...
Hello members, 2072644824759*2^33333-1 2072644824759*2^33333+1 2072644824759*2^33333+5 is a true prime triplet with 10047 digits. You can download the...
... Big congratulations! http://hjem.get2net.dk/jka/math/simultprime.htm is updated. It credits Norman Luhn, François Morain, NewPGen, LLR, Primo, FastECPP. I...
... It appears your mail was delayed 13 days. The largest known palindromic primes are at http://primes.utm.edu/top20/page.php?id=53 The current record is...
... Yes, he ran it on his computers .> I guess Primo didn't directly contribute to the final result.After 14 days of PRIMOing, I was unsuccessfully.I tried...
There are some newer options for testing and it really depends upon whether or not you are on PPC or x86. Personally I have had a lot of difficulty with...
... For prime p > 3, the criterion for primality of M = 2^p-1 is that there is precisely one such square. If we have none, or more than one, then M is...
... I reckon that the first 26 primes p for which M = 2^p - 1 is composite and every factor of M is congruent to 1 modulo 3 are 37, 67, 101, 103, 139, 257,...
Posted by: "Jens Kruse Andersen" ... I don't know if it's the same for other moderators, I presume it is, but from my perspective yahoogroups is annoyingly...
I'm working on a small joint project and have reached a point where I need a little help. The other party in the project probably being in the early hours of...
... Behalf Of Kevin Acres ... a ... Panic over. I'm nearly there. This (somewhat) simplifies to: n = r * (s+r) * (3*s+r) * ((2*x)^2+1) * (2*x^2+2) Regards, ...
Having problems with message search?
Fill out this form to ensure your group is one of the first to be migrated to the new message search system.
