Results 11 to 20 of about 1,195,018 (195)
Mersenne k-Fibonacci numbers [PDF]
Glasnik matematički, 2016 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.
openaire +4 more sources
Divisors of Mersenne numbers [PDF]
Mathematics of Computation, 1983 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
Primality-testing Mersenne numbers [PDF]
, 1983 Report of a systematic review of Mersenne numbers 2^p-1 for p ...
Holmes, S. M. +7 more
core +8 more sources
On some new families of $k$-Mersenne and generalized $k$-Gaussian Mersenne numbers and their polynomials [PDF]
, 2023 In this paper, we define the generalized k-Mersenne numbers and give a formula of generalized Mersenne polynomials and further, we study their properties.
Jagmohan Tanti +2 more
core +2 more sources
Mersenne Numbers: consolidated results [PDF]
, 1986 This document provides and comments on the results of the Lucas-Lehmer testing and/or partial factorisation of all Mersenne Numbers Mp = 2^p-1 where p is prime and less than 100,000. Previous computations have either been confirmed or corrected.
Hunt, David +4 more
core +7 more sources
Fermat and Mersenne numbers in $k$-Pell sequence
Математичні Студії, 2021 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)}
B. Normenyo, S. Rihane, A. Togbe
doaj +1 more source
Primality-testing Mersenne Numbers (II) [PDF]
, 1986 Reports the factor-filtering and primality-testing of Mersenne Numbers Mp for p < 100000, the latter using the ICL 'DAP' Distributed Array ...
Haworth, Guy McCrossan
core +8 more sources
On the solution of the exponential Diophantine equation 2x+m2y=z2, for any positive integer m [PDF]
Journal of Hyperstructures, 2023 It is well known that the exponential Diophantine equation 2x+ 1=z2 has the unique solution x=3 and z=3 innon-negative integers, which is closely related to the Catlan's conjecture.
Mridul Dutta, Padma Bhushan Borah
doaj +1 more source
Mathematics of Computation, 1958 Im Jahre 1957 prüfte der Verf. mit Hilfe der Maschine BESK die Mersenneschen Zahlen \(M_p = 2^p-1\) für \(p < 10,000\). Und zwar zunächst alle diese auf etwaige Teiler \(< 10\cdot 2^{20}\) und hierauf diejenigen für \(2300 < p < 3300\), bei denen sich kein solcher Teiler ergab, nach dem Lucas-Test auf ihre Primheit. Dabei ergab sich nur \(2^{3217}- 1\)
openaire +2 more sources
Revista Matemática Iberoamericana, 2021 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