Answer:
<h2>c = 9</h2>
Step-by-step explanation:

The mean is the average value of the numbers given in the series
The mode is the number that is appears more than any other number given in the series
Step-by-step explanation:
Given challenge is make a list of 5 numbers
The list of 5 number is = 8,10,12,15,15

so required mean is 12 has been computed
Mode = 15 ( the number 12 is appeared in two times 8,10,12,15,15)
Final answer
The required numbers are = 8,10,12,15,15
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 lowest term is
.
Solution:
Given expression is 
<u>To reduce this term to the lowest term:</u>

Multiply the numerator and denominator.

Now, divide the numerator and denominator by the greatest common factor.
Here 150 and 8 both have common factor 2.
So, divide numerator and denominator by 2.



Hence the lowest term is
.