There is no way to calculate LCM which isn't useful for integer factorization
Hm. Factoring an integer: factors( i ).
Least common multiple: lcm( i, j ).
If I need to factor (say) 100, what other integer do I substitute for xxx in: lcm( 100, xxx );?
and vice versa
So, factors( i ) == ... lcm( i, ??? )... and lcm( i, j ) == ... factors( i ) ....;.
Isn't it a bit of a problem if you need lcm() to discover factors; and factors to discover lcm()?
Your assertion is as devoid of logic and meaning; as the "usefulness of lcm to integer factorisation" is, to the question asked in the OP.
With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
| [reply] [d/l] [select] |