Question

Necessity of the condition $\gcd(a,n)$ divides $b$ for solving $ax\equiv b\pmod{n}$?

score 102 · Answer 1 · 2016-07-30 18:24:23

102

Views

Necessity of the condition $\gcd(a,n)$ divides $b$ for solving $ax\equiv b\pmod{n}$?

Published on 30 Jul 2016 - 18:24

score 1k · Answer 2 · 2026-03-25 10:57:25

1k

Views

The number of solutions of $x^{22} \equiv 2(mod23)$ has-

Published on 25 Mar 2026 - 10:57

score 93 · Answer 3 · 2016-07-31 17:59:41

93

Views

Finding all primes $p$ for which $p\mid x^2-x-1$ for some $x\in \mathbb Z$.

Published on 31 Jul 2016 - 17:59

score 2.4k · Answer 4 · 2016-08-01 09:08:03

2.4k

Views

To prove that if $ab\equiv ac\bmod n$ and $(a,n)=1$ then $b\equiv c\bmod n$

Published on 01 Aug 2016 - 9:08

score 662 · Answer 5 · 2016-08-01 19:02:43

662

Views

Cannot understand congruence relation from RSA

Published on 01 Aug 2016 - 19:02

score 164 · Answer 6 · 2016-08-08 12:05:20

164

Views

efficient algorithms for solving discrete log problem where $p$ has $> 100$ digits

Published on 08 Aug 2016 - 12:05

score 71 · Answer 7 · 2016-08-16 16:27:50

71

Views

Why are these two lines not congruent (and other ways to figure out if other shapes are not congruent)

Published on 16 Aug 2016 - 16:27

score 545 · Answer 8 · 2016-08-17 08:27:44

545

Views

Solve for $n$, $5n\equiv 3 \pmod 8$

Published on 17 Aug 2016 - 8:27

score 87 · Answer 9 · 2016-08-17 10:00:07

87

Views

Let $n=3^{1000}+1$. Is n prime?

Published on 17 Aug 2016 - 10:00

score 128 · Answer 10 · 2016-08-17 11:08:30

128

Views

Fermat's Little Theorem problem: $ 445^{445} + 225^{225} \pmod{9}$

Published on 17 Aug 2016 - 11:08

score 403 · Answer 11 · 2016-08-18 04:06:57

403

Views

Solving problem on complete set of residue classes

Published on 18 Aug 2016 - 4:06

score 185 · Answer 12 · 2016-08-19 09:57:29

185

Views

Example of using the extended euclidean alg to solve the discrete log problem?

Published on 19 Aug 2016 - 9:57

score 145 · Answer 13 · 2016-08-19 21:36:34

145

Views

A linear congruence equation with Fibonacci numbers

Published on 19 Aug 2016 - 21:36

score 1.3k · Answer 14 · 2026-03-26 17:52:19

1.3k

Views

Using Pollards rho algorithm for logarithms

Published on 26 Mar 2026 - 17:52

score 1.1k · Answer 15 · 2016-08-22 15:20:39

1.1k

Views

Solving linear congruence $2x + 11 \equiv 7 \pmod 3$

Published on 22 Aug 2016 - 15:20

List Question

Necessity of the condition $\gcd(a,n)$ divides $b$ for solving $ax\equiv b\pmod{n}$?

The number of solutions of $x^{22} \equiv 2(mod23)$ has-

Finding all primes $p$ for which $p\mid x^2-x-1$ for some $x\in \mathbb Z$.

To prove that if $ab\equiv ac\bmod n$ and $(a,n)=1$ then $b\equiv c\bmod n$

Cannot understand congruence relation from RSA

efficient algorithms for solving discrete log problem where $p$ has $> 100$ digits

Why are these two lines not congruent (and other ways to figure out if other shapes are not congruent)

Solve for $n$, $5n\equiv 3 \pmod 8$

Let $n=3^{1000}+1$. Is n prime?

Fermat's Little Theorem problem: $ 445^{445} + 225^{225} \pmod{9}$

Solving problem on complete set of residue classes

Example of using the extended euclidean alg to solve the discrete log problem?

A linear congruence equation with Fibonacci numbers

Using Pollards rho algorithm for logarithms

Solving linear congruence $2x + 11 \equiv 7 \pmod 3$

Trending Questions

Popular # Hahtags

Popular Questions