List questions from congruences

Published on 24 Oct 2014 - 9:03

1.3k

Views

How the find the smallest positive solution of $353x\equiv 254\mod 400$?

Published on 24 Oct 2014 - 14:01

274

Views

Proving property of congruence - help needed

Published on 25 Oct 2014 - 0:27

94

Views

An equation which has solution modulo every integer

Published on 25 Oct 2014 - 9:32

58

Views

What else could we do, instead of solving the congruences?

Published on 27 Oct 2014 - 21:34

266

Views

Solving a system of modular power congruences

Published on 28 Oct 2014 - 1:00

61

Views

How else could we solve the congruence?

Published on 28 Oct 2014 - 9:54

933

Views

Congruence class $[a]$ modulo $m$, $\gcd(x, m) = \gcd(a, m)$

Published on 28 Oct 2014 - 18:17

1.7k

Views

Well defined Functions on Congruence classes

Published on 28 Oct 2014 - 20:15

127

Views

Proofing the existence of a non-zero congruence class

Published on 29 Oct 2014 - 1:07

96

Views

Let a,b,m,k be integers such that m$\ge$2 and k $\neq$ 0. Let d = gcd(k,m) If a is congruent to b (mod m) and k is a common divisor of a and b...

Published on 29 Oct 2014 - 2:45

312

Views

Combining GCD and congruences

Published on 29 Oct 2014 - 3:00

75

Views

Modular Arithmetic with 2 Different Moduli

Published on 30 Oct 2014 - 1:34

44

Views

$a^2\equiv 10\pmod b$ and $a^3\equiv 33\pmod b$

Published on 30 Oct 2014 - 18:39

56

Views

The sum $\sum_{k=1}^{p-1} \frac{(p-1)!}{k} \pmod{p^2}$.

Published on 30 Oct 2014 - 18:55

List Question

Show that $p^{q^3+q} = p^2$ (mod $q$)

How the find the smallest positive solution of $353x\equiv 254\mod 400$?

Proving property of congruence - help needed

An equation which has solution modulo every integer

What else could we do, instead of solving the congruences?

Solving a system of modular power congruences

How else could we solve the congruence?

Congruence class $[a]$ modulo $m$, $\gcd(x, m) = \gcd(a, m)$

Well defined Functions on Congruence classes

Proofing the existence of a non-zero congruence class

Let a,b,m,k be integers such that m$\ge$2 and k $\neq$ 0. Let d = gcd(k,m) If a is congruent to b (mod m) and k is a common divisor of a and b...

Combining GCD and congruences

Modular Arithmetic with 2 Different Moduli

$a^2\equiv 10\pmod b$ and $a^3\equiv 33\pmod b$

The sum $\sum_{k=1}^{p-1} \frac{(p-1)!}{k} \pmod{p^2}$.

Trending Questions

Popular # Hahtags

Popular Questions