As someone who loves maths, I am involved in what is known as Maths Working Group in my college. Last week we were told to make a presentation on either Partitions or this other problem which is similar, which I'll come to later.
Basically a partition is how many different ways can you make up a natural number from summing other natural numbers, so 3 has partitions (1+1+1),(2+1),(3). We were basically told to do stuff with them, so I did.
The other problem was to do with bubbles, and nesting them. So say you have 3 bubbles, how many different ways can they be arranged - you could have all three nested, 2 nested with one outside or all three not nested. Again we were just told to play around with this problem. Thoughts?
I'll attach my powerpoint as a word document and a program which finds the first n partitions (where you enter n), and saves your previous runs to a file, called Previous Runs. It's a java file, so tell me if you have problems.
