Re: [algogeeks] Mathematics Puzzle

2010-11-22 Thread vamsee marpu
@Ashim : Yes


@Shiv Shankar : The Question says : *the students arrange themselves in
random order in the queue.

   *69* *is possible only when the students arrange
themselves in decreasing order of their rank.

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To post to this group, send email to algoge...@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.



[algogeeks] Mathematics Puzzle

2010-11-21 Thread vamsee marpu
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 algoge...@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.



Re: [algogeeks] Mathematics Puzzle

2010-11-21 Thread Ashim Kapoor
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 marpu.vam...@gmail.comwrote:

 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 algoge...@googlegroups.com.
 To unsubscribe from this group, send email to
 algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@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 algoge...@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.