Est. March 8, 2026 • Independent • Daily • Free @the.chronicler.news thechronicler.ca

The Chronicler

“Today’s Record. Tomorrow’s Reference.”
🔢 Crunch — Daily Puzzle Archive
← Back to The Chronicler

The Crunch is The Chronicler’s daily number puzzle. Use all four numbers exactly once — with addition, subtraction, multiplication, division, and brackets — to reach the target. Every puzzle is computationally verified by Python across all permutations and bracket structures before publication.

This archive records every Crunch published since Vol. I, No. 15 (March 22, 2026), when the puzzle was introduced. Newest editions appear first.

🔍 Filter Puzzles
Latest Edition
Vol. I, No. 27 — Today Fri, April 10, 2026
3
5
6
8
Target 38
( 5 × 8 ) − ( 6 ÷ 3 ) = 40 − 2 = 38
Python-verified — 2 distinct solutions (commutative variants). All four numbers used exactly once.
Read edition →
Archive — Newest First
Vol. I, No. 26 Thu, April 9, 2026
2
5
7
9
Target 58
See edition for solution.
Python-verified. All four numbers used exactly once.
Read edition →
Vol. I, No. 25 Wed, April 8, 2026
4
6
7
9
Target 78
( 4 × 9 ) + ( 6 × 7 ) = 36 + 42 = 78
Python-verified — 8 distinct solutions. All four numbers used exactly once.
Read edition →
Vol. I, No. 24 Tue, April 7, 2026
2
4
6
9
Target 48
( 9 − 6 ) × ( 4 × 2 × 2 ) — see edition for full solution
Python-verified. All four numbers used exactly once.
Read edition →
Vol. I, No. 23 Mon, April 6, 2026
3
6
7
8
Target 54
(7 × 8) − (6 ÷ 3) = 56 − 2 = 54
Python-verified — 2 distinct solutions. All four numbers used exactly once.
Read edition →
Vol. I, No. 22 Sun, March 29, 2026
2
6
7
9
Target 99
(6 + 7 − 2) × 9 = 11 × 9 = 99
Python-verified — 16 distinct solutions. All four numbers used exactly once.
Read edition →
Vol. I, No. 21 Sat, March 28, 2026
3
6
8
9
Target 72
(6 + 9 ÷ 3) × 8 = (6 + 3) × 8 = 72
Python-verified — 20 distinct solutions. All four numbers used exactly once.
Read edition →
Vol. I, No. 20 Fri, March 27, 2026
5
7
11
22
Target 84
(5 × 11) + 7 + 22 = 55 + 29 = 84
Python-verified — 24 distinct solutions. All four numbers used exactly once.
Read edition →
Vol. I, No. 19 Thu, March 26, 2026
3
7
15
27
Target 96
(7 × 15) − (27 ÷ 3) = 105 − 9 = 96
Python-verified — 2 distinct solutions. All four numbers used exactly once.
Read edition →
Vol. I, No. 18 Wed, March 25, 2026
2
9
25
50
Target 116
50 × 2 + 25 − 9 = 100 + 25 − 9 = 116
Python-verified — 16 distinct solutions. All four numbers used exactly once.
Read edition →
Vol. I, No. 17 Tue, March 24, 2026
4
7
25
50
Target 103
(4 × 7) + 25 + 50 = 28 + 75 = 103
Python-verified — 24 distinct solutions. All four numbers used exactly once.
Read edition →
Vol. I, No. 16 Mon, March 23, 2026
4
6
7
25
Target 151
(7 × 25) − (4 × 6) = 175 − 24 = 151
Python-verified — 4 distinct solutions. All four numbers used exactly once.
Read edition →
Vol. I, No. 15 Sun, March 22, 2026
4
6
8
25
Target 112
⚠ No valid solution exists for this combination. Python verification confirms 0 solutions across all permutations and bracket structures. This was The Chronicler’s inaugural Crunch puzzle; the Python verification standard was introduced in subsequent editions to prevent recurrence.
Read edition →
No puzzles match your filter. Try adjusting the date range or resetting.
How Crunch Works

Each Crunch puzzle presents four numbers and a target. Using each number exactly once, combine them with any of the four standard arithmetic operations (+, −, ×, ÷) and any bracket arrangement to reach the target.

From Vol. I, No. 16 onward, every Crunch is verified computationally before publication: a Python script tests all permutations of the four numbers across all operator combinations and five distinct bracket structures, confirming at least one valid solution exists and recording the total solution count. The cleanest solution is selected for publication.

The solution count reflects mathematical distinctness — different orderings of numbers or operators that each independently reach the target. Higher counts generally indicate more approachable puzzles; counts of 2–4 are the most challenging.