25.
The number that goes into both 75 and 100 is their greatest common divisor (GCD). The GCD of 75 and 100 is 25, as it is the largest number that can evenly divide both. Therefore, 25 is the number that goes into both 75 and 100. Other common divisors include 1 and 5.
GCD: 75
GCD: 1
GCD(33, 100) = 1
Euclid's Algorithm (http://www.cs.berkeley.edu/~vazirani/s99cs170/notes/lec3.pdf). the mod function (or %, as used here) is equal to the remainder of x/y. In this first case, 375 mod 275 = the remainder of 375/275, 375/275 is 1 r100 thus 375%275=100. gcd(375,275) => gcd(275,375%275) = gcd(275,100) =>gcd(100,275%100) = gcd(100,75) => gcd(75,100%75) = gcd(75,25) => gcd(25,75%25) = gcd(25,0) ===> gcd is 25.
The GCF is 15.
The Greatest Common Divisor (GCD) for 36 100 is 4
15 fifteen
The GCD of 18, 100 is 2.
15
The GCF is 3.
15