A magician deposits the same number of rabbits (at least one) at each of five houses. To get to the first house he crosses a magic river once, and to get to any house from another, he also crosses a magic river once. Each time he crosses a magic river, the number of rabbits he has doubles. He has no rabbits left when he leaves the fifth house. What is the minimum number of rabbits he could have at the start?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Why can't 1
Log in to reply
If we start with 1, thrn one rabbit will remain....and the question states that he is left with no rabbits at the end...
? Could you please clarify as to what you mean?
i cant understand the last two sentences -.-
Log in to reply
Ah, well, if you look at the final equation after crossing the last river, it turns out to be 32x - 31y = 0. So the question to be asked is "What positive integer value of x and y will make this equation 0?" Well, there are many solutions, but we are asked to find the smallest of said solutions. Thus we must find the least common multiple of 31 and 32. Since 31 is prime, the lowest multiple must be 31*32, or 992. Thus when 31 is substituted for x, and 32 for y, the equation is found to be true. The reason it must be 31 for x and 32 for y is because no other value lower than that will be true for the above equation.
Draw a diagram to visualize the problem as in the picture.
We will need to give k rabbits at every house, so the number of rabbits the magician has is k at the last house.
We can work backwards, and find that the number of rabbits the magician has when he starts is in the form 1 6 3 1 k .
Since the number of rabbits is an integer and it must be the minimum, k = 1 6 and 1 6 3 1 × 1 6 = 1 6
Exactly what I did!!
Suppose we have x rabbits in the beginning and we deposit y rabbits in every house. After deposit in the 1st house, we have x-y rabbits. After crossing 1st bridge we have 2(x-y) rabbits. After crossing 2nd bridge, we have 2(2(x-y)-y) rabbits and so on after deposit in the 5th house, we have the equation : 2(2(2(2(x-y)-y)-y)-y)-y=0. (because no rabbits left in the end) thus, 16x - 31y=0. Here, we must find the smallest value of x and y which are also integers. Here we find x= 31 and y=16. So, the number of rabbits in the beginning is 31.
let us suppose "x' no. of rabbits are given at each house
and 'y' be the min. no. of rabbits he takes,
then from last(5th) house after giving 'x' rabbits he is left with 0 rabbits , before crossing 5th river he must be having x/2 rabbits
and he gave 'x' rabbits at 4th house so after crossing 4th river he would have 'x+x/2' ,i.e.,' 3x/2' rabbits ,
before crossing 4th river,
he would have '3x/4' rabbits ,
after crossing 3rd river
he would have 3x/4+x = 7x/4 rabbits
before crossing 3rd river,
he would have '7x/8' rabbits ,
after crossing 2nd river
he would have
7x/8+x = 15x/8 rabbits
before crossing 2nd river,
he would have '15x/16' rabbits ,
after crossing 1st river
he would have
15x/16+x =31x/16 rabbits
before crossing 1st river,
he would have '31x/32' rabbits ,
31x/32=y
:x/y=32/31
for least no. of rabbits to be taken
x &y must be co-primes
so 'y' =31 rabbits
Problem Loading...
Note Loading...
Set Loading...
x represents the amount of rabbits before the crossing of the first river. After crossing the river, the number of rabbits double, and he deposits "y" rabbits into the first house. Thus he has 2x - y rabbits left. Once he crosses the next river this quantity is doubled. Now he has 4x - 2y rabbits, and again deposits y" rabbits into the house, leaving him with 4x - 3y rabbits. This process is repeated until he reaches the fifth house, where he finally has 32x - 31y rabbits, which is given to be 0. Thus, since 31 is prime, x must be 31, and y must be 32. This is the smallest amount of rabbits that the magician can begin with to satisfy this problem, because the least common multiple between 31 and 32 involves both 31 and 32.
x 2 x − y 4 x − 3 y 8 x − 7 y 1 6 x − 1 5 y 3 2 x − 3 1 y = 0
Thus, the minimum number of rabbits the magician can start with is:
3 1