A gardener has 27 roses and 36 daisies. He plants an equal number of each type of flower in each row. What is the greatest possible number of roses in each row.
108
I miss 2015 2014 2013 2012
what is Darrel has 36 daisies and 54 roses. He
wants to put an equal number of daisies
and roses into vases. What is the
GREATEST number of daisies and roses
Darrel can put in each vase?
6 12
9 18
To find the greatest possible number of roses in each row, we need to find the greatest common divisor (GCD) of 27 and 36. The GCD represents the largest number that can evenly divide both 27 and 36.
There are several methods to find the GCD, but one common method is to use the Euclidean algorithm:
1. Divide the larger number (36) by the smaller number (27) and find the remainder.
36 ÷ 27 = 1 remainder 9
2. Now, divide the previous smaller number (27) by the remainder (9) and find the new remainder.
27 ÷ 9 = 3 remainder 0
3. Since the remainder is now 0, the GCD is the last non-zero remainder we obtained, which is 9.
Hence, the greatest possible number of roses in each row is 9.