My Math Forum Wieferich primes - searching on www.elmath.org

 Number Theory Number Theory Math Forum

 December 30th, 2007, 09:35 PM #1 Newbie   Joined: Dec 2007 From: Brno, Czech Republic Posts: 15 Thanks: 0 Wieferich primes - searching on www.elmath.org You can participate in the project Wieferich@home aimed at searching for Wieferich primes. Download free application on www.elmath.org. Wieferich primes satisfy 2^(pā1) ā” 1 (mod p^2) and only two Wieferich primes are known up to now: 1093 and 3511.
 January 4th, 2008, 12:06 AM #2 Senior Member   Joined: Nov 2007 Posts: 258 Thanks: 0 Dude there aren't any more - I checked. (j/k)
 January 14th, 2008, 10:25 PM #3 Newbie   Joined: Dec 2007 From: Brno, Czech Republic Posts: 15 Thanks: 0 Did You check it for all primes? Brilliant!
 January 15th, 2008, 04:57 AM #4 Global Moderator     Joined: Nov 2006 From: UTC -5 Posts: 16,046 Thanks: 938 Math Focus: Number theory, computational mathematics, combinatorics, FOM, symbolic logic, TCS, algorithms So, tell us about the project -- how do you find Wieferich primes, or more to the point, how do you quickly discard composite candidates? brunojoyal, you know that doesn't help... if the problem is outside of NP (well, really outside the Arthur-Merlin protocol) then *your* infinite computational resources don't help *us* solve the problem, since we can't verify that your calculations are correct.
 January 15th, 2008, 05:32 AM #5 Newbie   Joined: Dec 2007 From: Brno, Czech Republic Posts: 15 Thanks: 0 Actually we prepare new version with a quick implementation of the sieve of Eratosthenes and our original modular exponentiation. A project is live and always open to good advice.
 February 5th, 2008, 04:16 AM #6 Newbie   Joined: Dec 2007 From: Brno, Czech Republic Posts: 15 Thanks: 0 The notably increasing speed of searching and additional innovations are in Version 2. More than 200 users ā participate!
February 5th, 2008, 09:21 AM   #7
Global Moderator

Joined: Nov 2006
From: UTC -5

Posts: 16,046
Thanks: 938

Math Focus: Number theory, computational mathematics, combinatorics, FOM, symbolic logic, TCS, algorithms
Quote:
 Originally Posted by miroslavkures Actually we prepare new version with a quick implementation of the sieve of Eratosthenes and our original modular exponentiation. A project is live and always open to good advice.
Very nice. I wasn't able to find any documentation on the site about the inner workings of the software, though.
• Algorithms: are you simply testing each prime mod p^2, or is there some better method? How is exponentiation done -- binary, ladder, something else?[/*:m:q6vu0wm1]
• How do you work with large numbers -- an existing library or custom-rolled? Or do you avoid working with numbers with more than 64 bits?[/*:m:q6vu0wm1]
• Is the source available somewhere, or even just key parts? This would help explain some algorithms even without documentation. Is the source portable? Does it have fast assembly routines for some processors?[/*:m:q6vu0wm1]
• What ranges are you searching? Is there any overlap with other projects?[/*:m:q6vu0wm1]
• Is there any double-checking done? Are checksums computed and reported, or only progress?[/*:m:q6vu0wm1]
• Do you know of any interesting theoretical results relating to Wieferich primes? All I know about is that abc implies that there are infinitely many non-Wieferich primes... but has anyone shown something stronger, like positive upper density of non-Wieferich primes under the abc conjecture?[/*:m:q6vu0wm1]
• Have their been any recent discoveries regarding Wieferich primes?[/*:m:q6vu0wm1]

 Tags primes, searching, wieferich, wwwelmathorg

 Thread Tools Display Modes Linear Mode

 Similar Threads Thread Thread Starter Forum Replies Last Post mathbalarka Number Theory 3 June 16th, 2012 01:49 PM mixos Probability and Statistics 6 August 27th, 2010 04:15 PM Siphrodias Academic Guidance 1 July 1st, 2010 12:35 PM therock31 Applied Math 2 June 9th, 2009 08:54 AM saharrahamim Math Books 1 September 3rd, 2008 08:47 AM

 Contact - Home - Forums - Cryptocurrency Forum - Top