Verify that |p(a)| = 2^n , if |a| = n for n = 0, 1, 2, 3.

We have to prove that,

|P(A)| = , if |A| = n for n = 0, 1, 2, 3.

For n = 0,

A = {}

P(A) = { {} } = = 1

For n = 1,

A = { a }     ( suppose )

P(A) = { {}, a } = = 2,

For n = 2,

A = { a, b }

P(A) = { {}, {a}, {b}, {a, b} = = 4,

For n = 3,

A = { a, b, c },

P(A) = { {}, {a}, {b}, {c}, {a, b}, {a, c}, {b, c}, {a, b, c} } = = 8

Thus, it is verified for n = 0, 1, 2, 3.

Now, suppose it is valid for a set B having k elements,

That is, |P(B)| =

Also, there is a set A,

Such that, A = B ∪ {x}

Since, after including the element x in set B,

The element x will be come with every element of set B in the power set of B,

i.e. P(A) = = = =

Hence, by the induction it has been proved,

|P(A)| = , if |A| = n, Where, n∈ N ( set of natural numbers )

this shows a reflection over the x-axis and is translated one unit down and 6 units to the right (x + 6, y - 1)

hope this !

~just a girl in love with shawn mendes