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:
36 questions were correct.
Step-by-step explanation:
In order to find how many questions correct, you have to multiply it :

Answer:
The solution of the equation is
⇒ 3rd answer
Step-by-step explanation:
* Lets explain how to solve this problem
- The function f(x) = e^x is called the (natural) exponential function
- The natural logarithm (㏑), or logarithm to base e, is the inverse
function to the natural exponential function
∵
is an exponential function
∴ We can solve it by using the inverse of e (㏑)
- Remember:
# 
# 
- Insert ln in both sides
∴ 
∵ 
∴ 2x + 5 = ㏑(4)
- Subtract 5 from both sides
∴ 2x = ㏑(4) - 5
- Divide both sides by 2 to find x
∴ 
* The solution of the equation is 
Please explain more your question
Your answer: A bakery uses 8 tablespoons of honey for every 10 cups of flour to make bread dough. Some days they bake bigger batches ...
brainly.com/question/18026512