That is, real numbers modulo an integer. I'm just interested in shuffling around the $+$, $-$, $*$, and $/$ operations.
In case a concrete example helps, here's my current problem. (I'm from a programming background so there's probably a notation disconnect, sorry about that.)
$$ LI(x) = (LI_0 + x / PI) \bmod 1 $$
$$ LF(x) = (LF_0 + x / PF) \bmod 1 $$
$$ LI(s) + 0.5 = LF(f) $$
$$ f = s + PT / 2 $$
I need to find a solution for $s$, given $LI_0$, $LF_0$, $PI$, $PF$ and $PT$.
Also I think I might have a solution by dropping the "$\bmod 1$"s, solving for $s$ and then modding that by:
$$\frac{1}{ \left| \frac{1}{PI} - \frac{1}{PF} \right| }$$
But I can't tell if that actually works because it introduces an enormous rounding error.
Also, while this is the problem at hand and solving it is my immediate goal, I really want to understand how to generate that solution, for next time.