)we say that a number n is a “rainbow” number if every digit from {0, 1, . . 9} shows up exactly once in n; for example, 1234567890 and 1029384756 are both rainbow numbers. take any two integer rainbow numbers n, m. prove that n − m ≡ 0 mod 9.