What is the purpose of using modulo 2 arithmetic rather than binary arithmetic in computing an fcs?

When using modulo 2 arithmetic it is easy to implement and get the result. Any arithmetic process would work provided it applied the same way in the forward and reverse the process. Modulo 2 arithmetic is performed digit by digit on binary numbers. Each digit is considered independently from its neighbors, numbers are not carried or borrows.