Everything you need to know about operations in modular arithmetic

Поделиться
HTML-код
  • Опубликовано: 1 янв 2025

Комментарии • 13

  • @mathemaniac
    @mathemaniac  5 лет назад +6

    I have been uploading semi-regularly on Friday since the start of the channel, but I don't want to be bound by this "upload schedule" anymore, so new videos are not necessarily uploaded on Friday.
    Next video will be titled "What is the next term of any sequence?".

    • @benYaakov
      @benYaakov 3 года назад

      I would appreciate if you please provide the link of that video.
      All the way, Love your vids

  • @nigeldbd
    @nigeldbd 2 года назад +1

    amazing explanation, thank you so much

  • @eduardvalentin830
    @eduardvalentin830 3 года назад +2

    how does this got only 5.6 k views :/. Keep up the work, with this kind of content you will surely get successful!!

    • @mathemaniac
      @mathemaniac  3 года назад

      Thanks for the appreciation!

  • @MrStudent1978
    @MrStudent1978 3 года назад +1

    Could not understand @9:30 ....Could you please clarify...

    • @mathemaniac
      @mathemaniac  3 года назад

      This is something I have talked about in my previous videos, namely the first ever video. Don't feel like rehashing the content, so I don't explain in more detail here.

  • @brendanmccann5695
    @brendanmccann5695 2 года назад +2

    Where is the "previous " video? I only see #1 and #2. This is #1. Good video, though. Thanks.

  • @nicoarias9193
    @nicoarias9193 3 года назад

    Excellent explanation!

  • @drmathochist06
    @drmathochist06 3 года назад +1

    Case 1 at 5:11 seems overly complicated. If a and m are coprime, then gcd(a, m) is 1, and b is always divisible by 1!

  • @Omar-hm6pu
    @Omar-hm6pu 2 года назад

    Ka=Kb[m] => a=b[m/gcd(m,k)]

  • @dishantpagdar8209
    @dishantpagdar8209 2 года назад

    six