Introduction to number theory lecture 23. Primitive roots.

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

КОМЕНТАРІ • 9

  • @richerzd
    @richerzd 2 роки тому +7

    I really like the teaching style here of motivating the proofs by analyzing small values and finding patterns! This makes the proof feel less magical like they appear out of thin air, and more natural like they can actually be found by a human.

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

    Thanks for sharing your knowledgment with us. Hugs from Brazil!

  • @robertgonzalez8859
    @robertgonzalez8859 11 місяців тому

    good lord, why are textbooks and other videos so opaque about this material? thank you for uploading this!

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

    Another proof of the result at 22:36 is to note that we can write the residue classes mod n as the product ab uniquely, where b is coprime to n. Hence for a fixed a there are exactly phi(n / a) choices of b, so \sigma_{a | n} phi(n / a) = \sigma_{a | n} phi(a) = n.

  • @lempuujjj2877
    @lempuujjj2877 Рік тому +1

    I THANK GOD FOR THE EXISTENCE OF PROFF RICHARD E BORCHERDS

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

    Thanks!

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

    yeeeeeeeeeeeeeeeeeeee