When working modulo $m$, the notation $a^{-1}$ is used to denote the residue $b$ for which $ab\equiv 1\pmod{m}$, if any exists. For how many integers $a$ satisfying $0 \le a < 100$ is it true that $a(a-1)^{-1} \equiv 4a^{-1} \pmod{20}$?
<|im_start|>system
You are a helpful assistant.<|im_end|>
<|im_start|>user
When working modulo $m$, the notation $a^{-1}$ is used to denote the residue $b$ for which $ab\equiv 1\pmod{m}$, if any exists. For how many integers $a$ satisfying $0 \le a < 100$ is it true that $a(a-1)^{-1} \equiv 4a^{-1} \pmod{20}$?
Please reason step by step, and put your final answer within \boxed{{}}.<|im_end|>
<|im_start|>assistant

user
0
When working modulo $m$, the notation $a^{-1}$ is used to denote the residue $b$ for which $ab\equiv 1\pmod{m}$, if any exists. For how many integers $a$ satisfying $0 \le a < 100$ is it true that $a(a-1)^{-1} \equiv 4a^{-1} \pmod{20}$?
train