+0  
 
0
141
2
avatar

Lizzie came up with a divisibility test for a certain number :\(m\)

Break a positive integer \(n\) into two-digit chunks, starting from the ones place. (For example, the number \( 354764\) would break into the two-digit chunks \(64,47,35\) )

Find the alternating sum of these two-digit numbers, by adding the first number, subtracting the second, adding the third, and so on. (In our example, this alternating sum would be \(64-47+54=52.\))

Find m and show that this is indeed a divisibility test for m (by showing that n is divisible by m if and only if the result of this process is divisible by m).

 Feb 18, 2021
 #1
avatar
0

Try writing out the number in decimal.

 Feb 18, 2021
 #2
avatar
0

hi this is the same person who wrote the question is it correct that as if you do this process with any multiple of 101 you get 0 and as you can divide any number by 0 that is the answer?

Guest Feb 19, 2021

20 Online Users