Question

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

score 590 · Answer 1 · 2026-05-10 12:12:20

590

Views

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

Published on 10 May 2026 - 12:12

score 413 · Answer 2 · 2026-05-10 20:03:54

413

Views

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

Published on 10 May 2026 - 20:03

score 1.7k · Answer 3 · 2026-03-25 09:25:41

1.7k

Views

Sum of consecutive prime numbers

Published on 25 Mar 2026 - 9:25

score 254 · Answer 4 · 2026-04-14 13:01:05

254

Views

Problem relating to primes and sequences

Published on 14 Apr 2026 - 13:01

score 359 · Answer 5 · 2026-05-10 15:01:49

359

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 10 May 2026 - 15:01

score 190 · Answer 6 · 2026-04-14 18:41:58

190

Views

About sets of polynomials that give prime outputs

Published on 14 Apr 2026 - 18:41

score 241 · Answer 7 · 2026-05-10 14:04:44

241

Views

How to complete this proof for Wilson's theorem

Published on 10 May 2026 - 14:04

score 213 · Answer 8 · 2026-05-10 20:03:59

213

Views

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

Published on 10 May 2026 - 20:03

score 189 · Answer 9 · 2026-05-10 13:51:15

189

Views

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

Published on 10 May 2026 - 13:51

score 300 · Answer 10 · 2026-04-11 23:13:06

300

Views

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

Published on 11 Apr 2026 - 23:13

score 526 · Answer 11 · 2026-03-25 09:24:11

526

Views

Proof that there are infinite prime numbers

Published on 25 Mar 2026 - 9:24

score 74 · Answer 12 · 2026-05-10 12:55:13

74

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 10 May 2026 - 12:55

score 256 · Answer 13 · 2026-04-29 12:18:58

256

Views

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

Published on 29 Apr 2026 - 12:18

score 51 · Answer 14 · 2026-04-11 13:11:25

51

Views

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

Published on 11 Apr 2026 - 13:11

score 705 · Answer 15 · 2026-04-29 12:46:10

705

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 29 Apr 2026 - 12:46

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