Timeline for Divisor sum from prime-power factorisation
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 27, 2015 at 6:39 | comment | added | Moartem | Yes, that´s right, it´s even bigger than O(product of exponents) | |
| Jul 25, 2015 at 10:16 | comment | added | Luis Mendo |
@Moartem Thanks! But I'm not sure about that. I compute the number s and then test all possible divisors from 1 to s. So it's (at least) O(s), which is probably between O(sum of exponents) and O(product of exponents)
|
|
| Jul 25, 2015 at 9:43 | comment | added | Moartem | Looks like you may add the 0.8 bonus | |
| Jul 24, 2015 at 12:30 | review | Low quality posts | |||
| Jul 24, 2015 at 12:51 | |||||
| Jul 24, 2015 at 12:09 | history | answered | Luis Mendo | CC BY-SA 3.0 |