Is modulus capable of universal computation?
You have to distinguish between two meanings of computation:


Computation of functions on a finite domain (e.g. circuits).
Computation of functions on an infinite domain (e.g. Turing machines).


A single division operation cannot be universal in terms of the second meaning, since division is total: it always halts (even division by zero halts). However, it could possibly be universal in terms of the first meaning. For example, if we encode the input using different primes, then the Chinese Remainder Theorem shows that $x \mapsto n \pmod{x}$ is universal, that is, for every Boolean function $f$ on some set $S$ of finite primes there is a number $n$ such that for every $x \in S$, $n \mod{x} = f(x)$.