So, you can write \((\sqrt{15!} + \sqrt{16!})^2\) as \((\sqrt{15!} + \sqrt{15!*16})^2\)
The square root of 16 is 4 so we can write this as \((\sqrt{15!} + 4\sqrt{15!})^2\) which is \((5\sqrt{15!})^2\)
Once we open the brackets we get 25*15!. The question asks what the greatest possible value of n is such that 25*15! is divisible by 5^n.
So basically, since 5 is a prime number how many times can 5 multiply by itself, so that it is divisible by 25*15!.
Well let us just break down 25*15!
25 is 5*5. 15! as we know is the multiple of all integers from 15 to 1. How many of those integers contain a 5? Well, 5, 10 (5*2) and 15 (5*3). So basically we could rewrite 25*15! as 5*5*5*5*5*1*2*3*4*6*7*8...... (no need to write these numbers out since its a waste of time and we only care about the 5s)
We can see that there are five 5s, in other words 5^5. Therefore, the greatest possible value of n is 5.
Aarushi225
What is the greatest possible value of n such that \((\sqrt{15!} + \sqrt{16!})^2\) is divisible by 5^n?
A. 0
B. 1
C. 3
D. 4
E. 5
The correct answer is 5 but i am getting 3 as my answer.
Can anyone help??