Math

[Guest]

Prove that if a,b,c,d,m,t are positive integers, m≠1,
[a]\equiv[/b](mod m)
then
gcd((a²c³d²+b²c³d²+1-2abc³d²)^t,m)=1.