Three girls X, Y and Z were asked to divide a certain number by 1547 by the method of factors. They took the factors in the order (7,13,17), (13,17,7) and (17,7,13) respectively. If the first girl X obtained (2,3,5) as successive remainder, then find the successive remainders obtained by the other two girls Y and Z.

A division algorithm is a rule that calculates the quotient and remainder of two integers, N and D, using Euclidean division. It can be applied by hand or used in software and digital circuit designs.  The division algorithm states that for any integer, a, and any positive integer, b, there are unique integers q and r such that a = bq + r. In this equation, r is greater than or equal to 0 and less than b.  The division algorithm can also be applied to polynomials.  The division algorithm for polynomials states that:  f(x) = q(x) g(x) + r(x)  This is the same as:  Dividend = Divisor *... Show more

A division algorithm is a rule that calculates the quotient and remainder of two integers, N and D, using Euclidean division. It can be applied by hand or used in software and digital circuit designs. 

The division algorithm states that for any integer, a, and any positive integer, b, there are unique integers q and r such that a = bq + r. In this equation, r is greater than or equal to 0 and less than b. 
The division algorithm can also be applied to polynomials. 

The division algorithm for polynomials states that: 
f(x) = q(x) g(x) + r(x) 
This is the same as:  Dividend = Divisor * Quotient + Remainder 

Here, r(x) is the remainder polynomial and is equal to 0 and degree r(x) < degree g(x). 
For example, the division algorithm can be used to find the other two zeros of a polynomial if one of the zeros is known.

Show less