Related papers: A new explicit expansion approach to Mersenne prim…
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. Developing new algorithms or improving upon existing ones could…
Mersenne primes, renowned for their captivating form as $2^p - 1$, have intrigued mathematicians for centuries. In this paper, we embark on a captivating quest to unveil the intricate nature of Mersenne primes, seamlessly integrating…
We study the connection between the Mersenne numbers $M(n) = 2^n-1$ and the dynamics of the angle-doubling map. Within this framework, we develop an algorithm to compute divisors of Mersenne numbers without explicitly evaluating $M(n)$.…
We extend the necessity part of Lucas Lehmer iteration for testing Mersenne prime to all base and uniformly for both generalized Mersenne and Wagstaff numbers(the later correspond to negative base). The role of the quadratic iteration $x…
The concept of Mersenne primes is studied in real quadratic fields of class number 1. Computational results are given. The field $Q(\sqrt{2})$ is studied in detail with a focus on representing Mersenne primes in the form $x^{2}+7y^{2}$. It…
In the present article we introduce three new notions which are called Gaussian Mersenne Lucas numbers, Mersenne Lucas polynomials and Gaussian Mersenne Lucas polynomials. We present and prove our exciting properties and results of them…
We give elementary proofs of some congruence criteria to compute binomial coefficients in modulo a prime. These criteria are analogues to the symmetry property of binomial coefficients. We give extended version of Lucas Theorem by using…
By using the elementary symmetric polynomials and some results of number theory, we solve the well known problem of Lehmer on Euler's totient function. As application, we obtain a new characterization of prime numbers.
This paper is devoted to the theory of prime numbers. In this paper we first introduce the notion of a matrix of prime numbers. Then, in order to investigate the density of prime numbers in separate rows of the matrix under consideration,…
This paper highlights the emergence of the Omega sequence in number theory and its connection with the emergence of a new prime number, and also highlights its theoretical applications for Lucas-Lehmer primality test, and Euclid-Euler…
We study new primality tests based on linear recurrent sequences of degree two exploiting a matricial approach. The classical Lucas test arises as a particular case and we see how it can be easily improved. Moreover, this approach shows…
We propose some primality tests for 2^kn-1, where k, n in Z, k>= 2 and n odd. There are several tests depending on how big n is. These tests are proved using properties of elliptic curves. Essentially, the new primality tests are the…
In this paper, two approximation algorithms are given. Let N be an odd composite number. The algorithms give new directions regarding primality test of given N. The first algorithm is given using a new method called digital coding method.…
This paper presents high-order numerical methods for solving boundary value problems associated with the Lane-Emden equation, which frequently arises in astrophysics and various nonlinear models. A major challenge in studying this equation…
This article concerned with the issue of solving a nonlinear equation with the help of iterative method where no any derivative evaluation is required per iteration. Therefore, this work contributes to a new class of optimal eighth-order…
The Mersenne primes are primes which can be written as some prime power of 2 minus 1. These primes were studied from antiquity in that their close connection with perfect numbers and even to present day in that their easiness for primality…
In this paper, we propose a general framework that extends the theory of permutation patterns to higher dimensions and unifies several combinatorial objects studied in the literature. Our approach involves introducing the concept of a…
This paper presents the Quanta Prime Sequence (QPS) and its foundational theorem, showcasing a unique class of polynomials with substantial implications. The study uncovers profound connections between Quanta Prime numbers and essential…
In this expository paper we describe four primality tests. The first test is very efficient, but is only capable of proving that a given number is either composite or 'very probably' prime. The second test is a deterministic polynomial time…
In this research paper, relationship between every Mersenne prime and certain Natural numbers is explored. We begin by proving that every Mersenne prime is of the form {4n + 3,for some integer 'n'} and generalize the result to all powers of…