You must find the factors of each number...
9 = 1, 3, 3, 9
6 = 1, 2, 3, 6
Next, determine the common multiple...
9 = 1, 3, 3, 9
6 = 1, 2, 3, 6
Therefore, the most groups Lavinia can make without any glasses or mugs left to spare is 3.
Since the hundred place is the 4 and the tens place is higher than 5 ( it is 7) to round to the hundreds place it would be 9500
Answer:
min = a_1
for i:= 2 to n:
if < min then min =
return min
Step-by-step explanation:
We call the algorithm "minimum" and a list of natural numbers
So lets first set the minimum to
min = a_1
now we want to check all the other numbers.
We can use a simple for loop, to find the minimum
min = a_1
for i:= 2 to n:
if < min then min =
return min
Answer:
Step-by-step explanation:
. 6
I think the answer is 8
but im not 100% sure