In this survey, we overview the celebrated Ramanujan’s congruences modulo 5, 7 and 11 for the partition function and how the classical combinatorial statistics rank and crank introduced by Dyson, Andrews and Garvan explain them. We also present some recent results on the explicit calculation of the dissections of the deviations of rank and crank and how these computations help to deduce unexpected arithmetic properties of these combinatorial statistics. In addition, we posed some open problems in this area. Bibliography: 36 titles. © The Author(s), under exclusive licence to Springer Nature Switzerland AG 2025.