When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Josephus problem - Wikipedia

    en.wikipedia.org/wiki/Josephus_problem

    In computer science and mathematics, the Josephus problem (or Josephus permutation) is a theoretical problem related to a certain counting-out game. Such games are used to pick out a person from a group, e.g. eeny, meeny, miny, moe. A drawing for the Josephus problem sequence for 500 people and skipping value of 6.

  3. List of NP-complete problems - Wikipedia

    en.wikipedia.org/wiki/List_of_NP-complete_problems

    The program is solvable in polynomial time if the graph has all undirected or all directed edges. Variants include the rural postman problem. [3]: ND25, ND27 Clique cover problem [2] [3]: GT17 Clique problem [2] [3]: GT19 Complete coloring, a.k.a. achromatic number [3]: GT5 Cycle rank; Degree-constrained spanning tree [3]: ND1

  4. File:Josephus problem 41 3.svg - Wikipedia

    en.wikipedia.org/wiki/File:Josephus_problem_41_3.svg

    Josephus problem table: Image title: Claude Gaspar Bachet de Méziriac's interpretation of the Josephus problem with 41 soldiers and a step size of 3, visualised by CMG Lee. Time progresses inwards along the spiral, green dots denoting live soldiers, grey dead soldiers, and crosses killings.

  5. File:Josephus problem table.svg - Wikipedia

    en.wikipedia.org/wiki/File:Josephus_problem...

    What links here; Upload file; Special pages; Printable version; Page information; Get shortened URL; Download QR code

  6. Coin problem - Wikipedia

    en.wikipedia.org/wiki/Coin_problem

    Frobenius coin problem with 2-pence and 5-pence coins visualised as graphs: Sloping lines denote graphs of 2x+5y=n where n is the total in pence, and x and y are the non-negative number of 2p and 5p coins, respectively. A point on a line gives a combination of 2p and 5p for its given total (green).

  7. Talk:Josephus problem - Wikipedia

    en.wikipedia.org/wiki/Talk:Josephus_problem

    Then it gives a proof that uses a different specific example ("we explicitly solve the problem when every second person will be killed"). But in no case does it actually give the answer. I believe the answer for the Josephus example of 41 participants and a step of three is that position 31 is the survivor and position 16 is the next-to-last.

  8. File:Josephus problem 30 9.svg - Wikipedia

    en.wikipedia.org/wiki/File:Josephus_problem_30_9.svg

    English: Variant of the Josephus problem with 15 Christians and 15 Turks and a step size of 9, visualised by CMG Lee. Time progresses inwards along the spiral, green dots denoting live soldiers, grey dead soldiers, and crosses killings.

  9. The Jewish War - Wikipedia

    en.wikipedia.org/wiki/The_Jewish_War

    The Jewish War [a] [b] is a work of Jewish history written by Josephus, a first-century Roman-Jewish historian. [1] [2] [3] It has been described by the biblical historian Steve Mason as "perhaps the most influential non-biblical text of Western history". [4]