NUMMIT #118 — TARGET 367
Loading…
Nummit #118 — target 367 (Hard)
This was the daily Nummit puzzle for June 27, 2026. The six numbers were 25, 75, 8, 2, 9, 1 and the target was 367. 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 (9, 8, 2, 1).
- The target: 367 is a prime number, so it can't be reached by multiplying two smaller whole numbers. The nearest starting number is 75, 292 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 #118 answer
Reveal solutionHide solution
One shortest solution (4 steps)
- 1. 25 × 2 = 50
- 2. 75 + 8 = 83
- 3. 9 × 50 = 450
- 4. 450 - 83 = 367
In words
- Multiply 25 by 2 to get 50.
- Add 75 and 8 to make 83.
- Multiply 9 by 50 to get 450.
- Subtract 83 from 450 to leave 367.
Other routes to 367 may exist; this is just one with the fewest steps.
Puzzles from the same week
Helpful answers
Frequently asked questions
- How hard was Nummit #118?
- Nummit #118 (June 27, 2026) is rated Hard. The target was 367 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 #118?
- 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 #118?
- 25, 75, 8, 2, 9, 1, with a target of 367. The large numbers were 75 and 25.
- Can I still play Nummit #118?
- 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.