Results 61 to 70 of about 377,673 (186)

SR-groups of Order 2ⁿp^m with Dihedral Sylow 2-subgroup

Моделирование и анализ информационных систем, 2007
The structure of SR-groups with dihedral Sylow 2-subgroup modulo Frattini subgroup is described. It is proved that if a group О is a non-supersolvable SR-group of order 2npm with dihedral Sylow 2-subgroup, p is Mersenne prime.
V. V. Yanishevskiy
doaj  

StorjLedger: An Innovative Distributed Storage Ecosystem That Overcomes Blockchain Trade‐Offs Using Erasure‐Coded Sharding and Proof‐of‐Storage Consensus

Engineering Reports, Volume 7, Issue 10, October 2025.
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

Groups with triangle‐free graphs on p$p$‐regular classes

Mathematische Nachrichten, Volume 298, Issue 6, Page 1796-1807, June 2025.
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, M. K. Jean‐Philippe, V. Sotomayor   +2 more
wiley   +1 more source

Mersenne k-Fibonacci numbers [PDF]

, 2016
For an integer k≥ 2, let (Fn(k))n be the k-Fibonacci sequence which starts with 0,...,0,1 (k terms) and each term afterwards is the sum of the k preceding terms. In this paper, we find all k-Fibonacci numbers which are Mersenne numbers, i.e., k-Fibonacci
Carlos A. Gómez, Jhon J. Bravo, Gómez, Carlos A., Bravo, Jhon J.   +3 more
core   +1 more source

Variable‐Range Hopping Conduction in Amorphous, Non‐Stoichiometric Gallium Oxide

Advanced Electronic Materials, Volume 11, Issue 4, April 2025.
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, Tobias Romstadt, Fabian Draber, Jinseok Ryu, Thorben Böger, Andreas Falkenstein, Miyoung Kim, Manfred Martin   +7 more
wiley   +1 more source

Mersenne Primes in Real Quadratic Fields

, 2012
The concept of Mersenne primes is studied in real quadratic fields of class number 1. Computational results are given. The field $Q(\sqrt{2})$ is studied in detail with a focus on representing Mersenne primes in the form $x^{2}+7y^{2}$. It is also proved that $x$ is divisible by 8 and $y\equiv \pm3\pmod{8}$ generalizing the result of F Lemmermeyer ...
Palimar, Sushma, Shankar, B. R.
openaire   +3 more sources

A characterization of some finite simple groups by their character codegrees

Mathematische Nachrichten, Volume 298, Issue 4, Page 1356-1369, April 2025.
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

Prospects for the Use of Quasi-Mersen Numbers in the Design of Parallel-Serial Processors

Applied Sciences
It is shown that a serial-parallel processor, comparable in bit capacity to a 16-bit binary processor, can be implemented based on an algorithm built on the residue number system, a distinctive feature of which is the use of the first four quasi-Mersenne
Aruzhan Kadyrzhan, Kaisarali Kadyrzhan, Akhat Bakirov, Ibragim Suleimenov   +3 more
doaj   +1 more source

Batched ranged random integer generation

Software: Practice and Experience, Volume 55, Issue 1, Page 155-169, January 2025.
Summary Pseudorandom values are often generated as 64‐bit binary words. These random words need to be converted into ranged values without statistical bias. We present an efficient algorithm to generate multiple independent uniformly‐random bounded integers from a single uniformly‐random binary word, without any bias.
Nevin Brackett‐Rozinsky, Daniel Lemire
wiley   +1 more source

LETTER Special Section on Cryptography and Information Security Simple Power Analysis on Fast Modular Reduction with

, 2006
SUMMARY We discuss side channel leakage from modular reduction for NIST recommended domain parameters. FIPS 186-2 has 5 recommended prime fields. These primes have a special form which is referred to as generalized Mersenne prime.
Generalized Mersenne, Curve Cryptosystems, Prime Elliptic   +2 more
core