Results 21 to 30 of about 377,673 (186)
Partitions of numbers and the algebraic principle of Mersenne, Fermat and even perfect numbers [PDF]
Notes on Number Theory and Discrete MathematicsLet ρ be an odd prime greater than or equal to 11. In a previous work, starting from an M-cycle in a finite field 𝔽_ρ, it has been established how the divisors of Mersenne, Fermat and Lehmer numbers arise.
A. M. S. Ramasamy
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
On recognition of simple group L2(r) by the number of Sylow subgroups
Acta Scientiarum: Technology, 2014 Let G be a finite group and n_{p}(G) be the number of Sylow p- subgroup of G. In this work it is proved if G is a centerless group and n_{p}(G)=n_{p}(L_{2}(r)), for every prime p in pi (G), where r is prime number, r^2 does not divide |G| and r is not ...
Alireza Khalili Asboei +1 more
doaj +1 more source
Sequences in finite fields yielding divisors of Mersenne, Fermat and Lehmer numbers, II [PDF]
Notes on Number Theory and Discrete MathematicsLet ρ be an odd prime ≥ 11. In Part I, starting from an M-cycle in a finite field 𝔽_ρ, we have established how the divisors of Mersenne, Fermat and Lehmer numbers arise.
A. M. S. Ramasamy
doaj +1 more source
A framework for cryptographic problems from linear algebra
Journal of Mathematical Cryptology, 2020 We introduce a general framework encompassing the main hard problems emerging in lattice-based cryptography, which naturally includes the recently proposed Mersenne prime cryptosystem, but also problems coming from code-based cryptography.
Bootland Carl +3 more
doaj +1 more source
Autocorrelation and Lower Bound on the 2-Adic Complexity of LSB Sequence of
IEEE Access, 2020 LSB (Least Significant Bit) sequences are widely used as the initial inputs in some modern stream ciphers, such as the ZUC algorithm-the core of the 3GPP LTE International Encryption Standard. Therefore, analyzing the statistical properties (for example,
Yuhua Sun +3 more
doaj +1 more source
Prime power Sylow numbers [PDF]
Journal of Mahani Mathematical ResearchIn this paper, we study finite groups with a prime-power number of Sylow \(p\)-subgroups. Motivated by the work of Yang et al.~(2022), who characterized non-solvable groups with a prime-power number of Sylow $2$-subgroups, we investigate the ...
Alireza Khalili Asboei
doaj +1 more source
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
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
On the Mersenne Prime Numbers [PDF]
, 2020 The prime numbers have been an important field of research for thousands of years and are intertwined with most other fields of mathematics. One topic that has piqued the interest of mathematicians young and old is the Mersenne prime numbers, which have ...
VanLandingham, Julia
core