Hi all, You can find here two new conjectures : http://www.primepuzzles.net/conjectures/conj_049.htm The comments/proofs/counterexamples can be sent to Carlos...
Dear List, A few days ago i proposed two conjectures. Conjecture A : Every natural number n > 1 can be written as n = pq + rs, where p, q, r, s are primes or...
Hi- I am a musician studying properties of the overtone, or harmonic series, and the question of the appearance of prime numbered partials in each octave of...
... It seems to me that this conjecture is true, and your proof is valid, if you assume that primes are equally likely to consist of any digit? But while we...
Hi Everybody, There are roughly 2.4 x 10^17 primes in the range [10^18,10^19] and I need to find a random 5.5 x 10^10 of them. 1. Knowing that sieving is...
... How do you know that sieving is prohibitively slow? Can you show me your comparison of the time it takes to generate a sequence of prime numbers using a ...
For those of you that are still interested: I know it has been a while, but I have updated the Integer-to-Image applet at https://home.comcast.net/~rwynar/. I...
Brought back on-list with permission. ... Good - you've done your research - that sieve is a smart design. The C GPL code is not brilliant, but it's so simple...
... You've made a mistake; so no. Unless you're talking about encrypting or decrypting with knowledge of the appropriate key, in which case it's always been...
... {u=3;m=4000;v=u+m;forstep(a=u,v,2,t=a^2-2;c=ceil(sqrt(t/2));for(n=c,a-2,s=2*n^2-t;if(issquare(s),next(2)));print(t))} ... This is not instantly obvious,...
Yes, I am interested. I also have a method. You can see my messages to this list. However, I am sure that the "moderators" will not allow your messages. You...
miltbrown@...
Oct 18, 2006 8:23 am
18396
Hello all: Let z(n)=Sqrt[Product[Prime[i]^2-1,{i,1,n}]] I have found ONLY ONE integer value for z(n): z(3)=24 Can someone found other integer value for z(n)? ...
I know this is good - as I actually understood much of it! /Elementary Number Theory/ - Uspensky and Heaslet. McGraw-Hill 1939 1) Elementary Properties of...
Reservations and ranges at: http://83.143.57.194:16384/Factorial/ I've covered most of the historical reservations with a pseudo-id. There are some known...
Dear List, Three new conjectures are proposed here : http://www.primepuzzles.net/conjectures/conj_050.htm You can send your comments/proofs/counterexamples to...
Hi all; Maarten van Thiel, northern Netherlands, but born in the south. I am not at all a mathematic, on the contrary, I worked as a chef for years, got...
... Welcome. ... A situation very similar to what you mention has already been met. Back in the days of only few prime hunter at universities with batch-jobs...
A Pari program to find all primes 1 or 7 mod 8. For any k=1,2,3,4,5,....Choose the k value and the range u and m you want. Slow algorithm, though. Hope Phil...
... Be forewarned - I'm now *way* OT. I've known about Riesel, and the Swedish machine 'BESK' (Binär Elektronisk SekvensKalkylator = "Binary Electronic...
... The library in question was DJB's primegen, and the issue was that gcc on the Power architecture seems to like having _unsigned_ chars by default (unlike...
Hi Everybody, I have two sets (A and B) of n positive integers each, and I need to subtract each element of B from each element of A. Obviously, the ...
I'm not sure how this relates to primes, maybe the elements of A and B are all prime? *wishful thinking* Anyway, wouldn't this be an O(2n-1) = O(2n) = O(n)...
Hello Kaveh, ... Consider the sets A = { N, 2N, 3N, ... N^2 }, B = { 0, 1, 2, ... N-1 }. The set obtained by subtracting each element of B from each element of...
