kavach wrote:
Bunnel can you please teach me how to solve this question?
Hey
kavach, i believe your query is to Bunuel, the Legend! Let me tag
Bunuel here.
Regarding this question, let me try to explain here:
To find highest power of a 288 in 55!, we'll approach as follows:
prime factorize 288 = 2^5 * 3^2,
Now check highest power of 2^5 and 3^2 in 55!
-> check for 2 -> 27+13+6+3+1 = 50, and for 2^5 highest power becomes
10-> check for 3 -> 18+6+2 = 26, and for 3^2 highest power becomes
13Now, 288 is formed by 5 instances of 2 & 2 instances of 3.
Number of possible pairs of 2^5 and 3^2 = Min(10,13) => 10
Answer: Option CHope it is helpful!
_________________
Just In case you liked my post, Hit +1 Kudos!!