相关论文: An elementary sieve

The prime simplicial complex $\Pi(G)$ of a finite group $G$ is composed of all sets of primes $S$ where $G$ has an element of order the product of primes in $S$, with the subsets partially ordered by inclusion. This complex was introduced…

The degree of insulation of a prime $p$ is defined as the largest interval around it in which no other prime exists. Based on this, the $n$-th prime $p_{n}$ is said to be insulated if and only if its degree of insulation is higher than its…

In this paper, we study a class of functions defined recursively on the set of natural numbers in terms of the greatest common divisor algorithm of two numbers and requiring a minimality condition. These functions are permutations, products…

We call an integer N>1 primover to base a if it either prime or overpseudoprime to base a. We prove, in particular, that every Fermat number is primover to base 2. We also indicate a simple process of receiving of primover divisors of…

Quite recently, in [8] the authoor of this paper considered the distribution of primes in the sequence $(S_n)$ whose $n$th term is defined as $S_n=\sum_{k=1}^{2n}p_k$, where $p_k$ is the $k$th prime. Some heuristic arguments and the…

The main result of this thesis is to show that there are only finitely many integers $n$ such that both $n$ and $d(n)$ are highly composite numbers at the same time, where $d(n)$ is the divisor function. Bertrand's postulate [4] is used…

In additive number theory, a finite set $A$ of integers is an $h$-basis for $n$ if every integer in $\{0,1,2,\ldots, n\}$ can be represented as the sum of exactly $h$ not necessarily distinct elements of $A$. This paper introduces a new…

Let $n$ be a positive integer and let $A$ be nonempty finite set of positive integers. We say that $A$ is relatively prime if $\gcd(A) =1$ and that $A$ is relatively prime to $n$ if $\gcd(A,n)=1$. In this work we count the number of…

Prime numbers are one of the most intriguing figures in mathematics. Despite centuries of research, many questions remain still unsolved. In recent years, computer simulations are playing a fundamental role in the study of an immense…

It is known that the sum of the reciprocal of integers, $\sum_n (1/n)$, and the sum of the reciprocal of primes, $\sum_n (1/p_n)$, both diverge. Here, we study a series made from primes that sums exactly to 1. We also show this sum is…

As a consequence of the classification of finite simple groups, the classification of permutation groups of prime degree is complete, apart from the question of when the natural degree $(q^n-1)/(q-1)$ of ${\rm L}_n(q)$ is prime. We present…

Let $p_n$ is the $n$-th prime. With help of the Cram\'er-like model, we prove that the set of intervals of the form $(2p_n,\enskip2p_{n+1})$ containing at list 3 primes has a positive density with respect to the set of all intervals of such…

Two constructed prime number subsets (called prime brother & sisters and prime cousins) lead to a third one (called isolated primes) so that all three disjoint subsets together generate the prime number set. It should be suggested how the…

An integer $n$ is said to be ternary if it is composed of three distinct odd primes. In this paper, we asymptotically count the number of ternary integers $n \leq x$ with the constituent primes satisfying various constraints. We apply our…

The purpose of this paper is to present a syatemic study of some familes of higher-order Euler numbers and polynomials. In particular, by using the basis property of higher-order Euler polynomials for the space of polynomials of degree less…

A distinguishing feature of certain intractable problems in prime number theory is the sparsity of the underlying sequence. Motivated by the general problem of finding primes in sparse polynomial sequences, we give an estimate for the…

In this note we describe a method for finding prime numbers as fixed points of particularly simple sequences. Some basic calculations show that success rates for identifying primes this way are over 99.9%. In particular, it seems that the…

In this paper, we develop a large sieve type inequality for some special characters whose moduli are squares of primes. Our result gives non-trivial estimate in certain ranges.

I develop a function that, for any integer $n \geq 2$, takes a value of 1 if $n$ is prime, 0 if $n$ is composite. I also discuss two applications: First, the characteristic function provides a new expression for the prime counting function.…

In recent work by Botkin, Dawsey, Hemmer, Just and the present author, a deterministic model of prime number distribution is developed based on properties of integer partitions that gives almost exact estimates for $\pi(n)$, the number of…