Is there a function that returns me the largest common divisor?

Asked Aug 02 '18 at 20:18

Active Aug 02 '18 at 20:24

Viewed 54 times

I tried this:

Intersection[Divisors[200], Divisors[280]] // Last

edited Aug 02 '18 at 20:24

Henrik Schumacher

asked Aug 02 '18 at 20:18

LCarvalho

3

Yes, it is called GCD: Greatest Common Divisor. – Henrik Schumacher Aug 02 '18 at 20:21
1

Thank you. I was searching because I'm Brazilian and the acronym here is MDC – LCarvalho Aug 02 '18 at 20:22
2

No problem. I'm German and it's called GGT here. =) – Henrik Schumacher Aug 02 '18 at 20:23
4

And just in case: LCM might also be of interest. – Henrik Schumacher Aug 02 '18 at 20:25

0 Answers0