Daily Math Puzzle: 2026-05-21

Sharpen your mathematical thinking with fresh puzzles delivered daily.

🧩 New Puzzle Every Day — Free
← Back To Today
2026-05-21

An astronaut has four different colored helmets (red, blue, green, yellow) and four matching gloves (also red, blue, green, yellow). Over four consecutive days he will wear one helmet and one glove each day, using each helmet exactly once and each glove exactly once. However, on no day may the helmet and glove be the same color. How many possible ordered sequences of helmet‑glove pairs can the astronaut wear over the four days?

🔥 Build your streak — solve daily in the app
Solution
🧩

Never Miss a Daily Puzzle

Download TestPrepMagic and get push notifications for each day's puzzle. Build daily streaks and track your improvement.

Download Free App

Related Puzzles

Math Puzzle: 2026-05-20

In the ancient kingdom of Khar, two construction crews work on a defensive wall. Crew A has 10 workers and can lay 4 meters of wall each day. Crew B has 15 workers and can lay 6 meters of wall each day. The king orders a 100‑meter wall to be finished in exactly 5 days. The crews may reassign any number of workers from Crew B to Crew A (or vice‑versa) each day, but a worker can belong to only one crew on a given day. What is the minimum number of workers that must be moved from Crew B to Crew A each day to meet the deadline?

Math Puzzle: 2026-05-19

A tech startup has 8 identical promotional stickers to give to its three product teams: Alpha, Beta, and Gamma. Each team must receive at least one sticker, and no two teams may receive the same number of stickers. How many different ways can the stickers be distributed?

Math Puzzle: 2026-05-18

Eight teams are placed at equal intervals around a circular track, which forms the vertices of a regular octagon. Every pair of teams must play exactly one match, and each match is played on a straight line connecting the two teams’ positions. A "shortcut" match is defined as a match whose line is either a side of the octagon or the shortest possible diagonal (i.e., it skips exactly one vertex). How many shortcut matches are played in total?