GOZUNTA
Try it now
Problem preview
MF.NS.5 Challenge MF-005-A12-V03

Find factors, multiples, common factors, and common multiples to solve numerical and contextual problems.

Test candidates against factor and multiple conditions

Problem

Two machines beep on repeating schedules. One beeps every \(6~\text{minutes}\), and the other beeps every \(9~\text{minutes}\). The factory wants check-in times that fit all the rules below.

Possible check-in times after the start of the shift: \(18~\text{minutes}\), \(24~\text{minutes}\), \(30~\text{minutes}\), \(36~\text{minutes}\), \(48~\text{minutes}\)

Rules:
- The time must be a common multiple of \(6\) and \(9\).
- The time must also be a factor of \(72\).

List all possible check-in times that work.

Blank table for possible check-in times 18, 24, 30, 36, and 48 minutes. The columns are Time after start, Common multiple of 6 and 9, Factor of 72, and Works. A short note above reminds students that the machines beep every 6 minutes and every 9 minutes. Open full size
Inside Gozunta

Turn the preview into practice.

More than a preview

Gozunta lets you study this problem—and more than 10,000 others.

Create targeted learning sessions, use hints, check your answer, read the walkthrough, watch the video, print the work, and track your progress.

Discover Gozunta Try it now
Four variants of this problem type
Curriculum context
Standard
MF.NS.5
Category
Number Sense
Domain
Whole-Number Structure
Objective
Find factors, multiples, common factors, and common multiples to solve numerical and contextual problems.
Problem type
Test candidates against factor and multiple conditions