Results 11 to 20 of about 71,662 (302)
FLAT PRIMES AND THIN PRIMES [PDF]
AbstractA number is called upper (lower) flat if its shift by +1 ( −1) is a power of 2 times a squarefree number. If the squarefree number is 1 or a single odd prime then the original number is called upper (lower) thin. Upper flat numbers which are primes arise in the study of multi-perfect numbers.
Broughan, Kevin A., Zhou, Qizhi
openaire +4 more sources
A dramatic increase in the number of outbreaks of dengue has recently been reported, and climate change is likely to extend the geographical spread of the disease. In this context, this paper shows how a neural network approach can incorporate dengue and
Paula Bergero +2 more
doaj +1 more source
To Prime, or Not to Prime: That Is the Question [PDF]
Mitochondrial priming is regulated by the B-cell lymphoma 2 (BCL-2) family of proteins and determines a cell's "readiness" for apoptosis. A highly primed cell will undergo apoptosis more easily than an unprimed cell in response to apoptotic stimuli via the intrinsic apoptotic pathway.
Danielle S, Potter, Anthony, Letai
openaire +2 more sources
Semicircular elements induced by p-adic number fields [PDF]
In this paper, we study semicircular-like elements, and semicircular elements induced by \(p\)-adic analysis, for each prime \(p\). Starting from a \(p\)-adic number field \(\mathbb{Q}_{p}\), we construct a Banach \(*\)-algebra \(\mathfrak{LS}_{p}\), for
Ilwoo Cho, Palle E. T. Jorgensen
doaj +1 more source
Synthesizing efficient heterogeneous catalysts with multiple active sites able to activate peroxymonosulfate (PMS) for the degradation of persistent organic pollutants continues to be a challenge for societies worldwide.
Elvira Gómez +3 more
doaj +1 more source
On Fourier Coefficients of the Symmetric Square L-Function at Piatetski-Shapiro Prime Twins
Let Pc(x)={p≤x|p,[pc]areprimes},c∈R+∖N and λsym2f(n) be the n-th Fourier coefficient associated with the symmetric square L-function L(s,sym2f). For any A>0, we prove that the mean value of λsym2f(n) over Pc(x) is ≪xlog−A−2x for almost all c∈ε,(5+3)/8−ε ...
Xue Han, Xiaofei Yan, Deyu Zhang
doaj +1 more source
A primality test for Kpⁿ⁺¹ numbers and a generalization of Safe primes and Sophie Germain primes [PDF]
In this paper, we provide a generalization of Proth's theorem for integers of the form Kpⁿ⁺¹. In particular, a primality test that requires a modular exponentiation (with a proper base a) similar to that of Fermat's test without the computation of any ...
Abdelrahman Ramzy
doaj +1 more source
A note on primes in short intervals [PDF]
This paper is concerned with the number of primes in short intervals. We prove that for every $\theta>1/2$ the intervals $[x, x+x^{\theta}]$ contain the expected number of primes for $x\rightarrow \infty$, with the assumption of an heuristic hypothesis ...
Bazzanella, Danilo
core +1 more source
New Proof That the Sum of the Reciprocals of Primes Diverges
In this paper, we give a new proof of the divergence of the sum of the reciprocals of primes using the number of distinct prime divisors of positive integer n, and the placement of lattice points on a hyperbola given by n=pr with prime number p.
Vicente Jara-Vera +1 more
doaj +1 more source
Prime Slaughter: Playful Prime Numbers [PDF]
Starting from the difficulty of creating playful representation of domain-specific abstract concepts, this study discusses the design of Prime Slaughter, a computer game aimed at facilitating individual sense-making of abstract mathematical concepts. Specifically the game proposes a transposition of primality and factorization into playful interactions,
Andrea Valente, Emanuela Marchetti
openaire +5 more sources

