Lizzie came up with a divisibility test for a certain number $m \neq 1$: 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+35=52.

Sorry for the big problem but I really need help with this :grimacing:

Lizzie came up with a divisibility test for a certain number $m \neq 1$:

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+35=52.

Step-by-step explanation:

step-by-step explanation:

function 2 has a greater rate of change than function 1

function 2 has a greater y-intercept than function 1

step-by-step explanation: