Timeline for Calculating (n ^ fibonacci(k)) MOD m for a large value of k
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 18, 2013 at 12:24 | comment | added | joro | @KhazhakKeghartSahak nice, m prime is easier. | |
| Dec 18, 2013 at 11:31 | vote | accept | Khazhak Keghart Sahak | ||
| Dec 18, 2013 at 11:31 | comment | added | Khazhak Keghart Sahak | Actually m is a prime number. I forgot to mention it on my problem description. Thanks for your hint! | |
| Dec 17, 2013 at 15:56 | history | edited | joro | CC BY-SA 3.0 |
Added efficiently and unknown factorization
|
| Dec 17, 2013 at 15:29 | history | answered | joro | CC BY-SA 3.0 |