Related papers: Waring-Goldbach Problem with Piatetski-Shapiro Pri…

Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, we establish a theorem of Bombieri-Vinogradov type for the Piatetski-Shapiro primes $p=[n^{1/\gamma}]$ with…

For a given base $g\ge2$, a positive integer is called a palindrome if its base $g$ expansion reads the same backwards as forwards. In this paper, we give an asymptotic formula for the number of relatively prime pairs of palindromes of a…

We study representations of integers as sums of the form $\pm a_1\pm a_2\pm \dotsb \pm a_n$, where $a_1,a_2,\ldots$ is a prescribed sequence of integers. Such a sequence is called an Erd\H{o}s-Sur\'anyi sequence if every integer can be…

Asymptotic formulae for Titchmarsh-type divisor sums are obtained with strong error terms that are uniform in the shift parameter. This applies to more general arithmetic functions such as sums of two squares, improving the error term in…

For given coprime positive integers $a$ and $b$, the classical Frobenius coin problem asked to find the largest number that cannot be expressed in the form $ax+by$ for nonnegative integers $x$ and $y$, also known as the Frobenius number.…

In this paper, we study the hybrid problem of Hua's theorem and the Piatetski-Shapiro prime number theorem, and obtain results in this direction of the nonhomogeneous case $k=3$, which deepen the classical result of Hua.

We prove an asymptotic formula for the number of integers $\leq x$ which can be written as the product of $k ~(\geq 2)$ distinct primes $p_1\cdots p_k$ with each prime factor in an arithmetic progression $p_j\equiv a_j \bmod q$, $(a_j,…

We obtain an asymptotic formula for the number of ways to represent every reduced residue class as a product of a prime and square-free integer. This may be considered as a relaxed version of a conjecture of Erd\"os, Odlyzko, and…

For all $\alpha_1,\alpha_2\in(1,2)$ with $1/\alpha_1+1/\alpha_2>5/3$, we show that the number of pairs $(n_1,n_2)$ of positive integers with $N=\lfloor{n_1^{\alpha_1}}\rfloor+\lfloor{n_2^{\alpha_2}}\rfloor$ is equal to…

An asymptotic formula for the number of partitions into p-cores is derived. As a byproduct some integer valued trigonometric sums are found

In this paper, we study a density version of Waring's problem. We prove that a positive density subset of $k$th-powers forms an asymptotic additive basis of order $O(k^2)$ provided that the relative lower density of the set is greater than…

Let $k$ be a natural number and let $c=2.134693\ldots$ be the unique real solution of the equation $2c=2+\log (5c-1)$ in $[1,\infty)$. Then, when $s\ge ck+4$, we establish an asymptotic lower bound of the expected order of magnitude for the…

Representation theory of finite groups portrays a marvelous crossroad of group theory, algebraic combinatorics, and probability. In particular the Plancherel measure is a probability that arises naturally from representation theory, and in…

For a subset $\mathcal A\subset \mathbb N$, let $p_{\mathcal A}(n)$ denote the restricted partition function which counts partitions of $n$ with all parts lying in $\mathcal A$. In this paper, we use a variation of the Hardy-Littlewood…

In this paper, we show that every pair of large even integers satisfying certain necessary conditions can be expressed as a pair of one prime, one prime square, two prime cubes and 56 powers of 2.

Many asymptotic formulas exist for unrestricted integer partitions as well as for distinct partitions of integers into a finite number of parts. Szekeres and Canfield have derived an asymptotic formula for the number of partitions that is…

This work gives a general approach to the determination of the asymptotic behavior of the sums of functions of primes based on the distribution of primes. It refines the estimate of the remainder term of the asymptotic expansion of the sums…

In this paper, we consider the simultaneous representation of pairs of sufficiently large integers. We prove that every pair of large positive odd integers can be represented in the form of a pair of one prime, four cubes of primes and 231…

We establish that almost every positive integer $n$ is the sum of four cubes, two of which are at most $n^{\theta}$, as long as $\theta\geq192/869$. An asymptotic formula for the number of such representations is established when…

In the context of the Frobenius coin problem, given two relatively prime positive integers $a$ and $b$, the set of nonrepresentable numbers consists of positive integers that cannot be expressed as nonnegative integer combination of $a$ and…