Professor Penn, thank you for a fantastic example using the Extended Euclidean Algorithm to write the greatest common divisor of two natural number as a linear combination of them. These mathematical tools have been with us for forever.
I thought that he did give the general solution by saying that x = 126k + 31 and y = -439k - 108 for all integers k, and then saying that those were the only solutions.
Professor Penn, thank you for a fantastic example using the Extended Euclidean Algorithm to write the greatest common divisor of two natural number as a linear combination of them. These mathematical tools have been with us for forever.
This is what peak performance looks like, you are one hell of a teacher.
Prof. Penn has a lot of patience
You can notice it , he changes a color of chalk accordingly where required so that we can understand
Keep it up!😅
A small writing error at 4:36. You forgot to write 'times 2' while substituting 122...
i thought i was the first one to notice :(
Maybe make the solution general form as the question states find x,y as integer but not one pair of(x,y)
I thought that he did give the general solution by saying that x = 126k + 31 and y = -439k - 108 for all integers k, and then saying that those were the only solutions.
I substituted backwards to calculate x and y and I needed stack to program it
Maybe substituting in that order allow to avoid using stack
..this is awesome..beautiful
gcd? More like gc-whee! Thanks for another entertaining ride through a topic in number theory.
Very good lessons!!! Brazilian hugs!!!
how to get 7 and -2?
c est parcequ il a oublié d ecrire .2 a une parenthese:
8 = 252 - ( 878 - 252.3 ).2 = 252.7+878.-2
@@fredpim11 i don't understand you :
@@usernotinah2350 he forgets to write 2 outside the braquet
@@fredpim11 aw okay thank uuu
Awesome!, if you are finding this too slow watch at 1.5X speed.
wow， pretty。
! ohhh good