Unlikely to the collision channels with ternary feedback (0 for idle slot, 1 for a slot where exactly one packet was successfully transmitted, and the collision symbol * is for a slot where more then one packets were transmitted and they collided), if the feedback is the multiplicity of the collisions, then the channel can be asymptotically fully utilized. This surprising fact was shown by Pippenger [1] in a probabilistic way. In [2] Ruszinkó and Vanroose gave an explicit algorithm which reaches this optimum. In this chapter we try to pay the attention of the reader how combining results from different branches, e.g., number theory, search theory, probability theory could relatively easily solve this long standing open problem.