你即將離開本站

並前往https://www.whitman.edu/mathematics/higher_math_online/section03.01.html

3.1 Congruence - Number Theory

If n is a positive integer, we say the integers a and b are congruent modulo n, and write a≡b(modn), if they have the same remainder on division by n.

確定！ 回上一頁

查詢 「Congruence modulo」的人也找了：

  1. congruence離散
    2.
  2. congruence數學
    3.
  3. congruence中文
    4.
  4. Congruence modulo
    5.
  5. Congruence relation
    6.
  6. Modular arithmetic
    7.
  7. 同餘題目
    8.
  8. Modulo
    9.