Hi , all , Within the past several years , the option -oe+ , which broadcasts its "stdout" to stdout and a file , has apparently disappeared ( can something...
Walter Nissen
wnissen@...
Dec 3, 2006 7:45 pm
18472
... On a Unix-like machine, try running the command "man tee". Windows boxes can be made to look Unix-like by any of several methods. Using Cygwin is the most...
... mersenneforum is experiencing a denial of service attack: http://www.mersenneforum.org/showthread.php?t=6725 The forum administrator is experimenting with...
... I personally advise against using tee. Better is to simply redirect output to a file ( ``> filename'' or '>> filename' to append), maybe stick that process...
... Fair enough. tee(1) tends to work for me just fine but YMMV. Beware, though, that on Windows machines it's frequently the case that you can't "tail -f" a...
Oi! Stop classifying my gibberings as questionable spam! ... If every chunk of output is accompanied with fflush(stdout) or fflush(NULL), then YMWBPG. I...
It is an old problem in this forum, how much primes a polynomial does represent. Admissible irreducible polynomials with integral coefficients and positive...
... If I understand correctly, then the proof mentioned at http://mathworld.wolfram.com/LuckyNumberofEuler.html shows that there is no number > 41 that works...
Hi all; Can someone point me to a site with the proof for the following (I Googled till blue in the face because:) I dont know the English word for what in...
... I do like the idea of a 'head bum' number! In English, it's rather less poetic - merely a 'palindrome'. ... The simplest proof is probably to prove and use...
How can one prove the primality of a PRP when every program I've tried is unable. To form of the prime is XYYX such as 2^2007+2007^2. I have many PRP's to...
... With a little less than 30% factorisation of N+1 and N-1 you can get a *proof* of primailty using PFGW plus CHG [1]. Otherwise a parallel implementation of...
Does anyone know something about Georges Brougnard prime gb- sequences ? Definition : -- gb[0] := any prime > 2 -- if gb[n] = 2 (mod 3) then gb[n+1] : =...
... It looks like you could be rehashing stuff that's already been done: http://www.leyland.vispa.com/numth/primes/xyyx.htm Are you aware of that web page? A...
I don't know much, but: Record-setters (in terms of # of steps to reach 7) appear to be the following pairs (prime, # of steps to reach 7) ... and I say...
Argh! This is the only group that I belong to that has postings going to sender and not the group list. I would like to suggest that the default be set to...
Here's Adam's post by his request. I surely don't want to get involved in the "reply-to-group" vs "reply-to-sender" debate! There are good arguments on both...
... Once you've read ``"Reply-To" Munging Considered Harmful'' http://www.unicom.com/pw/reply-to-harmful.html Then read ``"Reply-To" Munging Still Considered...
... 2^2007+2007^2. ... digits. ... Turns out I was rehashing some stuff. Using the list, I've verified some of the PRPs needing a proof. Also, I've been...
Matrix Factor Element Sets A Matrix Factor Element Set is defined recursively as follows. Any set of distinct non negative integers which includes zero is a ...
... These aren't sets, they're multisets. ... This does not define a Matrix Addition table. Is 0 0 0 0 such a table? Is 1 4 9 16 such a table? ... Given that...
... So it's a set { a_{i,j} : a_{i,j} = a_{1,j} + a_{i,1} if i>1 or j>1 } In that case, the whole thing becomes trivial. Sum { 2^{a_{i,1}} } * Sum {...
... I had not heard the name "multisets" before. I can use that terminology in the future. multisets if multiplicities are allowed, and sets if multiplicities...
Out of curiousity, I am wondering if the source to various sieving programs will ever be released by their authors. I do not know how to go about writing a...
... Most of my sieves have been made public. ... I'm sure I've written something like that already. What do I use for my Tetradic primes? Hmmm... If I still...