Results 31 to 40 of about 1,108 (208)
I DESIRE to announce the discovery which I have made that (2181 —;1) is divisible by 43441. This leaves only 16 of the numbers (2q — 1) originally reported composite by Mersenne, still unverified. I have submitted my determination to Lt.—Col. Allan Cunningham, R.E., who has kindly verified it.
openaire +1 more source
AT various times NATURE has inserted notices of the successive discoveries in relation to Mersenne's Numbers. In the issue of August 12, 1909, Colonel Cunningham's discovery that 228479 was a factor of 2P−1 when p = 71 was announced: the other factor was 10334355636337793, but whether this was a prime or not was left undetermined.
openaire +2 more sources
Purpose: Encryption of patient information has become an important issue in medical ultrasound instrumentation to secure information when images are accessed off-site.
Seung-Hyeok Shin +2 more
doaj +1 more source
In this paper, we define Gaussian Mersenne numbers and we give some properties of them. Moreover we present some relations among Gaussian Mersenne numbers, Gaussian Jacobsthal numbers and Gaussian Jacobsthal-Lucas numbers. We also present some results with matrices involving Gaussian Mersenne numbers.
openaire +1 more source
Cryptography using Fibonacci-Mersenne and Fibonacci-balancing p-sequences with a self-invertible matrix and the Affine-Hill cipher [PDF]
In this paper, we define two new sequences using the Fibonacci p-numbers, the generalized Mersenne numbers, and m-balancing numbers. These sequences are obtained from the corresponding characteristic polynomials.
Elahe Mehraban +3 more
doaj +1 more source
Boolean Hypercubes: The Origin of a Tagged Recursive Logic and the Limits of Artificial Intelligence
Boolean and logical hypercubes are discussed as providers of tags to logical object sets, transforming them into logical tagged sets, a generalization of fuzzy sets.
Ramon Carbó-dorca
doaj +1 more source
High performance FPGA implementation of the mersenne twister
Efficient generation of random and pseudorandom sequences is of great importance to a number of applications [4]. In this paper, an efficient implementation of the Mersenne Twister is presented. The proposed architecture has the smallest footprint of all
Shrutisagar Chandrasekaran +3 more
core +1 more source
In this work, we investigate the binomial transforms and Catalan transform of the $k$-Mersenne and $k$-Mersenne-Lucas numbers and examine the new integer sequences.
Kalika Prasad +3 more
doaj +1 more source
Bipartite Graphs Associated with Pell, Mersenne and Perrin Numbers
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
Affine–Hill cipher from Hadamard-type Fibonacci–Mersenne and Fibonacci-balancing p-sequences [PDF]
In this paper, we define two new sequences using the generalized Mersenne numbers, Fibonacci p-numbers, and m-balancing numbers. These sequences are constructed using the Hadamard-type product of their characteristic polynomials.
Elahe Mehraban +2 more
doaj +1 more source

