List questions from congruences

Published on 10 Dec 2014 - 2:52

353

Views

Congruences - proof problems

Published on 10 Dec 2014 - 12:40

66

Views

Find the residue of $1!+2!+........+n! \pmod{m}$ for $m>n$

Published on 10 Dec 2014 - 17:58

232

Views

Trying to prove a congruence for Stirling numbers of the second kind

Published on 10 Dec 2014 - 22:24

53

Views

How to solve this congruence?

Published on 11 Dec 2014 - 0:37

225

Views

Find the last digit of the exponent $x$.

Published on 25 Mar 2026 - 21:22

56

Views

How to find $x$ in $\left\lfloor{\frac{x-2000}{4}}\right\rfloor+x\equiv0\pmod 7$

Published on 13 Dec 2014 - 11:48

47

Views

A possible defining characteristic of primitive roots.

Published on 15 Dec 2014 - 18:29

6k

Views

Find the least positive integer $x$ that satisfies the congruence $90x\equiv 41\pmod {73}$

Published on 16 Dec 2014 - 15:48

239

Views

Is there a number congruent to 1 modulo infinitely many primes?

Published on 16 Dec 2014 - 20:44

177

Views

How to prove $x^{\phi(m)+1}\equiv x\pmod{p}$

Published on 16 Dec 2014 - 23:39

43

Views

Congruence with $x$ in a power

Published on 18 Dec 2014 - 6:29

85

Views

Integer $m$ such that $2^m\equiv\pm 1\pmod{2n+1}$

Published on 21 Dec 2014 - 4:56

95

Views

Extending Euler's Theorem gives minus 1 - why?

Published on 21 Dec 2014 - 10:51

68

Views

Congruence with binomial

Published on 22 Dec 2014 - 9:15

List Question

Solving $x^n \equiv a \text{ (mod } p)$ in $\mathbb{Z}$

Congruences - proof problems

Find the residue of $1!+2!+........+n! \pmod{m}$ for $m>n$

Trying to prove a congruence for Stirling numbers of the second kind

How to solve this congruence?

Find the last digit of the exponent $x$.

How to find $x$ in $\left\lfloor{\frac{x-2000}{4}}\right\rfloor+x\equiv0\pmod 7$

A possible defining characteristic of primitive roots.

Find the least positive integer $x$ that satisfies the congruence $90x\equiv 41\pmod {73}$

Is there a number congruent to 1 modulo infinitely many primes?

How to prove $x^{\phi(m)+1}\equiv x\pmod{p}$

Congruence with $x$ in a power

Integer $m$ such that $2^m\equiv\pm 1\pmod{2n+1}$

Extending Euler's Theorem gives minus 1 - why?

Congruence with binomial

Trending Questions

Popular # Hahtags

Popular Questions