Name
Abstract | ||
|---|---|---|
A cryptarithm is a mathematical puzzle where given an arithmetic equation written with letters rather than numerals, a player must discover an assignment of numerals on letters that makes the equation hold true. In this paper, we propose a method to construct a DFA that accepts cryptarithms that admit (unique) solutions for each base. We implemented the method and constructed a DFA for bases $k \le 7$. Those DFAs can be used as complete catalogues of cryptarithms,whose applications include enumeration of and counting the exact numbers $G_k(n)$ of cryptarithm instances with $n$ digits that admit base-$k$ solutions. Moreover, explicit formulas for $G_2(n)$ and $G_3(n)$ are given. |
Year | Venue | DocType |
|---|---|---|
2018 | CoRR | Journal |
Volume | Citations | PageRank |
abs/1807.11580 | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuki Nozaki | 1 | 0 | 0.34 |
| Diptarama Hendrian | 2 | 0 | 2.37 |
| Ryo Yoshinaka | 3 | 0 | 2.03 |
| Takashi Horiyama | 4 | 0 | 1.01 |
| Ayumi Shinohara | 5 | 936 | 88.28 |