Results 21 to 30 of about 8,955,762 (211)
On Triangular Secure Domination Number
InPrime, 2020 Let T_m=(V(T_m), E(T_m)) be a triangular grid graph of m ϵ N level. The order of graph T_m is called a triangular number. A subset T of V(T_m) is a dominating set of T_m if for all u_V(T_m)\T, there exists vϵT such that uv ϵ E(T_m), that is, N[T]=V(T_m)
Emily L Casinillo +3 more
doaj +1 more source
The search for the largest non Mersenne prime number
, 2021 I bring novelties in the search for the largest non mersenne prime number coming if not at the greatest number very close to ...
Luis Felipe massena misiec (8212830)
core +1 more source
Mathematics of Computation, 1958 Im Jahre 1957 prüfte der Verf. mit Hilfe der Maschine BESK die Mersenneschen Zahlen \(M_p = 2^p-1\) für \(p < 10,000\). Und zwar zunächst alle diese auf etwaige Teiler \(< 10\cdot 2^{20}\) und hierauf diejenigen für \(2300 < p < 3300\), bei denen sich kein solcher Teiler ergab, nach dem Lucas-Test auf ihre Primheit. Dabei ergab sich nur \(2^{3217}- 1\)
openaire +2 more sources
High performance FPGA implementation of the mersenne twister [PDF]
, 2008 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
HMNT: Hash Function Based on New Mersenne Number Transform
IEEE Access, 2020 In the field of information security, hash functions are considered important as they are used to ensure message integrity and authentication. Despite various available methods to design hash functions, the methods have been proven to time inefficient ...
Ali Maetouq, Salwani Mohd Daud
doaj +1 more source
Revista Matemática Iberoamericana, 2021 Motivated by recently developed interest to the distribution of q -ary digits of Mersenne numbers M_p = 2^p-1 , where p
Bryce Kerr +2 more
openaire +3 more sources
Nature, 1911 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
Fermat numbers and Mersenne numbers [PDF]
Mathematics of Computation, 1964 This paper gives details of the computations made on an IBM 7090 computer to show that the Fermat number \(F_m = 2^{2^m} +1\) is composite for \(m=14\), and that all the Mersenne numbers \(M_p=2^p-1\) \((5000 < p < 6000)\) are composite. The method used to show that the Fermat number is composite was to compute \(3^{2^n}\) modulo \(F_m\).
Selfridge, J. L., Hurwitz, Alexander
openaire +2 more sources
On generalized bihyperbolic Mersenne numbers [PDF]
, 2020 summary:In this paper, a new generalization of Mersenne bihyperbolic numbers is introduced. Some of the properties of presented numbers are given. A general bilinear index-reduction formula for the generalized bihyperbolic Mersenne numbers is obtained ...
Bród, Dorota +4 more
core +1 more source
Nature, 1895 IN 1644 the mathematician Mersenne asserted that out of the 56 primes not < 257, there were only 12 primes, viz.:—
openaire +2 more sources