A rabbit is packing lunches for his children. He had 90 carrots and 72 leaves of lettuce. If he is giving each bunny the same number of carrots and the same number of leaves of lettuce, how many baby bunnies must he have? He will have no extra vegetables after he packs the lunches
To find the maximum number of baby bunnies the rabbit can have, we need to find the greatest common divisor (GCD) of 90 and 72.
To find the GCD, we can use the Euclidean algorithm:
Step 1: Divide 90 by 72, we get a quotient of 1 and a remainder of 18.
Step 2: Divide 72 by 18, we get a quotient of 4 and a remainder of 0.
Since the remainder is 0, we conclude that the GCD of 90 and 72 is 18.
Therefore, the rabbit must have 18 baby bunnies in order to give each bunny the same number of carrots and leaves of lettuce.