A frog was at the bottom of an 80 m deep well. It attempted to come out of it by jumping. In each jump, it covered 1.15 m but slipped down by 0.75 m. The number of jumps after which it would be out of the well is:
199
We need to find the number of jumps a frog takes to escape an 80 m deep well.
In each jump cycle (jump up and slip down), the frog makes a net upward progress.
The frog escapes the well when its jump takes it to or past the 80 m mark. Importantly, if the frog reaches a height from which the next jump *alone* is sufficient to clear the well, it will not slip back from that final position.
Consider the height the frog needs to reach *before* its last jump. This height must be such that adding the jump height ($1.15 \, \text{m}$) reaches or exceeds the total depth ($80 \, \text{m}$).
Let $N$ be the total number of jumps required.
The number of jumps needed to reach or exceed the height of $78.85 \, \text{m}$ is calculated using the net gain per jump.
Number of jumps before the last one, let's call it $J$, must satisfy:
Since the number of jumps must be a whole number, the minimum integer value for $J$ (the number of jumps *before* the final one) is 198.
The total number of jumps $N$ is the sum of these preliminary jumps ($J$) plus the final jump.
After 198 jumps, the frog's height is:
On the 199th jump, the frog jumps $1.15 \, \text{m}$:
Since $80.35 \, \text{m} > 80 \, \text{m}$, the frog is out of the well on the 199th jump.
The smallest perfect square number divisible by each of 6 and 12 is:
The L.C.M. of two different numbers are 30. Which of the following cannot be their H.C.F.?
Which is the least four-digit number which when divided by 5, 6 and 8 leaves remainder 2 in each case?
The smallest perfect square number divisible by each of 6 and 12 is:
The L.C.M. of two different numbers are 30. Which of the following cannot be their H.C.F.?
Which is the least four-digit number which when divided by 5, 6 and 8 leaves remainder 2 in each case?