Turn on thread page Beta
    • Thread Starter
    Offline

    10
    ReputationRep:
    Take n playing cards and order them red,black,red,black,...

    (*):
    Now transfer the top card to a new pile and put the next card to the back of the (n-1 size) pack. Next, transfer the top card to the smaller pile so it becomes the second card in that pile and put the next card to the back of the (n-2 size pack). Keep doing this until there is only one (size n) pile left.

    The pile should look something like: R,R,R,...,B,B,B,...

    Keep doing (*) until the pile is the same as how it started: R,B,R,B,...
    There are two questions from here:

    1) Whatever the size of n, will there always be a finite amount of (*)'s before the pile is the same as how it started?

    2) How many times do you have to do (*) for the pile to go back to how it started?

    I made a MATLAB script (ask if you want it) which computed the first 70 counts of (*) for n=1,2,.... The numbers did seem quite random but when there were huge jumps, the numbers always ended with a 0 which leads me to think there's some kind of pattern.

    I tried answering both questions but didn't get very far. Can anyone else try? It may be not possible to answer either question but I thought it was quite interesting anyway.
    Offline

    15
    ReputationRep:
    I would say an important thing to consider is that from any arrangement of cards, you can run (*) in reverse to get another arrangement of cards. This means that there is only one arrangement that can have (*) run on it to get to any other given arrangement.

    So if you start with one arrangement of cards, an keep running (*) then you can consider the following possibilities:
    (i) You keep on going through an infinite number of arrangements - this can't be possible since there are only a finite number of arrangements of n cards
    (ii) You eventually get into a cycle, repeating some arrangements indefinitely - suppose this did happen, and you went through arrangements a1, a2, ..., ak, b1, b2, ..., bj, b1, b2, ... then b1 would have both ak and bj leading to it, which we know is impossible.
    (iii) After applying (*) a finite number of times, you eventually get back where you started - this is the only possible case.

    Therefore, the answer to (a) is yes.

    I'm not sure how to do part b. I suppose you could find an upper bound by calculating the number of arrangements of cards, but that wouldn't answer the question directly.
    Offline

    18
    ReputationRep:
    Without putting any thought in, try putting the sequence for n = 1,2,3, into the Sloane Sequence website (google sloane sequence).
    • Thread Starter
    Offline

    10
    ReputationRep:
    (Original post by DFranklin)
    Without putting any thought in, try putting the sequence for n = 1,2,3, into the Sloane Sequence website (google sloane sequence).
    This page is the only result. I'm not really familiar with this website to find out more about the sequence (if there is anything more).
    Offline

    18
    ReputationRep:
    (Original post by 0-))
    This page is the only result. I'm not really familiar with this website to find out more about the sequence (if there is anything more).
    If it had any other significance, or if there was a formula for the values, it would usually be included in the entry. So odds are there's no known formula for it.
 
 
 
Reply
Submit reply
Turn on thread page Beta
Updated: January 22, 2010

University open days

  1. University of Bradford
    University-wide Postgraduate
    Wed, 25 Jul '18
  2. University of Buckingham
    Psychology Taster Tutorial Undergraduate
    Wed, 25 Jul '18
  3. Bournemouth University
    Clearing Campus Visit Undergraduate
    Wed, 1 Aug '18
Poll
How are you feeling in the run-up to Results Day 2018?
Useful resources

Make your revision easier

Maths

Maths Forum posting guidelines

Not sure where to post? Read the updated guidelines here

Equations

How to use LaTex

Writing equations the easy way

Student revising

Study habits of A* students

Top tips from students who have already aced their exams

Study Planner

Create your own Study Planner

Never miss a deadline again

Polling station sign

Thinking about a maths degree?

Chat with other maths applicants

Can you help? Study help unanswered threads

Groups associated with this forum:

View associated groups

The Student Room, Get Revising and Marked by Teachers are trading names of The Student Room Group Ltd.

Register Number: 04666380 (England and Wales), VAT No. 806 8067 22 Registered Office: International House, Queens Road, Brighton, BN1 3XE

Write a reply...
Reply
Hide
Reputation gems: You get these gems as you gain rep from other members for making good contributions and giving helpful advice.