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)
Answer:
76
its going by 15's so you add 15
Step-by-step explanation:
5x90=450
700-450=250
250/5=50
50 more tickets.
i don't know if that's in an inequality form or not. but that's how many tickets
(a) the given triangle is a isosceles triangle, therefore the two leg sides will be congruent, as well as the two base angles. It is given that one of the base angles ∠XYW is 70°, therefore, due to the law of a isosceles triangle, the measurement of ∠XWY is also 70°. Remember, a triangle's interior angles add up to 180°, so:
180 - (70 + 70) = 180 - 140 = 40
40° is your answer.
m∠X = 40°
(b) All sides are congruent, making it a equilateral triangle. If it is a equilateral triangle, then all the angles also have the same measurement. The total of the interior angle's measurement is 180°. Divide by the amount of angles, 3:
180/3 = 60
60° is your answer.
m∠V = 60°
~
Answer:
What is it?
Step-by-step explanation:
