List questions from congruences

Published on 22 May 2015 - 15:23

265

Views

Evaluate $7^{8^9}\mod 100$

Published on 22 May 2015 - 21:07

165

Views

Solve quadratic congruences.

Published on 25 May 2015 - 9:03

594

Views

Fermat's little theorem for p-adic integers

Published on 25 May 2015 - 18:33

43

Views

If $a \equiv b \mod m$ and $0 \leq a$ and $b < m$, $a=b$?

Published on 26 May 2015 - 19:31

125

Views

Find $y$ satisfying $17y = 1 \mod (130)$

Published on 27 May 2015 - 9:25

113

Views

Let $p > 2$ be prime. Show that there exist integers $a,b \geq 0 $ satisfying the congruence $a^2 + b^2 \equiv -1 $(mod $p$).

Published on 31 May 2015 - 13:18

124

Views

Solving linear congruencies (modulus)

Published on 01 Jun 2015 - 3:22

55

Views

Help me out with understanding this congruence solution.

Published on 07 Jun 2015 - 19:03

110

Views

Other way show that $\zeta(-2)=(-\frac{1}{12})\mod 2$?

Published on 25 Mar 2026 - 22:04

29

Views

If :$\sum_{k=1}^{n}k^p =(\frac{n(n+1)}{2})\mod(p)$ how i deduce the remain of :$\sum_{k=1}^{n}k^{-p}$?

Published on 08 Jun 2015 - 14:53

45

Views

Help on understanding this congruency

Published on 08 Jun 2015 - 18:53

41

Views

Tools for dealing with a divisibility problem with powers of 2 and 3?

Published on 08 Jun 2015 - 20:07

126

Views

Which prime divides $18^{29}+1$?

Published on 09 Jun 2015 - 12:03

57

Views

$a^{27} \equiv 1 \pmod{37}$ implies $a^9 \equiv 1 \pmod{37}$ and similar problems

Published on 09 Jun 2015 - 13:10

List Question

Solving $3x^3\equiv 7\pmod{925}$

Evaluate $7^{8^9}\mod 100$

Solve quadratic congruences.

Fermat's little theorem for p-adic integers

If $a \equiv b \mod m$ and $0 \leq a$ and $b < m$, $a=b$?

Find $y$ satisfying $17y = 1 \mod (130)$

Let $p > 2$ be prime. Show that there exist integers $a,b \geq 0 $ satisfying the congruence $a^2 + b^2 \equiv -1 $(mod $p$).

Solving linear congruencies (modulus)

Help me out with understanding this congruence solution.

Other way show that $\zeta(-2)=(-\frac{1}{12})\mod 2$?

If :$\sum_{k=1}^{n}k^p =(\frac{n(n+1)}{2})\mod(p)$ how i deduce the remain of :$\sum_{k=1}^{n}k^{-p}$?

Help on understanding this congruency

Tools for dealing with a divisibility problem with powers of 2 and 3?

Which prime divides $18^{29}+1$?

$a^{27} \equiv 1 \pmod{37}$ implies $a^9 \equiv 1 \pmod{37}$ and similar problems

Trending Questions

Popular # Hahtags

Popular Questions