MFaulkner wrote:I just cannot conceptualize why the GCF is the answer to this problem.

Hi Michael,

Any common factor would tell you one way in which the flowers can be broken down into identical bouquets. For simplicity's sake, suppose we had 30 whites and 42 reds. The common factors of 30 and 42 (other than 1) are 2, 3, and 6. This means that these flowers can be broken down into any of the following identical bouquets:

• 2 bouquets of 15 whites and 21 reds

• 3 bouquets of 10 whites and 14 reds

• 6 bouquets of 5 whites and 7 reds

So if we're interested in how to group flowers into identical bouquets, we're really interested in finding a common factor to the number of whites and the number of reds. Notice from the example above that if we want a lot of bouquets, then we should use a greater common factor since the common factor dictates how many bouquets will be formed.

Thus to answer your question, which asks for the greatest number of identical bouquets possible, we need the greatest common factor of 21 and 91. This is why the answer is GCF(21,91) = 7.

Hope that makes sense,
-Patrick

^^Great explanation! Thank you very much.

Even though I am very comfortable with finding the GCF and LCM, I have never conceptualized as it is required for this problem.

Again, great explanation.

*tip of the hat

If you can't immediately conceptualize this then you can solve it like a word problem(Not as effective as the explanation above)

21/x=91/y (No flower can be left out)

Cross multiply: y/x = 91/21 = 13/3

For every 13 red we have 3 white...

Using the smaller number, we can see that we must have 7

GCF works best though...