1 modulo 9 is the set of numbers as follows:
(0(9) + 1), (1(9) + 1, ....)
which is:
1, 10, 19
All we have to do is divide 1000 by 9, and round down.
1000/9 = 111.111......
There are 111 numbers.
Now let us check our work.
the set is as follows:
(1,10,19, ....... (111)9 +1)
(1, 10, 19 ........ 1000)
We are within 1000.
Therefore, 111 of the 1000 smallest positive integers are congruent to 1 modulo 9.
Answer:
6 containers needed
Step-by-step explanation:
Given
----- Size
----- Size
Required
Determine the number of containers needed
This question illustrates the knowledge of fraction and division.
To get the number of containers needed, we simply divide the total size by the size of the container as follows;
Convert to improper fractions
--- Approximated
So you basically add all the numbers together multiply them by 100& divide by 54
Answer:4/5
Step-by-step explanation:
I think it's 4/5 because the number 3 is only one number of 5. And if you subtract 5-1, you'll get 4.
