(Abstract Algebra 1) Congruence Modulo n

Показать описание

This video introduces the notion of congruence modulo n with several examples. In addition, congruence modulo n is shown to be an equivalence relation on the set of integers and the equivalence classes are described.

Рекомендации по теме

Комментарии

We need more people like you in this world.

albertlewis

Oh man, great video. I'm in number theory right now and sometimes I get confused with all the notations lol. Helps me to break it down in simple terms.

FPrimeHD

Thank you very much! My lazy online professor doesn't bother recording any lectures, so I am forced to scour Youtube for proper teaching. This helped so much!

atarantul

it's so useful video. thank you so much sir.

balikakamble

I really like your videos as it gives complete understanding. Can you please help me with this one -
Show that if k and h are integers such that gcd(k, n) = 1, then the set
{h, h + k, h + 2k, . . ., h + (n − 1)k}
is a complete residue system modulo n

jvikings

clear and neat explanation. Thank you, sir

dhanimireddypadmavathi

I really like your videos, I have watched a few when I get stuck in class and you help me get it! For example here, I was having a hard time seeing why in my notes the teacher said "r-s must be 0" but you helped clear that up. However I have found that sometimes you speak too fast during your proofs, and I have to rewind 5 or 6 times over and over to rewatch parts and hear your explanation again. I get the message in the end but I thought would pass that feedback on. Maybe you do it on purpose to have a shorter/less intimidating length of video? I would personally rather have a video a few minutes longer where you talk slower but that's just me.

carolynmcaughren

Hello! I like the way u record and display ur lectues! am starting to give online lecture to my high school student. plz if u can send me an example, may be this one, of the latex template u use. I would be grateful! Thanks a lot and good day to u.

hassanhdach

Sir I have confusion at 4:26
Remainder congurences
1 -8, -5, -2, 1, 4, ...???
2. -7, -4, -1....????

farzanabatool

I don't understand the distinct part of the proof, how does the fact that r=s shows that the equivalence classes are distinct? Basically i dont understand WHY you would need the last part of the proof where you wrote down "suppose 0<=s<n.."

s