Confirming your payment

Skip to content

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

A game designer shares 42 red gems and 70 blue gems into identical prize bags, making as many bags as possible.

Question 173 marksMedium

A game designer shares 42 red gems and 70 blue gems into identical prize bags, making as many bags as possible. She finds the gcd by keeping only one number, most-recent-common-divisor: it starts at 1, and for each k=2,3,…,42k = 2, 3, \ldots, 42, if kk divides both 42 and 70, it is updated to kk. She starts the trace table below.

Trace table with columns k, divides 42, divides 70 and most-recent-common-divisor; only the start value 1 is filled in

(i) For which values of kk is most-recent-common-divisor updated?

(ii) Counting each value of kk once, how many values does she check?

(iii) How many bags does she make, and what is in each bag?