Gcf/lcm word problems
solve the following porblems in your workbook on this question page oderno
highlight key words that tell you it is a gcf ol. cm question, as well as the key words
that tell you if you are dealing with tons or multiples
1) tim as bag of 36 orange flavoured wets and peter habag of pe
lavoured wees. they have to divide up the wees into small toys with equal number
of wets, each truy containing cither onge-lavoured or grape-thevouted vects only
if there is no reminder, find the largest possible number of sweets in each try
2) martinis pasting pieces of square colored paper of equal tonto a board
messing 72 cm by 90 cm. if only whole squate pieces are used, and the boud is to
be completely covered, find the largest possible length of the side of each square
lored paper
5) two wires with lengths of 448 cm and 616 cm are to be cut into pieces of all the
me length without reminder. find the greatest possible length of the pieces
janice and jasmine were cach given a piece of ribbon of equal length. janice cuts
her tibbons into equal lengths of 2m, while jasmine cuts her ribbons into equal
jengths of 5 m. if there was no remainder in both ches, find the shortest possible
length of ribbon given to them
5) on a track for remote controlled ricing cars, racing car a completes the track in 28
seconds, while ting car completes itin 24 seconds. if they both at the same
time, after how many seconds will they be side by side again?
pencils come in pacages of 10 ore come in packages of 12. philip wants to
archase the smallest number of pencil andersen so that he will have exactly 1
user per pencil. how many packages of pencils and enters should phillip boy!