Results 11 to 20 of about 1,108 (208)
Mersenne k-Fibonacci numbers [PDF]
For an integer k≥ 2, let (Fn(k))n be the k-Fibonacci sequence which starts with 0,...,0,1 (k terms) and each term afterwards is the sum of the k preceding terms. In this paper, we find all k-Fibonacci numbers which are Mersenne numbers, i.e., k-Fibonacci numbers that are equal to 1 less than a power of 2.
Bravo, Jhon J., Gómez, Carlos A.
core +6 more sources
On digits of Mersenne numbers [PDF]
Motivated by recently developed interest to the distribution of q -ary digits of Mersenne numbers M_p = 2^p-1 , where p
Bryce Kerr +2 more
openaire +3 more sources
In this paper, we define the generalized k-Mersenne numbers and give a formula of generalized Mersenne polynomials and further, we study their properties. Moreover, we define Gaussian Mersenne numbers and obtain some identities like Binet Formula, Cassini's identity, D'Ocagne's Identity, and generating functions.
Munesh Kumari +2 more
core +5 more sources
Divisors of Mersenne numbers [PDF]
We add to the heuristic and empirical evidence for a conjecture of Gillies about the distribution of the prime divisors of Mersenne numbers. We list some large prime divisors of Mersenne numbers
Samuel S. Wagstaff
openaire +3 more sources
The q-Integers and the Mersenne Numbers [PDF]
Here we will show that the q-integers, the q-analogue of the integers that we can find in the q-calculus, are forming an additive group having a generalized sum similar to the sum of the Tsallis q-entropies of independent systems. The symmetric form of q-integers will be studied too.
Sparavigna, Amelia Carolina +1 more
openaire +3 more sources
On generalized Mersenne hybrid numbers
The hybrid numbers are generalization of complex, hyperbolic and dual numbers. In this paper we consider a special kind of hybrid numbers, namely the Mersenne hybrid numbers and we give some of their properties.
Szynal-Liana, Anetta, Włoch, Iwona
openaire +3 more sources
Partitions of numbers and the algebraic principle of Mersenne, Fermat and even perfect numbers [PDF]
Let ρ be an odd prime greater than or equal to 11. In a previous work, starting from an M-cycle in a finite field 𝔽_ρ, it has been established how the divisors of Mersenne, Fermat and Lehmer numbers arise.
A. M. S. Ramasamy
doaj +2 more sources
Boolean Hypercubes, Mersenne Numbers, and the Collatz Conjecture
This study is based on the trivial transcription of the vertices of a Boolean \textit{N}-Dimensional Hypercube $\textbf{H}_{N} $ into a subset $\mathbb{S}_{N}$ of the decimal natural numbers $\mathbb{N}.$ Such straightforward mathematical manipulation ...
Ramon Carbó Dorca
doaj +2 more sources
These notes have been issued on a small scale in 1983 and 1987 and on request at other times. This issue follows two items of news. First, WaIter Colquitt and Luther Welsh found the 'missed' Mersenne prime M110503 and advanced the frontier of complete Mp-testing to 139,267. In so doing, they terminated Slowinski's significant string of four consecutive
Haworth, Guy McCrossan
openaire +1 more source
On a generalized sum of the Mersenne Numbers [PDF]
The full citation for this Article is: Sparavigna, A. C. (2018). On a generalized sum of the Mersenne Numbers. Zenodo.
Sparavigna, Amelia Carolina +1 more
openaire +3 more sources

