Results 231 to 240 of about 5,990,152 (267)

The Subliminal Threshold Estimation Procedure (STEP): A calibration method tailored for estimating subliminal thresholds. [PDF]

Behav Res Methods
Elbaz E, Yaron I, Mudrik L.
europepmc   +1 more source

Anatomical validation of ultrasound-guided retrolaminar block for the treatment of symptomatic vertebral fragility fractures. [PDF]

Front Med (Lausanne)
Ponce A, Sala X, Gómez-Casanovas E, Llusá M, Gómez-Puerta JA, Peris P.   +5 more
europepmc   +1 more source

Transcriptomic and lipidomic analysis of the cryptococcal lung granuloma reveals macrophage boundary programs and sphingolipid remodeling. [PDF]

Nat Commun
Brauer VS, Takemura K, Rosati B, Cavalcanti-Neto MP, Dasilva D, Singh N, Normile T, Vaccaro G, Caso G, Singh H, Chen B, Ojima I, McKinnon D, Del Poeta M.   +13 more
europepmc   +1 more source

Beadex modulates haematopoiesis and innate immune defence against microbial infection in Drosophila melanogaster. [PDF]

J Cell Sci
Jain S, Salian K, Shah V, Nongthomba U.
europepmc   +1 more source

Relationship Between the Prime-Counting Function and a Unique Prime Number Sequence [PDF]

Missouri Journal of Mathematical Sciences, 2023
In the paper under review, the author gives an expression for the asymptotic limit of the prime-counting function \(\pi(x)\) as a function of the prime number subsequence of higher order \[ \mathbb{P}'=\{2, 5, 7, 13, 19, 23, 29, 31, 37, 43, 47, 53, 59, 61, 71, \dots\}.
May, Michael P.
exaly   +3 more sources

On the Counting Function of Irregular Primes

Indagationes Mathematicae, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amalia Pizarro-Madariaga, Carl Pomerance, Florian Luca   +2 more
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

On a Constant Related to the Prime Counting Function

Mediterranean Journal of Mathematics, 2015
Recall that \(\pi(x)\) denotes the number of primes not exceeding \(x\), and let \[ S(x)=\sum_{2\leq n\leq x}\frac{1}{\pi(n)}-\left(\frac{1}{2}\log^2 x-\log x-\log\log x\right). \] It is known that \(S(x)\) tends to a limit, say \(C\), as \(x\to\infty\).
Berkane, Djamel, Dusart, Pierre
openaire   +1 more source

On Relatively Prime Sets Counting Functions

Integers, 2010
AbstractThis work is motivated by Nathanson's recent paper on relatively prime sets and a phi function for subsets of {1, 2, 3, . . . ,
exaly   +3 more sources

The Counting Function for Elkies Primes

Journal of Number Theory
Let $E$ be an elliptic curve over a finite field $\mathbb{F}_q$ where $q$ is a prime power. The Schoof--Elkies--Atkin (SEA) algorithm is a standard method for counting the number of $\mathbb{F}_q$-points on $E$. The asymptotic complexity of the SEA algorithm depends on the distribution of the so-called Elkies primes.
Lippmann, Meher Elijah, McGown, Kevin J.
exaly   +3 more sources