Mathematica MathWorld Wolfram Science More »

HOME

TOPICS

LATEST

Finding the Greatest Common Divisor of Two Numbers by Factoring

You can find the greatest common divisor (GCD) of two numbers by multiplying together all the prime factors they have in common.

Contributed by: Jesse Nochella

Show Initialization Code

(8 lines omitted)

A much more efficient way of computing GCDs has been known for the past 2300 years. Named the Euclidean Algorithm, it is one of the oldest mathematical procedures known, appearing in Euclid's Elements around 300 BC.

Divisor (Wolfram MathWorld)

Greatest Common Divisor (Wolfram MathWorld)

Euclidean Algorithm (Wolfram MathWorld)

"Finding the Greatest Common Divisor of Two Numbers by Factoring" from The Wolfram Demonstrations Project
http://demonstrations.wolfram.com/FindingTheGreatestCommonDivisorOfTwoNumbersByFactoring/

Contributed by: Jesse Nochella

Report an issue »

Interact with Demonstrations using the latest version of the free Mathematica Player—Download Now

Browse all topics

Browse all education topics

	Source page:
	Email	Name (optional)
	Occupation (optional)	Organization (optional)
	I use Mathematica often occasionally never
	Country (optional) Remember me
	Note: Please do not include anything you consider confidential or proprietary. Your message and contact information may be shared with the author of any specific Demonstration for which you give feedback, but will not otherwise be published or distributed. Privacy Policy »

Wolfram Research

Site Index

RSS

Atom