Results 141 to 150 of about 986 (177)

LAX1 as a core biomarker in Alzheimer's disease and periodontitis via the STAT signaling pathway. [PDF]

BMC Geriatr
Guo H, Guo T, Wang X, Bao Y, Zhang Z, Xue F, Cheng D.   +6 more
europepmc   +1 more source

Integrity verified lightweight ciphering for secure medical image sharing between embedded SoCs. [PDF]

Sci Rep
Janakiraman S, R VR, Sivaraman R, Sridevi A, Upadhyay HN, Amirtharajan R.   +5 more
europepmc   +1 more source

Pushing the boundary of quantum advantage in hard combinatorial optimization with probabilistic computers. [PDF]

Nat Commun
Chowdhury S, Aadit NA, Grimaldi A, Raimondo E, Raut A, Lott PA, Mentink JH, Rams MM, Ricci-Tersenghi F, Chiappini M, Theogarajan LS, Srimani T, Finocchio G, Mohseni M, Camsari KY.   +14 more
europepmc   +1 more source

Development and Internal Validation of a Prediction Model for Major Cardiovascular and Respiratory Events in Chronic Obstructive Pulmonary Disease: Nationwide Primary Care Electronic Medical Records Cohort Study. [PDF]

Pragmat Obs Res
Gale CP, Bhutani M, Chan JSK, Townend J, Patel MS, Sadatsafavi M, Henley W, Ariti C, Carter V, Couper A, Hubbard R, Kocks JWH, Pullen R, Skinner D, Price D.   +14 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Mersenne numbers

2021
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

SOME IDENTITIES OF k-MERSENNE NUMBERS

Advances and Applications in Discrete Mathematics, 2017
Summary: 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

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

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