Question

Odd perfect numbers having as prime factors exclusively Mersenne primes and Fermat primes: reference request or proposal as an exercise

score 75 · Answer 1 · 2020-04-21 11:52:10

75

Views

Odd perfect numbers having as prime factors exclusively Mersenne primes and Fermat primes: reference request or proposal as an exercise

Published on 21 Apr 2020 - 11:52

score 341 · Answer 2 · 2020-04-24 15:50:19

341

Views

Can a composite number $3\cdot 2^n + 1$ divide a Fermat number $2^{2^m}+1$?

Published on 24 Apr 2020 - 15:50

score 83 · Answer 3 · 2020-05-05 02:19:25

83

Views

The constuctability of n-gon(regular n-polygon)

Published on 05 May 2020 - 2:19

score 175 · Answer 4 · 2020-05-17 01:24:45

175

Views

$F_n$ is the $n$-th Fermat Number. Prove there are infinitely many values of n for which $F_n + 2$ is composite.

Published on 17 May 2020 - 1:24

score 385 · Answer 5 · 2020-05-25 21:34:19

385

Views

Show that $2^{(p-1)/2} \equiv 1\: \mathrm{mod}\:p$?

Published on 25 May 2020 - 21:34

score 117 · Answer 6 · 2020-06-11 18:11:23

117

Views

Fermat numbers, GCD and proving existence of infinite primes

Published on 11 Jun 2020 - 18:11

score 132 · Answer 7 · 2020-07-10 07:35:32

132

Views

The greatest prime factor of $2^n+1$

Published on 10 Jul 2020 - 7:35

score 123 · Answer 8 · 2020-07-19 13:42:29

123

Views

Prove that $\gcd(2^{2^{22}}+1,2^{2^{222}}+1)=1$

Published on 19 Jul 2020 - 13:42

score 278 · Answer 9 · 2016-08-03 07:02:06

278

Views

To prove that the nth fermat number for $n \lt 4$ is prime, does the proof involve

Published on 03 Aug 2016 - 7:02

score 1.2k · Answer 10 · 2016-10-09 21:38:15

1.2k

Views

Fermat Numbers Theorem Proof by Induction

Published on 09 Oct 2016 - 21:38

score 2.9k · Answer 11 · 2016-10-24 03:08:19

2.9k

Views

Let $p$ be a prime divisor of the Fermat number $F_n = 2^{2^ n} + 1$. Prove that $p$ must have the form $2^{n+1}k + 1$.

Published on 24 Oct 2016 - 3:08

score 53 · Answer 12 · 2016-11-23 20:02:20

53

Views

Fermats conjecture requires divisibility by n squared

Published on 23 Nov 2016 - 20:02

score 29 · Answer 13 · 2016-11-24 03:00:45

29

Views

Prove a case that is a little bit different from Fermat Numbers

Published on 24 Nov 2016 - 3:00

score 233 · Answer 14 · 2016-11-28 19:40:28

233

Views

Suppose we have two positive integers $a$ and $b$ which satisfy the condition $a^3 − 2b^3 = 2$.

Published on 28 Nov 2016 - 19:40

score 241 · Answer 15 · 2016-12-04 23:22:38

241

Views

Is this true about Fermat Primes?

Published on 04 Dec 2016 - 23:22

List Question

Odd perfect numbers having as prime factors exclusively Mersenne primes and Fermat primes: reference request or proposal as an exercise

Can a composite number $3\cdot 2^n + 1$ divide a Fermat number $2^{2^m}+1$?

The constuctability of n-gon(regular n-polygon)

$F_n$ is the $n$-th Fermat Number. Prove there are infinitely many values of n for which $F_n + 2$ is composite.

Show that $2^{(p-1)/2} \equiv 1\: \mathrm{mod}\:p$?

Fermat numbers, GCD and proving existence of infinite primes

The greatest prime factor of $2^n+1$

Prove that $\gcd(2^{2^{22}}+1,2^{2^{222}}+1)=1$

To prove that the nth fermat number for $n \lt 4$ is prime, does the proof involve

Fermat Numbers Theorem Proof by Induction

Let $p$ be a prime divisor of the Fermat number $F_n = 2^{2^ n} + 1$. Prove that $p$ must have the form $2^{n+1}k + 1$.

Fermats conjecture requires divisibility by n squared

Prove a case that is a little bit different from Fermat Numbers

Suppose we have two positive integers $a$ and $b$ which satisfy the condition $a^3 − 2b^3 = 2$.

Is this true about Fermat Primes?

Trending Questions

Popular # Hahtags

Popular Questions