A pizza comes with 2 toppings chosen from mushroom, onion and pepper. Listing ordered pairs gives 6: MO, OM, MP, PM, OP, PO. But mushroom-then-onion is the same pizza as onion-then-mushroom, so every pizza was listed twice. There are 26=3 different pizzas: MO, MP and OP.
That is the whole idea of the formula. C(n,r)=r!(n−r)!n! is the permutation count (n−r)!n! divided by r!, the number of orders each chosen group can be listed in. To choose 4 students from 7 for a project group: P(7,4)=7×6×5×4=840 ordered lists, each group appears 4!=24 times, so there are 24840=35 groups. Choosing 4 to include is the same as choosing 3 to leave out, which is why (47)=(37)=35.
Choosing a president and a vice-president from the same 7 students looks like choosing 2 people, but now Ana as president with Ben as vice-president differs from the reverse. The roles make order matter, so the count is P(7,2)=42, not C(7,2)=21. A group whose members get labels is a permutation; a group without labels is a combination.
Think of it like this. A combination is a handful of items scooped into a bag: once they are inside, there is no first or last, only which items are in the bag. Count the ways to pick them one at a time, then divide by the number of orders in which you could have picked that same handful.
Core idea. A combination counts the ways to pick r items from n when rearranging the picked items doesn't make a new selection.