Question

There exist no Fermat numbers which are cubes

score 93 · Answer 1 · 2019-08-02 19:33:41

93

Views

There exist no Fermat numbers which are cubes

Published on 02 Aug 2019 - 19:33

score 44 · Answer 2 · 2019-08-21 12:37:59

44

Views

Let $A_p=a^{2^p}+b^{2^p}$. Prove that $(A_p,A_q)=1\forall p\ne q$

Published on 21 Aug 2019 - 12:37

score 154 · Answer 3 · 2019-08-25 18:57:14

154

Views

Remainder of Fermat's little theorem sum

Published on 25 Aug 2019 - 18:57

score 741 · Answer 4 · 2019-09-21 13:28:44

741

Views

Use Fermat’s little theorem to show that $8, 9, 10$ are not prime numbers

Published on 21 Sep 2019 - 13:28

score 225 · Answer 5 · 2019-10-15 19:53:43

225

Views

How to describe the primes not dividing any Fermat number?

Published on 15 Oct 2019 - 19:53

score 106 · Answer 6 · 2019-11-12 23:28:44

106

Views

Showing that the Fermat number $F_j$ divides $F_k - 2$, where $0 \le j \lt k$

Published on 12 Nov 2019 - 23:28

score 514 · Answer 7 · 2019-12-11 03:49:59

514

Views

How can I find the inverse of number using Fermat's Little Theorem or Euler's Theorem?

Published on 11 Dec 2019 - 3:49

score 145 · Answer 8 · 2019-12-20 14:00:48

145

Views

Find all integer solutions to $p^n+n=(n+1)^k$ where p is a prime of the form $2^m+1$

Published on 20 Dec 2019 - 14:00

score 61 · Answer 9 · 2019-12-22 13:40:21

61

Views

Can we deduce that there is infinitely many indices $n$ such that the period length of $1/(2^{2^n}+1)$ is strictly less then $2^{2^n}$.

Published on 22 Dec 2019 - 13:40

score 223 · Answer 10 · 2019-12-27 14:20:18

223

Views

Overflow when performing convolution using Number theoretic transforms (NTT)

Published on 27 Dec 2019 - 14:20

score 98 · Answer 11 · 2020-01-09 06:47:34

98

Views

A proof about period length

Published on 09 Jan 2020 - 6:47

score 79 · Answer 12 · 2020-01-23 16:23:53

79

Views

About the probability that the number of Fermat primes is infinite.

Published on 23 Jan 2020 - 16:23

score 78 · Answer 13 · 2020-03-02 11:09:20

78

Views

Natural numbers $n$, $k$ are given such that for any prime $p$ there exists an integer $a$ satisfying the condition $p\mid a^k-n$.

Published on 02 Mar 2020 - 11:09

score 140 · Answer 14 · 2020-03-14 23:03:00

140

Views

Prime numbers of the form $\,1+(p-1)^n$, with $\,p\,$ prime

Published on 14 Mar 2020 - 23:03

score 233 · Answer 15 · 2020-03-20 17:03:11

233

Views

On characterizations for near-square primes and Fermat primes in terms of equations involving arithmetic functions

Published on 20 Mar 2020 - 17:03

List Question

There exist no Fermat numbers which are cubes

Let $A_p=a^{2^p}+b^{2^p}$. Prove that $(A_p,A_q)=1\forall p\ne q$

Remainder of Fermat's little theorem sum

Use Fermat’s little theorem to show that $8, 9, 10$ are not prime numbers

How to describe the primes not dividing any Fermat number?

Showing that the Fermat number $F_j$ divides $F_k - 2$, where $0 \le j \lt k$

How can I find the inverse of number using Fermat's Little Theorem or Euler's Theorem?

Find all integer solutions to $p^n+n=(n+1)^k$ where p is a prime of the form $2^m+1$

Can we deduce that there is infinitely many indices $n$ such that the period length of $1/(2^{2^n}+1)$ is strictly less then $2^{2^n}$.

Overflow when performing convolution using Number theoretic transforms (NTT)

A proof about period length

About the probability that the number of Fermat primes is infinite.

Natural numbers $n$, $k$ are given such that for any prime $p$ there exists an integer $a$ satisfying the condition $p\mid a^k-n$.

Prime numbers of the form $\,1+(p-1)^n$, with $\,p\,$ prime

On characterizations for near-square primes and Fermat primes in terms of equations involving arithmetic functions

Trending Questions

Popular # Hahtags

Popular Questions