GCD(a+h,b+k) - Formula Given GCD(a,b) & GCD(h,k)?

  • Thread starter Thread starter harshant
  • Start date Start date
  • Tags Tags
    Gcd
harshant
Messages
29
Reaction score
0
Is there a formula for gcd(a+h,b+k) given gcd(a,b) and gcd(h,k)?...jus wondering
 
Physics news on Phys.org
harshant said:
Is there a formula for gcd(a+h,b+k) given gcd(a,b) and gcd(h,k)?...jus wondering
No such formula exists
 
ramsey2879 said:
No such formula exists

Yes, there can't be such a formula. For (a, b, h, k) = (1, 1, 1, 1) and (1, 2, 2, 1), gcd(a, b) = gcd(h, k) = 1, but gcd(a+h, b+k) is 2 and 3 (respectively).
 

Thread '##(A/\mathfrak{a})_{\mathfrak{p}/\mathfrak{a}}## and its isomorphism?'

I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
View full post »

Thread 'Questions about non existence of GCDs vs (coimages, cokernels)'

The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
View full post »

Thread 'Trouble understanding an online solution to an exercise in Dummit & Foote'

##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
View full post »

Similar threads

I Clarifications needed for an exercise in Hungerford's abstract algebra
Replies
23
Views
440
MHB GCD of a and b: Proving $gcd(a',b')=1$
Replies
4
Views
2K
Prove that ## gcd(a, n)=gcd(b, n) ##.
Replies
2
Views
2K
MHB Properties of gcd's and relatively prime integers
Replies
2
Views
2K
Can anyone please review/verify my proofs for gcd problem?
Replies
4
Views
2K
MHB Question about problem involving gcd
Replies
2
Views
2K
MHB Does Z[root(-3)] Qualify as a GCD Domain?
Replies
1
Views
2K
Proving LCM Formula and GCD for Non-Integers
2
Replies
59
Views
13K
GCD of a and b Prime and Odd: 1 or p?
Replies
1
Views
2K
Can anyone please review/verify/check this number theory proof?
Replies
12
Views
1K

Hot Threads

Recent Insights

Back
Top