Question

Let $p$ be a prime that is congruent to 1 mod 4. Show that the sum of the primitive roots mod $p$ is zero mod $p$

score 837 · Answer 1 · 2026-03-26 07:35:32

837

Views

Let $p$ be a prime that is congruent to 1 mod 4. Show that the sum of the primitive roots mod $p$ is zero mod $p$

Published on 26 Mar 2026 - 7:35

score 54 · Answer 2 · 2026-03-25 11:03:03

54

Views

Trinary Dirichlet convolution: $\sum_{abc=n} f(a)g(b) h(c)$ does not lead to anything new?

Published on 25 Mar 2026 - 11:03

score 370 · Answer 3 · 2026-03-25 12:36:59

370

Views

A congruence involving Fibonacci polynomials

Published on 25 Mar 2026 - 12:36

score 240 · Answer 4 · 2018-04-10 14:54:10

240

Views

Andrica's conjecture implies Legendre's conjecture

Published on 10 Apr 2018 - 14:54

score 46 · Answer 5 · 2018-04-10 16:42:17

46

Views

Existence of certain integers

Published on 10 Apr 2018 - 16:42

score 95 · Answer 6 · 2026-03-25 15:21:43

95

Views

On some conjectures about an inequality involving different arithmetic functions related to prime numbers

Published on 25 Mar 2026 - 15:21

score 113 · Answer 7 · 2026-03-23 01:56:27

113

Views

A race between ec-primes and mersenne-primes. Who will win in the long run?

Published on 23 Mar 2026 - 1:56

score 989 · Answer 8 · 2026-03-25 10:59:02

989

Views

If $p$ is prime and $p$ $\equiv$ $1$ (mod 4), then the congruence $x^2$ $\equiv$ $-1$ (mod $p$) has two incongruent solutions...

Published on 25 Mar 2026 - 10:59

score 61 · Answer 9 · 2026-03-28 03:00:31

61

Views

What does $2|x_1=u$ mean here?

Published on 28 Mar 2026 - 3:00

score 197 · Answer 10 · 2026-03-24 23:41:48

197

Views

Prime Numbers and Infinity

Published on 24 Mar 2026 - 23:41

score 238 · Answer 11 · 2018-04-11 21:42:39

238

Views

The smallest number with given number of divisors

Published on 11 Apr 2018 - 21:42

score 1k · Answer 12 · 2026-03-26 02:23:06

1k

Views

Finding Prime Factors of a number in $\log(n)$

Published on 26 Mar 2026 - 2:23

score 842 · Answer 13 · 2026-03-20 11:01:51

842

Views

If $ p \equiv 3 (\bmod{4}) $ is a rational prime, then p is a Gaussian prime

Published on 20 Mar 2026 - 11:01

score 175 · Answer 14 · 2026-03-25 04:19:10

175

Views

Unconditional result for the existence of primes in intervals of length one

Published on 25 Mar 2026 - 4:19

score 65 · Answer 15 · 2026-03-25 06:57:38

65

Views

If n = $\frac{a^{2p}-1}{a^2-1}$ where $a$ is an integer $>1$ and $p$ is an odd prime, then $n$ is pseudoprime to the base $a$.

Published on 25 Mar 2026 - 6:57

List Question

Let $p$ be a prime that is congruent to 1 mod 4. Show that the sum of the primitive roots mod $p$ is zero mod $p$

Trinary Dirichlet convolution: $\sum_{abc=n} f(a)g(b) h(c)$ does not lead to anything new?

A congruence involving Fibonacci polynomials

Andrica's conjecture implies Legendre's conjecture

Existence of certain integers

On some conjectures about an inequality involving different arithmetic functions related to prime numbers

A race between ec-primes and mersenne-primes. Who will win in the long run?

If $p$ is prime and $p$ $\equiv$ $1$ (mod 4), then the congruence $x^2$ $\equiv$ $-1$ (mod $p$) has two incongruent solutions...

What does $2|x_1=u$ mean here?

Prime Numbers and Infinity

The smallest number with given number of divisors

Finding Prime Factors of a number in $\log(n)$

If $ p \equiv 3 (\bmod{4}) $ is a rational prime, then p is a Gaussian prime

Unconditional result for the existence of primes in intervals of length one

If n = $\frac{a^{2p}-1}{a^2-1}$ where $a$ is an integer $>1$ and $p$ is an odd prime, then $n$ is pseudoprime to the base $a$.

Trending Questions

Popular # Hahtags

Popular Questions