  Thomassen, in 1983, conjectured that for a positive integer $k$, every
$2$-connected non-bipartite graph of minimum degree at least $k + 1$ contains
cycles of all lengths modulo $k$. In this paper, we settle this conjecture
affirmatively.
