The time it takes to multiply two matrices of size n is determined by the polyno

Question

The time it takes to multiply two matrices of size n is determined by the polynomial expression 2n^3 – n^2. Compute the number of operations required to run a program that multiplies two matrices of size 20.

Your company needs to temporarily hire a programmer to work on a project. Two proposed payment schemes for this work are as follows:
(1) A flat fee of $1,000, plus $20 per hour or (2) $25 per hour.
Set up and solve an inequality that would enable your company to determine possible job lengths (in hours) for which the person is paid less according to plan 1 than for plan 2.
(Hint: Set up two expressions and use an inequality to separate them for solving. Let x = the number of hours worked.)

Explanation / Answer

Two proposed payment schemes for this work are as follows: (1) A flat fee of $1,000, plus $20 per hour or (2) $25 per hour. Set up and solve an inequality that would enable your company to determine possible job lengths (in hours) for which the person is paid less according to plan 1 than for plan 2. Plan 1: P(x) = 20x + 1000 Plan 2: P(x) = 25x + 0 To solve for this we have to put the equations together and simplify. 25x = 20x + 1000 (solve for x) 25x - 20x = 1000 (brought 20x over to the left side making it oppositely charged) 5x = 1000 (solve for x) x = 1000 / 5 = 200 hours So, any number of hous greater than 200 would would be required if you wanted to save money and use plan 1 cause at that amount of money plan 1 would cost at 201 hours is $5020and plan b would cost $5025. I dont know what the 1st part of your question is asking but if you explain better I would be happy to work it out for you.

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.