Timeline for Landau logarithm
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 13, 2021 at 11:42 | comment | added | Kevin Cruijssen | @ovs Apparently a port of the Jelly answer is even shorter. The main part of the code remains the same though, so thanks again for those golfs. | |
| Jan 13, 2021 at 11:42 | history | edited | Kevin Cruijssen | CC BY-SA 4.0 |
deleted 603 characters in body
|
| Jan 13, 2021 at 11:36 | comment | added | Kevin Cruijssen |
@ovs Oh, nice approach with –. This is indeed a lot better. Thanks for -6.
|
|
| Jan 13, 2021 at 11:35 | history | edited | Kevin Cruijssen | CC BY-SA 4.0 |
deleted 603 characters in body
|
| Jan 13, 2021 at 10:49 | comment | added | ovs |
21 bytes by using the iteration index and – to get the result, keeping the maximum lcm on top of the stack and only appending one lcm to each partition.
|
|
| Jan 13, 2021 at 7:56 | history | answered | Kevin Cruijssen | CC BY-SA 4.0 |