Hi Eclectic Lady,
As a visual representation I would suggest saying if you have N variables and are looking to see how many different pairings you can make then you have N distinct first choices and N-1 second choices (since you DON'T want to choose the same one twice and there's N-1 others). Now that gives us N*(N-1)... you could draw a chart if that would help you and scribble out the squares that don't apply.
Now finally consider that Tinsel + Fairy Lights is exactly the same as Fairy Lights + Tinsel, so everything in our table is exactly duplicated. We can say this with certainty because we start with N different options and remove that one from the pool at that point. So we need to divide N*(N-1) by 2
N*(N-1)/2
This is actually the formula for triangular numbers and is considered to be a very elegant mathematical formula which crops up in lots of different scenarios.
For more complicated calculations I suggest using Combin(Number of different options, Number of selections) as others have suggested.
As a visual representation I would suggest saying if you have N variables and are looking to see how many different pairings you can make then you have N distinct first choices and N-1 second choices (since you DON'T want to choose the same one twice and there's N-1 others). Now that gives us N*(N-1)... you could draw a chart if that would help you and scribble out the squares that don't apply.
Now finally consider that Tinsel + Fairy Lights is exactly the same as Fairy Lights + Tinsel, so everything in our table is exactly duplicated. We can say this with certainty because we start with N different options and remove that one from the pool at that point. So we need to divide N*(N-1) by 2
N*(N-1)/2
This is actually the formula for triangular numbers and is considered to be a very elegant mathematical formula which crops up in lots of different scenarios.
For more complicated calculations I suggest using Combin(Number of different options, Number of selections) as others have suggested.