# Manny makes dinner using 1 box of pasta and 1 jar of sauce. If pasta is sold in pckages of 6 boxes and sauce is sold in packages of 3 jars, what is the least number of dinners that Manny can make without any supplies left over?

## The answer is 6. If it takes 1 box of pasta AND 1 jar of sauce to make ONE dinner, and we want to know the least number of dinners that Manny can make without any supplies left over, if: pasta is sold in packages of 6 boxes and sauce is sold in packages of 3 jars.... Then, because we have to have a complete package of pasta for one dinner, but do not necessarily need an entire jar of sauce, the answer is 6 dinners, since pasta is sold with 6 in one package (we could use only 1/2 jar of sauce per dinner).

## When finding the answer to this type of question, the key word is "least". This tells us that we are looking for the least common multiple of the two numbers. So, to find the answer, you write out the multiples of both numbers, until you find the first match. That is your least common multiple. For the number 6, we have 6,12,18,24,36... and for the number 3 we have 3,6,9,12,15... So we see that 6 is the first common number and that's your answer.

## Donβt look at this

## Thx that really helped

## Ty for the answer πππ

## You're welcome! If you have any more questions, feel free to ask.

## To find the least number of dinners Manny can make without any supplies left over, we need to find the least common multiple (LCM) of the number of boxes of pasta and jars of sauce.

First, let's determine the number of boxes and jars Manny has:

- Boxes of pasta: 1

- Jars of sauce: 1

To find the LCM, we need to look at the factors of each number:

Factors of 1: 1

Factors of 1: 1

The LCM is the smallest number that is divisible by both of these numbers. In this case, it is simply 1.

Therefore, Manny can make 1 dinner without any supplies left over.