Find the depth of water in the pond, Mathematics

A lotus is 2m above the water in a pond. Due to wind the lotus slides on the side and only the stem completely submerges in the water at a distance of 10m from the original position. Find the depth of water in the pond.

Ans: (x+2)2 = x2 + 102

x2 + 4x + 4 = x2 + 100

⇒ 4x + 4 = 100

x = 24

Depth of the pond = 24m


Posted Date: 4/8/2013 3:27:04 AM | Location : United States

Related Discussions:- Find the depth of water in the pond, Assignment Help, Ask Question on Find the depth of water in the pond, Get Answer, Expert's Help, Find the depth of water in the pond Discussions

Write discussion on Find the depth of water in the pond
Your posts are moderated
Related Questions

Two tangents TP and TQ are drawn to a circle with center O from an external point T.prove that angle PTQ=angle 2 OPQ

Figure shows noise results for a prototype van measured on a rolling road. The vehicle had a four-cylinder-in-line engine. The engine speed was varied in 3rd gear from just above

1) Find the are length of r(t) = ( 1/2t^2, 1/3t^3, 1/3t^3) where t is between 1 and 3 (greater than or equal less than or equal) 2) Sketch the level curves of f(x,y) = x^2-2y^2

a. Cassie has seven skirts, five blouses, and ten pairs of shoes. How many possible outfits can she wear? b. Cassie decides that four of her skirts should not be worn to school.

Evaluate the given limit. Solution: In this question none of the earlier examples can help us. There's no factoring or simplifying to accomplish.  We can't rationalize &

How to Simplifying Square Roots ? To simplify square roots, 1. Factor the radicand into primes. 2. Circle each pair of like numbers. 3. For each pair of like numbers, place

Susan traveled 114 miles in 2 hours. If she remains going at the similar rate, how long will it take her to go the remaining 285 miles of her trip? There is a 1 in 6 chance of

If d is the HCF of 30, 72, find the value of x & y satisfying d = 30x + 72y. (Ans:5, -2 (Not unique) Ans:    Using Euclid's algorithm, the HCF (30, 72) 72 = 30 × 2 + 12

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