Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Fermat and Mersenne numbers in $k$-Pell sequence

View through CrossRef
For an integer $k\geq 2$, let $(P_n^{(k)})_{n\geq 2-k}$ be the $k$-generalized Pell sequence, which starts with $0,\ldots,0,1$ ($k$ terms) and each term afterwards is defined by the recurrence$P_n^{(k)}=2P_{n-1}^{(k)}+P_{n-2}^{(k)}+\cdots +P_{n-k}^{(k)},\quad \text{for all }n \geq 2.$For any positive integer $n$, a number of the form $2^n+1$ is referred to as a Fermat number, while a number of the form $2^n-1$ is referred to as a Mersenne number. The goal of this paper is to determine Fermat and Mersenne numbers which are members of the $k$-generalized Pell sequence. More precisely, we solve the Diophantine equation $P^{(k)}_n=2^a\pm 1$ in positive integers $n, k, a$ with $k \geq 2$, $a\geq 1$. We prove a theorem which asserts that, if the Diophantine equation $P^{(k)}_n=2^a\pm 1$ has a solution $(n,a,k)$ in positive integers $n, k, a$ with $k \geq 2$, $a\geq 1$, then we must have that $(n,a,k)\in \{(1,1,k),(3,2,k),(5,5,3)\}$. As a result of our theorem, we deduce that the number $1$ is the only Mersenne number and the number $5$ is the only Fermat number in the $k$-Pell sequence.
Ivan Franko National University of Lviv
Title: Fermat and Mersenne numbers in $k$-Pell sequence
Description:
For an integer $k\geq 2$, let $(P_n^{(k)})_{n\geq 2-k}$ be the $k$-generalized Pell sequence, which starts with $0,\ldots,0,1$ ($k$ terms) and each term afterwards is defined by the recurrence$P_n^{(k)}=2P_{n-1}^{(k)}+P_{n-2}^{(k)}+\cdots +P_{n-k}^{(k)},\quad \text{for all }n \geq 2.
$For any positive integer $n$, a number of the form $2^n+1$ is referred to as a Fermat number, while a number of the form $2^n-1$ is referred to as a Mersenne number.
The goal of this paper is to determine Fermat and Mersenne numbers which are members of the $k$-generalized Pell sequence.
More precisely, we solve the Diophantine equation $P^{(k)}_n=2^a\pm 1$ in positive integers $n, k, a$ with $k \geq 2$, $a\geq 1$.
We prove a theorem which asserts that, if the Diophantine equation $P^{(k)}_n=2^a\pm 1$ has a solution $(n,a,k)$ in positive integers $n, k, a$ with $k \geq 2$, $a\geq 1$, then we must have that $(n,a,k)\in \{(1,1,k),(3,2,k),(5,5,3)\}$.
As a result of our theorem, we deduce that the number $1$ is the only Mersenne number and the number $5$ is the only Fermat number in the $k$-Pell sequence.

Related Results

On Hybrid Hyper k-Pell, k-Pell–Lucas, and Modified k-Pell Numbers
On Hybrid Hyper k-Pell, k-Pell–Lucas, and Modified k-Pell Numbers
Many different number systems have been the topic of research. One of the recently studied number systems is that of hybrid numbers, which are generalizations of other number syste...
Ghani Mersenne and Fermat Entropy for Some Dendrimers and Their Structure-Property Modeling
Ghani Mersenne and Fermat Entropy for Some Dendrimers and Their Structure-Property Modeling
The mathematical language provided by various topological index types may be used to identify various properties of chemical components in a molecular structure. Within the framewo...
Some Binomial Sums of k-Pell, k-Pell-Lucas and Modified k-Pell Numbers
Some Binomial Sums of k-Pell, k-Pell-Lucas and Modified k-Pell Numbers
The main goal of this paper is to find some new identities containing k-Pell and k-Pell-Lucas numbers. In addition, we use these identities to prove binomial properties of k-Pell, ...
On generalized (k, r)-Pell and (k, r)-Pell–Lucas numbers
On generalized (k, r)-Pell and (k, r)-Pell–Lucas numbers
We introduce new kinds of k-Pell and k-Pell–Lucas numbers related to the distance between numbers by a recurrence relation and show their relation to the (k,r)-Pell and (k,r)-Pell–...
On the k-Vieta-Pell and k-Vieta-Pell-Lucas Sequences
On the k-Vieta-Pell and k-Vieta-Pell-Lucas Sequences
The aim of this paper is to define the k-Vieta-Pell and k-Vieta-Pell-Lucas sequences, and some terms of these sequences are given. Then, we find the relations between the terms of ...
Fermat's Last Theorem: A Proof by Contradiction
Fermat's Last Theorem: A Proof by Contradiction
In this paper I offer an algebraic proof by contradiction of Fermat’s Last Theorem. Using an alternative to the standard binomial expansion, (a+b) n = a n + b Pn i=1 a n−i (a + b) ...
Diophantine equations for additive Pell numbers in Pell, Pell–Lucas, and Modified Pell numbers
Diophantine equations for additive Pell numbers in Pell, Pell–Lucas, and Modified Pell numbers
This paper investigates the Diophantine equations arising from ternary additive problems of Pell, Pell–Lucas, and Modified Pell numbers. Specifically, we characterize all integer s...
The Properties of the Altered Pell and Pell Lucas Sequences
The Properties of the Altered Pell and Pell Lucas Sequences
The altered Pell and Pell Lucas sequences are defined by altering the Pell and Pell Lucas numbers, it is seen that they have similar properties to usual the Pell and Pell Lucas seq...

Back to Top