SOLUTION: Show that any number of the form (ABCABC) is divisible by 13?

SOLUTION: Show that any number of the form (ABCABC) is divisible by 13?

Algebra.Com

Question 438354: Show that any number of the form (ABCABC) is divisible by 13?
Answer by richard1234(7193) (Show Source): You can put this solution on YOUR website!
If A,B,C are digits with , ABCABC can be expressed as 1001*ABC, since ABC000 = 1000*ABC, then just add ABC. 1001 is divisible by 13, so ABCABC must also be divisible by 13.
RELATED QUESTIONS
any number of the form "abcabc" must be divisible by which of the following: (1)8... (answered by Theo,ikleyn)

1. Show that the sum of any two odd numbers is always an even number. 2. Show that the... (answered by ewatrrr)

Show that 1 greater than the sum of the squares of any three consecutive integers is... (answered by richard1234)

find a number that; The last digit is even Sum of the digits is divisible by 3 The... (answered by jim_thompson5910)

Prove that the value of the expression is not divisible by 6 for any whole n:... (answered by MathLover1,greenestamps)

Find the counterexample to show that the following statement is incorrect: "The sum of... (answered by Edwin McCravy)

Find a counterexample to show that the following statement is incorrect: (answered by stanbon,MathLover1)

# 5. Find a counterexample to show that the following statement is incorrect: �The sum... (answered by jim_thompson5910)

If the sum of the digits is divisible by 9 that number is also divisible by 9,6,4,and... (answered by solver91311)