Add Wolfram Mathematica notebook solving the 27-matchstick division puzzle

[Copilot]

88 ÷ 31 = 14 uses 27 matchstick segments (7-segment display digits) but is mathematically invalid. The task is to rearrange those 27 segments into a valid equation with no segments added or removed.

Changes

• New cerillos.nb — Mathematica notebook that:
  • Defines a segment-count lookup for digits 0–9
  • Verifies the original equation's segment total (27) and invalidity
  • Exhaustively searches A ÷ B = C for all integer triples ≤ 999 where contarSegmentos(A) + contarSegmentos(B) + contarSegmentos(C) == 27
  • Presents all solutions in a grid; isolates 2-digit ÷ 2-digit results

Key findings

8 solutions preserve the 2-digit ÷ 2-digit structure; the closest to the original (keeping 88 unchanged):

Equation	Segments
88 ÷ 44 = 2	14 + 8 + 5 = 27 ✓
68 ÷ 34 = 2	13 + 9 + 5 = 27 ✓
86 ÷ 43 = 2	13 + 9 + 5 = 27 ✓
66 ÷ 22 = 3	12 + 10 + 5 = 27 ✓

In 88 ÷ 44 = 2: divisor 31→44 (digit 3 gains a segment to become 4; digit 1 gains two segments to become 4) and result 14→2 (digit 1 disappears; digit 4 loses one segment to become 2). Net segment delta: zero.

segmentos = <|0->6, 1->2, 2->5, 3->5, 4->4, 5->5, 6->6, 7->3, 8->7, 9->6|>;
contarSegmentos[n_Integer] := Total[segmentos /@ IntegerDigits[n]]

(* Search: all valid A÷B=C with 27 total segments *)
Reap[Do[
  If[Divisible[a,b] &&
     contarSegmentos[a] + contarSegmentos[b] + contarSegmentos[a/b] == 27,
     Sow[{a, b, a/b}]],
  {a,1,999}, {b,1,a}]]

---

🔒 GitHub Advanced Security automatically protects Copilot coding agent pull requests. You can protect all pull requests by enabling Advanced Security for your repositories. Learn more about Advanced Security.