Give a combinatorial proof that the cardinality of the power set of a finite set a is 2^|a|

There are ways of building a subset of elements from , so the total number of subsets you can build is

Recalling the binomial theorem, the above sum is equal to

as required.

this is not the answer this is just a question. is this middle school math?

step-by-step explanation:

the smallest possible measurement of the width is 14 feet

step-by-step explanation:

let's assume length of parallelogram is 'l'

width of parallelogram is 'w'

the perimeter of a parallelogram must be no less than 40 feet

so, we get

we are given

length of parallelogram is 6 feet

so,

l=6

we can plug it

now, we can solve for w

subtract both sides by 12

divide both sides by 2

and we get

so,

the smallest possible measurement of the width is 14 feet