Puzzle 2: Prisoner’s Visitors Puzzle

Math and Logic Puzzle

Difficulty: Medium

There are 60 records given to you which correspond to a prisoner who is imprisoned for 60 days. He has 6 relatives of which one of them visits him daily and the others visit him every ith day from the day of his imprisonment (i=2,3,4,5,6 for these 5 relatives).

Every record is sealed with the day number on it which implies the number of days he is jailed when the record is filed with the names of visitors on that particular day. You have to make a new record which should be filled with the following details:

visitor name – number of visits after 1st 60 days

Assume that no other relatives visited him at all, names of these 6 relatives are different and you don’t know their names. Find the minimum number of records that need to be checked to make the new record correctly. Find the number of ways you can choose minimum number of records and still you can make the new record correctly.

Comments/Solutions are welcome.

Published in: on December 16, 2008 at 10:16 am  Leave a Comment  

The URI to TrackBack this entry is: http://praneeth.wordpress.com/2008/12/16/puzzle-2-prisoners-visitors-puzzle/trackback/

RSS feed for comments on this post.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Connecting to %s

Follow

Get every new post delivered to your Inbox.