Question

Prove: $k^2 \equiv 1 \mod p \implies k \equiv \pm1 \mod p$

score 584 · Answer 1 · 2026-03-22 19:53:58

584

Views

Prove: $k^2 \equiv 1 \mod p \implies k \equiv \pm1 \mod p$

Published on 22 Mar 2026 - 19:53

score 410 · Answer 2 · 2026-03-25 04:59:46

410

Views

Prove that primes of the form $2n^2+10n+15$ are also of the form $36k+7$

Published on 25 Mar 2026 - 4:59

score 1.7k · Answer 3 · 2026-03-24 04:55:46

1.7k

Views

Sum of consecutive prime numbers

Published on 24 Mar 2026 - 4:55

score 251 · Answer 4 · 2018-02-04 06:34:03

251

Views

Problem relating to primes and sequences

Published on 04 Feb 2018 - 6:34

score 353 · Answer 5 · 2026-03-25 06:21:16

353

Views

On the Number of Prime Numbers less than a Given Quantity - how is the Gamma function set in relation to the Pi function?

Published on 25 Mar 2026 - 6:21

score 187 · Answer 6 · 2018-02-04 12:01:38

187

Views

About sets of polynomials that give prime outputs

Published on 04 Feb 2018 - 12:01

score 239 · Answer 7 · 2026-03-24 23:43:11

239

Views

How to complete this proof for Wilson's theorem

Published on 24 Mar 2026 - 23:43

score 212 · Answer 8 · 2026-03-25 04:58:46

212

Views

$\Bbb{Z}[X]$ embeds in $\Bbb{Z}_2 \times \Bbb{Z}_3 \times \Bbb{Z}_5 \times \cdots$?

Published on 25 Mar 2026 - 4:58

score 183 · Answer 9 · 2026-03-24 23:49:53

183

Views

Relationship between the number of digits of a natural number and that of its factors

Published on 24 Mar 2026 - 23:49

score 297 · Answer 10 · 2018-02-04 20:58:39

297

Views

Are there infinite many positive integers $n$ such that $n^2+n+41$ is composite, but not divisible by $41$?

Published on 04 Feb 2018 - 20:58

score 525 · Answer 11 · 2026-03-24 17:26:21

525

Views

Proof that there are infinite prime numbers

Published on 24 Mar 2026 - 17:26

score 73 · Answer 12 · 2026-03-25 05:48:03

73

Views

Let $ a $ be a positive integer and $ p $ be an odd prime. Show that if $ x^2 \equiv 1 \mod{p^a}, $ then $ x \equiv \pm 1 \mod{p^a}. $

Published on 25 Mar 2026 - 5:48

score 248 · Answer 13 · 2026-03-20 05:55:16

248

Views

What is the least prime which has 32 1-bits?

Published on 20 Mar 2026 - 5:55

score 49 · Answer 14 · 2026-03-25 00:49:27

49

Views

Each prime $p$ dividing $n$ has some special form

Published on 25 Mar 2026 - 0:49

score 695 · Answer 15 · 2026-03-23 03:05:07

695

Views

Prove $\sum\limits_{j=1}^{p-1} j\left(\frac{j}{p}\right) = 0 $ for an odd prime $p$ with $p\equiv 1\text{ mod } 4$

Published on 23 Mar 2026 - 3:05

List Question

Prove: $k^2 \equiv 1 \mod p \implies k \equiv \pm1 \mod p$

Prove that primes of the form $2n^2+10n+15$ are also of the form $36k+7$

Sum of consecutive prime numbers

Problem relating to primes and sequences

On the Number of Prime Numbers less than a Given Quantity - how is the Gamma function set in relation to the Pi function?

About sets of polynomials that give prime outputs

How to complete this proof for Wilson's theorem

$\Bbb{Z}[X]$ embeds in $\Bbb{Z}_2 \times \Bbb{Z}_3 \times \Bbb{Z}_5 \times \cdots$?

Relationship between the number of digits of a natural number and that of its factors

Are there infinite many positive integers $n$ such that $n^2+n+41$ is composite, but not divisible by $41$?

Proof that there are infinite prime numbers

Let $ a $ be a positive integer and $ p $ be an odd prime. Show that if $ x^2 \equiv 1 \mod{p^a}, $ then $ x \equiv \pm 1 \mod{p^a}. $

What is the least prime which has 32 1-bits?

Each prime $p$ dividing $n$ has some special form

Prove $\sum\limits_{j=1}^{p-1} j\left(\frac{j}{p}\right) = 0 $ for an odd prime $p$ with $p\equiv 1\text{ mod } 4$

Trending Questions

Popular # Hahtags

Popular Questions