Difference between revisions of "Divisibility rules/Rule 2 for 7 proof"

Line 8: Line 8:
 
==See also==
 
==See also==
 
[[Divisibility rules | Back to Divisibility Rules]]
 
[[Divisibility rules | Back to Divisibility Rules]]
 +
[[Category:Divisibility Rules]]

Revision as of 19:26, 6 March 2014

Truncate the last digit of $N$, double that digit, and subtract it from the rest of the number (or vice-versa). $N$ is divisible by 7 if and only if the result is divisible by 7.

Proof

An understanding of basic modular arithmetic is necessary for this proof.

The divisibility rule would be $2n_0-k$, where $k=d_110^0+d_210^1+d_310^2+...$, where $d_{n-1}$ is the nth digit from the right (NOT the left) and we have $k-2n_0\equiv 2n_0+6k$ and since 2 is relatively prime to 7, $2n_0+6k\equiv n_0+3k\pmod{7}$. Then yet again $n_0+3k\equiv n_0+10k\pmod{7}$, and this is equivalent to our original number.

See also

Back to Divisibility Rules

Invalid username
Login to AoPS