For n≥4, show that ((n 2)2)=3(n 3)+3(n 4). LHS: So we have a set of (n 2) elements, and we are choosing a 2 element subset. RHS: We are choosing a 3 element subset and a 4 element subset. But we multiply by 3 by the multiplication principle for some reason.

trkalo84

trkalo84

Answered question

2022-09-22

For n 4, show that ( ( n 2 ) 2 ) = 3 ( n 3 ) + 3 ( n 4 ) .
LHS: So we have a set of ( n 2 ) elements, and we are choosing a 2 element subset.
RHS: We are choosing a 3 element subset and a 4 element subset. But we multiply by 3 by the multiplication principle for some reason.

Answer & Explanation

ticotaku86

ticotaku86

Beginner2022-09-23Added 12 answers

LHS: The ( n 2 ) is the number of pairs you can form of n distinct elements, so the LHS counts the number of ways to choose two distinct pairs.
RHS: Notice that you can choose two pairs that have a common element (but only one). If the two pairs are disjoint, then you need to choose four elements and then ask how you pair them. If the pairs have a common element, then you need to choose only three elements and then choose which is the common element.

Do you have a similar question?

Recalculate according to your conditions!

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?