Question

An approximation for $1\leq n\leq N$ of the number of solutions of $2^{\pi(n)}\equiv 1\text{ mod }n$, where $\pi(x)$ is the prime-counting function

score 221 · Answer 1 · 2018-03-11 14:04:47

221

Views

An approximation for $1\leq n\leq N$ of the number of solutions of $2^{\pi(n)}\equiv 1\text{ mod }n$, where $\pi(x)$ is the prime-counting function

Published on 11 Mar 2018 - 14:04

score 56 · Answer 2 · 2018-03-11 20:34:42

56

Views

To find positive integers from $Z_8$

Published on 11 Mar 2018 - 20:34

score 113 · Answer 3 · 2018-03-12 08:31:32

113

Views

To find the smallest integer greater than $23$ with certain modular residues

Published on 12 Mar 2018 - 8:31

score 18 · Answer 4 · 2018-03-12 11:10:44

18

Views

Is this an equivalent definition of the notation $f(x) \equiv g(x) \hspace{4mm} ( \text{mod} \hspace{2mm} h(x), \hspace{1mm} n )$?

Published on 12 Mar 2018 - 11:10

score 343 · Answer 5 · 2026-03-23 07:21:10

343

Views

If $5x \equiv 15 \pmod{25}$, then definitely $x \equiv 3 \pmod{25}$. Is this true or false?

Published on 23 Mar 2026 - 7:21

score 143 · Answer 6 · 2026-03-24 12:19:04

143

Views

Elementary Number Theory: Cubic Congruences

Published on 24 Mar 2026 - 12:19

score 39 · Answer 7 · 2018-03-14 11:14:53

39

Views

Reference request: "If $a$ and $m$ are coprime then there must exist $k \in \mathbb{N}$ such that $a^k \equiv 1 \pmod m$"

Published on 14 Mar 2018 - 11:14

score 27 · Answer 8 · 2018-03-15 03:04:35

27

Views

Expand powers and simplify the coefficient

Published on 15 Mar 2018 - 3:04

score 137 · Answer 9 · 2026-03-22 21:32:28

137

Views

How many operations are required to check the congruence $(x+a)^n \equiv x^n + a \pmod{x^r-1, n}$?

Published on 22 Mar 2026 - 21:32

score 350 · Answer 10 · 2026-03-22 10:39:25

350

Views

Congruent Squares Question using algebra

Published on 22 Mar 2026 - 10:39

score 61 · Answer 11 · 2018-03-16 18:03:39

61

Views

Elementary Number Theory: Solving a Congruence Equation

Published on 16 Mar 2018 - 18:03

score 31 · Answer 12 · 2018-03-17 05:48:09

31

Views

Distinct equivalence classes of the relation $R$ defined on $\mathbb Z$ defined by $mRn$ if $5 \mid m^3 - n^3$

Published on 17 Mar 2018 - 5:48

score 55 · Answer 13 · 2026-03-23 05:24:48

55

Views

Congruence relation

Published on 23 Mar 2026 - 5:24

score 48 · Answer 14 · 2018-03-18 23:48:10

48

Views

If $p\equiv 2 \pmod{3}$ evaluate :

Published on 18 Mar 2018 - 23:48

score 39 · Answer 15 · 2018-03-21 20:16:10

39

Views

General pattern for a sequence

Published on 21 Mar 2018 - 20:16

List Question

An approximation for $1\leq n\leq N$ of the number of solutions of $2^{\pi(n)}\equiv 1\text{ mod }n$, where $\pi(x)$ is the prime-counting function

To find positive integers from $Z_8$

To find the smallest integer greater than $23$ with certain modular residues

Is this an equivalent definition of the notation $f(x) \equiv g(x) \hspace{4mm} ( \text{mod} \hspace{2mm} h(x), \hspace{1mm} n )$?

If $5x \equiv 15 \pmod{25}$, then definitely $x \equiv 3 \pmod{25}$. Is this true or false?

Elementary Number Theory: Cubic Congruences

Reference request: "If $a$ and $m$ are coprime then there must exist $k \in \mathbb{N}$ such that $a^k \equiv 1 \pmod m$"

Expand powers and simplify the coefficient

How many operations are required to check the congruence $(x+a)^n \equiv x^n + a \pmod{x^r-1, n}$?

Congruent Squares Question using algebra

Elementary Number Theory: Solving a Congruence Equation

Distinct equivalence classes of the relation $R$ defined on $\mathbb Z$ defined by $mRn$ if $5 \mid m^3 - n^3$

Congruence relation

If $p\equiv 2 \pmod{3}$ evaluate :

General pattern for a sequence

Trending Questions

Popular # Hahtags

Popular Questions