Results 51 to 60 of about 13,596 (196)
Probabilistic Methods on Erdos Problems [PDF]
, 2013 The study of perfect numbers dates back to Euler and Mersenne. A perfect number is a number that is equal to the sum of its proper divisors which are said to include the multiplicative unit 1.
Gilbert, Jesse
core +1 more source
A Note on Transfinite M Theory and the Fine Structure Constant [PDF]
, 2001 In this short note, using notions from $p$-Adic QFT and $p$-branes, we derive the transfinite M $theoretical$ corrections $(\alpha_M)^{-1} = 100 + 61 \phi$ to El Naschie's inverse fine structure constant value $(\alpha_{HS})^{-1}= 100 + 60\phi$ which was
Brekke +16 more
core +3 more sources
Public key cryptographic algorithm SM2 optimized implementation on low power embedded platform
网络与信息安全学报, 2022 With the development of wireless communication technology and the popularization of intelligent terminals, more and more cryptographic algorithms are applied to IoT devices to ensure the security of communication and data.Among them, the SM2 elliptic ...
Ganqin LIU +4 more
doaj +3 more sources
More Generalized Mersenne Numbers [PDF]
, 2004 In 1999, Jerome Solinas introduced families of moduli called the generalized Mersenne numbers. The generalized Mersenne numbers are expressed in a polynomial form, p = f(t), where t is a power of 2. It is shown that such p’s lead to fast modular reduction methods which use only a few integer additions and subtractions.
Jaewook Chung, Anwar Hasan
openaire +1 more source
Leading Digits of Mersenne Numbers [PDF]
Experimental Mathematics, 2019 It has long been known that sequences such as the powers of $2$ and the factorials satisfy Benford's Law; that is, leading digits in these sequences occur with frequencies given by $P(d)=\log_{10}(1+1/d)$, $d=1,2,\dots,9$. In this paper, we consider the leading digits of the Mersenne numbers $M_n=2^{p_n}-1$, where $p_n$ is the $n$-th prime. In light of
Cai, Zhaodong +4 more
openaire +2 more sources
FPGA Realization of a Novel Hyperchaos Augmented Image Encryption Algorithm
IET Computers &Digital Techniques, Volume 2026, Issue 1, 2026.With the rapid growth of multimedia communication, protecting image data has become increasingly critical. This article proposes a novel 3‐stage hyperchaos‐based augmented image encryption technique (3SHAIET) that utilizes a three‐stage process with chaotic systems of increasing dimensionality (e.g., six‐dimensional [6D], 8D, and 9D) to enhance ...
Wassim Alexan +6 more
wiley +1 more source
Divisibility by 3 of even multiperfect numbers of abundancy 3 and 4 [PDF]
, 2010 We say a number is flat if it can be written as a non-trivial power of 2 times an odd squarefree number. The power is the “exponent” and the number of odd primes the “length”. Let N be flat and 4-perfect with exponent a and length m.
Broughan, Kevin A., Zhou, Qizhi
core +1 more source
On generalized Mersenne hybrid numbers
Annales Universitatis Mariae Curie-Sklodowska, sectio A – Mathematica, 2020 The hybrid numbers are generalization of complex, hyperbolic and dual numbers. In this paper we consider a special kind of hybrid numbers, namely the Mersenne hybrid numbers and we give some of their properties.
Szynal-Liana, Anetta, Włoch, Iwona
openaire +2 more sources
Kesetaraan Uji Pepin dan Lucas-lehmer [PDF]
, 2015 Pepin test provides a necessary and sufficient condition for a Fermat number to be a prime. Lucas-Lehmer test provides a necessary and sufficient condition for a Mersenne number to be a prime.
Gemawati, S. (Sri) +2 more
core
, 2017 CPUs and operating systems are moving from 32 to 64 bits, and hence it is important to have good pseudorandom number generators designed to fully exploit these word lengths. However, existing 64-bit very long period generators based on linear recurrences
Harase, Shin, Kimoto, Takamitsu
core +1 more source