Is the sum of the reciprocals of all the primes an infinite number? If not what is the approximate number at which it starts trailing off into trivially small...
Could somebody recommend a program that can PRP test large numbers of small numbers (say under 25 digits). I know PFGW will do this but is there a faster...
... of small numbers (say under 25 digits). I know PFGW will do this but is there a faster program for small numbers? ... It might be worth testing pari, as...
I did a quick scan of the files and didn't see a sieve for finding small primes. I may have missed one if it was there, can someone give me a link to one...
A program in Java (C++) for small primes is attached. Milton L. Brown miltbrown at earthlink.net public class Prime { public static void main(String[] args) { ...
Milton Brown
miltbrown@...
Sep 3, 2004 3:48 am
15263
I'm working on turning that into c++ code that I can use, but I don't see what the purpose of the lines k!==0 //pointless, no need to do factorial here and ...
... First of all, he wrote "k != 0", not "k !== 0" and the first is basic C/C++ code. There is no confusion with the factorial. ... No, it's the remainder...
For the small prime lister program, the outer for-loop is exited as soon as i is found to be composite. The number is not composite (prime) when k != 0,...
Milton Brown
miltbrown@...
Sep 4, 2004 7:06 am
15266
As you know Z (the set of all integer number)is a commutative ring With indentity. We difine L(p)={pk: k is integer number} such that p is prime number. ...
... number). ... Take any two univariate polynomials, P(x) and K(x), such that their orders sum to p(n), then yes, you can multiply them together to create a...
... It seems that Reza is not asking for just a polynomial of degree p(n), but a polynomial of the form a(0) + sum(a(i)x^p(i),i=1..n) where each a(i) is not...
Cino ... Try 4^p+p, 3^p+p+1, p^p+p+1, p^(p-1)/2 +p +1 etc. I am only finding a couple. They are probably infinite in count maybe some one can prove on some of...
I have just looked at 2^p-p and with the exception of p=2 this doesnt yield any primes p<20000. Clearly about half of the numbers of this form are divisible by...
Lately I have been interested in primality testing: to determine whether a number, N, is prime or composite. From what I have thus far read, various tests have...
At 06:50 PM 9/6/2004, Ronald Dwyer wrote: 3. Of the numbers that end in the digit 9, one thing we can do is ... That is of very little help because it tells...
Hi, I have a question which is related to factoring composite numbers, although why may not be obvious at first. I have a (straight) line x1,y1 to x2,y2 where...
Thankyou to those observent people who spotted my typing error! I meant to say that 2^p-p (for p being prime) doesn't yield any primes for p<20000 except for...
If you allow not only primes but all odd numbers then besides 3, 13 and 19, 2^p-p (p<10,000) is also prime for p=9 and 21 and 3-PRP for p=55, 261, 3415, 4185,...
No homework requests please!!! REZA RANJBAR <saeedgeometr22@...> wrote: Let P(x) is none-zero polynomial on R (the set of all real number). Show that. ...
Congratulations to Jens K. Andersen who has just broken the existing records for generalised bitwins of lengths 3-6 and has found the first generalised bitwin...
Here's a simple, simple prime number tester for very small numbers. It saves the previous results of test searches in memory, so it will be impractical if you...
... Thanks. A generalized BiTwin with k links (length k+1) is k+1 twin primes on the form n*b^i+/-1 for k+1 consecutive positive values of i, and b>2. My new...
Hi Milton, Thanks for the response. I should add the clarification that y1 and y2 even though not whole numbers are also not irrational. So eventually the ...
Your problem as stated has no solution. Consider the line y = x*sqrt(2). Any point (x1,y1) on the line, can not have both x and y be whole numbers. Perhaps...
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.
