If you're seeing this message, it means we're having trouble loading external resources on our website.

If you're behind a web filter, please make sure that the domains *.kastatic.org and *.kasandbox.org are unblocked.

Main content

Finding HCF through Euclid's division algorithm

You might need: Calculator


Ankita tries to find the highest common factor of a and b using Euclid's division algorithm (EDA).
In one of her steps, she divides 867 by 255.
Find the highest common factor of a and b.
  • Your answer should be
  • an integer, like 6
  • a simplified proper fraction, like 3/5
  • a simplified improper fraction, like 7/4
  • a mixed number, like 1 3/4
  • an exact decimal, like 0.75
  • a multiple of pi, like 12 pi or 2/3 pi