Rohit is on his way to visit your Grandma, who lives at the end of the state.It's her birthday, and he want to give her the cakes that he has made.Between his place and her grandma house, he need to cross 7 toll bridges. Before you can cross the toll bridge, you need to give them half of the cakes you are carrying, but as they are kind trolls, they each give you back a single cake. How many cakes do rohit have to carry with him so he can reach his grandma home with exactly 2 cakes?
@dan815 @ganeshie8
we can write a function for n tolls
dy/dx=y/2+1
y(7)=2
let x be the number of tolls and y be the number of cakes
we solving for y(0)
not sure if using a continous function is valid though since its a discrete game
another simple way is to go backwards
\[a_{n+1} = \dfrac{a_n}{2} + 1\]
it looks like geometric series...
oh 2 cakes!??
u tricky bunny
is the answer just 2 cakes???
if he starts with 2 cakes no matter what hte toll, he can maintain 2 cakes at every end of hte toll
yes
there are other solutions too though probably
i have another problem if you alls re interested more probability
lol, dan.
Whoops, they return one cake. In that case, we'll have the + sign instead of the - sign.
Join our real-time social learning platform and learn together with your friends!