Solving algebraic word problems, Mathematics

Assignment Help:

Solving Algebraic Word Problems:

What are the capacities of two water storage tanks in a nuclear facility if one holds 9 gallons less than three times another, and their whole capacity is 63 gallons?

Solution:

Step 1. Let x = Capacity of the Smaller Tank

Step 2. Then, 3x - 9 = Capacity of the Larger Tank

Step 3. Total Capacity = Capacity of the Smaller Tank + Capacity of the Larger Tank

63 = x + (3x - 9)

Step 4. Solving for x:

x + (3x - 9)      = 63

4x - 9 = 63

4x = 63 + 9

4x = 72

x = 18

Solving for the other unknown:

3x - 9  = 3(18) - 9

3x - 9  = 54 - 9

3x - 9  = 45

Answer:         

Capacity of the Smaller Tank = 18 gallons

Capacity of the Larger Tank = 45 gallons

Step 5. The larger tank holds 9 gallons less than three times the smaller tank.

3(18) - 9 = 54 - 9 = 45

The total capacity of the two tanks is 63 gallons.

18 + 45 = 63

Therefore, the answers check. 


Related Discussions:- Solving algebraic word problems

Actual solution to a differential equation, The actual solution is the spec...

The actual solution is the specific solution to a differential equation which not only satisfies the differential equation, although also satisfies the specified initial conditions

Geometry, #pqrs is a parallelogram its adjacent side is 2:1.state tHE angle...

#pqrs is a parallelogram its adjacent side is 2:1.state tHE angles

Find the area of the shaded region, ABC is a right angled triangle in which...

ABC is a right angled triangle in which ∠A = 900. Find the area of the shaded region if AB = 6 cm, BC=10cm & I is the centre of the Incircle of ?ABC. Ans: ∠A =90 0 BC

How much, If one acre costs $2500 how much does .39 of an acre cost

If one acre costs $2500 how much does .39 of an acre cost?

Linear programming, Consider the following linear programming problem: M...

Consider the following linear programming problem: Min (12x 1 +18x 2 )             X 1 + 2x 2 ≤ 40             X 1 ≤ 50             X 1 + X 2 = 40             X

Prove that prims algorithm produces a minimum spanning tree, Prove that Pri...

Prove that Prim's algorithm produces a minimum spanning tree of a connected weighted graph. Ans: Suppose G be a connected, weighted graph. At each iteration of Prim's algorithm

AREA, How do you find the distributive property any faster?

How do you find the distributive property any faster?

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd