Nice video! The binary representation and its xor op took the same teaching time to the theorem proof. I think if we should shorten the former or prolong the latter. For the last part of the proof, we can do one intermediate step to help understand: a' xor b xor c = a' xor (a xor a) xor b xor c = (a' xor a) xor (a xor b xor c) = (0...1rrrrr) xor (0...1rrrrr) = 0. The induction hypothesis should be emphasized (seems mentioned only one time), I felt that the proof assumes the theorem is correct, actually the proof (k+1) assumes (1 to k) are correct.
Nice video! The binary representation and its xor op took the same teaching time to the theorem proof. I think if we should shorten the former or prolong the latter. For the last part of the proof, we can do one intermediate step to help understand: a' xor b xor c = a' xor (a xor a) xor b xor c = (a' xor a) xor (a xor b xor c) = (0...1rrrrr) xor (0...1rrrrr) = 0. The induction hypothesis should be emphasized (seems mentioned only one time), I felt that the proof assumes the theorem is correct, actually the proof (k+1) assumes (1 to k) are correct.
lovely video, thank you!
kindly suggest some more detailed materials. I am reading Ferguson, but that's not sufficient. thanks
your videos are great but can you not write while the video is being recorded because that can make viewers zone out and lose focus
@@haksell Totally agree with you. This way is much better.
it keeps me more focussed because something other than talking is happening so i think it can also be beneficial
you mean, you are not taking notes?