I need help with a number theory problem. Gcd and division algorithm stuff. Any help is appreciated!?

let a,b be positive integers. prove that there exist c,d that are positive integers such that c=a and gcd(c,d)=b if and only if b^2 divides a.