Results 41 to 50 of about 524 (199)
Federated learning (FL) is a privacy‐preserving method for short‐term load forecasting in energy networks. However, current defense mechanisms against adversarial attacks often depend on supplementary machine learning frameworks, such as anomaly detection models or Byzantine‐robust aggregators.
Habib Ullah Manzoor +5 more
wiley +1 more source
We add to the heuristic and empirical evidence for a conjecture of Gillies about the distribution of the prime divisors of Mersenne numbers. We list some large prime divisors of Mersenne numbers M p {M_p}
Samuel S. Wagstaff
core +1 more source
Generalised Mersenne numbers revisited [PDF]
Generalised Mersenne Numbers (GMNs) were defined by Solinas in 1999 and feature in the NIST (FIPS 186-2) and SECG standards for use in elliptic curve cryptography.
Granger, Robert +4 more
core +4 more sources
We experimentally demonstrate that the scattering‐induced decrease in light intensity experienced by a crystal embedded in a high‐viscosity jet is very limited in materials such as lipidic cubic phase or hydroxyethyl cellulose, and therefore cannot justify the use of pump energies exceeding the linear excitation regime under realistic experimental ...
Stanisław Niziński +5 more
wiley +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
The prime numbers have been an important field of research for thousands of years and are intertwined with most other fields of mathematics. One topic that has piqued the interest of mathematicians young and old is the Mersenne prime numbers, which have ...
VanLandingham, Julia
core
Characterizations of Mersenne and 2-rooted primes
We give several characterizations of Mersenne primes (Theorem 1.1) and of primes for which 2 is a primitive root (Theorem 1.2). These characterizations involve group algebras, circulant matrices, binomial coefficients, and bipartite graphs.
Sunil K. Chebolu +2 more
openaire +3 more sources
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
General Solution of the Diophantine equation involving Mersenne Prime
In this article, I study and solve the exponential Diophantine equation $M_p^{x} + (M_q + 1)^{y}= (lz)^2$ where $M_p$ and $M_q$ are Mersenne primes, $l$ is a prime number, and $x,y$, and $z$ are non-negative integers.
Ghosh, Arkabrata
core
On the emergence of the Quanta Prime sequence
This paper presents the Quanta Prime Sequence (QPS) and its foundational theorem, showcasing a unique class of polynomials with substantial implications.
Moustafa Ibrahim
doaj +1 more source

