Simultaneous Linear Congruent Equations (solving)...

Hello,

Having reviewed dozens of web sites, I am still having trouble
understanding of how to apply the extended Euclidean Algorithm (I'll
call this EA) in the solving of the above types of equations.

Most of the sites are like this one...

http://encyclopedia.kids.net.au/page/ch/Chinese_remainder_theorem

....where they get the equations into the form of

x equiv b1 (mod n1)
x equiv b2 (mod n2)

....and then say something the the effect of 'using the extended
Euclidean algorithm' we get.....' etc.Then proceed to write down a sum
the operands of which don't bear any resemblance to the what can
actually be found on the link they give for the 'Euclidean algorithm'.
In this example, that link takes you here...

http://encyclopedia.kids.net.au/page/ex/Extended_Euclidean_algorithm

Sorry, but in the above example, how do I plug the x, b and n values
into the EA? What's also frustrating is that this example seems to be
on many other pages only with different formatting.

Does anyone have an idiot's guide (step by step that explains
precisely the origins of all operands used) on how to find x given I
have b1, n1, b2, n2?

Thanks,

Matthew
.

Relevant Pages