Let n and m be integer numbers. Prove that, if 3n+7m
is divisible by 19, then the number 43n + 75m is divisible by 19 also.
Though the solution space is small enough to use a spreadsheet like Larry did, we don't even need that much. Start with the given condition and do some modular arithmetic.
8*(3n + 7m) = 8*0 mod 19
24n + 56m = 0 mod 19
(19n + 19m) + 24n + 56m = (19n + 19m) + 0 mod 19
43n + 75m = 0 mod 19