Mod-10 Lec-35 The Primary Decomposition Theorem and Jordan Decomposition

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

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

  • @alex.b.pavlov
    @alex.b.pavlov 4 года назад +2

    I think this approach is the best way to explain JCF, it is concise, clear and beautiful. I’d like to know textbooks that use it.

  • @williamerickson2091
    @williamerickson2091 9 лет назад +6

    Thank you -- very clear lecture. Watching you prove the PDT helped much more than using the textbook alone.

  • @udaysankarrath7737
    @udaysankarrath7737 5 месяцев назад

    Thanks sir।Very clear lecture। 🙏

  • @anmolrastogi2762
    @anmolrastogi2762 6 лет назад

    how to get g1 and g2 in the example ? please explain.

  • @RohitKumarYadav0516
    @RohitKumarYadav0516 Год назад

    How can you find g1 and g2???

  • @ravilaimuelnath6628
    @ravilaimuelnath6628 6 лет назад +3

    very nice

  • @Mathsfunn
    @Mathsfunn 6 лет назад

    Sir can solved any examples based on last theorem.?

  • @realkabirc303
    @realkabirc303 Год назад

    Very good lecture👍

  • @RaviKumar-fj6wj
    @RaviKumar-fj6wj 5 лет назад

    How f1g1 & f2g2 are calculated so fast.Is there any concept missing.Pls help.Much regard.

    • @VatsalyaSharan
      @VatsalyaSharan 4 года назад

      There is a theorem for prime polynomials