I have always assumed that it's one big draw and every bond is entered into that and can only be pulled maximum once every week. Prize bonds have been going for a long time, longer than the widespread availability of computers, haven't they - it might be completely unrealistic but I've always had this image of men in brown suits with the equivalent of a big giant hat, pulling numbers out while someone on the side with a clipboard carefully notes them down.
I would never have thought each bond has a chance to win 9,000 draws every week. Each bond has a chance to win one prize in one big draw every week.
So, I promised I'd come back to this. Haven't had time to think about how to calculate it more correctly. But I thought I might set out the calculations I was using for odds so far, and see if any maths guru out there can help amend it for the situation Janet is talking about, where each bond can only win once per week.
The question I originally wanted to answer was "what are the odds of winning a particular number of times in a year, with a particular number of prize bonds?". I decided I should start with some simpler examples. What are my chances of winning two out of three coin tosses? The chances of
anything happening are: the number of ways the given thing could happen, divided by the total number of things that could happen. For example, the chance of throwing a three on a dice are: one way a three can come up, out of six different numbers that could come up, i.e. 1/6. What about our three coin tosses? I can write down the possible outcomes as a sequence of heads (H) and tails (T):
1: H H H
2: H H T
3: H T H
4: H T T
5: T H H
6: T H T
7: T T H
8: T T T
Now I just count the number of outcomes for which there are two heads -- outcomes 2,3 and 5, so the odds are 3/8. Note, this is the odds of getting
exactly two heads. For the odds of getting
at least two heads, we have to add in outcome number one where we get three heads, for odds of 4/8 or 1/2.
Ok, now let's generalise this problem. What are the chances of getting
exactly k heads out of
n coin tosses. For the three-toss two-head problem above I just had to count all the ways I could choose two slots to be heads out of three different positions. Now I want to choose
k slots out of
n different positions. This is sometimes expressed as "
n Choose
k" and there is a well known formula for it in
combinatorics:
The exclamation mark notation means "factorial" which in turn means "multiply all the numbers from
n down to 1", so for example 5! = 5 x 4 x 3 x 2 x 1. Let's see how it works out for our previous example of two heads out of three tosses, i.e. "3 choose 2":
That matches what we found -- there are three ways to choose two slots to be heads out of three coin tosses. But we're looking for odds, so what's the total number of ways that
n coin tosses can turn out? That's easy -- there are two possible outcomes each time (H or T) so for
n tosses it's:
So finally, the odds of
k heads out of
n coin tosses are:
Now let's generalise some more. When we wrote down all the possible heads (H) and tails (T) outcomes, we could have chosen any symbol for heads and tails. Let's do it again and choose 0 and 1:
1: 0 0 0
2: 0 0 1
3: 0 1 0
4: 0 1 1
5: 1 0 0
6: 1 0 1
7: 1 1 0
8: 1 1 1
If you know what
binary numbers are, i.e. numbers in base 2, you can see that our coin toss problem is exactly the same as saying: "how many 3-digit base-2 numbers are there with exactly 2 zeros?", or more generally: "how many
n-digit base-2 numbers are there with exactly
k zeros?". We could generalise even more by working in any base,
b. How many
n-digit base-
b numbers are there with exactly
k zeros?
It's quite easy to generalise our existing formula for this. First we have to realise that the total number of possible outcomes is now
instead of
. There are also far more ways of getting our desired result. Previously, when we chose
k slots to be 0 (heads) all the other (
) slots
had to be 1 (tails). But now, when we have chosen
k slots to be zero, there are (
) ways for each of the other (
) slots to be non-zero. This is effectively a number in base (
) with (
) digits, so the number of different values is:
So finally, the number of
n-digit base-
b numbers with exactly
k zeros is:
At this stage you may be wondering what all this has to do with Prize Bonds. Well, we've now got everything we need to answer our original question. We look at the number of prizes every year and notice that the number of €50 prizes so vastly outnumbers all the others, that as a first approximation we can ignore every other type of prize. The prize bond website tells you how to work out the number of €50 prizes ... it's about 470,000 in a year. Now, using my flawed logic, there are 470,000 draws each year. (In reality there are 52 draws with about 9,000 prizes in each draw but bear with me). Let's say you are entered in each of 470,000 draws. What are your chances of winning each draw? It is your amount invested divided by the total prize bond fund ... that's the fraction of the total prize bonds you hold. For example, you have €100k invested, the total fund is €2 bn, so you have a 1/20,000 chance in each draw. That means there's one chance you'll win it, and 19,999 chances someone else will win it.
Ok, so let's pretend each draw is one digit in a vast 470,000 digit number. There are 20,000 different way each draw could come out -- one of which represents a win for you, so let's say a win for you is the zero digit in a base 20,000 number. What are the odds of you winning, say, 23 times? This is a problem we know how to solve! It's the number of 470,000 digit numbers in base 20,000 with exactly 23 zeros! And that's what our formula gives us:
There's some crazy big numbers to deal with there -- bigger than a spreadsheet like Excel can work with directly -- but it
is possible to get an answer, and in this case it works out to a little worse than 1/12 or 8.08%. That's the odds of winning
exactly 23 x €50 prizes with €100k invested. You can work out the odds for any other number of wins and investment amounts using the same formula, which is what I've done throughout this thread.
Now, the way we've modelled this approach, there is some tiny but non-zero chance that your bonds could win all 470,000 x €50 prizes. But we suspect that actually, each bond can only win once per week so we have to model it differently. I'm not sure exactly how, but I have a germ of an idea. But maybe someone out there knows an easy way? How's that for a challenge.