Related papers: A Combinatorial Method for Counting Smooth Numbers…

We consider the problem of counting $k$-tuples of positive integers satisfying any arbitrary set of gcd conditions, where every integer is not larger than $x$. We first establish the conditions to guarantee the existence of such tuples, and…

We establish the asymptotic formula for the number of integral points in non-compact symmetric homogeneous spaces of semi-simple simply connected algebraic groups over global function fields, given by the sum of the products of local…

The variance of primes in short intervals relates to the Riemann Hypothesis, Montgomery's Pair Correlation Conjecture and the Hardy--Littlewood Conjecture. In regards to its asymptotics, very little is known unconditionally. We study the…

We study sums with multiplicative functions that take values over a non-homogenous Beatty sequence. We then apply our result in a few special cases to obtain asymptotic formulas such as the number of integers in a Beatty sequence…

This paper studies integer solutions to the ABC equation A+B+C=0 in which none of A, B, C has a large prime factor. Set H(A,B, C)= max(|A|,|B|,|C|) and set the smoothness S(A, B, C) to be the largest prime factor of ABC. We consider…

The happy function $H: \mathbb{N} \rightarrow \mathbb{N}$ sends a positive integer to the sum of the squares of its digits. A number $x$ is said to be happy if the sequence $\{H^n(x)\}^\infty_{n=1}$ eventually reaches one. A basic open…

In this paper we establish a general asymptotic formula for the sum of the first $n$ prime numbers, which leads to a generalization of the most accurate asymptotic formula given by Massias and Robin. Further we prove a series of results…

We investigate one-dimensional families of diagonal forms, considering the evolution of the asymptotic formula and error term. We then discuss properties of the average asymptotic formula obtained. The subsequent second moment analysis…

The paper considers asymptotics of summation functions of additive and multiplicative arithmetic functions. We also study asymptotics of summation functions of natural and prime arguments. Several assertions on this subject are proved and…

Implicit samplers are algorithms for producing independent, weighted samples from multi-variate probability distributions. These are often applied in Bayesian data assimilation algorithms. We use Laplace asymptotic expansions to analyze two…

The integers $n=\prod_{i=1}^r p_i^{a_i}$ and $m=\prod_{i=1}^r p_i^{b_i}$ having the same prime factors are called exponentially coprime if $(a_i,b_i)=1$ for every $1\le i\le r$. We estimate the number of pairs of exponentially coprime…

For every integer $n\ge 1$ let $a_n$ be the smallest positive integer such that $n+a_n$ is prime. We investigate the behavior of the sequence $(a_n)_{n\ge 1}$, and prove asymptotic results for the sums $\sum_{n\le x} a_n$, $\sum_{n\le x}…

Assuming the Riemann Hypothesis, we obtain asymptotic formulas for the average number representations of an even integer as the sum of two primes. We use the method of Bhowmik and Schlage-Puchta and refine their results slightly to obtain a…

Let $s\ge 2$ be an integer. Denote by $\mu_s$ the least integer so that every integer $\ell >\mu_s$ is the sum of exactly $s$ integers $>1 $ which are pairwise relatively prime. In 1964, Sierpi\'nski asked a determination of $\mu_s$. Let…

Let A be a nonempty finite set of relatively prime positive integers, and let p_A(n) denote the number of partitions of n with parts in A. An elementary arithmetic argument is used to obtain an asymptotic formula for p_A(n).

Besides various asymptotic results on the concept of sum-product bases in $\mathbb{N}_0$, we consider by probabilistic arguments the existence of thin sets $A,A'$ of integers such that $AA+A=\mathbb{N}_0$ and $A'A'+A'A'=\mathbb{N}_0$.

In a recent paper (Tran et al., Ann.Phys.311(2004)204), some asymptotic number theoretical results on the partitioning of an integer were derived exploiting its connection to the quantum density of states of a many-particle system. We…

A semiprime is a natural number which can be written as the product of two primes. The asymptotic behaviour of the function $\pi_2(x)$, the number of semiprimes less than or equal to $x$, is studied. Using a combinatorial argument,…

The strong probable primality test is an important practical tool for discovering prime numbers. Its effectiveness derives from the following fact: for any odd composite number $n$, if a base $a$ is chosen at random, the algorithm is…

Let $\mathcal{P}$ be the set of primes and $\mathbb{N}$ the set of positive integers. Let also $r_1,...,r_t$ be positive real numbers and $R_2(r_1,...,r_t)$ the set of odd integers which can be represented as $$ p+2^{\lfloor…