GCF and LCM Story Problems Challenge

This video tutorial covers solving story problems using the Greatest Common Factor (GCF) and Least Common Multiple (LCM). It begins with an introduction to these concepts, followed by a detailed walkthrough of a GCF problem involving distributing skittles and Hershey bars into goodie bags. The tutorial then shifts to an LCM problem, using train schedules to illustrate the concept. The video concludes with a summary and practice problems for students to solve on their own.

Sheila has 28 skittle bags and 36 Hershey bars. What is the greatest number of goodie bags she can make?

• 4

• 5

• 6

• 7

How many skittles will be in each goodie bag if Sheila makes the greatest number of bags?

• 8

• 6

• 7

• 9

Tags

CCSS.3.OA.A.3

How many Hershey bars will be in each goodie bag if Sheila makes the greatest number of bags?

• 8

• 10

• 11

• 9

Tags

CCSS.3.OA.A.3

What is the first step in finding the GCF using the ladder method?

• Divide by 7

• Divide by 3

• Divide by 2

• Divide by 5

What is the GCF of 28 and 36?

• 5

• 4

• 3

• 2

How many total pieces of candy does Sheila have?

• 74

• 64

• 84

• 54

Tags

CCSS.2.OA.A.1

Train A makes a stop every 45 minutes and Train B every 60 minutes. How many minutes will pass before they meet?

• 150

• 135

• 180

• 120

How many loops will Train A make before meeting Train B?

• 4

• 3

• 5

• 2

Tags

CCSS.4.OA.C.5

How many loops will Train B make before meeting Train A?

• 5

• 2

• 3

• 4

Tags

CCSS.3.OA.D.9

Which type of problem involves finding when events will meet up again?

• Neither

• Both

• LCM

• GCF