Results 51 to 60 of about 39,822 (114)
The 25th and 26th Mersenne primes
The 25th and 26th Mersenne primes are 2 21701 − 1 {2^{21701}} - 1 and 2 23209
Laura Nickel, Curt Noll
core +1 more source
StorjLedger leverages erasure‐coded sharding and Proof‐of‐Storage to deliver nearly 1000 transactions per second with sub‐second latency, 98% data redundancy, and 76% lower storage costs, resolving the blockchain trilemma by harmonizing scalability, security, and decentralization.
Saha Reno, Koushik Roy
wiley +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
Groups with triangle‐free graphs on p$p$‐regular classes
Abstract Let p$p$ be a prime. In this paper, we classify the p$p$‐structure of those finite p$p$‐separable groups such that, given any three non‐central conjugacy classes of p$p$‐regular elements, two of them necessarily have coprime lengths.
M. J. Felipe +2 more
wiley +1 more source
mid-pSquare: Leveraging the Strong Side-Channel Security of Prime-Field Masking in Software
Efficiently protecting embedded software implementations of standard symmetric cryptographic primitives against side-channel attacks has been shown to be a considerable challenge in practice.
Brieuc Balon +5 more
doaj +1 more source
Variable‐Range Hopping Conduction in Amorphous, Non‐Stoichiometric Gallium Oxide
The combination of experimental evidence, ab‐initio DOS calculations and quantitative modeling by kinetic Monte Carlo simulations reveals: Variable‐range hopping (VRH) is the dominant electron conduction mechanism in a‐GaOx (x = 0.8 to 1.0), even at room temperature, which leads to a new, fundamental understanding of a‐GaOx‐based electronic devices ...
Philipp Hein +7 more
wiley +1 more source
Properties related to Fermat Primes, their connectedness with Mersenne Numbers and the reason why there are not infinite many Mersenne Primes and Perfect Numbers.
César Aguilera (17784863)
core +1 more source
A characterization of some finite simple groups by their character codegrees
Abstract Let G$G$ be a finite group and let χ$\chi$ be a complex irreducible character of G$G$. The codegree of χ$\chi$ is defined by cod(χ)=|G:ker(χ)|/χ(1)$\textrm {cod}(\chi)=|G:\textrm {ker}(\chi)|/\chi (1)$, where ker(χ)$\textrm {ker}(\chi)$ is the kernel of χ$\chi$.
Hung P. Tong‐Viet
wiley +1 more source
High performance FPGA implementation of the mersenne twister [PDF]
Efficient generation of random and pseudorandom sequences is of great importance to a number of applications [4]. In this paper, an efficient implementation of the Mersenne Twister is presented. The proposed architecture has the smallest footprint of all
Shrutisagar Chandrasekaran +3 more
core +1 more source
ON THE THIRD SMARANDACHE CONJECTURE ABOUT PRIMES [PDF]
In this paper one basically verifies the third Smarandache conjecture on ...
Le, Maohua
core +1 more source

