Results 171 to 180 of about 1,598,417 (209)
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Extending Mersenne Numbers to Bicomplex (p,q)-Mersenne Quaternions with Catalan Transformations
EQUATIONSIn our study we define bicomplex (p,q)- Mersenne numbers. Utilizing these numbers, we present bicomplex (p,q)- Mersenne quaternions which are a generalization of Mersenne quaternions. All these sequences have second order recurrence relations.
Engin Eser, B. Kuloǧlu, E. Özkan
semanticscholar +1 more source
Nature, 1922
IN my presidential address to Section A of the British Association, reprinted in NATURE (September 16), I stated that 137 was the least value of n for which the prime or composite character of 2n–1 was still undecided. Mr. W. W. Rouse Ball has pointed out to me that this is incorrect, as 2137–1 has been shown to be composite by M. A.
openaire +1 more source
IN my presidential address to Section A of the British Association, reprinted in NATURE (September 16), I stated that 137 was the least value of n for which the prime or composite character of 2n–1 was still undecided. Mr. W. W. Rouse Ball has pointed out to me that this is incorrect, as 2137–1 has been shown to be composite by M. A.
openaire +1 more source
SOME IDENTITIES OF k-MERSENNE NUMBERS
Advances and Applications in Discrete Mathematics, 2017Summary: In this study, we first examine \(k\)-Mersenne numbers. Then we obtain some identities on the \(k\)-Mersenne numbers.
Uslu, Kemal, Deniz, Vural
openaire +2 more sources
Search Limits on Divisors of Mersenne numbers
BIT, 1962On the urgent request of several coenthusiasts around the globe in the field of Factorization of Mersenne Numbers, the author publishes here for the first time the search limits on divisorsq of 2p − 1, even when no divisor up to this limit was found. This list, therefore, should avoid time consuming double work.
openaire +1 more source
Computers As a Novel Mathematical Reality: III. Mersenne Numbers and Sums of Divisors
Doklady. Mathematics, 2023N. Vavilov
semanticscholar +1 more source
On Lucas's Test for the Primality of Mersenne's Numbers
Journal of the London Mathematical Society, 1935Beweis des Satzes: Ist \(p\) eine Primzahl \((\neq 2)\), so ist \(N = 2^p - 1\) dann und nur dann eine Primzahl, wenn das \((n - 1)\)-te Glied der Reihe \(S_1 = 4, \ldots, S_k= S_{k-1}^2 - 1\) teilbar ist durch \(N\). Ein Teil dieses Satzes ist von Lucas; sein Beweis war nicht einwandfrei. Verf. gebraucht die Reihe \(U_r =\frac{(a^r - b^r)}{(a - b)}\),
openaire +2 more sources
A novel cuckoo search algorithm with adaptive discovery probability based on double Mersenne numbers
Neural computing & applications (Print), 2021M. Reda +3 more
semanticscholar +1 more source