What is the number theory theorem that says something like if x,y are different primes, then there is some a,b integers s.t. ax+by=1 ?
For any two non zero number a and b there exists two integers x and y such that ax+by=gcd(a,b)
Euclid's Lemma ^
Its parent identity : https://en.wikipedia.org/wiki/B%C3%A9zout%27s_identity For co-primes d=1.
awesome, thanks everyone. I found a new way to prove things in modern algebra 1) find a similar theorem in number theory 2) steal the idea of the proof adjusting accordingly.
I know you don't like the guy; but this is a good overview :-) http://www.heidelberg-laureate-forum.org/blog/video/lecture-tuesday-september-20-2016-sir-andrew-wiles/
haha, I only said that because I go to a bad school and have had professors do similar things to others I work with. :) A. Wiles is still a "god" in my book. Most gods are jerks :)
wow he got old
being a god is not easy work I guess
Join our real-time social learning platform and learn together with your friends!