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)
This stuff is way to hard
If you just want to know what is the least common multiple of 20 and 15, it is 60. Usually, this is written as
lcm(20,15) = 60
Answer:
Arc DB = 146
x = 5
Step-by-step explanation:
Remark
The relationship between the large arc, the small arc and the intersecting angle is
1/2 (large arc - small arc) = intersecting angle.
Givens
Large arc = 25x + 21
Small arc = 96
5x
Solution
1/2*(25x + 21 - 96) = 5x*2 Multiply both sides by 2
25x + 21 - 96 = 10 x Combine
25x - 75 = 10x Subtract 25x from both sides
-75 = 10x - 25x
-15x = -75
x = 5
DB = 25x + 21
DB = 25*5 + 21
DB = 125 + 21
DB = 146
Tell me if this is not in the choices.
Answer:
No. The answer is 72
Step-by-step explanation:
As 12x6=72
