Timeline for Two-Dimensional Gobbling Algorithm
Current License: CC BY-SA 2.5
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 28, 2010 at 16:28 | comment | added | Martin Erickson | Thank you for your kind responses. I had noticed that the one-dimensional case is answered very simply (the formula is given by the nth harmonic number), and wondered whether one could solve the two-dimensional version of the problem. We can derive a recurrence relation. Let e(m,n) be the expected number of outputs. Then e(m,n)=1+(1/(mn))Sum[e(m,n),{j,1,m-1},{k,1,n-1}], for m,n>1, and e(m,1)=1, e(1,n)=1. I wonder whether there is an explicit formula for e(m,n). | |
| Jun 26, 2010 at 20:41 | answer | added | Will Jagy | timeline score: 1 | |
| Jun 26, 2010 at 14:03 | comment | added | j.c. | They all seem to be from here: www2.truman.edu/~erickson/openproblems.html | |
| Jun 26, 2010 at 13:03 | comment | added | Keenan Kidwell | People on MO typically like to see some background or motivation for questions, an explanation as to why you're interested in the answer. All the questions you've asked recently are somewhat lacking in this regard. | |
| Jun 26, 2010 at 12:58 | history | edited | Martin Erickson | CC BY-SA 2.5 |
added 171 characters in body
|
| Jun 26, 2010 at 12:46 | history | asked | Martin Erickson | CC BY-SA 2.5 |