NUMMIT #63 — TARGET 857

Loading…

Nummit #63 — target 857 (Hard)

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

About this puzzle

  • The numbers: 2 large (75, 25) and 4 small (10, 7, 5, 5).
  • The target: 857 is a prime number, so it can't be reached by multiplying two smaller whole numbers. The nearest starting number is 75, 782 away, so you have to build the target rather than start next to it.
  • Difficulty: It is rated Hard because the shortest route needs 4 operations and the target sits far from every starting number, so there is no quick shortcut.
  • Tip: With 75 and 25 on the board, try combining the large numbers first and fine-tune with the small ones.

Nummit #63 answer

Reveal solution

One shortest solution (4 steps)

  1. 1. 75 + 10 = 85
  2. 2. 5 + 5 = 10
  3. 3. 85 × 10 = 850
  4. 4. 7 + 850 = 857

In words

  1. Add 75 and 10 to make 85.
  2. Add 5 and 5 to make 10.
  3. Multiply 85 by 10 to get 850.
  4. Add 7 and 850 to make 857.

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

Puzzles from the same week

Helpful answers

Frequently asked questions

How hard was Nummit #63?
Nummit #63 (May 3, 2026) is rated Hard. The target was 857 and a shortest solution takes 4 steps. It is rated Hard because the shortest route needs 4 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 #63?
No. Nummit never requires every number. A shortest solution to this puzzle uses 5 of the six, and each number can be used once.
What were the numbers in Nummit #63?
25, 75, 7, 10, 5, 5, with a target of 857. The large numbers were 75 and 25.
Can I still play Nummit #63?
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.