Use the Euclidean algorith to find the GCD (greatest common denominator) of the two numberes 2835 and 1080 and find numbers s and t such that 2835s + 1080t equals the GCD. Write neatly and show all related work. Points will be lost if work is not shown.
It's actually extra credit for my sister and she asked me if I could figure it out. I probably could but it would take me a while due to my extreme ineptitude at math. I figured since most of the people on these boards are highly intelligent, why not ask here. In the book it looks like there is some form of chart they are using.
An example problem starts like this:
s543 + t234 s t
543 1 0
234 0 1
If you can answer this, that's great. If not, thanks anyways for taking a look.
It's actually extra credit for my sister and she asked me if I could figure it out. I probably could but it would take me a while due to my extreme ineptitude at math. I figured since most of the people on these boards are highly intelligent, why not ask here. In the book it looks like there is some form of chart they are using.
An example problem starts like this:
s543 + t234 s t
543 1 0
234 0 1
If you can answer this, that's great. If not, thanks anyways for taking a look.
Facebook
Twitter