In How Ways Can You Play Stanley Solitaire?
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866909229969833984 |
|---|---|
| author | Ekhad, Shalosh B. Zeilberger, Doron |
| author_facet | Ekhad, Shalosh B. Zeilberger, Doron |
| contents | We introduce a very simple solitaire game, named Stanley Solitaire, in honor of Richard Stanley, and prove an explicit closed-form formula for the number of ways of playing it. Alas, the only proof that we know is via a deep theorem of Richard Stanley from 1984. We challenge the readers to find a more elementary proof. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_15980 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | In How Ways Can You Play Stanley Solitaire? Ekhad, Shalosh B. Zeilberger, Doron Combinatorics We introduce a very simple solitaire game, named Stanley Solitaire, in honor of Richard Stanley, and prove an explicit closed-form formula for the number of ways of playing it. Alas, the only proof that we know is via a deep theorem of Richard Stanley from 1984. We challenge the readers to find a more elementary proof. |
| title | In How Ways Can You Play Stanley Solitaire? |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2406.15980 |