Lets suppose we have two integers $a$ and $b$ such that $b\mid a$ and an integer $p$ that is not co-prime with $b$. In that case, $b^{-1}$ does not exist in $\mathbb{Z_p}$, but there is an integer number, let's call it $c$, that satisfy the relation $\frac{a}{b}=c$. The question is that could we consider that $c \mod p$ is the answer to the calculation $\frac{a}{b}\pmod p$?
Let's show a concrete example, $\frac{7!}{5!}\pmod 5$, $5!$ has no inverse, but $\frac{7!}{5!}=42$ and $42 \bmod 5 = 2$, so could we say that $2$ is the answer to the question or an answer does not exist?
Thanks