Using a new approach starting with a residue computation, we sharpen some of the known estimates for the counting function of friable integers. The improved accuracy turns out to be crucial for various applications, some of which concern fundamental questions in probabilistic number theory.