mathschallenge.net logo

Numbered Discs 2

Problem

Using discs numbered 1 to 6, it is possible to place the discs in two bags, such that no bag contains its double in exactly four different ways:

{1,3,4}{2,5,6}
{1,3,4,5}{2,6}
{1,4,6}{2,3,5}
{1,4,5,6}{2,3}

If you had discs numbered 1 to 10, how many ways can you separate the discs into the two bags such that no bag contains its double?

Problem ID: 164 (Apr 2004)     Difficulty: 2 Star

Show Problem & Solution