Answer:
question is not proper
Step-by-step explanation:
question is
Hello!
-3x-2=-3(3)-2=-9-2= -11
Therefore, The Correct Answer would be 100%:
"-11", Option "A".
I Hope my answer has come to your Help. Thank you for posting your question here in Brainly. We hope to answer more of your questions and inquiries soon. Have a nice day ahead! :)
First of all, the modular inverse of n modulo k can only exist if GCD(n, k) = 1.
We have
130 = 2 • 5 • 13
231 = 3 • 7 • 11
so n must be free of 2, 3, 5, 7, 11, and 13, which are the first six primes. It follows that n = 17 must the least integer that satisfies the conditions.
To verify the claim, we try to solve the system of congruences
Use the Euclidean algorithm to express 1 as a linear combination of 130 and 17:
130 = 7 • 17 + 11
17 = 1 • 11 + 6
11 = 1 • 6 + 5
6 = 1 • 5 + 1
⇒ 1 = 23 • 17 - 3 • 130
Then
23 • 17 - 3 • 130 ≡ 23 • 17 ≡ 1 (mod 130)
so that x = 23.
Repeat for 231 and 17:
231 = 13 • 17 + 10
17 = 1 • 10 + 7
10 = 1 • 7 + 3
7 = 2 • 3 + 1
⇒ 1 = 68 • 17 - 5 • 231
Then
68 • 17 - 5 • 231 ≡ = 68 • 17 ≡ 1 (mod 231)
so that y = 68.
3^3. if you're simplifying then you keep the base the smae but add the exponents since you are "multiplying" the bases
Answer:
13
Step-by-step explanation:
So first Subtract 100 from 250. Since you are trying to find out the amount of hours, you don’t need the tips to count.
The next step is too either do the equation 150 divided by 11.50 or you can multiply 11.50 by 13.
it’s not fourteen because 149.5 is closer to 150 then 161
Hope this helps