What's the basic LLR equation?
I'm wondering the basic LLR equation. Not the FFT stuff, but the basic math problem it's applied to.
I'm going to show it to my friends and see if can see the white all the way around their irises(wrong word?) when they realize just how big the numbers being dealt with are. Hmmmm, just Googled it, and there might not be an actual equation. To be honest, I thought it was something like: [2^(2^n1)]/n then check to see if the remainder is 0. Edit2: I meant no OBVIOUS ALGEBRAIC equation. 
[QUOTE=jasong;289973]I'm wondering the basic LLR equation. Not the FFT stuff, but the basic math problem it's applied to.
I'm going to show it to my friends and see if can see the white all the way around their irises(wrong word?) when they realize just how big the numbers being dealt with are.[/QUOTE] [URL="http://en.wikipedia.org/wiki/Lucas%E2%80%93Lehmer%E2%80%93Riesel_test"]Lucasâ€“Lehmerâ€“Riesel test[/URL] 
Yes, science man :) that's what I Googled before I posted my edits.
Unfortunately, their eyes will probably glaze over if I try to explain it to them, I was hoping for a literal algebraic equation even though the actual numbers are unbelievably gigantic. Actually, though... Well, with some exponents you start with 4, square it and subtract 2, square that and subtract 2, square THAT and subtract 2...I think I can explain that adequately. Hmmmm, might still be able to do this. 
Utilizing modular arithmetic, the numbers are only ever as large as k*2^n1 (i.e. the number you're testing). If we didn't have that benefit, hm...
(LL/LLR are practically interchangeable for this discussion; the difference that comes from different starting points is negligible) It's sequence [URL="http://oeis.org/A003010"]A003010[/URL]. At index 0, it's 4. By index 6, it has 37 digits. Running the LL test for M7 requires you to go to index 5. MM7 has 39 digits. So the sequence that is at the heart of the LL/LLR tests makes numbers roughly 2^N, where N is the number you're testing. For LLR tests, this means checking if a number of about the size 2^(k*2^n1) divides k*2^n1. For a megabit prime, this has over 10^300,000 digits (for comparison, a billion has 10 digits, and a googolplex has 10^100+1 digits). For the largest known prime, this has almost 10^13,000,000 digits. In general, for a xdigit number, the sequence would go to about 10^x digits if not for modular arithmetic. In case you didn't notice, there's nothing here special about base 10. For any base b: for an xdigit (in base b) number, the sequence would be about b^x digits. Notice that I only say the number's approximate size. This is because getting the exact value would be most simply stated as the LL sequence formula, which is not easy to intuitively grasp the size of. 
Yes, MiniGeek, I understand. The numbers we're dealing with are frickin' huge, and only modular arithmetic allows us to get an answer.

All times are UTC. The time now is 18:44. 
Powered by vBulletin® Version 3.8.11
Copyright ©2000  2022, Jelsoft Enterprises Ltd.