<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" version="2.0">
  <channel>
    <title>topic Josephus problem in New SAS User</title>
    <link>https://communities.sas.com/t5/New-SAS-User/Josephus-problem/m-p/570601#M11983</link>
    <description>&lt;P&gt;Does anyone have solution for Josephus problem.&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;</description>
    <pubDate>Tue, 02 Jul 2019 15:34:30 GMT</pubDate>
    <dc:creator>Armkents</dc:creator>
    <dc:date>2019-07-02T15:34:30Z</dc:date>
    <item>
      <title>Josephus problem</title>
      <link>https://communities.sas.com/t5/New-SAS-User/Josephus-problem/m-p/570601#M11983</link>
      <description>&lt;P&gt;Does anyone have solution for Josephus problem.&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;</description>
      <pubDate>Tue, 02 Jul 2019 15:34:30 GMT</pubDate>
      <guid>https://communities.sas.com/t5/New-SAS-User/Josephus-problem/m-p/570601#M11983</guid>
      <dc:creator>Armkents</dc:creator>
      <dc:date>2019-07-02T15:34:30Z</dc:date>
    </item>
    <item>
      <title>Re: Josephus problem</title>
      <link>https://communities.sas.com/t5/New-SAS-User/Josephus-problem/m-p/570662#M12002</link>
      <description>&lt;P&gt;You might want to include a description of what you mean -- &lt;A href="https://en.wikipedia.org/wiki/Josephus_problem" target="_self"&gt;I'm guessing it's this classic problem&lt;/A&gt;, sometimes assigned as a programming learning exercise.&lt;/P&gt;
&lt;P&gt;&amp;nbsp;&lt;/P&gt;
&lt;P&gt;If it is an assignment....do you have examples of what you've tried?&amp;nbsp; There are probably elegant solutions in SAS/IML, but I think a DATA step approach could work as well.&lt;/P&gt;</description>
      <pubDate>Tue, 02 Jul 2019 17:23:54 GMT</pubDate>
      <guid>https://communities.sas.com/t5/New-SAS-User/Josephus-problem/m-p/570662#M12002</guid>
      <dc:creator>ChrisHemedinger</dc:creator>
      <dc:date>2019-07-02T17:23:54Z</dc:date>
    </item>
    <item>
      <title>Re: Josephus problem</title>
      <link>https://communities.sas.com/t5/New-SAS-User/Josephus-problem/m-p/570682#M12005</link>
      <description>&lt;P&gt;Given that there are close to 8 billion possible solvers, "yes" is a very probable answer.&lt;/P&gt;</description>
      <pubDate>Tue, 02 Jul 2019 18:19:38 GMT</pubDate>
      <guid>https://communities.sas.com/t5/New-SAS-User/Josephus-problem/m-p/570682#M12005</guid>
      <dc:creator>Kurt_Bremser</dc:creator>
      <dc:date>2019-07-02T18:19:38Z</dc:date>
    </item>
  </channel>
</rss>

