okay , I have no idea how to work this out.
This is the question.....
There is a class who are having a competition, they have to guess the right combination of numbers.
The combination is ten numbers long, however the only numbers used are 1 2 and 3
The numbers are drawn from a giant basket, which contains 1 thousand no.1 balls ... 1 thousand no.2 balls and 1 thousand no.3 balls.. (stupid i know ahaha). NOTE : when a number is drawn it is put back in the basket with the other balls SO THERE IS ALWAYS THE SAME CHANCE OF DRAWING 1 2 OR 3 AND THE BALLS WILL NEVER RUN OUT
What is the total number of possible combinations?
examples of possible combinations
3131223132
1111111111
2121212121
3122212132
You get the idea......
the actual answer i need is
What is the total number of possible combinations
Unless lives are at stake, nothing justifies bumping in the space of 10 minutes. Let alone bumping twice.
means .
This is the answer because there are 10 'pigeon holes' for the number and there are three possibilities for each 'pigeon hole'.
Edit: Three bumps in 10 minutes. A new world record. I can hardly blame Plato for his second reply in this thread.