George bought a house for $210,000 and now it has increased in value by 8% how much more is the house worth?
1 answer:
You might be interested in
To graph it, just graph 
and 
and see where they intersect
I would like to solve it by using math and not graphing
if you don't want to see the math, just don't scroll down
the graphical meathod is above, first line, just read it
hmm
multiply both sides by -1
multiply both sides by
minus 1 from both sides and minus 6(3^x) from both sides
use u subsitution
we can rewrite it as
now factor
I mean use quadratic formula
for
so for 0=u^2-16u-1, a=1, b=-16, c=-1
remember that u=3^x so u>0
if we have u=8+√65, it's fine, but u=8-√65 is negative and not allowed
so therfor
if you take the log base 3 of both sides you get
if you use ln then
then
I would like to solve it by using math and not graphing
if you don't want to see the math, just don't scroll down
the graphical meathod is above, first line, just read it
hmm
multiply both sides by -1
multiply both sides by
minus 1 from both sides and minus 6(3^x) from both sides
use u subsitution
we can rewrite it as
now factor
I mean use quadratic formula
for
so for 0=u^2-16u-1, a=1, b=-16, c=-1
remember that u=3^x so u>0
if we have u=8+√65, it's fine, but u=8-√65 is negative and not allowed
so therfor
if you take the log base 3 of both sides you get
if you use ln then
then
Given:
Product A requires 7 board feet of wood and 4 lbs of wicker.
Product B requires 5 board feet of wood and 5 lbs of wicker.
Product C requires 4 board feet of wood and 3 lbs of wicker.
Available wood = 3000 board feet
Available wicker = 1400 lbs
Profit margin of A = $35 per unit
Profit margin of B = $42 per unit
Profit margin of C = $20 per unit
To find:
The linear programming problem for given situation.
Solution:
Let the number of units produced of products A, B and C are x, y and z respectively.
Product A Product B Product C Total
Board feet of wood 7 5 4 3000
wicker 4 5 3 1400
Objective function: Maximize
s.t.,
Board feet of wood :
Wicker :
Number of units cannot be negative. So, .
Therefore, the required LPP is
Maximize
s.t.,