Greatest Common Divisor: Revision history

28 April 2023

• curprev 09:1209:12, 28 April 2023‎ Admin talk contribs‎ 1,404 bytes −175‎ No edit summary

10 April 2023

• curprev 07:5307:53, 10 April 2023‎ Admin talk contribs‎ 1,579 bytes +27‎ No edit summary

15 February 2023

• curprev 14:4814:48, 15 February 2023‎ Admin talk contribs‎ 1,552 bytes −15‎ No edit summary
• curprev 13:0513:05, 15 February 2023‎ Admin talk contribs‎ 1,567 bytes +14‎ No edit summary
• curprev 12:0312:03, 15 February 2023‎ Admin talk contribs‎ 1,553 bytes −11‎ No edit summary
• curprev 10:2610:26, 15 February 2023‎ Admin talk contribs‎ 1,564 bytes +210‎ No edit summary

10 October 2022

• curprev 10:5610:56, 10 October 2022‎ Admin talk contribs‎ 1,354 bytes +1,354‎ Created page with "== Problem Description== The greatest common divisor, sometimes also called the highest common divisor (Hardy and Wright 1979, p. 20), of two positive integers a and b is the largest divisor common to a and b. For example, GCD(3,5)=1, GCD(12,60)=12, and GCD(12,90)=6. The greatest common divisor GCD(a,b,c,...) can also be defined for three or more positive integers as the largest divisor shared by all of them. Two or more positive integers that have greatest common divis..."