X, Y, Z are sets of all positive divisors of | vedclass

Name: Exam Paper Generator | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(C) The prime factorizations are:$X = 10^{60} = 2^{60} 	imes 5^{60} \implies n(X) = (60+1)(60+1) = 61^2 = 3721$$Y = 20^{50} = (2^2 	imes 5)^{50} = 2

Vedclass · Accepted Answer

$73001$

Vedclass · Answer

(C) The prime factorizations are:$X = 10^{60} = 2^{60} 	imes 5^{60} \implies n(X) = (60+1)(60+1) = 61^2 = 3721$$Y = 20^{50} = (2^2 	imes 5)^{50} = 2^{100} 	imes 5^{50} \implies n(Y) = (100+1)(50+1) = 101 	imes 51 = 5151$$Z = 30^{40} = (2 	imes 3 	imes 5)^{40} = 2^{40} 	imes 3^{40} 	imes 5^{40} \implies n(Z) = (40+1)^3 = 41^3 = 68921$Intersections:$X \cap Y = \gcd(10^{60}, 20^{50}) = \gcd(2^{60} 	imes 5^{60}, 2^{100} 	imes 5^{50}) = 2^{60} 	imes 5^{50} \implies n(X \cap Y) = 61 	imes 51 = 3111$$X \cap Z = \gcd(10^{60}, 30^{40}) = \gcd(2^{60} 	imes 5^{60}, 2^{40} 	imes 3^{40} 	imes 5^{40}) = 2^{40} 	imes 5^{40} \implies n(X \cap Z) = 41 	imes 41 = 1681$$Y \cap Z = \gcd(20^{50}, 30^{40}) = \gcd(2^{100} 	imes 5^{50}, 2^{40} 	imes 3^{40} 	imes 5^{40}) = 2^{40} 	imes 5^{40} \implies n(Y \cap Z) = 41 	imes 41 = 1681$$X \cap Y \cap Z = \gcd(2^{60} 	imes 5^{60}, 2^{100} 	imes 5^{50}, 2^{40} 	imes 3^{40} 	imes 5^{40}) = 2^{40} 	imes 5^{40} \implies n(X \cap Y \cap Z) = 41^2 = 1681$Using the Principle of Inclusion-Exclusion:$n(X \cup Y \cup Z) = n(X) + n(Y) + n(Z) - [n(X \cap Y) + n(X \cap Z) + n(Y \cap Z)] + n(X \cap Y \cap Z)$$n(X \cup Y \cup Z) = 3721 + 5151 + 68921 - [3111 + 1681 + 1681] + 1681$$n(X \cup Y \cup Z) = 77793 - 6473 + 1681 = 73001$

$X, Y, Z$ are sets of all positive divisors of $10^{60}, 20^{50}$ and $30^{40}$ respectively. Find $n(X \cup Y \cup Z)$.

Similar Questions

How many $3$-digit numbers can be formed by using the digits $1, 3, 6,$ and $8$,when the digits may be repeated any number of times?

If $\frac{{}^{n + 2}{C_6}}{{}^{n - 2}{P_2}} = 11$,then $n$ satisfies the equation

If $n$ is even and the value of $^nC_r$ is maximum,then $r = $

In how many ways can $6$ persons stand in a queue at a time?

All the five-digit numbers in which each successive digit exceeds its predecessor are arranged in the increasing order of their magnitude. The $97^{th}$ number in the list does not contain the digit:

Vedclass Test Series

Exam Paper Generator

Online Exam Module