answer given by abhishek is the minimum no of flowers that need to be plucked
in general no of flowers = 15*x/16 where x is no of flowers to be offered in the temple so 15,16 30,32 45,48 .. .. all are possible infinite solutions On Wed, Mar 16, 2011 at 10:36 PM, Kunal Patil <kp101...@gmail.com> wrote: > I agree with Abhishek's solution... > > > On Wed, Mar 16, 2011 at 4:53 PM, ravindra patel > <ravindra.it...@gmail.com>wrote: > >> 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 < >> neo.iiita2...@gmail.com> wrote: >> >>> Total Flowers plucked = 15 >>> Flowers offered at each temple = 16 >>> >>> >>> On Wed, Mar 16, 2011 at 3:44 PM, bittu <shashank7andr...@gmail.com>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 algogeeks@googlegroups.com. >>>> To unsubscribe from this group, send email to >>>> algogeeks+unsubscr...@googlegroups.com. >>>> 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 algogeeks@googlegroups.com. >>> To unsubscribe from this group, send email to >>> algogeeks+unsubscr...@googlegroups.com. >>> 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 algogeeks@googlegroups.com. >> To unsubscribe from this group, send email to >> algogeeks+unsubscr...@googlegroups.com. >> 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 algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Sunny Aggrawal B-Tech IV year,CSI Indian Institute Of Technology,Roorkee -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
