The [b][i]highest common factor[/i][/b] of two positive integers [i][color=#0000ff]a [/color][/i]and [i][color=#ff0000]b[/color]:[br]- [/i]is denoted as[i] [b]HCF[/b][/i][b]([i]a, b[/i])[/b][br]- is the largest positive integer among the common divisors of [i][color=#0000ff]a[/color][/i] and[color=#ff0000] [i]b[/i][/color][br]- is always a number smaller than or equal to the smallest number between [i][color=#0000ff]a[/color][/i] and [i][color=#ff0000]b[/color][/i][br][br]To [b]find[/b] the [i][b]HCF[/b][/i] of two positive integers [i][color=#0000ff]a [/color][/i]and [i][color=#ff0000]b[/color][/i]:[br]- write the prime factorization of [i][color=#0000ff]a[/color][/i] and [i][color=#ff0000]b[/color][/i] [br]- [b]multiply [/b]together all the [b]common factors[/b] of the two numbers, [b]each taken once[/b] and with its [b]minimum exponent[/b].

Enter two numbers in the app below, and explore the Euler-Venn representation of their factors and their highest common factor.