Modular Arithmetic Basics: Congruence mod n

Поділитися
Вставка
  • Опубліковано 21 гру 2024

КОМЕНТАРІ • 50

  • @Eulers_identity132
    @Eulers_identity132 11 місяців тому +2

    This was actually sooo useful!! You explain Modular Arithmetic better than any online video or course I've found on the internet. Everything makes sense now!! Every video I come across explain as they solve congruences, but you are the only one who actually proved the operations and made things make sense. Thanks so much! New Subscriber

  • @samaiatraforti9060
    @samaiatraforti9060 2 роки тому +5

    You have explained this better than anyone I have come across either on the internet or at my university. Thankyou, SO much. Truly a lifesaver before my mid semester exams!!! New subscriber :)

  • @pauldifolco5736
    @pauldifolco5736 4 роки тому +6

    Looking forward to this if it becomes a sort of series!

  • @grantmccotter8779
    @grantmccotter8779 4 місяці тому +1

    You explain this far better than my university lecturer.

  • @sherifayoosuf6762
    @sherifayoosuf6762 4 роки тому +3

    Really nice video , I am a slow learner of Maths , This explains step by step very clearly . Many videos I watched regarding the basics of Modular Arithmetic but all those were for quick learners I think . This one is really helpful for a person like me who is slow and little bit poor in maths , Thank you

  • @OriginalSuschi
    @OriginalSuschi 4 роки тому +8

    Thank you for starting this Series! I know the basics, but there are many things that I should memorize as well :)

  • @premdeepkhatri1441
    @premdeepkhatri1441 5 місяців тому

    very good explanation. Thank You for explanation.

  • @kadirduljic9217
    @kadirduljic9217 4 роки тому +2

    As always, great video by even greater teacher!

  • @MrCoreyTexas
    @MrCoreyTexas 5 місяців тому

    Thank you for these videos, I was studying cryptography and it assumes you know a lot about modular arithmetic. I took a lot of math in primary school and college, and I don't seem to recall ever going through this (but I never took a cryptography course to be fair, and I could have forgotten about it)

  • @poloqaz
    @poloqaz 2 роки тому

    wow.... just wow... that was in depth very good explanation. thank you.

  • @Leo_banana
    @Leo_banana 2 роки тому

    Thank you! You answered my question of operations!

  • @Kdd160
    @Kdd160 4 роки тому +1

    I wanted to learn this as this is very important for number theory which is very interesting. I was able to find only the long lectures on youtube. Since I didn't have time for all this, I was not able to learn this thing. THANK YOU FOR THIS VIDEO

  • @jessicacostadasilva1933
    @jessicacostadasilva1933 3 роки тому

    thank you a lot!!! it was a great explanation. Also, your english is super clear and easy to understand

  • @immortalspiritualbeing7037
    @immortalspiritualbeing7037 2 роки тому

    I love this video, it is very clear and accurate

  • @epistemicompute
    @epistemicompute 3 роки тому

    underrated video

  • @pointer7pl
    @pointer7pl 2 роки тому +3

    i do not get this

  • @ExtraPawn7
    @ExtraPawn7 3 роки тому

    Good video for quick rivision

  • @ahmadsyamimarsyad6431
    @ahmadsyamimarsyad6431 3 роки тому

    Thnks for the very clear explanation!

  • @HouseOrigins
    @HouseOrigins 3 роки тому

    Very clear and well explained, new subscriptor here!

  • @MrCoreyTexas
    @MrCoreyTexas 5 місяців тому

    I just write a % n instead of rem(a,n) when I'm working out math on paper, I just use the C notation, it's succinct.

  • @datsmydab-minecraft-and-mo5666
    @datsmydab-minecraft-and-mo5666 4 роки тому +1

    You should do a series on Complex Analysis!

  • @AhamedKabeer-wn1jb
    @AhamedKabeer-wn1jb 4 роки тому +1

    Wow.. What a beautifull explanation...

  • @bilalabbad7954
    @bilalabbad7954 2 роки тому

    Good as always

  • @mohammedafras211
    @mohammedafras211 4 роки тому +1

    If a, b positive integers and 1+ab divides a^2+b^2 then (a^2+b^2)/(1+ab) is a square of integer can you prove this?🤔

  • @intruder4907
    @intruder4907 3 роки тому

    Thanks a lot this video help me a lott and was soo clear .

  • @paulifeanyi3836
    @paulifeanyi3836 3 роки тому

    Damn this is another channel I am watching to understand this but instead I am getting more and more confused totally

  • @himanikaushal3008
    @himanikaushal3008 4 роки тому +1

    Thank you 🌸

  • @theoxc
    @theoxc 3 роки тому

    Very clear, thanks a lot!!

  • @maciej12345678
    @maciej12345678 Рік тому

    exepting by null 3:51 ZIRO

  • @jennyrosebabao6024
    @jennyrosebabao6024 4 роки тому

    hello sir can you solve this one:
    4x + 1 5mod12....i cant understand when it comes like this..please sir im begging you

  • @assameducationhelp2460
    @assameducationhelp2460 2 роки тому +1

    I am seeing from Laluk College Assam India

  • @jasonhuang5175
    @jasonhuang5175 3 роки тому

    That’s awesome man!

  • @guill3978
    @guill3978 4 роки тому +2

    You teleported in 1:25

  • @ProfessorMastermind
    @ProfessorMastermind 3 роки тому +1

    0.34 ..(a-b)/n should be a non zero integer . Whole numbers are 0,1,2,3.. but here it can also be negative . But nice explanation .

    • @A7medzz0
      @A7medzz0 Рік тому

      Exactly
      and the symbol Z is the integer set not the whole number
      again great explanation

  • @alexander17293
    @alexander17293 4 роки тому

    Well done.

  • @udaybhaskar2880
    @udaybhaskar2880 4 роки тому

    Excellent

  • @cyrhabucod2360
    @cyrhabucod2360 3 роки тому

    give an example to show that a²=b²(mod n) need to imply that a = b (mod n)

  • @gunjanraj827
    @gunjanraj827 3 роки тому

    Very nice

  • @jennyrosebabao6024
    @jennyrosebabao6024 4 роки тому

    wow amazing

  • @guill3978
    @guill3978 4 роки тому

    We are beginning with the easiest contents, all right

    • @MuPrimeMath
      @MuPrimeMath  4 роки тому +1

      Yes, I am starting a series on basic number theory. We will get to more difficult stuff once we get through the basics!

  • @fern_shy
    @fern_shy Рік тому

    goat

  • @3manthing
    @3manthing 4 роки тому +1

    I could be wrong so go easy on me, but isn't there a limitation when multiplying linear congruence by a constant. I think the constant cannot be a multiple of your n, cause that would be like multiplying a regular exuation by zero.
    example:
    4≡1(mod 3) multiplying both sides 3 would give 12≡3(mod 3) , which we know is not he case.
    Splendid video by the way, i think you just forgot to stress this fact. :)

    • @3manthing
      @3manthing 4 роки тому +1

      I just realised that 12≡3≡0(mod 3), which is still true, but the eqution is now trivially true. My bad, so sory.😅
      Anyway, like i was saying, the identity becomes trivially true. A simple example:
      4=2^2 \multiplying both sides by zero, we get
      0*4=0*2^2
      0=0

    • @MuPrimeMath
      @MuPrimeMath  4 роки тому +2

      Yes, in that case it is like multiplying an equation by zero. When we do that, it's usually not very helpful. However, we're still allowed to do it!

  • @du4lstrik3
    @du4lstrik3 3 місяці тому +1

    Yo my guy, next time, actually use those variables and put some values in them. Writing a ton of letters all over the board is DRY. I get that you're explaining the laws and being very technical, but you have to throw some practical examples in there to show how the laws are applicable.
    For Christ's sake. This is where people fall out of mathematics. APPLICATION, APPLICATION, APPLICATION.

  • @shellamadre935
    @shellamadre935 3 роки тому

    Hi handsome sir,thank you

  • @guill3978
    @guill3978 4 роки тому

    This is obvious. You should explain the modular exponenciation or solve modular equations in which the number X to be guessed is the exponent of the power to be divided or the residue, like b.