There are infinite solutions to this problem. Say x flowers are plucked and y flowers are offered in each temple. then -
2(2(2(2x-y) -y) -y) -y =0 i.e. 16x-15y=0; any pair the x and y satisfying this equation is a solution.Smallest numbers are 15, 16 as Abhishek told. Thanks, - Ravindra On Wed, Mar 16, 2011 at 4:37 PM, abhishek agrawal <[email protected]>wrote: > Total Flowers plucked = 15 > Flowers offered at each temple = 16 > > > On Wed, Mar 16, 2011 at 3:44 PM, bittu <[email protected]> wrote: > >> There is a lake, of square shape. There are four temples on each >> corner. There is a flower tree next to, say temple no 1. The pond has >> this magic power, if a flower is dip into the water it doubles the >> quantity. There is a warning note from the priest, saying "No flower >> should be wasted". >> >> So the puzzle is, how many flowers should be plucked from the tree and >> should be offered in the temple and after offering at each temple, no >> flower should be left. Each temple has to be offered the same number >> of flower. Before offering, flowers has to be dipped in to the pond to >> get it double, as he can pluck the flowers from the tree only once, so >> he has to be carefull in choosing, the total number of flowers >> >> >> >> Thanks >> Shashank >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to [email protected]. >> To unsubscribe from this group, send email to >> [email protected]. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> >> > > > -- > Abhishek Agrawal > > +919533890833 > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
