miroslavkures wrote: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.
miroslavkures wrote:Please, download and run the client application. Your speed will be displayed on the screen. You may use both cores with multicore launcher. Thanks for resulting comments.
miroslavkures wrote:Very nice. So, we use two tests parallelly: the complete test and the periodic test. The complete one tests cca 300-700 primes per second. Simultaneously, the periodic test implements the conjecture that binary expressions of Wieferich primes are periodic. The speed is multiplied by number of cores. As to Your testing: unpublished results are suspicious - although Your near W.p. is OK. Nevertheless, our strategy is not a linear searching; we search already for primes greater than 6*10^15 in one of four ranges. More on www.elmath.org.
If You have more questions or even want cooperate, You can also use my e-mail email@example.com.
rogue wrote:So if I understand correctly, you ignore certain primes because they do not periodic. But that is based upon an unproven conjecture. Your results are likely to be incomplete, especially WRT near Wieferichs.
miroslavkures wrote:rogue wrote:So if I understand correctly, you ignore certain primes because they do not periodic. But that is based upon an unproven conjecture. Your results are likely to be incomplete, especially WRT near Wieferichs.
No. We use two tests. The first one ("complete") tests every prime. The second one tests only periodic primes (simultaneously and independently) up to the bit length 3500. The speed is related to the complete test.
If You have quicker algorithm, You can explain it
Users browsing this forum: No registered users and 1 guest