Timeline for Primality criteria for Fermat numbers using quartic recurrence equation
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 6, 2012 at 4:14 | comment | added | pedja | @EmilJerabek On my computer Java implementation of this test is approximately $1.5$ time faster than Java implementation of Inkeri's test... | |
| Mar 23, 2012 at 18:18 | comment | added | Emil Jeřábek | The tests are the same, one step of pedja’s recurrence amounts to doing two steps of Inkeri’s recurrence. Obviously, you can cut down the number of iterations $k$ times by doing $k$ original steps in one iteration, but that’s not going to reduce the number of arithmetic operations used. | |
| Mar 23, 2012 at 17:24 | comment | added | Gerhard Paseman | I apologize. I switched indices in my head as I was writing the remark. I support your assertion (based only on the post, however) that your test uses fewer indices. Gerhard "Needs To Drink More Coffee" Paseman, 2012.03.23 | |
| Mar 23, 2012 at 17:21 | comment | added | Gerhard Paseman | I don't know how you count iterations. Looking at the indices suggests to me that you use more iterations than the test of Inkeri does. Gerhard "Ask Me About System Design" Paseman, 2012.03.23 | |
| Mar 23, 2012 at 11:58 | comment | added | pedja | I didn't know that such test exists . As you can see my test uses lesser number of iterations . | |
| Mar 23, 2012 at 11:39 | history | answered | François Brunault | CC BY-SA 3.0 |