Theory of numbers: Congruences: Chinese remainder theorem

แชร์
ฝัง
  • เผยแพร่เมื่อ 23 ม.ค. 2025

ความคิดเห็น • 8

  • @gunhasirac
    @gunhasirac 3 ปีที่แล้ว

    Solution to exercise at 17:30
    The reason squaring 5 consecutively gives a solution (the orange one) to the x^2 ≡ x mod 10^10 automagically is because firstly, that’s one of the easiest way to find 0 in mod 5^10. The reason it also gives the solution to 1 mod 2^10 is because 5 ≡ 0 mod 5 ≡ 1 mod 2 and notice that by squaring this solution of x ≡ 0 mod 5 ≡ 1 mod 2, you actually get a solution of y ≡ 0^2 mod 5^2 ≡ 1^2 mod 2^2. By repeating this it not hard to see that 5^(2^k) solves the equation z ≡ 0 mod 5^(k+1) ≡ 1 mod 2^(k+1). However for 6 we have 6 ≡ 1 mod 5 ≡ 0 mod 2 and same method fails immediately, but one can check that squaring 6 gives a solution to x^5 ≡ x mod 10^10 eventually for pretty much the same reason.
    Key: binomial coefficients

  • @saniap234
    @saniap234 4 ปีที่แล้ว +1

    Richards thanks for your lectures. Is the series Theory Of Numbers completed? Or will you make more videos on these Theory Of Numbers?

  • @SmallWave80
    @SmallWave80 4 ปีที่แล้ว

    Sunzi is the same person who wrote the The Art of War (under the name of Sun Tzu).
    Thanks again for professor's wonderful maths lectures.

    • @richarde.borcherds7998
      @richarde.borcherds7998  4 ปีที่แล้ว +6

      According to wikipedia en.wikipedia.org/wiki/Sunzi_Suanjing they are two different people with the same name.

    • @SmallWave80
      @SmallWave80 4 ปีที่แล้ว +3

      @@richarde.borcherds7998 You are right. I got this wrong all these years. Thanks for clarification.

  • @brendawilliams8062
    @brendawilliams8062 3 ปีที่แล้ว

    Thankyou

  • @migarsormrapophis2755
    @migarsormrapophis2755 4 ปีที่แล้ว +5

    yee

  • @pronaybiswas7524
    @pronaybiswas7524 4 ปีที่แล้ว +2

    Yee