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)
The simplified answer would be 14x+17y-11
Less. If you multiple 1 2/5 by $2.99 you would get about $4.19. If you multiple 2 3/10 by $2.99 you would get about $6.88. If you add those together, you would get $11.07, which is less than $12.
Answer: There were 10 students in the class on the first day.
Step-by-step explanation:
Let x be the number of students of the first day.
Given: A college writing seminar increased its size by 50 percent from the first to the second day.
i.e. Number of students on second day = (Number of students on first day)+(50% of Number of students on first day)
= x +50% of x
= x+0.50x
= (1.50)x
=1.50x
Since, it is given that the total number of students in the seminar on the second day was 15.
i.e. 

Hence, there were 10 students in the class on the first day.