One addendum: while the original prompt is hard to follow, if I'm reading it correctly (and I may not be) there are a lot of possible values for c and k, though I agree with Rich that (c - k) = 400.
Let's define the function first.
If xyz is a three digit number such that x is the 100s digit, y is the 10s digit, and z is the units digit (e.g. xyz is NOT x * y * z), then g(xyz) = 2^x * 3^y * 5^z.
So, for instance, g(209) = 2^2 * 3^0 * 5^9.
If we know that c and k are three digit integers, let c = the three digit # abd and k = the three digit # efg.
f(c) = f(abd) = 2^a * 3^b * 5^d
f(k) = f(efg) = 2^e * 3^f * 5^g
If f(c) = 16f(k), then 2^a * 3^b * 5^d = 16 * 2^e * 3^f * 5^g,
or
2^a * 3^b * 5^d = 2^4 * 2^e * 3^f * 5^g
or
2^a * 3^b * 5^d = 2^(e+4) * 3^f * 5^g
Since both sides of the equation represent integers, and these integers are the same, they have the same prime factorization. Our bases are all prime, so a = e + 4, b = f, and d = g.
Returning to our three digit numbers, that means that they each have the same tens and units digits, but the hundreds digit of c is 4 greater than the hundreds digit of k. So c - k = 400.
Just to illustrate, say c = 512 and k = 112. Then f(c) = 2^5 * 3^1 * 5^2 and f(k) = 2^1 * 3^1 * 5^2. f(c) = 16f(k), and c and k are three digit integers, so these values satisfy the equation.
Open follow up question to stimulate a chat on these boards: how many possible coordinates (c,k) are there that satisfy the function above and the equation f(c) = 16f(k)?
EDIT: Mitch, you are quick on the draw, you beat me to it! Still, I took forever typing this, so I'm leaving it up
