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

Prove that n ℂ Z+ is divisible by 3( respectively 9). to show that if and only if the sum of its digits is divisible by 3

2. Relevant equations

3. The attempt at a solution

so n= 3q, q>3 that n[itex]\equiv[/itex]0 mod 3

n=X1* 10^n+ x2*10^n-1......Xn

so need to prove(x1+x2+......Xn)[itex]\equiv[/itex]0 mod 3, the how to prove the next step

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

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

# Homework Help: Number theory problem divisible

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