Scribd Logo
Upload

Welcome to Scribd!

  • 53 views

    The Josephus Problem

    Uploaded by

    Ericka Rivera Santos
    The Josephus problem describes a counting game where people stand in a circle and are eliminated by counting around the circle at fixed intervals, with the last remaining person being freed. The problem is to determine the position in the initial circle that will avoid being eliminated, given the number of people, starting point, direction of counting, and number skipped between eliminations.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd

    The Josephus Problem

    Uploaded by

    Ericka Rivera Santos
    53 views1 page
    The Josephus problem describes a counting game where people stand in a circle and are eliminated by counting around the circle at fixed intervals, with the last remaining person being freed. The problem is to determine the position in the initial circle that will avoid being eliminated, given the number of people, starting point, direction of counting, and number skipped between eliminations.

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The Josephus problem describes a counting game where people stand in a circle and are eliminated by counting around the circle at fixed intervals, with the last remaining person being freed. The problem is to determine the position in the initial circle that will avoid being eliminated, given the number of people, starting point, direction of counting, and number skipped between eliminations.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Download as txt, pdf, or txt
    53 views1 page

    The Josephus Problem

    Uploaded by

    Ericka Rivera Santos
    The Josephus problem describes a counting game where people stand in a circle and are eliminated by counting around the circle at fixed intervals, with the last remaining person being freed. The problem is to determine the position in the initial circle that will avoid being eliminated, given the number of people, starting point, direction of counting, and number skipped between eliminations.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Download as txt, pdf, or txt
    You are on page 1of 1

    In 

    computer science and mathematics, the Josephus problem (or Josephus permutation)


    is a logical problem related to a particular counting-out game.

    People are staying in a circle watching to be dealt with. Thinking comes out at a


    fixed point in the circle and proceeds around the circle in a fixed direction.
    After a limited number of people are skipped, the next person is dealt with. The
    procedure is renewed with the going on people, setting up with the later person,
    working in the same direction and dancing the same number of people, until hardly
    one person remains and is freed.

    The problem — given the number of people, starting point, direction, and number to
    be passed up — is to single out the position in the initial circle to avoid
    execution

    You might also like