List questions from congruences

Published on 08 Apr 2016 - 12:38

33

Views

Is there Modular 's cycling property?

Published on 08 Apr 2016 - 18:52

96

Views

Proof checking Number theory: prove that $d\nmid a^{2^{n}}+1$.

Published on 29 Mar 2026 - 16:31

8.3k

Views

Find remainder when $1^{5} + 2^{5} \cdots +100^{5}$ divided by 4

Published on 10 Apr 2016 - 14:28

464

Views

Find the inverses of 2,3,...,16 modulo 17.

Published on 10 Apr 2016 - 15:32

222

Views

Compute the least positive residue of $3^{83} \pmod {3600}$

Published on 10 Apr 2016 - 17:34

53

Views

Let $f \in \mathbb{Z}_p [x]$, where $p$ is prime, be defined by $f(x) = x^p - x$. Show that its Polynomial evaluation is identically zero.

Published on 10 Apr 2016 - 21:56

103

Views

i'm confusing on power of x in modular equation..

Published on 11 Apr 2016 - 14:52

1.1k

Views

Congruence Modulo involving factorials

Published on 12 Apr 2016 - 1:30

147

Views

Congruent powers implies numbers are congruent

Published on 12 Apr 2016 - 7:34

42

Views

Prove on Theory of Congruences

Published on 12 Apr 2016 - 14:06

196

Views

Congruences with LCM and Relatively Prime Numbers

Published on 12 Apr 2016 - 16:12

1.2k

Views

Show that if $\gcd(a,pq)=1$ and $g=\gcd (p-1, q-1)$ then $a^{\frac{(p-1)(q-1)}{g}}\equiv 1 \pmod {pq}$.

Published on 13 Apr 2016 - 6:30

488

Views

solve $x^2 -4x +13 \equiv 0 \pmod{81}$?

Published on 23 Feb 2026 - 11:38

86

Views

Suppose that gcd($a,p$) = gcd($b,p$) = 1, and neither of the congruences $x^2 ...

Published on 26 Mar 2026 - 11:18

List Question

Find polynomial congruent to function modulo 6

Is there Modular 's cycling property?

Proof checking Number theory: prove that $d\nmid a^{2^{n}}+1$.

Find remainder when $1^{5} + 2^{5} \cdots +100^{5}$ divided by 4

Find the inverses of 2,3,...,16 modulo 17.

Compute the least positive residue of $3^{83} \pmod {3600}$

Let $f \in \mathbb{Z}_p [x]$, where $p$ is prime, be defined by $f(x) = x^p - x$. Show that its Polynomial evaluation is identically zero.

i'm confusing on power of x in modular equation..

Congruence Modulo involving factorials

Congruent powers implies numbers are congruent

Prove on Theory of Congruences

Congruences with LCM and Relatively Prime Numbers

Show that if $\gcd(a,pq)=1$ and $g=\gcd (p-1, q-1)$ then $a^{\frac{(p-1)(q-1)}{g}}\equiv 1 \pmod {pq}$.

solve $x^2 -4x +13 \equiv 0 \pmod{81}$?

Suppose that gcd($a,p$) = gcd($b,p$) = 1, and neither of the congruences $x^2 ...

Trending Questions

Popular # Hahtags

Popular Questions