Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Greatest common divisor
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== Applications == === Reducing fractions === {{further|Irreducible fraction}} The greatest common divisor is useful for reducing [[fraction]]s to the [[Irreducible fraction|lowest terms]].<ref>{{Cite web|title=Greatest Common Factor|url=https://www.mathsisfun.com/greatest-common-factor.html|access-date=2020-08-30|website=www.mathsisfun.com}}</ref> For example, {{math|1=gcd(42, 56) = 14}}, therefore, : <math>\frac{42}{56}=\frac{3 \cdot 14 }{ 4 \cdot 14}=\frac{3 }{ 4}.</math> === Least common multiple === {{Further|Least common multiple}} The least common multiple of two integers that are not both zero can be computed from their greatest common divisor, by using the relation : <math>\operatorname{lcm}(a,b)=\frac{|a\cdot b|}{\operatorname{gcd}(a,b)}.</math>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)