C Language seeking greatest common divisor and least common multiple

Source: Internet
Author: User
Tags greatest common divisor

Seeking greatest common divisor and least common multiple

Assuming that there are two numbers a and B, the greatest common divisor and least common multiple of a B are actually a problem, and it is concluded that the greatest common divisor of these two numbers can calculate their least common multiple.

Least common multiple's formula is a*b/m.

M for greatest common divisor

Because A=m*i; B=m*j;

Least common multiple to m*i*j

Methods for calculating the greatest common divisor of A and B:

Method One:

More Phase loss subtraction:

The largest of the two numbers is subtracted from the smallest, until two is equal, this number is greatest common divisor

such as 4 and 6

6-4=2

2 numbers become 4 and 2.

4-2=2

Two numbers become 2 and 2.

2=2 that is 2 is two number of greatest common divisor

Method Two:

Euclidean method:

Approximate principle similar to more phase loss subtraction

A>b

The remainder of the a%b is R

C Language seeking greatest common divisor and least common multiple

Related Article

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.