Let n, k be positive integers such that n is not divisible by 3 and k≥n. Prove that there exists a positive integer m which is divisible by n and the sum of its digits in the decimal representation is k. modular arithmeticnumber theoryrelatively prime