The answer is thanks a lot
Answer:
35
Step-by-step explanation:
2(-5)^2+3(-5)
=2(25)+(-15)
=50-15
=35
PLS GIVE BRAINLIEST
Yes, 23 has an inverse mod 1000 because gcd(23, 1000) = 1 (i.e. they are coprime).
Let <em>x</em> be the inverse. Then <em>x</em> is such that
23<em>x</em> ≡ 1 (mod 1000)
Use the Euclidean algorithm to solve for <em>x</em> :
1000 = 43×23 + 11
23 = 2×11 + 1
→ 1 ≡ 23 - 2×11 (mod 1000)
→ 1 ≡ 23 - 2×(1000 - 43×23) (mod 1000)
→ 1 ≡ 23 - 2×1000 + 86×23 (mod 1000)
→ 1 ≡ 87×23 - 2×1000 ≡ 87×23 (mod 1000)
→ 23⁻¹ ≡ 87 (mod 1000)
2/5 van not be simiplified because 2 and 5 dont have a common factor lower than them
5. B, The answer is the only one that is false
6. G, Only reasonable answer
7. D, 3/5 is equivelant to 180/300
Hope this helps :D
