Answer:
78.38
Step-by-step explanation:
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)
Let c represent the weight of cashews and p the weight of pecans.
Then c + 10 = total weight of the nut mixture.
An equation for the value of the mixture follows:
$1.50(10 lb) + $0.75c = (c+10)($1.00)
Solve this equation for c: 15 + .75c = c + 10. Subtract .75c from both sides:
15 = 1c - 0.75c + 10. Then 5=0.25c, and c = 5/0.25, or 20.
Need 20 lb of cashews.
Check: the pecans weigh 10 lb and are worth $1.50 per lb, so the total value of the pecans is $15. The total value of the cashews is (20 lb)($0.75/lb), or $15. Does (20 lb + 10 lb)($1/lb) = $15 + $15? Yes. So c= 20 lb is correct.
Answer:
hard
Step-by-step explanation:
I don't know because I have never learnt these things
Answer:
Step-by-step explanation:
