Problem accredited to Aaron Pain (Bexhill College).
In A level further mathematics you study core content and take two options. However, you are instead allowed to take as many options as you like, and be graded on your best two.
The options system works in this way: there are different topics to choose from, , and for each topic there are two options: and . The only rules are that you are not allowed to take unless you also take , and obviously you have to take at least two options in total.
Define an option set as a set of options you could take. Then for example, you could take the option sets: , , or , but you would not be allowed to take the option set: because you cannot take without also taking .
Given , how many different choices do you have for option sets to take?
Find a general formula and give your answer as the total number of different option sets corresponding to .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
For each topic A i : i ∈ { 1 , 2 , . . . , n } , you can either:
Hence there are three different choices corresponding to each topic. This means there are a total of 3 n different option sets.
Then also, you have to take at least two options in total.
In this, we have counted n different option sets that only contain one option, and also the empty set.
Subtracting these from our answer, we get the total number of option sets that follow both the two rules is:
3 n − n − 1
Indeed 3 ( 1 0 ) − ( 1 0 ) − 1 = 5 9 0 3 8