- #1
e(ho0n3
- 1,357
- 0
[SOLVED] An LCM Problem
Homework Statement
Let a and b be positive integers and let m = lcm(a,b). If s is a multiple of both a and b, prove that s is a multiple of m.
The attempt at a solution
I want to do this without the fact that all multiples of a and b have the form n[(ab) / gcd(a,b)]. This seems impossible. Any tips?
Homework Statement
Let a and b be positive integers and let m = lcm(a,b). If s is a multiple of both a and b, prove that s is a multiple of m.
The attempt at a solution
I want to do this without the fact that all multiples of a and b have the form n[(ab) / gcd(a,b)]. This seems impossible. Any tips?