Let S 1 2 3 .... m m 3. Let x1 x2 ....xn be the subsets of S each of size 3. Define a function f from S to the set of natural numbers as f i is the number of sets TEX X j TEX that contain the element i. That is f i j i TEX epsilon TEX TEX X j TEX . Then TEX sum i 1 f i TEX is

Courses
- For Working Professionals
- For Students
- Programming Languages
- Web Development
- Machine Learning and Data Science
  - Complete Data Science Program(Live)
  - Mastering Data Analytics
- New Courses
- School Courses
  - CBSE Class 12 Computer Science
  - School Guide
- All Courses
Tutorials
- DSA
- Data Structures
- Algorithms
- System Design
  - System Design Tutorial
  - Software Design Patterns
- Interview Corner
- Languages
  - C
  - C++
  - Java
  - Python
  - JavaScript
  - PHP
  - C#
  - SQL
  - Scala
  - Perl
  - Go Language
  - Kotlin
- Web Development
  - HTML
  - CSS
  - JavaScript
  - PHP
  - CSS Frameworks
  - JavaScript Frameworks
  - JavaScript Libraries
  - WordPress
  - JSON
- School Learning
  - English Grammar
  - School Programming
  - Mathematics
  - CBSE Syllabus
  - Maths Notes (Class 8-12)
  - Maths Formulas (Class 8 -11)
  - NCERT Solutions
  - RD Sharma Solutions
  - Science Notes
  - Physics Notes (Class 8-12)
  - Chemistry Notes (Class 8-12)
  - Biology Notes
  - Social Science Syllabus
  - Social Science Notes
    - SS Notes (Class 7-12)
    - CBSE History Notes (Class 7-10)
    - CBSE Geography Notes (Class 7-10)
    - CBSE Civics Notes (Class 7-10)
      - Civics Class 7
      - Civics Class 8
  - Commerce
  - CBSE Previous Year Papers
- ML & Data Science
  - Machine Learning
  - Data Science
- CS Subjects
- GATE
- GFG Sheets
  - Web Dev Cheat Sheets
  - Company-Wise SDE Sheets
  - DSA Sheets
- CS Exams/PSUs
  - ISRO
  - UGC NET
- Student
- UPSC
- SSC CGL
- Banking Exams
Jobs
Practice
Contests

GATE | GATE-CS-2006 | Question 25

Last Updated : 14 Feb, 2018

Let S = {1, 2, 3, …., m}, m>3. Let x1, x2,….xn be the subsets of S each of size 3. Define a function f from S to the set of natural numbers as, f(i) is the number of sets $X_j$ that contain the element i. That is, f(i) = |{j|i $\epsilon$ $X_j$ }|.
Then, $\sum_{i=1}f(i)$ is :
(A) 3m
(B) 3n
(C) 2m + 1
(D) 2n + 1

Answer: (B)

Explanation: First of all, number of subsets of S of size 3 is mC3 i.e. n=mC3. Now we count number of subsets in which a particular element i appears, that will be (m−1)C2, because 1 element is already known, and we have to choose 2 elements from remaining m-1 elements.