Results 1 to 2 of 2

Math Help - recurrence relation question

  1. #1
    Newbie
    Joined
    Mar 2013
    From
    Edmonton
    Posts
    1

    recurrence relation question

    Hi !!! I have no idea how to do this question help please !!
    Sylvester caught n mice which he arranged in a circle and numbered them 1,2,...,n in clockwise order. Starting with mouse number 1, Sylvester went around the circle in clockwise order, skipping over one mouse and eating the next one. He went round and round by the same rule, until only one mouse was left. This lucky mouse was then set free. Denote f(n) as the number assigned to the lucky mouse initially. Now f(1)=1, f(2)=1, f(3)=3, f(4)=1, and f(5)=3
    a) Express f(2n) and f(2n+1) in terms of f(n)
    b) given that f(530)=37, determine f(2121).
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Super Member
    Joined
    Dec 2012
    From
    Athens, OH, USA
    Posts
    639
    Thanks
    257

    Re: recurrence relation question

    This is a particular instance of the famous Josephus problem. Google this problem, and you'll find the complete solution.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Recurrence relation
    Posted in the Advanced Algebra Forum
    Replies: 0
    Last Post: May 12th 2012, 11:32 PM
  2. Recurrence relation question
    Posted in the Advanced Algebra Forum
    Replies: 2
    Last Post: January 3rd 2010, 07:17 PM
  3. find a recurrence relation question
    Posted in the Discrete Math Forum
    Replies: 0
    Last Post: November 29th 2009, 07:03 PM
  4. finding recurrence relation - question #2
    Posted in the Discrete Math Forum
    Replies: 3
    Last Post: November 26th 2009, 08:19 AM
  5. Recurrence Relation
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: July 8th 2008, 09:47 AM

Search Tags


/mathhelpforum @mathhelpforum