<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Mathematics on Adnatull's Blog</title><link>https://adnatull.github.io/tags/mathematics/</link><description>Recent content in Mathematics on Adnatull's Blog</description><image><title>Adnatull's Blog</title><url>https://adnatull.github.io/images/logo.jpg</url><link>https://adnatull.github.io/images/logo.jpg</link></image><generator>Hugo</generator><language>en-us</language><lastBuildDate>Thu, 08 Feb 2018 23:08:50 +0000</lastBuildDate><atom:link href="https://adnatull.github.io/tags/mathematics/index.xml" rel="self" type="application/rss+xml"/><item><title>The Josephus Problem</title><link>https://adnatull.github.io/dev/2018/02/08/the-josephus-problem/</link><pubDate>Thu, 08 Feb 2018 23:08:50 +0000</pubDate><guid>https://adnatull.github.io/dev/2018/02/08/the-josephus-problem/</guid><description>&lt;h3 id="introduction"&gt;Introduction&lt;/h3&gt;
&lt;p&gt;The &lt;strong&gt;Josephus Problem&lt;/strong&gt; is a count-out game which is regarded as a theoretical problem in Computer Science or Mathematics. In this game, &lt;strong&gt;n&lt;/strong&gt; people stand in a circle &lt;strong&gt;s&lt;/strong&gt; is the starting number of people. &lt;strong&gt;s&lt;/strong&gt; is holding a sword where &lt;strong&gt;s&lt;/strong&gt; kills &lt;strong&gt;s+k-1&lt;/strong&gt;&amp;rsquo;th people from his position and gives his sword to &lt;strong&gt;s+k&lt;/strong&gt;&amp;rsquo;th people. Thus &lt;strong&gt;s+k&lt;/strong&gt; becomes new &lt;strong&gt;s&lt;/strong&gt;.&lt;!-- more --&gt; 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 &amp;amp; s = 1.&lt;/p&gt;</description></item></channel></rss>