Counting problem (1 Viewer)

Mahan1 · Mar 5, 2017

$\textrm{1.If X is a set with n distinct elements.}$ $\textrm{then prove the number of pairs (A,B) is } \ 3^{n} - 2^{n}$
$\textrm{where} \ A \subset B \ \textrm{and} \ A,B \subseteq X$

$\textrm{2.We call a 10 digit number interesting if all the digits are different}$
$\textrm{and the number is divisible by 11111.}$
$\textrm{Now many interesting numbers are there?}$

Paradoxica · Mar 6, 2017

Please format everything properly, it is difficult to interpret exactly what you are asking.

Mahan1 · Mar 6, 2017

Paradoxica said:
Please format everything properly, it is difficult to interpret exactly what you are asking.

which question are you referring to and what is confusing about the question?

Counting problem (1 Viewer)

Mahan1

Member

Paradoxica

-insert title here-

Mahan1

Member

Users Who Are Viewing This Thread (Users: 0, Guests: 1)