With priceless advice from Grandad here on MHF, I think I finally worked out the Chinese Remainder Theorem Calculator.

Chinese Remainder Theorem Calculator

Located on the discrete math page, this allows you to enter several modulus equations and the calculator will solve them using the Chinese Remainder Theorem. One piece of the calculator will contain a link which opens up to our Euclidean Algorithm Calculator in another window to determine x and y in Bezouts identity.

The lesson was also built in our new format which contains a tab for automated quiz generation.

As always, let me know if you see errors or want enhancements. Have a great weekend.

__________________

To view links or images in signatures your post count must be 10 or greater. You currently have 0 posts.

Have you the code you used for the algorithm?

I'd just be interested in messing around with it, checking efficiency etc.

Do you mean Euclid's Extended Algorithm? If so, that lesson is here:

Euclid's Algorithm and Euclid's Extended Algorithm Calculator

I list out the math in each column. Nothing else special is going on behind the scenes.

__________________

To view links or images in signatures your post count must be 10 or greater. You currently have 0 posts.

Enhancement Update:

I've included a section just after we determine the solution to the modulo equations which plugs in your answer and confirms that is the answer to the (n) equations that you enter.

I also updated the random generator to the Teachers Corner quiz generator to have more solutions which are not in the millions.

__________________

To view links or images in signatures your post count must be 10 or greater. You currently have 0 posts.