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.
Hello there.
<span>How many solutions does the system of equations have y=5x+7 and 3y-15x=18
</span><span>B two
</span>
Turn 2 1/2 into an improper fraction by multiplying 2 by 2, then adding 1 to that number and using 2 as the new denominator. You get 5/2. Then make it the same denominator as the serving size by multiplying it by 2, or 2/1. You get 10/4. After that, see how many times 3 goes into 10. It’s 3, with 1 remaining. Therefore, he can make 3 1/4 servings, or 3, if you need an exact answer.
<h3>
Answer: 580 square cm</h3>
===================================================
Work Shown:
A = area of smaller rectangle
A = length*width
A = 35*22
A = 770
B = area of larger rectangle
B = length*width
B = 45*30
B = 1350
C = area of the border only
C = B - A
C = 1350-770
C = 580 square cm
