Notifications
Clear all

CONGRUENCE PROBLEM: PLEASE WHAT IS THE APPROACH TO THIS PROBLEM DO I USE CHINESE REMAINDER THEOREM  

  

0
Topic starter

1 Answer
0

You first need to find the highest power of 10 dividing 2017! Try to understand why that is equivalent to the highest power of 5 dividing that. Suppose that the highest power is "n". Now you need to find residue modulo (10^(n+2)), then you apply the Chinese remainder theorem taking the residue modulo (2^(n+2)) and modulo (5^(n+2)). For how to find the highest power of a prime dividing a factorial, check this link: How to get the highest power of a prime dividing a factorial

 

This post was modified 5 months ago by Mmesomachi Nwachukwu
Share: