Number Theory involving GCD, LCM, Mod and Others

Ternary generalizations
of gcd(n,m)lcm(n,m)=nmgcd(n,m)lcm(n,m)=nm
Ask Question
Asked 5 years, 10 months ago
Modified 5 years, 10 months ago
Viewed 189 times
3
gcd(n,m)lcm(n,m)=nm.gcd(n,m)lcm(n,m)=nm. Can this theorem work with 3 integers? And how
to prove it? I tried doing this with 2 integers n,m , but I can't figure out how to do it with 3.
 elementary-number-theory

 gcd-and-lcm

 least-common-multiple

Share
Cite
Follow
edited Jan 30, 2017 at 17:24

Bill Dubuque
261k3737 gold badges270270 silver badges885885 bronze badges
asked Jan 30, 2017 at 11:43

Ben
9755 bronze badges
 1
abc=a(bc)abc=a(bc). What are DBD and MBK?
– user14972
Jan 30, 2017 at 11:46
 Oh sorry, Im not native english speaker so I miswrote them, DBD is GCD and MBK is LCM
– Ben
Jan 30, 2017 at 11:48
Add a comment
2 Answers
Sorted by:
Highe st sc ore (de fa ult)

2
From here:
 Number Theory involving GCD, LCM, Mod and Others
We have that

Theorem: lcm(a,b,c)=abc(bc,ca,ab) lcm(a,b,c)=abc(bc,ca,ab)

Proof: a,b,c⟺abc⟺abc⟺ abc(bc,ca,ab)∣ k∣ kbc,kca,kab∣(kbc,kca,kab)=k(bc,ca,a

b)∣∣∣ k a,b,c∣ k⟺abc∣ kbc,kca,kab⟺abc∣(kbc,kca,kab)=k(bc,ca,ab)⟺ abc(bc,ca,ab)| k

where (bc,ca,ab)(bc,ca,ab) means the gcd of ab,bc,caab,bc,ca. Hope it helps.

Share
Cite
Follow
edited Apr 13, 2017 at 12:20

CommunityBot
1
answered Jan 30, 2017 at 11:57
user371838
 As a courtesy, when you quote verbatim an answer posted by another user, you should cite that answer.
– Bill Dubuque
Jan 30, 2017 at 15:30
 @BillDubuque Yes, yes, very sorry. In fact I was then going to cite that answer, but due to unavoidable
circumstances, totally forgot about it. Will never do it again. Very sorry once again.
– user371838
Jan 30, 2017 at 15:37
 No problem, I presumed it was an oversight.
– Bill Dubuque
Jan 30, 2017 at 15:39
Add a comment
0
Let the highest power of prime pp that divides a,b,ca,b,c be A,B,CA,B,C respectively.

So, the highest power of prime pp that divides the GCD will be min(A,B,C)(A,B,C)

and the highest power of prime pp that divides the LCM will be max(A,B,C)(A,B,C)

We need min(A,B,C)+(A,B,C)+max(A,B,C)=A+B+C(A,B,C)=A+B+C for any prime that

divides at least one of a,b,ca,b,c

WLOG min(A,B,C)=A,(A,B,C)=A, and

max(A,B,C)=C⟹A+C=A+B+C⟺B=0(A,B,C)=C⟹A+C=A+B+C⟺B=0

So, (a,b,c)(a,b,c) must be 11 for LCM(a,b,c)⋅(a,b,c)⋅GCD(a,b,c)=abc(a,b,c)=abc

For the two integer case, trivially min(A,B)+(A,B)+max(A,B)=A+B(A,B)=A+B

Share
Cite
Number Theory involving GCD, LCM, Mod and Others
Follow
answ