in this lecture you will get the proof of art-02 and Art -03
ie Prove that the linear congruence ax= b (modm) has a solution iff d I b where d = (a,m)
and Prove that the linear congruences ax= b (modm) , d = (a,m) and d I b has exactly d incongruent solutions modulo m.
Linear Congruences And Chinese Remainder Theorem
Number Theory , Kamaldeep Njjar
kamaldeep nijjar,kamal nijjar,Linear Congruences And Chinese Remainder Theorem,number theory for competitive programming,number theory lecture,number theory discrete mathematics,number theory,linear congruences in number theory,linear congruence modulo,linear congruence and chinese remainder theorem,chinese remainder theorem in number theory,chinese remainder theorem,chinese remainder theorem example,mathematical proofs,equations,engineering mathematics
Click on this to get exclusive support from myside.. Always here for my meambers.
By being member of my channel you can suggest me for new upcoming videos.
/ @kamaldeepnijjar