We are now equipped to define and solve linear diophantine equations. We are on track to cover RSA encryption algorithms in June.

We are now equipped to define and solve linear diophantine equations. We are on track to cover RSA encryption algorithms in June.

I thought that from your description that you would handle equations with more than two variables, instead of just ax+by=z, where x, y, and z are given and we want to find a and b (all variables integers).

Will this be enough for the general Chinese Remainder Theorem you will be discussing later?

I believe it is. All lessons up to and including the RSA encryption algorithms on June 1 are written. (I’m currently working on lesson eight for summer school.)