Tim has a bag of 36 orange-flavored sweets and Peter has a bag of 44 grape-flavored sweets. They have to divide up the sweets into small trays with equal number of sweets; each tray containing either orange-flavored or grape-flavored sweets only. If there is no remainder, find the largest possible number of sweets in each tray.

The largest possible number of sweets in each tray is 4.

In order to determine the largest possible sweets in each tray, the highest common factor of the number of sweets have to determined. The highest common factor is the highest factor that is common to two or more numbers.

Factors of 36 =  1, 2, 3, 4, 6, 9, 12, 18, and 36.

Factors of 44 = 1, 2, 4, 11, 22, 44.

Common factors = 1, 2, 4

Highest common factor - 4  

To learn more about highest common factor, please check: link

Largest possible number of sweets in each tray

Step-by-step explanation:

Given:

Number of orange-flavored sweets = 36

Number of grape-flavored sweets = 44

To find: largest possible number of sweets in each tray

Solution:

HCF(highest common factor) of two or more numbers refers to the greatest number which can divide the given numbers

To find largest possible number of sweets in each tray, find the HCF(highest common factor) of 36 and 44.

So,

So,

Largest possible number of sweets in each tray

last one.

step-by-step explanation:

last one.

generally speaking, the others follow some sort of pattern that correlates to either linear (looks like a straight line) or sinusoidal (looks like an s).

the last one is just a random cloud of points that doesn't correlate to any particular known order.