Jump to content
BrainDen.com - Brain Teasers
  • 0


superprismatic
 Share

Question

The country of Ozendia has a weekly lottery drawing.

A set of 6 numbers are drawn without replacement from

the set of numbers {1,2,3,...,40} randomly. A play

of this lottery consists of buying a ticket with a

buyer-chosen guess as to what these 6 numbers will be.

The drawing order of the numbers does not matter.

Each play costs $1. The payoff is usually in the

multi-million dollar range and it is a percentage of

the ticket sales since the last winner. Ozendians

love to gamble, so there is usually a small number

of winning tickets each week. If this number is

greater than one, the jackpot is shared equally among

the winning tickets. So far, this is much like many

lotteries familiar to most people.

Ozendians are social gamblers. That is, very often

a group of people will buy a bunch of tickets with

any winnigs divided up equitably to the group

members. Ozendian lottery officials want to encourage

this behavior as they believe it increases ticket

sales. So they developed a scheme to allow groups

to buy lots of sets of numbers on a single ticket.

They have what they call a 7-play ticket. You get

to choose 7 numbers on a 7-play and the ticket wins

if any subset of 6 of these 7 numbers is picked.

Since this is equivalent to buying 7 different

normal tickets, the cost is $7 for this kind of ticket.

Similarly, they have an 8-play, which is equivalent

to 28 standard tickets and so, costs $28. In fact,

they have N-play tickets right up to N=15 which

costs a whopping $5005! They, in fact have all

N-plays for N=6,7,8,9,10,11,12,13,14,15 (I included

the standard game as a 6-play).

Well (wouldn't you know it?), there's a group of 143

mathematicians in the Ozendian Defence Department who

wish to buy the equivalent of a 16-play costing $8008

($56 for each mathematician). They have decided on

their 16 favorite numbers. They wish to cover all

subsets of 6 out of their 16 numbers using standard

N-play tickets (N=6 to 15) at minimal cost. After all,

they are mathematicians, so they can afford to pay a

bit more than $56 each!

How many of each type of N-play tickets (include the

standatd game as 6-play) are necessary to achieve

minimal cost? What is the cost per play?

Link to comment
Share on other sites

9 answers to this question

Recommended Posts

  • 0

After all, they are mathematicians, so they can afford to pay a

bit more than $56 each!

How many of each type of N-play tickets (include the

standatd game as 6-play) are necessary to achieve

minimal cost? What is the cost per play?

They could buy 8008 (16C6) standard tickets (6-play) for $1 each. So, the minimum amount cannot be more than $56 each for the 143 mathematicians. And you wrote that they could afford to pay a bit more than $56. Am I missing something or is that statement in the question redundant??

Edited by DeeGee
Link to comment
Share on other sites

  • 0

They could buy 8008 (16C6) standard tickets (6-play) for $1 each. So, the minimum amount cannot be more than $56 each for the 143 mathematicians. And you wrote that they could afford to pay a bit more than $56. Am I missing something or is that statement in the question redundant??

Sorry, I meant to ask:

What is the minimum number of N-play tickets

which would achieve the cover of all subsets of 6

out of the 16 numbers?

Link to comment
Share on other sites

  • 0

I would like to restate the problem:

The country of Ozendia has a weekly lottery drawing.

A set of 6 numbers are drawn without replacement from

the set of numbers {1,2,3,...,40} randomly. A play

of this lottery consists of buying a ticket with a

buyer-chosen guess as to what these 6 numbers will be.

The drawing order of the numbers does not matter.

Each play costs $1. The payoff is usually in the

multi-million dollar range and it is a percentage of

the ticket sales since the last winner. Ozendians

love to gamble, so there is usually a small number

of winning tickets each week. If this number is

greater than one, the jackpot is shared equally among

the winning tickets. So far, this is much like many

lotteries familiar to most people.

Ozendians are social gamblers. That is, very often

a group of people will buy a bunch of tickets with

any winnigs divided up equitably to the group

members. Ozendian lottery officials want to encourage

this behavior as they believe it increases ticket

sales. So they developed a scheme to allow groups

to buy lots of sets of numbers on a single ticket.

They have what they call a 7-play ticket. You get

to choose 7 numbers on a 7-play and the ticket wins

if any subset of 6 of these 7 numbers is picked.

Since this is equivalent to buying 7 different

normal tickets, the cost is $7 for this kind of ticket.

Similarly, they have an 8-play, which is equivalent

to 28 standard tickets and so, costs $28. In fact,

they have N-play tickets right up to N=15 which

costs a whopping $5005! They, in fact have all

N-plays for N=6,7,8,9,10,11,12,13,14,15 (I included

the standard game as a 6-play).

Well (wouldn't you know it?), there's a group of 143

mathematicians in the Ozendian Defence Department who

wish to buy the equivalent of a 16-play costing $8008

($56 for each mathematician). They have decided on

their 16 favorite numbers. They wish to cover all

subsets of 6 out of their 16 numbers using standard

N-play tickets (N=6 to 15) with as few N-play tickets

as possible (including the standard game as 6-play).

After all, they are mathematicians, so they can afford

to pay a bit more than $56 each!

What is the minimum number of N-play tickets

which would achieve the cover of all subsets of 6

out of the 16 numbers? What would they cost?

Link to comment
Share on other sites

  • 0

This seems too easy again! May be I am still missing something!!

A minimum of 16 tickets would be needed (16C15)

Buy 16 tickets of 15-Play leaving out 16the number in first, 15th number in second, 14th in the third... and so on

The cost would be 16 * 5005 = 80080 and cost per mathematician = 80080/143 = $560

Edited by DeeGee
Link to comment
Share on other sites

  • 0

This seems too easy again! May be I am still missing something!!

A minimum of 16 tickets would be needed (16C15)

Buy 16 tickets of 15-Play leaving out 16the number in first, 15th number in second, 14th in the third... and so on

The cost would be 16 * 5005 = 80080 and cost per mathematician = 80080/143 = $560

No, you're not missing something. You have a convincing argument that you have found an upper bound. Can you prove that it can't be done with fewer tickets?

Link to comment
Share on other sites

  • 0

Such as now...

and buy only 4 tickets, costing $68.01 per mathematician

Would you post precisely which tickets they would be? Just assume that the mathematicians want to cover all subsets of 6 from the numbers {1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16}. I can't seem to find a set of tickets as you describe.

(Webmaster, There seems to be a spoiler problem)

Edited by superprismatic
Link to comment
Share on other sites

  • 0

I can't seem to find a set of tickets as you describe.

Oops... neither can I. 4 tickets is definitely wrong, and I can't remember anymore how I came up with 10.

Link to comment
Share on other sites

Join the conversation

You can post now and register later. If you have an account, sign in now to post with your account.

Guest
Answer this question...

×   Pasted as rich text.   Paste as plain text instead

  Only 75 emoji are allowed.

×   Your link has been automatically embedded.   Display as a link instead

×   Your previous content has been restored.   Clear editor

×   You cannot paste images directly. Upload or insert images from URL.

Loading...
 Share

  • Recently Browsing   0 members

    • No registered users viewing this page.
×
×
  • Create New...