Additive problems for integers with a given number of prime divisors

The asymptotics of sums of the form Στ(|bn−a|) (summation overn<N, ω(n)=k) is studied, whereω(n) is the number of distinct prime divisors ofn, andτ(n) is the number of all divisors. Translated fromMatematicheskie Zametki, Vol. 63, No. 5, pp. 749–762, May, 1998. In conclusion, the author wishes to express his gratitude to Professor N. M. Timofeev for valuable advice. This research was supported by the Russian Foundation for Basic Research under grant No. 96-01-00502.     

A Barban-Davenport-Halberstam theorem for integers with fixed number of prime divisors

The purpose of this paper is to study the distribution of integers with a given number prime divisors over arithmetic progressions, via using the large-sieve inequality, Huxley-Hooley contour and the zero-density estimate, and present a Barban-Davenport-Halberstam type theorem for it.     

Properties of large prime divisors of numbers of the form p − 1

The main result of this paper is the fact that the fraction of primes p ≤ x satisfying the condition that p ? 1 has a prime divisor q > exp(ln x/ln ln x) and the number of prime divisors of q ? 1 essentially differ from ln ln(x/n), where n = (p ? 1)/q, tends to zero as x increases.     

On the distribution of

Suppose that α is an irrational number and β is a real number. It is proved that there are infinitely many prime numbers p such that ‖ αp-β‖ <p ^-9/28.     

Average distribution of prime ideals in families of number fields

We view an algebraic curve over ℚ as providing a one-parameter family of number fields and obtain bounds for the average value of some standard prime ideal counting functions over these families which are better than averaging the standard estimates for these functions.      

On a class of inequalities for orthonormal systems

In this paper, a novel approach to the proof of inequalities of Lieb-Thirring type based on the standard apparatus of the theory of orthogonal series is proposed.     

On the ingham divisor problem

The main result of this paper is the following theorem. Suppose thatτ(n) = ∑ _d|n l and the arithmetical functionF satisfies the following conditions:

On irregular prime power divisors of the Bernoulli numbers

Let ( ) denote the usual th Bernoulli number. Let be a positive even integer where or . It is well known that the numerator of the reduced quotient is a product of powers of irregular primes. Let be an irregular pair with . We show that for every the congruence has a unique solution where and . The sequence defines a -adic integer which is a zero of a certain -adic zeta function originally defined by T. Kubota and H. W. Leopoldt. We show some properties of these functions and give some applications. Subsequently we give several computations of the (truncated) -adic expansion of for irregular pairs with below 1000.

     

Selberg’s one-dimensional sieve with Buchstab weights of new type

In this paper we study Selberg's sieve method with Buchstab weights of new type. The theorem proved in this paper gives a more advantageous choice of the parameters of a one-dimensional weighted sieve as compared to previous results. Translated fromMatematicheskie Zametki, Vol. 66, No. 1, pp. 38–49, July, 1999.     

Approximating the number of integers without large prime factors

denotes the number of positive integers and free of prime factors . Hildebrand and Tenenbaum gave a smooth approximation formula for in the range , where is a fixed positive number . In this paper, by modifying their approximation formula, we provide a fast algorithm to approximate . The computational complexity of this algorithm is . We give numerical results which show that this algorithm provides accurate estimates for and is faster than conventional methods such as algorithms exploiting Dickman's function.

     

Approximating the number of integers free of large prime factors

Define to be the number of positive integers such that has no prime divisor larger than . We present a simple algorithm that approximates in floating point operations. This algorithm is based directly on a theorem of Hildebrand and Tenenbaum. We also present data which indicate that this algorithm is more accurate in practice than other known approximations, including the well-known approximation , where is Dickman's function.

     

The Exceptional Set in the Two Prime Squares and a Prime Problem

In this paper we prove that, with at most O（N^5/12＋ε） exceptions, all positive odd integers n ≤ N with n ≡ 0 or 1（mod 3） can be written as a sum of a prime and two squares of primes.     

An estimate for the number of integers without large prime factors

denotes the number of positive integers and free of prime factors y$">. Hildebrand and Tenenbaum provided a good approximation of . However, their method requires the solution to the equation , and therefore it needs a large amount of time for the numerical solution of the above equation for large . Hildebrand also showed approximates for , where and is the unique solution to . Let be defined by for 0$">. We show approximates , and also approximates , where . Using these approximations, we give a simple method which approximates within a factor in the range , where is any positive constant.

     

Dynamics on the number of prime divisors for additive arithmetic semigroups

In 2020, Bergelson and Richter gave a dynamical generalization of the classical Prime Number Theorem, which has been generalized by Loyd in a disjoint form with the Erdős-Kac Theorem. These generalizations reveal the rich ergodic properties of the number of prime divisors of integers. In this article, we show a new generalization of Bergelson and Richter's Theorem in a disjoint form with the distribution of the largest prime factors of integers. Then following Bergelson and Richter's techniques, we will show the analogues of all of these results for the arithmetic semigroups arising from finite fields as well.     

On the Number of Birch Partitions

Birch and Tverberg partitions are closely related concepts from discrete geometry. We show two properties for the number of Birch partitions: Evenness and a lower bound. This implies the first nontrivial lower bound for the number of Tverberg partitions that holds for arbitrary q, where q is the number of partition blocks. The proofs are based on direct arguments and do not use the equivariant method from topological combinatorics.