3
$\begingroup$

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

I tried this:

Intersection[Divisors[200], Divisors[280]] // Last
$\endgroup$

closed as off-topic by Henrik Schumacher, Michael E2, LCarvalho, JungHwan Min, andre314 Aug 2 '18 at 20:57

This question appears to be off-topic. The users who voted to close gave this specific reason:

  • "This question arises due to a simple mistake such as a trivial syntax error, incorrect capitalization, spelling mistake, or other typographical error and is unlikely to help any future visitors, or else it is easily found in the documentation." – Henrik Schumacher, Michael E2, LCarvalho, JungHwan Min, andre314
If this question can be reworded to fit the rules in the help center, please edit the question.

  • 3
    $\begingroup$ Yes, it is called GCD: Greatest Common Divisor. $\endgroup$ – Henrik Schumacher Aug 2 '18 at 20:21
  • 1
    $\begingroup$ Thank you. I was searching because I'm Brazilian and the acronym here is MDC $\endgroup$ – LCarvalho Aug 2 '18 at 20:22
  • 2
    $\begingroup$ No problem. I'm German and it's called GGT here. =) $\endgroup$ – Henrik Schumacher Aug 2 '18 at 20:23
  • 4
    $\begingroup$ And just in case: LCM might also be of interest. $\endgroup$ – Henrik Schumacher Aug 2 '18 at 20:25

Browse other questions tagged or ask your own question.