Комментарии:
What donuts are those?
ОтветитьYour explanation is amazing. It is way better than my professor's! Thank you so much!
ОтветитьThank you 🙃🙃🙃
ОтветитьThanks for the refresher. I hardly understood this when getting my undergrad degree and now that im working on my masters it came back to haunt me 🤣
ОтветитьHey hope you are doing alright just I wanna say that
GOD loved the world so much he sent his only begotten
son Jesus to die a brutal death for us so that we can have eternal life and we can all accept this amazing gift this by simply trusting in Jesus, confessing that GOD raised him from the dead, turning away from your sins and forming a relationship with GOD. :)
You rock it
Ответитьthanks!!!!!!!!!!!!!!!!!!!!!
Ответить10 congruent 14(mod 4) , or 10 = k*4 + 14. So by your example 10 congruent 2(mod 4) and 10 congruent 14 (mod 4) are equivalent statements?
ОтветитьI hope this comment will be noticed. Can b be greater than the value of n? Thank you in advance to the person who will answer✨✨
ОтветитьThank you for explaining this in a straightforward manner, I FUCKING LOVE YOU!
Ответить(by wikipaedia) Actually, the first claim is the most correct one, same remainder when a and b are divided by n,
a = kn + r, b = jn + r then we have a - b = (k-j)n + 0 which means that n | a - b (the last claim). If we add b to both side,
a = Kn + b by setting K = k - j.
edit: depends on variables to choose the most suitable one.
This video was awesome! I'm so glad I found your channel. You have a new subscriber here.
ОтветитьI'm really confused😢
Ответитьthankyou so much!! this really helped a lot 🥰🥰
ОтветитьI would attend every class of this guy 😭👍💓
Ответитьsummary: a = b mod m is known ads congrunce relation where a divides m and b divides m with same remainder and a is some constant times *m +b
ОтветитьCan I solve for i in this equation?
(n-i) % (m+1) = 0
O thank you sir 😭
ОтветитьW
ОтветитьI spent an hour trying to understand it from my book... 6 minute video is what i needed.
Ответить