Related papers: Criteria of Primality

An extension to the factorisation principle as suggested by Fermat is presented.We start from a symmetry of natural numbers and obtain the factorisation principle therefrom.Later it is extended further to test the primality of any natural…

We present a sufficient condition for the Riemann hypothesis. This condition is the existence of a special ordering on the set of finite products of distinct odd primes.

In this paper, we propose various sufficient conditions to determine if a given real number is an irrational number or a transcendental number and also apply these conditions to some interesting examples, particularly,one of them comes from…

We give a necessary and sufficient condition for a prime to be an integer group determinant for an arbitrary abelian $p$-group of the form ${\rm C}_{p} \times H$, where ${\rm C}_{p}$ is the cyclic group of order $p$. Also, we show that…

For which monomial supports do most polynomials generate a prime ideal? We give necessary and sufficient conditions for the radical of the ideal to be prime over an algebraically closed field. In characteristic zero, the same conditions…

This paper presents algorithms for calculating the quadratic character and the norms of prime ideals in the ring of integers of any quadratic field. The norms of prime ideals are obtained by means of a sieve algorithm using the quadratic…

An s-tuple of positive integers are k-wise relatively prime if any k of them are relatively prime. Exact formula is obtained for the probability that s positive integers are k-wise relatively prime.

A simple criterion is derived in order that a number sequence ${\cal S}_n$ is a permitted spectrum of a quantized system. The sequence of the prime numbers fulfils the criterion and the corresponding one-dimensional quantum potential is…

Let \beta be a real number. Then for almost all irrational \alpha>0 (in the sense of Lebesgue measure) \limsup_{x\to\infty}\pi_{\alpha,\beta}^*(x)(\log x)^2/x>=1, where \pi_{\alpha,\beta}^*(x)={p<=x: both p and [\alpha p+\beta] are primes}.

We introduce the concept of an almost prime number generalizing a prime number. It turns out that a composite almost prime number must be a Carmichael number, in case it exists. We prove several properties of almost prime numbers and…

Prime numbers have attracted the attention of mathematiciansand enthusiasts for millenniums due to their simple definition and remarkable properties. In this paper, we study primorial numbers (the product of the first prime numbers) to…

Let $K\geq 2$ be a natural number and $a_i,b_i\in\mathbb{Z}$ for $i=1,\ldots,K-1$. We use the large sieve to derive explicit upper bounds for the number of prime $k$-tuplets, i.e., for the number of primes $p\leq x$ for which all $a_ip+b_i$…

We prove an asymptotic formula for the number of primes of the shape $a^2 +p^4$, thereby refining the well known work of Friedlander and Iwaniec. Along the way, we prove a result on equidistribution of primes up to $x$, in which the moduli…

Among three natural numbers there is always one which is larger than or equal to the Nim sum of the remaining two numbers. This amazing fact has many applications.

In this paper we study primality and primary decomposition of certain ideals which are generated by homogeneous degree $2$ polynomials and occur naturally from determinantal conditions. Normality is derived from these results.

In this paper, we propose a new primality test, and then we employ this test to find a formula for {\pi} that computes the number of primes within any interval. We finally propose a new formula that computes the nth prime number as well as…

Let $\mathbb{F}_{q^n}$ be the extension of the field $\mathbb{F}_q$ of degree n, where $q$ is power of prime $p$, i.e $q=p^k$, where k is a positive integer. In this paper, we provide sufficient condition for the existence of a primitive…

We provide a sufficient condition for a polynomial ring, not necessarily commutative, to have a first-order definition for the rational integers.

Let f(t) be a rational function of degree at least 2 with rational coefficients. For a given rational number x_0, define x_{n+1}=f(x_n) for each nonnegative integer n. If this sequence is not eventually periodic, then the difference…

For every sufficiently large integer $R$, there exists a Carmichael number with exactly $R$ prime factors.