Questions tagged [fermat-numbers]

In mathematics, a Fermat number, named after Pierre de Fermat who first studied them, is an integer of the form $$F_{n} = 2^{2^n} + 1$$ where $n$ is a nonnegative integer. The first few Fermat numbers are: $$3,\ 5,\ 17,\ 257,\ 65537,\ \cdots $$

If $2^k +1$ is prime, and $k > 0$, it can be shown that $k$ must be a power of two, $k=2^n$. A number of the form $2^{2^n}+1$ is called a Fermat number, and when it happens to be a prime, it is called a Fermat prime. As of 2017, the only known Fermat primes are those for which $0\leq n\leq 4$. In addition, John L. Selfridge made an intriguing conjecture: Let $g(n)$ be the number of distinct prime factors of $2^{2^n} + 1$. Then $g(n)$ is not monotonic (non-decreasing).

If another Fermat prime exists, that would imply that the conjecture is false.

130 questions
0
votes
1 answer

Is this proof, about Fermat numbers being coprime, wrong?

Let $m, n$ be positive integers, with $m > n$ and $2^{2^m}+1$ and $2^{2^n}+1$, Fermat numbers. To prove that both Fermat numbers are coprime, it's sufficient to state $$\begin{align}(2^{2^m}+1, 2^{2^n}+1) =&\\ (2^{2^m}+1-(2^{2^n}+1), 2^{2^n}+1) =&…
agus
  • 51
0
votes
2 answers

Fermat numbers question

I am looking for direction in my question. The question is to prove, by long polynomial division, that: \begin{equation} 2^{2^{n+1}}-1\ |\ 2^{F_n-1}-1 \end{equation} I have tried a lot of things, like calling:\begin{equation} t=2^{2^n}…
dfdf1
  • 85
0
votes
2 answers

I am stuck on Fermat's Little Theorem. I know how to apply it, but does it apply here $15^{48}$ mod $53$.

I can't seem to figure out this problem. I can factor to reduce the number, but this is too time consuming. Isn't FLT suppose to help here? Can someone provide clarification please? FLT problem
0
votes
1 answer

How to prove n^k ≡ n mod 5 if and only if k ≡ 1 mod 4, for all integer n and k is natural?

I do believe that it has something to do with Fermat's little theorem, and I can prove the backward relationship, but how to prove the forward if? like is N^k-1 necessarily be n ^ 4m?
0
votes
1 answer

Use Fermat's little theorem to compute x^y^z mod p (where p is prime)?

I'm new to Fermat's theorem (a, and I am familiar with how to use it in basic cases with relatively large numers (i.e. 2^345 mod 31). I was given the question to find 4^(2^2006), and found myself stuck with wrong answers (when comparing to the…
Nick H
  • 1
-4
votes
0 answers

Fermat numbers question.

The question is to prove, by long polynomial division, that: $(2^{2^{(n+1)}}−1) | 2^{(Fn - 1)}−1$ $Fn = 2^{2^n}+1$
gftyh
  • 1
-6
votes
1 answer

Is this proof of Fermat's theorem acceptable?

I stumbled upon Fermat's theorem while reading Steig Larsson's "The Girl Who Played With Fire": $x^3 = y^3 + z^3 \tag{Eq. 1}$ As far as it goes, it is an academic tweak of the Pythagorean theorem. $x^2 = y^2 + z^2\tag{Eq. 2}$ So differentiating…