Results 171 to 180 of about 1,246,845 (203)

Some Properties between Mersenne, Jacobsthal and Jacobsthal-Lucas Hybrid Numbers

open access: yesChaos, Solitons and Fractals, 2021
© 2021 Elsevier LtdIn this paper, we define Mersenne hybrid numbers inspired by the definition of hybrid numbers. Then, we give some algebraic properties of Mersenne, Jacobsthal and Jacobsthal-Lucas hybrid numbers.
Dursun Taşci̧, Emre Sevgi
exaly   +2 more sources

Mersenne's Numbers

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

Mersenne numbers as a difference of two Lucas numbers

Commentationes Mathematicae Universitatis Carolinae, 2023
Summary: Let \((L_n)_{n\geq 0}\) be the Lucas sequence. We show that the Diophantine equation \(L_n-L_m=M_k\) has only the nonnegative integer solutions \((n,m,k)=(2,0,1)\), \((3,1,2)\), \((3,2,1)\), \((4,3,2)\), \((5,3,3)\), \((6,2,4)\), \((6,5,3)\) where \(M_k=2^k-1\) is the \(k\)th Mersenne number and \(n>m\).
openaire   +3 more sources

New Vistas on Mersenne numbers

Proceeding International Conference on Science and Engineering, 2023
Mersenne numbers are analyzed for varieties of interesting properties. Various fascinating relations connecting Mersenne numbers with other special number patterns by means of theorems involving the relations are exhibited.
openaire   +1 more source

Search Limits on Divisors of Mersenne numbers

BIT, 1962
On 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

On Lucas's Test for the Primality of Mersenne's Numbers

Journal of the London Mathematical Society, 1935
Beweis 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 Problem Connected with Mersenne's Numbers

The American Mathematical Monthly, 1902
(1902). A Problem Connected with Mersenne's Numbers. The American Mathematical Monthly: Vol. 9, No. 2, pp. 34-36.
openaire   +1 more source

On the generalization of Mersenne and Gaussian Mersenne polynomials

Journal of Analysis, 2023
Jagmohan Tanti   +2 more
exaly  

Home - About - Disclaimer - Privacy