tag:blogger.com,1999:blog-6886322164356510143.post3224758962706462298..comments2017-05-23T22:09:23.459+05:30Comments on Solve One Puzzle A Day: Boys and GirlsSumanhttp://www.blogger.com/profile/16003666190821812767noreply@blogger.comBlogger6125tag:blogger.com,1999:blog-6886322164356510143.post-43444608722669610332012-05-29T12:51:36.154+05:302012-05-29T12:51:36.154+05:30hey Vageesha,
its 2^10 [2 raised to the power of 1...hey Vageesha,<br />its 2^10 [2 raised to the power of 10].<br />-TechnoTechnoPrabhuhttp://www.blogger.com/profile/08087399932442188531noreply@blogger.comtag:blogger.com,1999:blog-6886322164356510143.post-51907575829129253952012-05-22T19:12:29.895+05:302012-05-22T19:12:29.895+05:30guys i couldm' understand this 2(n-1) means ho...guys i couldm' understand this 2(n-1) means how it 210 come and how its 1024 comes..<br />5 persons 5 seats how it is 16..<br /><br />Can you please explain me..vageesha jajurhttp://www.blogger.com/profile/13512108743420791635noreply@blogger.comtag:blogger.com,1999:blog-6886322164356510143.post-88089207555785846102012-04-05T02:59:04.656+05:302012-04-05T02:59:04.656+05:30It is a shame that you have 'proven' this ...It is a shame that you have 'proven' this with a method sometimes referred to as the Engineers Induction (it holds for P(2), it holds for P(3), so it holds for P(n) with n > 1). Jayant indeed provides an informal but nonetheless true proof to this problem: Since there are no open spaces between the boys and girls, each of the possible permutations of n persons would be situated either at the left side of the n + 1 theatre leaving a place at the extreme right or vice versa for the new person to sit down. So each of the permutations of n would provide two permutations at n + 1.<br /><br />In no way disrespect was meant though, I love puzzles like this!Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-6886322164356510143.post-62236584432133142632010-02-21T08:18:21.927+05:302010-02-21T08:18:21.927+05:30Amiable dispatch and this post helped me alot in m...Amiable dispatch and this post helped me alot in my college assignement. Thanks you seeking your information.Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-6886322164356510143.post-46752518306788793602007-11-16T06:12:00.000+05:302007-11-16T06:12:00.000+05:30P(1) = 1P(n) = 2*P(n-1), n > 1If a new member is a...P(1) = 1<BR/>P(n) = 2*P(n-1), n > 1<BR/><BR/>If a new member is added, then he can either sit on the extreme left of the already seated group, or to the extreme right...Jayanthttp://www.blogger.com/profile/09502265636397042024noreply@blogger.comtag:blogger.com,1999:blog-6886322164356510143.post-13801683798510383732007-11-15T06:56:00.000+05:302007-11-15T06:56:00.000+05:302 ways only if they start from the edge / 1024 way...2 ways only if they start from the edge / 1024 ways to do it.<BR/> (sitting order is considered)John Emmanuel Chiramelhttp://www.blogger.com/profile/09420469751977155127noreply@blogger.com