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: the number of cookies sold must be greater than or equal to 800
Step-by-step explanation:
Let x represent the number of cookies made and sold in a month.
The cookie factory has a fixed cost of $300 per month plus $.45 for each cookie. This means that the total cost of producing x cookies in a month would be
300 + 0.45x
Each cookie sells for $.95. This means that the total revenue from selling x cookies would be
0.95x
Profit = Revenue - cost
Therefore, the number of cookies that must be sold during one month for the profit to be at least $100 would be
0.95x - (300 + 0.45x) ≥ 100
0.95x - 300 - 0.45x ≥ 100
0.95x - 0.45x ≥ 100 + 300
0.95x - 0.45x ≥ 100 + 300
0.5x ≥ 400
x ≥ 400/0.5
x ≥ 800
Answer:
5)102,78
6)56,56
<em><u>See</u></em><em><u> </u></em><em><u>THE</u></em><em><u> </u></em><em><u>IMAGE</u></em><em><u> </u></em><em><u>FOR</u></em><em><u> </u></em><em><u>SOLUTION</u></em><em><u> </u></em>
Answer:
10x+23 (pretty sure) and the * means multiply
Step-by-step explanation:
Answer:
32
Step-by-step explanation:
