the question is:
given n find the top 20 msb in bit representation of its factorial.
i am trying to solve the question by finding the power of 2 in logn time in factorial of a number
if its greater than or equal to 20 then top 20 msb are zero
but what to do when power of 2 in prime factorisation is less than 20 here i am getting stuck how to solve it?
@Rj.25 please send the question link so that i can check
or tell the question no from the pdf you attached
there is no question link i watched this question in the video
the question is find the last 20 bits in the bit representation of a factorial of given number n
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.