Question

How do I find the least x that satisfies this congruence properties?

score 501 · Answer 1 · 2026-03-20 12:16:51

501

Views

How do I find the least x that satisfies this congruence properties?

Published on 20 Mar 2026 - 12:16

score 439 · Answer 2 · 2026-03-18 02:22:48

439

Views

Counting the number of solutions of the congruence $x^k\equiv h$ (mod q)

Published on 18 Mar 2026 - 2:22

score 1k · Answer 3 · 2026-03-17 20:53:13

1k

Views

Remainder of $22!$ upon division with $23$?

Published on 17 Mar 2026 - 20:53

score 83 · Answer 4 · 2026-03-17 01:17:35

83

Views

Does increasing the modulo decrease collisions?

Published on 17 Mar 2026 - 1:17

score 344 · Answer 5 · 2026-03-19 12:36:40

344

Views

Congruence equation ...

Published on 19 Mar 2026 - 12:36

score 365 · Answer 6 · 2026-03-24 16:13:05

365

Views

Reducing products in modular arithmetic

Published on 24 Mar 2026 - 16:13

score 903 · Answer 7 · 2026-03-21 20:00:22

903

Views

Product of sums of all subsets mod $k$?

Published on 21 Mar 2026 - 20:00

score 39 · Answer 8 · 2026-03-23 17:21:08

39

Views

Lack of clarity over modular arithmetic notation

Published on 23 Mar 2026 - 17:21

score 149 · Answer 9 · 2026-03-23 01:55:41

149

Views

How to prove infinitely many integer triples $x,y,z$ such that $x^2 + y^2 + z^2$ is divisible by $(x + y +z)$

Published on 23 Mar 2026 - 1:55

score 121 · Answer 10 · 2026-03-22 05:59:20

121

Views

Can $\mathbb{Z}_2$ be constructed as the closure of $4\mathbb{Z}+1$?

Published on 22 Mar 2026 - 5:59

score 40 · Answer 11 · 2026-03-20 13:02:06

40

Views

Is it possible for the expression $n=4xy-(x+y)$ to cover all the positive intergers $n$ verifying $n=1(mod4)$

Published on 20 Mar 2026 - 13:02

score 122 · Answer 12 · 2026-03-20 13:24:04

122

Views

Unable to solve congruence modulo arithmetic question for power of integer: $(7552)^3 \equiv ... \pmod{89}$.

Published on 20 Mar 2026 - 13:24

score 66 · Answer 13 · 2026-03-20 08:01:16

66

Views

Please vet modulo question: $77546 + x - 465 = 513* 663 \pmod{92}$.

Published on 20 Mar 2026 - 8:01

score 119 · Answer 14 · 2026-03-22 03:10:39

119

Views

Logic or meaning of $5 \equiv \frac{4}{8}\pmod {12}$

Published on 22 Mar 2026 - 3:10

score 314 · Answer 15 · 2026-03-20 01:17:05

314

Views

Find $X^2 \equiv 9 \pmod {13}$ without consulting table?

Published on 20 Mar 2026 - 1:17

List Question

How do I find the least x that satisfies this congruence properties?

Counting the number of solutions of the congruence $x^k\equiv h$ (mod q)

Remainder of $22!$ upon division with $23$?

Does increasing the modulo decrease collisions?

Congruence equation ...

Reducing products in modular arithmetic

Product of sums of all subsets mod $k$?

Lack of clarity over modular arithmetic notation

How to prove infinitely many integer triples $x,y,z$ such that $x^2 + y^2 + z^2$ is divisible by $(x + y +z)$

Can $\mathbb{Z}_2$ be constructed as the closure of $4\mathbb{Z}+1$?

Is it possible for the expression $n=4xy-(x+y)$ to cover all the positive intergers $n$ verifying $n=1(mod4)$

Unable to solve congruence modulo arithmetic question for power of integer: $(7552)^3 \equiv ... \pmod{89}$.

Please vet modulo question: $77546 + x - 465 = 513* 663 \pmod{92}$.

Logic or meaning of $5 \equiv \frac{4}{8}\pmod {12}$

Find $X^2 \equiv 9 \pmod {13}$ without consulting table?

Trending Questions

Popular # Hahtags

Popular Questions