Results 41 to 50 of about 986 (177)
EXPONENTIAL AND CHARACTER SUMS WITH MERSENNE NUMBERS [PDF]
Journal of the Australian Mathematical Society, 2012 AbstractWe give new bounds on sums of the form ∑ n≤NΛ(n)exp (2πiagn/m) and ∑ n≤NΛ(n)χ(gn+a), where Λ is the von Mangoldt function, m is a natural number, a and g are integers coprime to m, and χ is a multiplicative character modulo m. In particular, our results yield bounds on the sums ∑ p≤Nexp (2πiaMp/m) and ∑ p≤Nχ(Mp) with Mersenne numbers Mp=2p−1 ...
Banks, William D. +3 more
openaire +1 more source
Bipartite Graphs Associated with Pell, Mersenne and Perrin Numbers
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2019 In this paper, we consider the relationships between the numbers of perfect matchings (1-factors) of bipartite graphs and Pell, Mersenne and Perrin Numbers.
Öteleş Ahmet
doaj +1 more source
On the square-freeness of Fermat and Mersenne numbers [PDF]
Pacific Journal of Mathematics, 1967 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Warren, Leroy J., Bray, Henry G.
openaire +3 more sources
Mersenne Primes in Certain Lucas Sequences [PDF]
EPJ Web of ConferencesPrime numbers are the most important numbers in number theory and cryptography. One of such special primes are given by the set of Mersenne primes, that are derived from the form Mn = 2n − 1, where n is a prime number.
Hadi Ahmed H., Hashim Hayder R.
doaj +1 more source
Converting Binary Floating‐Point Numbers to Shortest Decimal Strings: An Experimental Review
Software: Practice and Experience, Volume 56, Issue 4, Page 462-478, April 2026.ABSTRACT Background When sharing or logging numerical data, we must convert binary floating‐point numbers into their decimal string representations. For example, the number π might become 3.1415927. Engineers have perfected many algorithms for producing such accurate, short strings.
Jaël Champagne Gareau, Daniel Lemire
wiley +1 more source
On the intersections of nilpotent subgroups in simple groups
Proceedings of the London Mathematical Society, Volume 132, Issue 3, March 2026.Abstract Let G$G$ be a finite group and let Hp$H_p$ be a Sylow p$p$‐subgroup of G$G$. A recent conjecture of Lisi and Sabatini asserts the existence of an element x∈G$x \in G$ such that Hp∩Hpx$H_p \cap H_p^x$ is inclusion‐minimal in the set {Hp∩Hpg:g∈G}$\lbrace H_p \cap H_p^g \,:\, g \in G\rbrace$ for every prime p$p$.
Timothy C. Burness, Hong Yi Huang
wiley +1 more source
Testing Randomness Using Artificial Neural Network
IEEE Access, 2020 The vital characteristic of randomness is unpredictability. Thus any regularity will compromise the application of random numbers. Quantum random number generators (QRNGs) can provide intrinsic unpredictable randomness based on the nature of quantum ...
Yulong Feng, Lingyi Hao
doaj +1 more source
Note on a Mersenne number [PDF]
Bulletin of the American Mathematical Society, 1934 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
ON THE LARGEST PRIME FACTOR OF THE MERSENNE NUMBERS [PDF]
Bulletin of the Australian Mathematical Society, 2009 AbstractLetP(k) be the largest prime factor of the positive integerk. In this paper, we prove that the seriesis convergent for each constantα<1/2, which gives a more precise form of a result of C. L. Stewart [‘On divisors of Fermat, Fibonacci, Lucas and Lehmer numbers’,Proc. London Math. Soc.35(3) (1977), 425–447].
Ford, Kevin +2 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