Hello! There are many yet more "memorable" primes at http://www.utm.edu/research/primes/curios/ And the prime ...
744
Barubary
barubary@...
Apr 2, 2001 5:06 am
Can someone direct me to a program that'll let me add/subtract/multiply/divide 20000 bit numbers? Thanks, -- Barubary...
745
Hervé LELEU
h.leleu@...
Apr 2, 2001 8:45 am
Hi all, I would like to work out the conjecture that says that any sufficiently large and non square integer number is the addition of a prime number and a...
746
Andrey Kulsha
Andrey_601@...
Apr 2, 2001 8:51 am
Hello! ... (digits:25) ... (verification : a = ... So... ... You haven't looked at Prime Curios collection!!! ...
747
Andrey Kulsha
Andrey_601@...
Apr 2, 2001 12:38 pm
Hello, Paul! ... is ... G.L. Honaker has just published it: http://www.utm.edu/research/primes/curios/102..201.html Have you seen ...
748
Andrey Kulsha
Andrey_601@...
Apr 2, 2001 12:41 pm
SORRY, I've just missed a point. :-) The right URL is http://www.utm.edu/research/primes/curios/102...201.html Best wishes, Andrey ... ÷ÁÛ ÌÕÞÛÉÊ...
749
jfribrg@...
Apr 2, 2001 2:35 pm
... If you want a basic calculator, the Unix utility bc may serve your purposes. Otherwise , the programming languages Java and Perl both support...
750
Paul Landon
plandon@...
Apr 2, 2001 3:44 pm
Primeform is the best "pocket calculator" for big numbers. As a side effect it even tests for probable or proven primality too! :-) It has many functions such...
751
didier.boivin@...
Apr 2, 2001 4:13 pm
Answer to Barubary : you should try ARIBAS that can handle interer at arbitrary precision, and real up to 4096 digits. see...
753
David Litchfield
Mnemonix@...
Apr 2, 2001 7:22 pm
Howdy all, Just a quick question. Given a number that is the result of multiplying two primes together one can work out what these two primes are by...
754
Renaud LIFCHITZ
RenaudL@...
Apr 2, 2001 7:34 pm
Hello all ! Let p = 3141592003181 Let N = Phi(6,p^20) = (p^60+1)/(p^20+1) (500 digits) Then N = 2161.43505714401.F.C with C unfactored and : F =...
755
Renaud LIFCHITZ
RenaudL@...
Apr 2, 2001 8:37 pm
Hello, Oops ! F is really prime but Hendrik Lenstra have just pointed me that it is p^8-p^4+1, a well known factor form for cyclotomic numbers. Thanks to him. ...
756
Ravi Kiran.G
ee98259@...
Apr 3, 2001 5:02 am
Hi All, I'am a new entrant into this group and my interests in primes are confined to factorisation.So here's the mail,I have a similar kind of programme which...
757
David Litchfield
Mnemonix@...
Apr 3, 2001 1:48 pm
Hi, Does anybody know of a quick test to see whether a number squareroots to give a whole number? sqrt() is too computationally "heavy" and I don't need the...
758
Paul Leyland
pleyland@...
Apr 3, 2001 2:06 pm
... To be certain, you really need to calculate the square root and check. Either that or an equivalent procedure which is likely to be at least as "heavy". If...
759
Phil Carmody
fatphil@...
Apr 3, 2001 3:47 pm
... Grab the GMP (Gnu Multi Precision) library from 'swox' (a web-search should find it - I daren't open any new windows due to fragility, but it's something...
760
Phil Carmody
fatphil@...
Apr 3, 2001 4:40 pm
... Yup, GMP uses 256 rather than 64. In a base-2 representation of your numbers this is simply looking at the lowest byte. 63 is 3^2*7 65 is 5*13 The reason...
761
Paul Leyland
pleyland@...
Apr 3, 2001 4:56 pm
... and d) they use a very small amount of memory for the tables and very little computation to find them, though the latter only needs to be done once and the...
762
Mark Edwards
me298@...
Apr 3, 2001 8:11 pm
Hi there, I am currently undertaking a (minor) investigation in the algebra of digit sums. However, as yet I've found it difficult to find any material of the ...
763
Phil Carmody
fatphil@...
Apr 3, 2001 9:56 pm
The following is from a discussion with the GMP guys: ... [SNIP] ... For a typical RISC 64bit architecture, we were agreed that one probably can't get much...
764
Barubary
barubary@...
Apr 3, 2001 10:16 pm
... such ... Digit sums? Those are very simple. The sum of the digits of N expressed in base B, mod B-1, is N (mod B-1). A simple example is determining...
765
Milton Brown
miltbrown@...
Apr 4, 2001 2:55 am
You could look at my paper on Reducing Sums which I placed on my link at www.cs.ucr.edu/~mbrown Milton L. Brown miltbrown@......
766
SWagler@...
Apr 4, 2001 2:56 am
In a message dated 4/3/2001 7:01:39 AM Pacific Daylight Time, ... Observed heuristically, if you sum the digits of a square recursively to a single digit, the...
767
Paul Leyland
pleyland@...
Apr 4, 2001 9:11 am
... Indeed. It's the quadratic residue test with modulus 9. It's subsumed in the mod 63 test I gave and it's equivalent in the other proposals. Paul...
768
Jon Perry
perry@...
Apr 4, 2001 5:23 pm
Try: http://dmoz.org/Science/Math/Number_Theory/ for serious stuff, http://dmoz.org/Science/Math/Mathematical_Recreations/ for more humerous material. Jon...
769
torasso.flavio@...
Apr 5, 2001 3:55 pm
By the same method I used in obtaining a twin primes' rule I worked on (n,n+4) pairs and I found the following: for n not equal to 9, (n,n+4) is a prime pair...
770
Hervé LELEU
h.leleu@...
Apr 6, 2001 8:36 am
... Hello Paul, I have tested the conjecture for n<=6.2*10^7 and there are only the 36 square free integers I have mentioned that do not meet the rule. I...
771
Gert Bohn
gbohn@...
Apr 7, 2001 10:16 am
Hello to each of the primenumbers community ! ... and it is also stronger than "There are infinitely many prime twins". This mail list does not allow attached...
772
Milton Brown
miltbrown@...
Apr 7, 2001 3:18 pm
Chris, Perhaps this qualifies as a prime curio 1111*10^111+111 Milton L. Brown miltbrown@......
773
Jon Perry
perry@...
Apr 7, 2001 5:09 pm
WHat's so great about part 3: (1.3) The members of E are all the sums of some prime numbers. If you look at: ...
