My difficulty with the material: this is pretty standard number theory stuff that I've encountered so far (extended euclidean algorithm and modularity, etc&). I guess the hardest part is paying attention to how to keep track of the quotients and coefficients that yield \(ax + by = gcd(x,y)\). On some level I know how this works, but I have to re-figure-it-out every time including doing the reading just now.
The most interesting part, I guess, has to do with them mentioning quadratic residues. I don't know too much about it, but I wonder how hard it is to solve higher degree polynomials \(\pmod n\).
Mathjax test $x^2$ \(x^2\) \[x^2\] $$x^2$$ `x^2`. okay just imagine these worked up above, until I figure it out.
No comments:
Post a Comment