Timeline for Divisor sum from prime-power factorisation
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 4, 2016 at 5:18 | history | edited | isaacg | CC BY-SA 3.0 |
edited body
|
| Jul 25, 2015 at 9:45 | vote | accept | Moartem | ||
| Jul 23, 2015 at 21:59 | comment | added | isaacg |
@Dennis Well, the higher order terms dominate, so it would probably have the rutime of the highest order multiplication, which is O(n) if we can assume the base is a constant.
|
|
| Jul 23, 2015 at 21:28 | comment | added | Dennis | Independently of the implementation, I don't think it's possible to calculate the first n power of a in O(n) time, unless you assume that multiplication is O(1). | |
| Jul 23, 2015 at 2:32 | history | answered | isaacg | CC BY-SA 3.0 |