S= {1, 2, 3, 4, 5, 6 ......n), a subset x is formed which contains all the pairs of numbers possible from S. Find the sum of, the lesser number in each pair, belonging to set x.

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is C

Option (c)

Given question is variable to variable. Let n = 3, S = {1, 2, 3} and x = {(1, 2), (1, 3) and (2, 3)}

The sum of minimum number of all the pairs belonging to set x = 1 + 1 + 2 = 4. Put n = 3 in the given options.
Only option (c) will give 4.

Suggest Corrections

Similar questions

{a_{1}, a_{2}, a_{3} \dots, a_{n}}

a_{3}

{1, 2, 3, 4, 5, 6, . . ., n}

(A, B)

S = {1, 2, 3, 4, 5, 6}

A \cap B = ϕ

A \cup B = S

Prove that the number of subsets of a set containing n distinct elements is $2^{n}$ for all $n ϵ N$ .

(m, n)

m^{2} + 2 m - 35 = 2^{n}

Join BYJU'S Learning Program