Timeline for Eight coins for the fair king
Current License: CC BY-SA 4.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 26, 2023 at 12:50 | comment | added | Hemant Agarwal | Did you write a program that used brute force or did it use some algorithm (greedy/dynamic programming etc) ? | |
| Dec 27, 2018 at 17:40 | comment | added | Cœur | According to the article "Remarks on the postage stamp problem with applications to computers" by R. Alter, J. Barnett, published in 1977, the Fibonacci sequence A027941 is proved to be a lower bound to this problem. So your answer is definitely valuable for a quick estimate for larger number of coins. | |
| Dec 27, 2018 at 8:18 | comment | added | Glorfindel | Yeah, it's something else after all. I guess I wasn't sober when I posted that :) | |
| Dec 27, 2018 at 2:34 | comment | added | Cœur |
While this approach works for 1 or 2 coins, it fails at 3 coins: A027941 gives a value of 12, but the set {1, 4, 5} shows we can go up to 15.
|
|
| Dec 24, 2018 at 18:33 | history | edited | Glorfindel | CC BY-SA 4.0 |
added 411 characters in body
|
| Dec 24, 2018 at 15:34 | history | edited | Glorfindel | CC BY-SA 4.0 |
added 51 characters in body
|
| Dec 24, 2018 at 15:28 | history | edited | Glorfindel | CC BY-SA 4.0 |
added 946 characters in body
|
| Dec 24, 2018 at 15:08 | comment | added | Dr Xorile | I can confirm that this works up to 1596. 1597 requires 9 coins (610,610,233,89,34,13,5,2,1) | |
| Dec 24, 2018 at 14:25 | history | edited | Glorfindel | CC BY-SA 4.0 |
added 119 characters in body
|
| Dec 24, 2018 at 14:15 | history | undeleted | Glorfindel | ||
| Dec 24, 2018 at 14:15 | history | edited | Glorfindel | CC BY-SA 4.0 |
deleted 47 characters in body
|
| Dec 24, 2018 at 13:51 | history | deleted | Glorfindel | via Vote | |
| Dec 24, 2018 at 13:40 | history | edited | Glorfindel | CC BY-SA 4.0 |
added 115 characters in body
|
| Dec 24, 2018 at 13:33 | history | answered | Glorfindel | CC BY-SA 4.0 |