11
votes
Accepted
You're going to laugh, but the nonzero integers have a natural group law using multiplication and gcd formula (no addition!)
Unfortunately, $4 \ast 2=\frac{8}{4}=2=1 \ast 2$, so $\ast$ can’t be a group law.
6
votes
Accepted
Polynomial gcd of $x^5+x+1$ and $x^2+1$
Let $d(x)$ be the greatest common divisor, so that $d(x)\mid x^2+1$ and $d(x)\mid x^5+x+1$.
Suppose $d(x)\ne 1$.
Then any root of $d$ is a root of $x^2+1$, so equals $\pm i$.
Any root of $d$ is a root ...
3
votes
Accepted
Possible values of $\gcd(2a^2+6a-4, 2a^2+4a-3)$
Any common factor of $2a^2+6a-4$ and $2a^2+4a-3$ is also a factor of
$(2a^2+6a-4)-(2a^2+4a-3)=2a-1$
and hence of $(2a^2+4a-3)-a(2a-1)=5a-3$
and hence of $5(2a-1)-2(5a-3)=1$.
If you wish you can ...
2
votes
Polynomial gcd of $x^5+x+1$ and $x^2+1$
One other way I see is to factorize $x^5+x+1$ over $\Bbb Q$. Since it has no rational root by the rational root theorem, we may assume that it is a product of a quadratic and a cubic polynomial. This ...
1
vote
Polynomial gcd of $x^5+x+1$ and $x^2+1$
Go to complex numbers, as the GCD is the same over real numbers and over complex numbers. (Euclid's algorithm doesn't "care" if you are executing it in $\mathbb R$ or in a bigger field.)
So, ...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
gcd-and-lcm × 3140elementary-number-theory × 1293
number-theory × 499
divisibility × 496
abstract-algebra × 262
prime-numbers × 178
polynomials × 165
euclidean-algorithm × 161
solution-verification × 147
modular-arithmetic × 147
discrete-mathematics × 119
ring-theory × 97
prime-factorization × 80
proof-writing × 78
group-theory × 67
arithmetic × 60
proof-explanation × 54
algebra-precalculus × 51
integers × 47
algorithms × 45
combinatorics × 44
divisor-sum × 44
linear-algebra × 40
summation × 39
factoring × 39