divisibility problem and gcd Let a and b be a positive integers. Proof that if number $ 100ab -1 $ divides number $ (100a^2 -1)^2 $ then also divides number $ (100b^2 -1)^2 $.
My attempt:
Let's notice that \begin{split} b^2(100a^2-1)^2 -a^2(100b^2-1)^2 & =(100a^2b-b)^2-(100ab^2-a)^2\\
 & =(100a^2b-b-100ab^2+a)(100a^2b-b+100ab^2-a)\\
 & =(100ab(a-b)+(a-b))(100ab(a+b)-(a+b))\\
 & =(a-b)(100ab+1)(a+b)(100ab-1).\end{split}
This means that $ 100ab-1 |a^2(100b^2-1)^2$, so if we proof that $\gcd(100ab-1,a^2)=1$ the proof is completed. Now I know that it  should be trivial to show that these numbers are relatively prime but somehow i have no idea how to do it.
Also I am intrested if there is a way to solve this problem by using modular arithmetic?

We show how modular arithmetic allows us to view it as a special case of polynomial reversal, i.e. that $f(a)=0\Rightarrow \tilde f(a^{-1})=0,\,$ where $\tilde f$ denotes the reverse (reciprocol) polynomial.
Here mod arithmetic works nicely:  $\bmod 100ab-1\,$ we have $\,100ab\equiv 1\,$ so $\,\color{#c00}{a \equiv 1/(100b)}.\,$ We can substitute this into any polynomial equation $\,f(\color{#c00}a)\equiv 0\,$ then clear denom's to get an equation $\,g(b)\equiv 0\,$ for $\,b.\,$ Here $f(a)\equiv (100\color{#c00}a^2-1)^2\equiv0\,$ so making said $\rm\color{#c00}{substitution}$ for $\,\color{#c00}a\,$ yields
$$0\equiv f(a) \equiv \left[\dfrac{100}{(\color{#c00}{100b})^2}-1\right]^2 \equiv \left[\dfrac{1-100b^2}{\color{#0a0}{100b^2}}\right]^2\!\Rightarrow (1-100b^2)^2\equiv 0\!\!$$

Your proof, viewed modularly, essentially squares the following equation (compare here)
$$\begin{align} 
b(\color{#c00}{100a}a-1) &\,\equiv\, a(1-\color{#0a0}{100b}b)\\
\iff\ \ b\ (\color{#c00}{b^{-1}}\ a-1) &\,\equiv\, a(1-\ \color{#0a0}{a^{-1}}\ b),\,\ \text{is true by both} \equiv a-b 
\end{align}\qquad$$
So squaring we get $\,(100aa-1)^2\equiv 0\Rightarrow \color{#0a0}{a^2}(1-100bb)^2\equiv 0\Rightarrow (1-100bb)^2\equiv 0\,$ by twice cancelling the unit (invertible) $\,\color{#0a0}a\,$, i.e. by scaling by $\,\color{#0a0}{a^{-1}\, (\equiv 100b)}$.

Remark $ $ We can do all arithmetic fraction-free by scaling $\,f(a)\,$ by $\,(\color{#0a0}{100b^2})^2$ (this is essentially what is done in S. Dolan's answer, but there the key idea $\rm\color{#c00}{(elimination)}$ is not brought to the fore).
Above is a slight variation of the following well known result: $ $ if  $\,a\,$ is a root of a polynomial $\,f(x)\,$ then $\,a^{-1}\,$ is a root of the reciprocal (reverse) polynomial $\,x^{d}f(1/x),\,$ $\, d := \deg f,\,$ as above.
Thus by using modular arithmetic we can express the problem using equations (congruences) and this allows us to use well-known facts on the relationship between an equation for $\,a\,$ and one for its inverse $\,a^{-1}.\,$ This relationship would be obfuscated if we used only divisibility language (vs. congruence equations).
