mersenne numbers
Recently Published Documents


TOTAL DOCUMENTS

82
(FIVE YEARS 22)

H-INDEX

8
(FIVE YEARS 1)

2021 ◽  
Vol 56 (2) ◽  
pp. 115-123
Author(s):  
B. Normenyo ◽  
S. Rihane ◽  
A. Togbe

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.


Author(s):  
Bryce Kerr ◽  
László Mérai ◽  
Igor Shparlinski
Keyword(s):  

2021 ◽  
Vol 9 (3) ◽  
pp. 48-51
Author(s):  
Mustafa Asci ◽  
Suleyman Aydinyuz
Keyword(s):  

Author(s):  
Yüksel Soykan

In this paper, we introduce the generalized p-Mersenne sequence and deal with, in detail, two special cases, namely, p-Mersenne and p-Mersenne-Lucas-sequences. We present Binet’s formulas, generating functions, Simson formulas, and the summation formulas for these sequences. Moreover, we give some identities and matrices related with these sequences.


Mathematics ◽  
2021 ◽  
Vol 9 (20) ◽  
pp. 2620
Author(s):  
Dragana Bajić ◽  
Goran Dimić ◽  
Nikola Zogović

This paper proposes a code defined on a finite ring ℤpM, where pM = 2m−1 is a Mersenne prime, and m is a binary size of ring elements. The code is based on a splitting sequence (splitting set) S, defined for the given multiplier set ℰ={±20, ±21,…, ±2m−1}. The elements of ℰ correspond to the weights of binary error patterns that can be corrected, with the bidirectional single-bit error being the representative that occurs the most. The splitting set splits the code-word into sub-words, which inspired the name splitting code. Each sub-word, provided with auxiliary control symbols that are a byproduct of the coding procedure, corrects a single symbol error. The code can be defined, with some constraints, for general Mersenne numbers as well, while the multiplier set can be adjusted for adjacent binary errors correction. The application proposed for this code is a hybrid three-stage incremental ARQ procedure that transmits the code-word in the first stage, auxiliary control symbols in the second stage, and retransmits the sub-words detected as incorrect in the third stage. At each stage, error correction can be turned on or off, keeping both the retransmission rate and residual error rate at a low level.


2021 ◽  
Vol 27 (1) ◽  
pp. 161-170
Author(s):  
Bir Kafle ◽  
◽  
Salah Eddine Rihane ◽  
Alain Togbé ◽  
◽  
...  
Keyword(s):  

In this paper, we determine all the Mersenne numbers which are in the sequences of Padovan and Perrin numbers, respectively.


Sign in / Sign up

Export Citation Format

Share Document