Answer:
Step-by-step explanation:
Answer:
101
Step-by-step explanation:
Note that
Here these two numbers have the common divisor 11. Find the least common multuply:
This means that the minimum number of games that Enzo could have played will be
Answer:
the answer is c
Step-by-step explanation: