List questions from chinese-remainder-theorem

Published on 27 Mar 2026 - 19:30

70

Views

Solving $4957^k \equiv 1 \pmod{7007}$ with the chinese remainder theorem

Published on 07 Dec 2016 - 13:34

329

Views

how to find the solution to simultaneous congruences

Published on 27 Mar 2026 - 21:23

69

Views

Use the Chinese Remainder Theorem to give the general solution to the equations: x = 9 (mod 10) x = 5 (mod 11) x = 9 (mod 13)

Published on 12 Dec 2016 - 15:12

231

Views

When using the extended Euclidean algorithm, can you add the integer to make the answer positive?

Published on 13 Dec 2016 - 13:03

687

Views

How quickly can we use Chinese remainder theorem to find a value?

Published on 15 Dec 2016 - 17:29

2.1k

Views

Deriving Chinese Remainder Theorem from gcd Bezout identity

Published on 16 Dec 2016 - 1:55

46

Views

Congruences (not mod ideals) and CRT in non-UFD (examples).

Published on 25 Dec 2016 - 2:25

891

Views

$N$ consecutive non powers

Published on 25 Mar 2026 - 17:35

160

Views

Chinese Remainder Theoram

Published on 30 Dec 2016 - 10:54

1.5k

Views

What is the remainder when $40!$ is divided by $1763$?

Published on 31 Dec 2016 - 19:32

95

Views

Finding the element in $R/IJ$ which is mapped to a specific element in $R/I \times R/J$ under a CRT style ring isomorphism

Published on 26 Mar 2026 - 3:01

58

Views

A Number Theory Reduction

Published on 10 Jan 2017 - 17:10

409

Views

Solving a system of congruence inequalities

Published on 27 Mar 2026 - 21:18

738

Views

Compute $5^{10,000}\equiv \mod 52$

Published on 14 Jan 2017 - 20:26

List Question

BMO1, Q6 Number Theory

Solving $4957^k \equiv 1 \pmod{7007}$ with the chinese remainder theorem

how to find the solution to simultaneous congruences

Use the Chinese Remainder Theorem to give the general solution to the equations: x = 9 (mod 10) x = 5 (mod 11) x = 9 (mod 13)

When using the extended Euclidean algorithm, can you add the integer to make the answer positive?

How quickly can we use Chinese remainder theorem to find a value?

Deriving Chinese Remainder Theorem from gcd Bezout identity

Congruences (not mod ideals) and CRT in non-UFD (examples).

$N$ consecutive non powers

Chinese Remainder Theoram

What is the remainder when $40!$ is divided by $1763$?

Finding the element in $R/IJ$ which is mapped to a specific element in $R/I \times R/J$ under a CRT style ring isomorphism

A Number Theory Reduction

Solving a system of congruence inequalities

Compute $5^{10,000}\equiv \mod 52$

Trending Questions

Popular # Hahtags

Popular Questions