NUMMIT #204 — TARGET 759

Loading…

Nummit #204 — target 759 (Hard)

This was the daily Nummit puzzle for September 21, 2026. The six numbers were 25, 50, 7, 1, 5, 4 and the target was 759. It is rated Hard, and the shortest solution takes 5 steps. Playing it here is practice mode, so it won't change your daily streak.

About this puzzle

  • The numbers: 2 large (50, 25) and 4 small (7, 5, 4, 1).
  • The target: 759 = 3 × 11 × 23. The nearest starting number is 50, 709 away, so you have to build the target rather than start next to it.
  • Difficulty: It is rated Hard because the shortest route needs 5 operations and the target sits far from every starting number, so there is no quick shortcut.
  • Tip: With 50 and 25 on the board, try combining the large numbers first and fine-tune with the small ones.

Nummit #204 answer

Reveal solution

One shortest solution (5 steps)

  1. 1. 25 + 50 = 75
  2. 2. 7 + 4 = 11
  3. 3. 1 + 5 = 6
  4. 4. 75 - 6 = 69
  5. 5. 11 × 69 = 759

In words

  1. Add 25 and 50 to make 75.
  2. Add 7 and 4 to make 11.
  3. Add 1 and 5 to make 6.
  4. Subtract 6 from 75 to leave 69.
  5. Multiply 11 by 69 to get 759.

Other routes to 759 may exist; this is just one with the fewest steps.

Puzzles from the same week

Helpful answers

Frequently asked questions

How hard was Nummit #204?
Nummit #204 (September 21, 2026) is rated Hard. The target was 759 and a shortest solution takes 5 steps. It is rated Hard because the shortest route needs 5 operations and the target sits far from every starting number, so there is no quick shortcut.
Do I have to use all six numbers in Nummit #204?
No. Nummit never requires every number. A shortest solution to this puzzle uses 6 of the six, and each number can be used once.
What were the numbers in Nummit #204?
25, 50, 7, 1, 5, 4, with a target of 759. The large numbers were 50 and 25.
Can I still play Nummit #204?
Yes. The board above is this exact puzzle in practice mode, so it doesn't affect your daily streak. You can check your answer afterwards by opening the solution on this page.