相关论文: Simple Divisibility Rules for the 1st 1000 Prime N…

We present a detailed proof of the prime number theorem suitable for a typical undergraduate- or graduate-level complex analysis course. Our presentation is particularly useful for any instructor who seeks to use the prime number theorem…

Recently, Andrews introduced separable integer partition classes and studied some well-known theorems. In this article, we will consider the types of partitions with restrictions on consecutive parts. We will show that such partitions are…

Polynomial time primality tests for specific classes of numbers of the form $k\cdot 2^m \pm 1$ are introduced.

In this paper, we present several explicit formulas of the sums and hyper-sums of the powers of the first (n+1)-terms of a general arithmetic sequence in terms of Stirling numbers and generalized Bernoulli polynomials.

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…

The problem of N-digit sets all permutations of which give primes is discussed. Such sets may include only digits 1, 3, 7 and 9, and none of 0, 2, 5, 4, 6, 8. Direct calculations show that such full-permutation digit sets occur at N = 1, 2,…

We define A_n=\sum_{i=1}^n (-1)^i\frac{1}{i} and we show that, for every prime p, there exists a number n such that A_n\equiv 0 (mod p).

An elementary method for computing various prime sequences using the sequence of Farey sequences is described.

Several examples of generalized number systems are constructed to compare various conditions occurring in the literature for the prime number theorem in the context of Beurling generalized primes.

Using Kummer's Theorem, we give a necessary and sufficient condition for a Narayana number to be divisible by a given prime. We use this to derive certain properties of the Narayana triangle.

We obtain an upper bound for the distribution of primes in the form $n^4 + k$ up to $x$, averaged over $k$ with small square-full part. As a corollary, we show that for almost all $k$, there is an expected amount of primes in the form $n^4…

By establishing an improved level of distribution we study almost primes of the form $f(p,n)$ where $f$ is an irreducible binary form over $\mathbb Z$.

Building on the concept of pretentious multiplicative functions, we give a new and largely elementary proof of the best result known on the counting function of primes in arithmetic progressions.

This paper presents a new technique of generating large prime numbers using a smaller one by employing Goldbach partitions. Experiments are presented showing how this method produces candidate prime numbers that are subsequently tested…

We showed that the prime gap for a prime number p is less than or equal to the prime count of the prime number.

The prime number problem falls within the realm of number theory, specifically elementary number theory. Current research approaches have unnecessarily complicated this matter. In contrast to more advanced mathematical tools, the methods of…

Let $P$ be a subset of the primes of lower density strictly larger than $\frac12$. Then, every sufficiently large even integer is a sum of four primes from the set $P$. We establish similar results for $k$-summands, with $k\geq 4$, and for…

We prove that it is always possible to find a permutation $p$ on the set $\{1,...,n\}$ such that $c+p(c)$ is prime for all $c \in \{1,...,n\}.$

In this paper, we develop Furstenberg's proof of infinity of primes, and prove several results about prime divisors of sequences of integers, including the celebrated Schur's theorem. In particular, we give a simple proof of a classical…

The difference between two consecutive prime numbers is called the distance between the primes. We study the statistical properties of the distances and their increments (the difference between two consecutive distances) for a sequence…