g the size up. Then figure out which quantum the given input n corresponds to.) 2.231 A function f : A → B is said to be c-to-1 if, for every output value b ∈ B, there are exactly c different values a...

g the size up. Then figure out which quantum the given input n corresponds to.) 2.231 A function f : A → B is said to be c-to-1 if, for every output value b ∈ B, there are exactly c different values a ∈ A such that f(a) = b. (These functions are useful in counting; see the Division Rule in Theorem 9.11.) For what values of k is it possible to define a c-to-1 (for some integer c) quantizing function that transforms into {0, 1, . . . , 255} into a set of k quanta?