Counting, modular counting and graph homomorphisms by Magkakis, A

“…A characteristic feature of counting modulo <em>k</em> is that the objects to be counted can be grouped in sets of size <em>k</em> and, thus, cancel out. …”