Results 1 to 10 of about 1,246,845 (203)
Features of digital signal processing algorithms using Galois fields GF(2n+1). [PDF]
An alternating representation of integers in binary form is proposed, in which the numbers -1 and +1 are used instead of zeros and ones. It is shown that such a representation creates considerable convenience for multiplication numbers modulo p = 2n+1 ...
Ibragim E Suleimenov +2 more
doaj +2 more sources
Lucas-Lehmer test is the current standard algorithm used for testing the primality of Mersenne numbers, but it may have limitations in terms of its efficiency and accuracy.
Moustafa Mohamed
exaly +3 more sources
Learned pseudo-random number generator: WGAN-GP for generating statistically robust random numbers. [PDF]
Pseudo-random number generators (PRNGs) are software algorithms generating a sequence of numbers approximating the properties of random numbers. They are critical components in many information systems that require unpredictable and nonarbitrary ...
Kiyoshiro Okada +3 more
doaj +2 more sources
BiEntropy, TriEntropy and Primality [PDF]
The order and disorder of binary representations of the natural numbers < 28 is measured using the BiEntropy function. Significant differences are detected between the primes and the non-primes.
Grenville J. Croll
doaj +2 more sources
In this paper, we study periodic tridiagonal Toeplitz matrices with perturbed corners. By using some matrix transformations, the Schur complement and matrix decompositions techniques, as well as the Sherman-Morrison-Woodbury formula, we derive explicit ...
Zhaolin Jiang, Yunlan Wei
exaly +3 more sources
Mersenne version of Brocard-Ramanujan equation
In this study, we deal with a special form of the Brocard-Ramanujan equation, which is one of the interesting and still open problems of Diophantine analysis.
Ayşe Nalli, Seyran İbrahimov
doaj +1 more source
A study on the number of edges of some families of graphs and generalized Mersenne numbers
The relationship between the Nandu sequence of the SM family of graphs and the Generalized Mersenne numbers is demonstrated in this study. Nandu sequences are related to the two families of SM sum graphs and SM Balancing graphs.
K.G. Sreekumar +3 more
doaj +1 more source
Fermat and Mersenne numbers in $k$-Pell sequence
For an integer $k\geq 2$, let $(P_n^{(k)})_{n\geq 2-k}$ be the $k$-generalized Pell sequence, which starts with $0,\ldots,0,1$ ($k$ terms) and each term afterwards is defined by the recurrence $ P_n^{(k)}=2P_{n-1}^{(k)}+P_{n-2}^{(k)}+\cdots +P_{n-k}^{(k)}
B. Normenyo, S. Rihane, A. Togbe
doaj +1 more source
On the solution of the exponential Diophantine equation 2x+m2y=z2, for any positive integer m [PDF]
It is well known that the exponential Diophantine equation 2x+ 1=z2 has the unique solution x=3 and z=3 innon-negative integers, which is closely related to the Catlan's conjecture.
Mridul Dutta, Padma Bhushan Borah
doaj +1 more source
On the Split Mersenne and Mersenne-Lucas Hybrid Quaternions
In this communication, introduce the split Mersenne and Mersenne-Lucas hybrid quaternions, also obtaining generating functions and Binet formulas for these hybrid quaternions and investigating some properties among them.
B. Malini Devi, S. Devibala
doaj +1 more source

