What is the division algorithm for 7 and 192?

We have a formula for division algorithm  a= bq+r            (1)

a is the greatest integer between the two given integers

And b is the other integer

q is the quotient

r is the remainder

here we have a=192 and b=7  substituting values in equation (1) we get

192 = 27 *7 + 3                       (2)

now  substitute quotient from equation (2)  in place  of a  that is a=27  and remainder  in place of b that is b =3 in equation as below

27= 9*3 +0

we will proceed till we get remainder zero.

I did not see the eifel tower cause I did no go to paris.

Step-by-step explanation: