what is the name of this famous puzzle ? On Mon, Nov 22, 2010 at 2:57 PM, Salil Joshi <[email protected]>wrote:
> Hi, > The puzzle needs to be rephrased as: > "If the rank of the student who comes out of the classroom is better > than ranks of all students who came out before him/her, then he/she > gets a lollipop". > Rephrased this way, this is a famous puzzle, and the answer is > log(69). > > > > On Nov 22, 12:44 pm, shiva <[email protected]> wrote: > > If all the person got his rank increased except the first(he is last > > know) then > > > > 1. if the previous first ranked person stand front in queue then 69 > > lollipop need to be distributed. > > 2. other case 68 lollipop need to be distributed. > > > > On Nov 21, 9:46 pm, Shiv Shankar Prajapati <[email protected]> > > wrote: > > > > > Its total no. of Student i.e. 69. > > > If all the students ranking is increased then all the student will > get > > > the lollipop. But there is one student left who was at top n now on the > > > least ranking and as the condition is given that student may appear > first > > > and get the lollipop. So professor need will give 69 lollipop. in this > > > (worst) case. > > > > > On Sun, Nov 21, 2010 at 8:42 PM, Ashim Kapoor <[email protected]> > wrote: > > > > Do you mean if the rank of a student is better than the rank of the > prev > > > > student then he/she gets a lollipop? > > > > > > Thank you, > > > > Ashim > > > > > > On Sun, Nov 21, 2010 at 6:57 PM, vamsee marpu < > [email protected]>wrote: > > > > > >> Does anybody know the solution for the following problem : > > > > > >> *A headmaster of a primary school performs an activity with the > students > > > >> of a class to encourage them to perform better in academics. He asks > them to > > > >> stand in queue, starts calling the students out one by one and asks > them > > > >> their rank in class. Each one has a unique rank in class. If the > rank of a > > > >> student is better than his/her previous best rank, then he awards > him/ her a > > > >> lollipop (students love lollipops). Note that the first one in the > queue > > > >> will always get a lollipop and the students arrange themselves in > random > > > >> order in the queue. What is the expected number of lollipops the > headmaster > > > >> will have to distribute among students if the total number of > students in > > > >> the class is 69? Note that the answer can be a fractional number.* > > > > > >> Thanks and Regards, > > > >> M. Vamsee > > > > > >> -- > > > >> 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]<algogeeks%[email protected]> > <algogeeks%[email protected]<algogeeks%[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]<algogeeks%[email protected]> > <algogeeks%[email protected]<algogeeks%[email protected]> > > > > > > . > > > > For more options, visit this group at > > > >http://groups.google.com/group/algogeeks?hl=en. > > > > > -- > > > With Regards, > > > > > Shiv Shankar, > > -- > 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]<algogeeks%[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.
