When is the J(n) = n/2 true? (Josephus problem) - Discrete Mathematics #4

In the 4th exercise of the "Discrete math" series we will find out for which n the Josephus number is n/2. We will find the conditions and afterwards proof a special requirement by induction.

⏰ Timeline 00:00 Exercise 00:14 Josephus problem 00:58 Exercise goal 01:30 Finding requirements 03:06 Why we are not done yet 03:23 When is r a whole number? 04:46 Proof by induction 08:19 Conclusion 08:37 Example

🔗 Useful links https://youtu.be/uCsD3ZGzMgE

🔢 Formula J(n) = n / 2

🖼️ Thumbnail icon credits Collaboration icon made by mynamepong from www.flaticon.com Swords icon made by Freepik from www.flaticon.com ... https://www.youtube.com/watch?v=fz_P7a8XaYc