Question

let a and b to be two positive integers. is gcd(a², b²) =(gcd (a, b))² ? ? if it is true then prove it, if it is not then give a counter example.​

Answer 1

SORRY DI(SIS)

I DON'T KNOW ABOUT THIS

THOUGH I HAVE POSTED A ANSWER

PLEASE CHECK IT , IF IT HELPS YOU

PLEASE MARK IT AS BRAINLIST

We can prove that GCD(A,0)=A is as follows:

We can prove that GCD(A,0)=A is as follows:The largest integer that can evenly divide A is A.

We can prove that GCD(A,0)=A is as follows:The largest integer that can evenly divide A is A.All integers evenly divide 0, since for any integer, C, we can write C ⋅ 0 = 0. So we can conclude that A must evenly divide 0.

We can prove that GCD(A,0)=A is as follows:The largest integer that can evenly divide A is A.All integers evenly divide 0, since for any integer, C, we can write C ⋅ 0 = 0. So we can conclude that A must evenly divide 0.The greatest number that divides both A and 0 is A.

HOPE IT HELPS YOU.....