• Answer of this question

    155 and 1385Find the Euclid's divusi on n algorithms
    Isaiah Thompson's image
    Isaiah Thompson
    Step 1. Divide the larger number by the smaller one: 1,385 ÷ 155 = 8 + 145; Step 2. Divide the smaller number by the above operation's remainder: 155 ÷ 145 = 1 + 10; Step 3. Divide the remainder from the step 1 by the remainder from the step 2: 145 ÷ 10 = 14 + 5; Step 4. Divide the remainder from the step 2 by the remainder from the step 3: 10 ÷ 5 = 2 + 0; At this step, the remainder is zero, so we stop: 5 is the number we were looking for, the last remainder that is not zero. This is the greatest common factor (divisor).Greatest (highest) common factor (divisor): gcf, gcd (155; 1,385) = 5;

    Written on April 7, 2021, 11:46 p.m.