Edit MetaData
8 years ago
8 years ago
Hi Bhargav
899 = 29*31, So we can find out the remainders with 29 and 31 separately and then we can use Chinese remainder theorem.
28! mod 29 = 28 ,(By Wilson's theorem)
28! mod 31 = 15 (Extended wilson's theorem)
So By CRT we can say that required number is 29k+28 = 31m+15
The smallest number which satiesfies this condition is 666
So the required remainder is 666
Hope it is clear now.
Thanks
Detailed syllabus & Topic-wise Weightage
By proceeding you agree to create your account
Free CAT Syllabus PDF will be sent to your email address soon !!!