suppose u r writing (2n+1) numbers starting from 1 i.e. 1,2,3,4,.....(2n+1) around a circle. You are now doing an operation that is as follows:::::you will delete the alternating numbers when you have come to the position where you have started writing the numbers i.e. ,think, u have written upto 17 and then comes the number 1 so keeping 1 as it is you delete the number 2,4,6,.... and when you delete 16 ,a cycle is covered and keep 17 as it is and then you will delete alternatingly the remaining numbers .you will find that after all operation there would be only one number left.find that particular number in general cases and in terms of "n" ...i told you an example taking (2n+1)=17 before...

## Comments

Sort by:

TopNewestYour procedure is unclear. In your example you keep 1 the first time around and the second time you keep the 17 which is not at the beginning the circular list. Please clarify. – Francisco Rivera · 3 years, 11 months ago

Log in to reply

– Sayan Chowdhury · 3 years, 11 months ago

please please see the picture i uploaded as my picture ....you would get the ideaLog in to reply

– Sayan Chowdhury · 3 years, 11 months ago

i am giving you a picture of the procedure my email is metronetizen@gmail.com please give your email to send that pictureLog in to reply

This is the well-known Josephus Problem. As Wikipedia mentions, this is also important in computer science specifically as a classic example of "circular linked-list".

Peace. AD. – Abhishek De · 3 years, 11 months ago

Log in to reply

i am giving you a picture of the procedure my email is metronetizen@gmail.com please give your email to send that picture – Sayan Chowdhury · 3 years, 11 months ago

Log in to reply