
লেক সার্কাস, কলাবাগান
📍 Location: লেক সার্কাস, কলাবাগান ...

📍 Location: লেক সার্কাস, কলাবাগান ...
#cloud ...
#rain ...

Sunset view from Campus ...

On boat at Sonargaon lake. #sonargaonmuseum #sonargaon ...

...

📍 Location: বাঁশবাড়ি, লালমাটিয়া ...

📍 Location: মধ্যপাড়া, দক্ষিণ খান #dhakarainfact #morningdhakarain ...
Introduction The Josephus Problem is a count-out game which is regarded as a theoretical problem in Computer Science or Mathematics. In this game, n people stand in a circle s is the starting number of people. s is holding a sword where s kills s+k-1’th people from his position and gives his sword to s+k’th people. Thus s+k becomes new s. Going in the same direction this procedure is repeated until one person is left. Remaining one person is marked as a winner. The gif below explains the procedure. Here n = 12, k = 3 & s = 1. ...
Explanations: N straight lines are drawn on a plane paper. Each line intersects with rest all lines. That means N’th line intersects N-1 lines. You can assume infinite number of lines can be drawn on that paper. You have to find total regions after N lines are drawn. An image is given below to understand the problem clearly. Solve Approach: From above picture we see that base case L[0] = 1 (here, L = Lines). Whenever a line is drawn it intersects all other lines. Lets try to find the pattern from the picture. L[1] = 2, When 1st line is drawn it intersects 0 line. So, L[1] = 1+L[0] = 1. When 2’th line is drawn it intersects 1 lines. So, L[2] = 2+L[1] . Because when intersecting 1 line it creates 2 new regions. You can see for yourself by drawing on text paper. Again, when 3rd line is drawn it intersects 2 lines and creates 3 new regions. Thus, L[3] = 3+L[2]. From observation we see that, when N’th line is drawn and it intersects N-1 lines and creates N new regions. The total regions become new regions + old regions. So, for N lines, L[n] = N+L[n-1]. To know answer of L[n] we need to know L[n-1], To know L[n-1] we need to know L[n-2]….and in ending stage L[0]. Thus, we can say that recurrent solution exists for this problem. ...