... I share Milton's concern. If the site is down only temporarily for maintenance, or for moving to a new ISP, etc., I'm sure many dozens of contributors to...
About Mike Oakes' concern, here is what I heard from Henri some days ago. Lélio ... From: Henri Lifchitz <henri.lifchitz@...> Date: 25/03/2009 18:49 ...
2009/3/31 David Broadhurst <d.broadhurst@...> ... Using L=50227322745600 smooth number, |P(2,L)|=60, the above man-in-the-middle approach in c program: ...
I have sent an on-line message to Robert Gerbicz mooting the possibility to a distributed search for a Carmichael number of order 3. [Actually, I intended it...
My conjecture pertaining to Carmichael Numbers was proved by Pomerance and Maxal(see www.crorepatibaniye.com/failurefunctions). Another conjecture: All the...
... The 5th Carmichael number, namely 2821, has not one but TWO Carmichael factors. Also the factor 127 occurs in 25 of the first 646 Carmichael numbers. ...
is there any general formula for triples (a,b,c) such that a,b are mutually prime and both odd and also a^2-b^2=c^2. ....(1)? also can this be extended to...
... Sorry for the typo in my previous answer The 5th Carmichael number, namely 2821, has not one but TWO Mersenne factors. Also the factor 127 occurs in 25 of...
... Yes: (4*n^2+1)^2 - (4*n^2-1)^2 = (4*n)^2 ... No: for p = 0 mod 4, the number of odd coprime pairs [x,y] with p = x^2 - y^2 is 2^k where k is the number of...
PS: I left out a square sign, here restored: for p = 0 mod 4, the number of odd coprime pairs [x,y] with p^2 = x^2 - y^2 is 2^k where k is the number of...
5. a general formula for the following Posted by: "san_tan1" san_tan1@... san_tan1 Date: Thu Apr 2, 2009 5:15 am ((PDT)) is there any general formula...
5. a general formula for the following Posted by: "san_tan1" san_tan1@... san_tan1 Date: Thu Apr 2, 2009 5:15 am ((PDT)) is there any general formula...
"I was lazy and did not use binary indexing for products of primes." Yes, I used long long int (8bytes) to store the residue (L<2^63), and int (4 bytes) to...
In a talk http://alumnus.caltech.edu/%7Ehowever/talks/FortCollins.pdf given in December 2006, Everett Howe posed this "Open Problem": "What are the first 3...
... Analyzing all 1401644 Carmichael numbers less than 10^18, one finds the following tallies of divisors that are Mersenne primes: 3: 1967 7: 133381 31:...
I am inclined to believe that this is a corollary of the Devaraj-Pomernce-Maxal Thoerem (see www.crorepatibaniye.com/failurefunctions). A.K. Devaraj ... ...
It seems impossible to access http://www.crorepatibaniye.com/. The last update seen by web.archive of /any/ page on that site dates back to Nov.2007. The...
... How many mistakes can be packed into 7 words? 1) Deveraj has no Thoerem. 2) Devaraj has no theorem, either. 3) Pomerance (not Pomernce) and 4) Alekseyev...
Dear Maxmilian, Let me clarify; A 104016 is the sequence of Devaraj Numbers which are also Carmichael Numbers and A 104017 is that of Devaraj Numbers which...
... As far as I understood, the D-numbers are /defined/ as those for which this is an integer; your conjecture says that this is a CN, but it isn't. Maximilian...
Dear prime number fans, is there anything available about possible finiteness of primes of the form (x+1)^p-x^p ? Specifically, some curios reasons led me to...
... They are cyclotomic, so have the same kind of rules surrounding admissible factors as Mersennes. (Which are actually quite non-trivial, and the most...
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.
