Max can paint a house in 3 hours. Saria can paint a house in 5 hours. working together, how long will it take both Saria and Max to paint a house?

Posted Date: 1/31/2013 1:52:56 PM | Location : United States

Ask an Expert

Related Discussions:- Problem Solving, Assignment Help, Ask Question on Problem Solving, Get Answer, Expert's Help, Problem Solving Discussions

Write discussion on Problem Solving
Your posts are moderated

Write your message here..

Related Questions

Proof of limit comparison test - sequences and series, Proof of Limit Compa... Proof of Limit Comparison Test As 0  Now, as   we know that for large enough n the quotient a n /b n should be close to c and thus there must be a positive integer

Parabola, what''s it? what''s it?

Factorization, 143 143

Linear programming, function [x, z] = readSolution(tableau, basis) function [x, z] = readSolution(tableau, basis)

rules for solving linear in-equations - linear algebra, Explain what are t... Explain what are the Rules for solving linear in-equations?

Principle of superposition, If y 1 (t) and y 2 (t) are two solutions to a... If y 1 (t) and y 2 (t) are two solutions to a linear, homogeneous differential equation thus it is y (t ) = c 1 y 1 (t ) + c 2 y 2 (t )   ........................(3) Remem

Laplace transforms, In this section we will be searching how to utilize Lap... In this section we will be searching how to utilize Laplace transforms to solve differential equations. There are various types of transforms out there into the world. Laplace tran

Write as denominator standard form, 2 -5power 2 -5power

Simple random sampling, Simple Random Sampling It refers to the samplin... Simple Random Sampling It refers to the sampling technique whether each and every item of the population is described an equal chance of being included in the sample. Because s

Define a complete lattice, Define a complete lattice and give one example. ... Define a complete lattice and give one example. Ans:  A lattice (L, ≤) is said to be a complete lattice if, and only if every non-empty subset S of L has a greatest lower bound