Solveeit Logo

Question

Mathematics Question on permutations and combinations

If S = {2, 4, 8, 16, ..., 512}. If S is broken in 3 equal subsets A, B and C such that A∩B = B∩C = C∩A = φ and A∪B∪C = S then maximum number of ways to break is

A

9C3

B

9!(3!)3\frac{9!}{(3!)3}

C

9!(3!)4\frac{9!}{(3!)4}

D

9!(3!)2\frac{9!}{(3!)^2}

Answer

9!(3!)3\frac{9!}{(3!)3}

Explanation

Solution

The Correct answer is option is (B) : 9!(3!)3\frac{9!}{(3!)3}