I'm working on a question about factorization of a GCD.
Let x = p$^{n1}_1$ ... p$^{nk}_k$
Is it correct to answer this with: p$^{n1}_1$ + $^{m1}_1$ ... p$^{nk}_k$ + $^{mk}_k$ ?
I'm working on a question about factorization of a GCD.
Let x = p$^{n1}_1$ ... p$^{nk}_k$
Is it correct to answer this with: p$^{n1}_1$ + $^{m1}_1$ ... p$^{nk}_k$ + $^{mk}_k$ ?
Copyright © 2021 JogjaFile Inc.
No, try $x=12=2^2\cdot 3^1 \cdot 5^0, y=1350=2^1\cdot 3^3 \cdot 5^2$. The GCD is not $2^3\cdot 3^4 \cdot 5^2=16200$ For a common divisor, you need the minimum of the exponents.