Related papers: A binary additive equation involving fractional po…

In this paper we consider the equation $[p^{c}] + [m^{c}] = N$, where $N$ is a sufficiently large integer, and prove that if $1 < c < \frac{29}{28}$, then it has a solution in a prime $p$ and an almost prime $m$ with at most $\left[…

We consider the equation $[p_{1}^{c}] + [p_{2}^{c}] + [p_{3}^{c}] = N$, where $N$ is a sufficiently large integer, and prove that if $1 < c < \frac{17}{16}$, then it has a solution in prime numbers $p_{1}$, $p_{2}$, $p_{3}$ such that each…

For any real number $t$, let $[t]$ denote the integer part of $t$. In this paper it is proved that if $1<c<\frac{247}{238}$, then for sufficiently large integer $N$, the equation \[\left[p^{c}\right]+\left[m^{c}\right]=N\] has a solution in…

We investigate the additive theory of the set $S = \{1^c, 2^c, \dots, N^c\}$ when $c$ is a real number. In the language of additive combinatorics, we determine the asymptotic behaviour of the additive energy of $S$. When $c$ is rational,…

Let $[\, \cdot\,]$ be the floor function. In this paper, we show that when $1<c<\frac{82}{79}$, then every sufficiently large positive integer $N$ can be represented in the form \begin{equation*} N=[p^c]+[m^c]\,, \end{equation*} where $p$…

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$.

The undecidability of the additive theory of primes (with identity) as well as the theory Th(N,+, n -> p\_n), where p\_n denotes the (n+1)-th prime, are open questions. As a possible approach, we extend the latter theory by adding some…

Let $p$ be a prime. We discuss $p$-adic properties of various arithmetical functions related to the coefficients of modular form and generating functions. Modular forms are considered as a tool of solving arithmetical problems. Examples of…

Let $c > 1$ and $0 < \gamma < 1$ be real, with $c \notin \mathbb N$. We study the solubility of the Diophantine inequality \[ \left| p_1^c + p_2^c + \dots + p_s^c - N \right| < \varepsilon \] in Piatetski-Shapiro primes $p_1, p_2, \dots,…

As a well-known enumerative problem, the number of solutions of the equation $m=m_1+...+m_k$ with $m_1\leqslant...\leqslant m_k$ in positive integers is $\Pi(m,k)=\sum_{i=0}^k\Pi(m-k,i)$ and $\Pi$ is called the additive partition function.…

Let $w(n)$ be an additive non-negative integer-valued arithmetic function which is equal to $1$ on primes. We study the distribution of $n + w(n)$ $\pmod p$ and give a lower bound for the density of the set of numbers which are not…

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…

An effective upper bound is established for the least non-trivial integer solution to the system of cubic forms \[ \begin{cases} F = c_{1}x_1^3 + c_{2}x_2^3 + \cdots + c_{n}x_n^3 = 0, \\ G = d_{1}x_1^3 + d_{2}x_2^3 + \cdots + d_{n}x_n^3 =…

If p is a prime and n a positive integer, let v(n) denote the exponent of p in n, and u(n)=n/p^{v(n)} the unit part of n. If k is a positive integer not divisible by p, we show that the p-adic limit of (-1)^{pke} u((kp^e)!) as e goes to…

We study the equation $F_n + F_m = y^p$, where $F_n$ and $F_m$ are respectively the $n$-th and $m$-th Fibonacci numbers and $p \ge 2$. We find all solutions under the assumption $n \equiv m \pmod{2}$.

Let $m$ be a positive integer and $b_{m}(n)$ be the number of partitions of $n$ with parts being powers of 2, where each part can take $m$ colors. We show that if $m=2^{k}-1$, then there exists the natural density of integers $n$ such that…

Let $[x]$ denote the integral part of the real number $x$, and $N$ be a sufficiently large integer. In this paper, it is proved that, for $1<c<\frac{4109054}{1999527}, c\not=2$, the Diophantine equation…

In this sequence of work we investigate polynomial equations of additive functions. We consider the solutions of equation \[ \sum_{i=1}^{n}f_{i}(x^{p_{i}})g_{i}(x)^{q_{i}}= 0 \qquad \left(x\in \mathbb{F}\right), \] where $n$ is a positive…

The number of tuples with positive integers pairwise relatively prime to each other with product at most $n$ is considered. A generalization of $\mu^{2}$ where $\mu$ is the M\"{o}bius function is used to formulate this divisor sum and…

Let $1<c<\frac{1787}{1502}$ and $N$ be a sufficiently large real number. In this paper, it is proved that for any arbitrarily large number $E>0$ and for almost all real $R \in (N,2N]$, the Diophantine inequality…