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

Problem

Ankita tries to find the highest common factor of a and b using Euclid's division algorithm left parenthesis, start text, E, D, A, end text, right parenthesis.
In one of her steps, she divides 867 by 255.
Find the highest common factor of a and b.
start text, H, C, F, end text, left parenthesis, a, comma, b, right parenthesis, equals
  • Your answer should be
  • an integer, like 6
  • a simplified proper fraction, like 3, slash, 5
  • a simplified improper fraction, like 7, slash, 4
  • a mixed number, like 1, space, 3, slash, 4
  • an exact decimal, like 0, point, 75
  • a multiple of pi, like 12, space, start text, p, i, end text or 2, slash, 3, space, start text, p, i, end text
Stuck?
Stuck?