Choose 2 of the 4 friends Ana, Ben, Cy and Dee to come to a concert. List the pairs: AB, AC, AD, BC, BD, CD, so 6 ways. Now count another way: 4 choices for the first ticket and 3 for the second give 4×3=12 ordered picks, but every pair shows up twice (AB and BA), so 212=6. Dividing out the orderings is the whole idea of (kn)=k!(n−k)!n!: (n−k)!n! counts ordered picks, and dividing by k! removes the repeats.
Choosing who comes is the same as choosing who stays home, so (kn)=(n−kn). Picking 3 of 10 to come leaves 7 behind, and (310)=(710). Compute with the smaller number and cancel instead of multiplying out 10!: (310)=3⋅2⋅110⋅9⋅8=120.
The same numbers appear in algebra. In (a+b)3=(a+b)(a+b)(a+b), each term of the expansion takes a or b from each bracket. The term ab2 comes from choosing which 2 of the 3 brackets supply b, which can happen in (23)=3 ways, so (a+b)3=a3+3a2b+3ab2+b3.
When order matters, the count is bigger and (kn) is the wrong tool. A president and a vice-president from those 4 friends gives 4×3=12 outcomes, because "Ana president, Ben vice" differs from the reverse. If swapping two chosen items gives a different outcome, use a permutation.
Think of it like this. Picture n light switches in a row: choosing k items means flipping exactly k of them on. (kn) counts the possible on/off patterns. A pattern doesn't record the order you flipped the switches in, so order doesn't matter, and turning k on leaves n−k off, so (kn)=(n−kn).
Core idea. The binomial coefficient (kn) counts how many ways to pick k items from n when order doesn't matter.