Related papers: Equal Sum and Product Problem III
We determine properties of the set of values of $ [nx] - ([x]/1 + [2x]/2 + \cdots + [nx]/x) $ as $n$ and $x$ vary.
For any $\varepsilon >0$, we obtain an asymptotic formula for the number of solutions $n \le x$ to $$ \lVert \alpha n + \beta \rVert < x^{-\frac{1}{4}+\varepsilon} $$ where $n$ is $[y,z]$-smooth for infinitely many real number $x$. In…
We consider Lagrange's equation $x_1^2 + x_2^2 + x_3^2 + x_4^2 = N$, where $N$ is a sufficiently large and odd integer, and prove that it has a solution in natural numbers $x_1, \dots, x_4 $ such that $x_1 x_2 x_3 x_4 + 1$ has no more than…
Let $k\ge 2$ be a fixed integer. We consider sums of type $\sum_{n_1^2+\cdots+ n_k^2\le x} F(n_1,\ldots,n_k)$, taken over the $k$-dimensional spherical region $\{(n_1,\ldots,n_k)\in {\Bbb Z}^k: n_1^2+\cdots+ n_k^2\le x\}$, where $F:{\Bbb…
Let $f: \mathbb{N}^2 \mapsto \mathbb{C}$ be an arithmetic function of two variables. We study the existence of the limit: \[\displaystyle \lim_{x \to \infty} \frac{1}{x^2 (\log x)^{k-1}} \sum_{n_1 , n_2 \le x} f (n_1, n_2) \] where $k$ is a…
We study the representations of large integers $n$ as sums $p_1^2 + ... + p_s^2$, where $p_1,..., p_s$ are primes with $| p_i - (n/s)^{1/2} | \le n^{\theta/2}$, for some fixed $\theta < 1$. When $s = 5$ we use a sieve method to show that…
In this paper, we derive the following asymptotic formula $$ \mathop{{\sum}'}_{n\leqslant x}\dfrac{r(n)}{r(n+1)} = {x}{(\ln x)^{-3/4}}(c+o(1)),\ \ x \to +\infty,$$ where $r(n)$ is the number of representations of $n$ as a sum of two…
In this paper, we find asymptotic formula for the following sum with explicit error term: \[M_{x}(g_{1}, g_{2}, g_3)=\frac{1}{x}\sum_{n\le x}g_{1}(F_1(n))g_{2}(F_2(n))g_{3} (F_3(n)),\] where $F_1(x), F_2(x)$ and $F_3(x)$ are polynomials…
In this paper we introduce and study a family $\Phi_k$ of arithmetic functions generalizing Euler's totient function. These functions are given by the number of solutions to the equation $\gcd(x_1^2+\ldots +x_k^2, n)=1$ with $x_1,\ldots,x_k…
A perfect number is a positive integer $N$ such that the sum of all the positive divisors of $N$ equals $2N$, denoted by $\sigma(N) = 2N$. The question of the existence of odd perfect numbers (OPNs) is one of the longest unsolved problems…
An asymptotic expansion for the generalised quadratic Gauss sum $$S_N(x,\theta)=\sum_{j=1}^{N} \exp (\pi ixj^2+2\pi ij\theta),$$ where $x$, $\theta$ are real and $N$ is a positive integer, is obtained as $x\rightarrow 0$ and…
Let $X_1,\,X_2,\,\ldots,\,X_N$, $N\in\mathbb{N}$ be independent but not necessarily identically distributed discrete and integer-valued random variables. Assume that $X_1\geqslant m_1$, $X_2\geqslant m_2$, $\ldots$, $X_N\geqslant m_N$…
For any given set $A$ of nonnegative integers and for any given two positive integers $k_1,k_2$, $R_{k_1,k_2}(A,n)$ is defined as the number of solutions of the equation $n=k_1a_1+k_2a_2$ with $a_1,a_2\in A$. In this paper, we prove that if…
The paper compares the asymptotic of the expressions $\frac {1} {x} \sum\limits_{n \leq x} {f(n)}$ and $\sum\limits_{n \leq x} {\frac {f(n)} {n}}$, $\frac {1} {x} \sum\limits_{p \leq x} {f(p)}$ and $\sum\limits_{p \leq x} {\frac {f(p)}…
In this paper, we study equations over Brandt semigroup $B_n$. We compute that the number of unsolvable equations in one variable asymptotically equals $\frac{2}{n^2}$, and the average number of solutions of these equations asymptotically…
We show that the expected asymptotic for the sums $\sum_{X < n \leq 2X} \Lambda(n) \Lambda(n+h)$, $\sum_{X < n \leq 2X} d_k(n) d_l(n+h)$, and $\sum_{X < n \leq 2X} \Lambda(n) d_k(n+h)$ hold for almost all $h \in [-H,H]$, provided that…
Let $p,p_1,\ldots,p_m$ be positive integers with $p_1\leq p_2\leq\cdots\leq p_m$ and $x\in [-1,1)$, define the so-called Euler type sums ${S_{{p_1}{p_2} \cdots {p_m},p}}\left( x \right)$, which are the infinite sums whose general term is a…
In this note we investigate the set $S(n)$ of positive integer solutions of the title Diophantine equation. In particular, for a given $n$ we prove boundedness of the number of solutions, give precise upper bound on the common value of…
Let $b > a > 0$. We prove the following asymptotic formula $$\sum_{n\ge 0} \big\lvert\{x/(n+a)\} - \{x/(n+b)\}\big\rvert = \frac{2}{\pi}\zeta(3/2)\sqrt{cx} + O(c^{2/9}x^{4/9}),$$ with $c=b-a$, uniformly for $x \ge 40 c^{-5}(1+b)^{27/2}$.
We show that the number of positive integers $n\leq N$ such that $\mathbb{Z}/(n^2+n+1)\mathbb{Z}$ contains a perfect difference set is asymptotically $N/\log{N}$.