Timeline for Shortest Addition Chain
Current License: CC BY-SA 3.0
15 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:04 | history | edited | CommunityBot |
Commonmark migration
|
|
| May 27, 2017 at 19:08 | comment | added | ZaMoC | fixed! but it takes longer | |
| May 27, 2017 at 19:07 | history | edited | ZaMoC | CC BY-SA 3.0 |
added 2 characters in body
|
| May 27, 2017 at 14:20 | comment | added | Zgarb |
For input 149, I got a chain of length 11 from your program, but there exists one of length 10 ([1,2,4,5,9,18,36,72,77,149]). It seems that your program uses random sampling and isn't guaranteed to find the optimal solution.
|
|
| May 27, 2017 at 11:38 | comment | added | ZaMoC | the right one {1, 2, 3, 5, 10, 15} | |
| May 27, 2017 at 11:07 | history | edited | ZaMoC | CC BY-SA 3.0 |
deleted 139 characters in body
|
| May 27, 2017 at 10:58 | history | edited | ZaMoC | CC BY-SA 3.0 |
deleted 139 characters in body
|
| May 27, 2017 at 10:53 | comment | added | Neil | As I don't have access to Mathematica, what length of chain does this give for an input of 15? | |
| May 27, 2017 at 10:36 | history | edited | ZaMoC | CC BY-SA 3.0 |
added 81 characters in body
|
| May 27, 2017 at 10:28 | history | edited | ZaMoC | CC BY-SA 3.0 |
added 145 characters in body
|
| May 27, 2017 at 9:57 | review | Low quality posts | |||
| May 27, 2017 at 10:16 | |||||
| May 27, 2017 at 9:49 | history | edited | ZaMoC | CC BY-SA 3.0 |
deleted 11 characters in body
|
| May 27, 2017 at 9:41 | history | edited | ZaMoC | CC BY-SA 3.0 |
deleted 6 characters in body
|
| May 27, 2017 at 9:36 | history | edited | ZaMoC | CC BY-SA 3.0 |
deleted 1 character in body
|
| May 27, 2017 at 9:24 | history | answered | ZaMoC | CC BY-SA 3.0 |