formula of number of subsets
Answers
Answered by
2
➡️➡️➡️➡️➡️➡️➡️➡️➡️➡️➡️➡️➡️➡️➡️➡️➡️
☆☞ [ Verified answer ]☜☆
For a set S with cardinality c, the cardinality of the set containing all the subsets of S is 2^c. Formally, the set of all subsets of S, called the power set of S, is denoted 2^S, which is the set of all functions from S to the set 2, where each function f corresponds to a subset of S and 2 denotes the ordinal {0, 1}. Each such function f has the value f(s) = 1 if s is in the subset corresponding to f, and f(s) = 0 if not. If f is the function correpsonding to the empty set, then f(s) =0 for all elements s of the set S. If f corresponds to S itself, then f(s) = 1 for all elements of S.
jai siya ram☺ __/\__
➡️➡️➡️➡️➡️➡️➡️➡️➡️➡️➡️➡️➡️➡️➡️➡️➡️
¯\_(ツ)_/¯
Similar questions
English,
4 months ago
World Languages,
4 months ago
Social Sciences,
4 months ago
Math,
9 months ago
Computer Science,
9 months ago
Science,
1 year ago