(adsbygoogle = window.adsbygoogle || []).push({}); 1. The problem statement, all variables and given/known data

Suppose a, b, n are integers with n >/= 2

Prove that:

(a + b) mod n = ((a mod n) + (b mod n)) mod n

2. Relevant equations

Modular arithmetic rules.

3. The attempt at a solution

r1 = a(modn)

=> a = q1n + r1

r2 = bmodn

=> b = q2n + r2

r1 + r2 = a - q1n + b - q2n

= (a + b) + (-q1 - q2)n

Here is where I have no idea where to go. :S

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Modular Arithmetic Proof, Help Needed

**Physics Forums | Science Articles, Homework Help, Discussion**