Combinatorics

[Guest]

Hi. It supposed to be easiest part of a whole test but I can't solve it. It drives me crazy and I fell stupid. Please help to solve:
If we make a sequence selecting three elements from three different elements {1, 2, 3} and we permit overlapped elements for the sequence, then the total number of sequences is [1 - ?] . If we do not take into account the order, the total number of the selections is [2 - ?]

So,the first one is easy A=n^3=3^3=27. The second one is I totally do not understand. The right answer should be 27, but I can't figure out how to come to it whatsoever.

Sorry if I've posted thread on the wrong section - that one seemed most relevant.

[Guest]

Hey, whatup. I'm also lost on this one. I don't even speak english.
I'm confused by the second part, quote: "If we do not take into account the order, the total number of the selections is [2 - ?]"
In my answers, it says 10, but i make no ideia why.
Pls halp