daviddoji/pytudes
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Refactor questions about solutions in Sicherman Dice

Browse Source 
Rephrase questions regarding solutions for composite and perfect square numbers.
This commit is contained in:
Peter Norvig
2026-09-02 16:56:45 -07:00
committed by GitHub
parent 708e128e23
commit 19d2b079e2
1 changed files with 1 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
ipynb/Sicherman Dice.ipynb
View File

@@ -1751,10 +1751,9 @@
"\n",
"- Do all composite *N* have solutions?\n",
"- Does any prime *N* have a solution?\n",
"- Do some *N* have more than the 3 solutions that 8 has?\n",
"- Does the fact that 8 has 3 solutions have anything to do with the fact that 8 is a perfect cube?\n",
"- What about the 7 solutions for 12? 12 has 6 factors; does that matter?\n",
"- The 9 perfect squares, 4 and 9, have 1 solution each; is that true of all perfect squares?\n",
"- The perfect squares 4 and 9 have 1 solution each; is that true of all perfect squares?\n",
"- Could we make this 10 times faster? 100 times?\n",
"- Could we handle greater values of *N* if we worked with [generating functions](https://en.wikipedia.org/wiki/Sicherman_dice)?\n",
"- What about Sicherman triples (3 nonstandard dice with the same distribution of sums as 3 standard dice)?\n",