Confirming your payment

Skip to content

Competency-Based Questions (CBQ) · Question 14 of 40

Rohan wants to split 24 red crayon boxes and 36 blue crayon boxes into the largest number of identical gift sets.

Question 142 marksMedium

Rohan wants to split 24 red crayon boxes and 36 blue crayon boxes into the largest number of identical gift sets. His "gcd method" for m≤nm \le n is: list the divisors of the smaller number mm, and report the largest divisor that is less than or equal to nn.

(i) What does Rohan's method report for 24 and 36? Explain why this answer does not fit the definition of gcd.

(ii) Find the correct gcd and say how many gift sets he can make.