Some remarks on the [x/n]-sequence
The article focuses on number theoretic applications of sums of functions from \(1\leq n\leq x\) involving the floor function, \(\lfloor\frac{x}{n}\rfloor\). The authors improve some upper bounds on classical partial sum results. Sums involving the floor function such as these occur in practice when evaluating number theoretic functions and partial sums. For example, if \(\alpha(n)\) is a Dirichlet invertible arithmetic function, i.e., if \(\alpha(1) \neq 0\), then as in Section 2 of \textit{T. M. Apostol}'s [Introduction to analytic number theory. Corrected 5th printing. New York, NY: Springer (1998; Zbl 1154.11300)], we can invert sums of the following form:\N\begin{align*}\NG(x) & := \sum_{n \leq x} \alpha(n) F\left(\lfloor \frac{x}{n} \rfloor\right) \\\NF(x) & \phantom{:} = \sum_{n \leq x} \alpha^{-1}(n)G\left(\lfloor \frac{x}{n} \rfloor\right).\N\end{align*}\NThe reviewer also notes some identities proved in the preprint article [\textit{M. D. Schmidt}, ``Exact formulas for partial sums of the Möbius function expressed by partial sums weighted by the Liouville lambda function, Preprint, \url{arXiv:2102.05842}] given as follows for \(r(1)\neq 0\) where \(R(x) := \sum_{n \leq x} r(n)\), \(H(x) := \sum_{n \leq x} h(n)\), and \(R^{-1}(x) := \sum_{n \leq x} r^{-1}(n)\) with \(r^{-1}(n)\) taken to be the Dirichlet (convolution) inverse of the arithmetic function \(r\):\N\begin{align*}\NS_{r \ast h}(x) & := \sum_{n \leq x} \sum_{d|n} r(d) h\left(\frac{n}{d}\right) \\\N& \phantom{:} = \sum_{d \leq x} r(d) H\left(\left\lfloor \frac{x}{d} \right\rfloor\right) \\\N& \phantom{:} = \sum_{k \leq x} H(k) \left[ R\left(\left\lfloor \frac{x}{k} \right\rfloor\right) - R\left(\left\lfloor \frac{x}{k+1} \right\rfloor\right) \right] \\\NH(x) & \phantom{:} = \sum_{j \leq x} S_{r \ast h}(j) \left[ R^{-1}\left(\left\lfloor \frac{x}{j} \right\rfloor\right) - R^{-1}\left(\left\lfloor \frac{x}{j+1} \right\rfloor\right) \right] \\\N& \phantom{:} = \sum_{k \leq x} r^{-1}(k) S_{r \ast h}\left( \left\lfloor \frac{x}{k} \right\rfloor\right).\N\end{align*}
- A divisor problem.
- A variant of the prime number theorem
- Cardinality of a floor function set
- Corrigendum to: ``On a sum involving the Euler function
- DISTRIBUTION OF ELEMENTS OF A FLOOR FUNCTION SET IN ARITHMETICAL PROGRESSIONS
- Fluctuations in the mean of Euler's phi function
- Footnote to the Titchmarsh-Linnik Divisor Problem
- scientific article; zbMATH DE number 194767 (Why is no real title available?)
- scientific article; zbMATH DE number 3995796 (Why is no real title available?)
- scientific article; zbMATH DE number 3182297 (Why is no real title available?)
- Note on a paper by Bordellès, Dai, Heyman, Pan and Shparlinski
- On a generalisation of Bordellès-Dai-Heyman-Pan-Shparlinski's conjecture
- On a sum involving certain arithmetic functions and the integral part function
- On a sum involving small arithmetic function and the integral part function
- On a sum involving the Euler function
- On a sum involving the Euler function
- On a sum involving the Mangoldt function
- On certain sums of number theory
- On Euler's function
- On the difference between consecutive primes
- On the distribution of the greatest common divisor of the elements in integral part sets
- ON THE PRIMES IN FLOOR FUNCTION SETS
- Primes in floor function sets
- The fractional sum of small arithmetic functions
- Three-dimensional exponential sums under constant perturbation
This page was built for publication: Some remarks on the \([x/n]\)-sequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6989504)
