Problem 4 (a) Three friends are packing sweets into gift boxes. They agree that each box should contain the same number of sweet

Question

Problem 4
(a) Three friends are packing sweets into gift boxes. They agree that
each box should contain the same number of sweets, but they are
each working in separate locations with their own pile of sweets so
cannot share boxes. Gwen has 286 sweets, Bill has 390 sweets and
Zeta has 468 sweets. If they put the largest number of sweets into
each box that they can and they use up all their sweets, how many
boxes of sweets will they pack?
(b) Use the Euclidean Algorithm to find the highest common factor of
8008 and 24255 (you need to show all working).

in progress 0
Thành Công 4 years 2021-07-22T05:50:10+00:00 1 Answers 49 views 0

Answers ( )

  1. dangkhoa
    0
    2021-07-22T05:51:23+00:00
    Reply

    Answer:

    a) 26

    b) 77

    Step-by-step explanation:

Leave an answer

Browse

Giải phương trình 1 ẩn: x + 2 - 2(x + 1) = -x . Hỏi x = ? ( )