modular exponentiation?
|
10-26-2018, 06:08 PM
Post: #36
|
|||
|
|||
RE: modular exponentiation?
I just want to mention, that my favorite HP-16C is also able to solve the original problem.
With the modular exponentiation function, which I presenetd in this thread http://www.hpmuseum.org/forum/thread-11674.html in the "General Software Library", it is possible to compute the last (up to) 18 digits of \(\Bigg(\sum_{n=1}^{1000} n^{n} \bmod 10^{10}\Bigg) \bmod 10^{10}\) very easily. There is only one smal problem left: The computation lasts for about 8 hours. Best regards Hartmut |
|||
« Next Oldest | Next Newest »
|
User(s) browsing this thread: 1 Guest(s)