From 19d2b079e298ae9774a76986edb99cca4ed601bb Mon Sep 17 00:00:00 2001 From: Peter Norvig Date: Wed, 2 Sep 2026 16:56:45 -0700 Subject: [PATCH] Refactor questions about solutions in Sicherman Dice Rephrase questions regarding solutions for composite and perfect square numbers. --- ipynb/Sicherman Dice.ipynb | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) diff --git a/ipynb/Sicherman Dice.ipynb b/ipynb/Sicherman Dice.ipynb index 14bdd25..1329cff 100644 --- a/ipynb/Sicherman Dice.ipynb +++ b/ipynb/Sicherman Dice.ipynb @@ -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",