For \(u\in\mathbb R\), denote by \([u]\) and \(\|u\|\) the largest integer not exceeding \(u\) and the distance from \(u\) to the nearest integer, respectively. \textit{J.-M. Deshouillers} [Acta Arith. 25, 393--403 (1973--1974; Zbl 0278.10020)] proved that for all \(\alpha\in(1,4/3)\) any sufficiently large natural number \(x\) can be expressed as \(x=[U^\alpha]+ [V^\alpha]\) with nonnegative integers \(U\) and \(V\). \textit{S. A. Gritsenko} [Russ. Acad. Sci., Izv., Math. 41, No. 3, 447--464 (1993); translation from Izv. Ross. Akad. Nauk, Ser. Mat. 56, No. 6, 1198--1216 (1992; Zbl 0810.11057)] extended the range of \(\alpha\) possessing this property to \(\alpha\in(1,55/41)\). \textit{M. Z. Garaev} and \textit{K. L. Kuch} [J. Anal. Appl. 20, 999--1006 (2001; Zbl 1030.11037)] showed that for all \(\alpha\in(1,3/2]\) and \(N\geq 2\) there exist \(\gg N\) natural numbers \(x\leq N\) expressibile as \(x=[U^\alpha]+[V^\alpha]\), where \(U\) and \(V\) are natural numbers. Here the author establishes the following result. Theorem. For all \(\alpha\in(1,3/2)\), any sufficiently large natural number \(x\) can be expressed as \(x=[U^\alpha]+ [V^\alpha]\), where \(U\) and \(V\) are natural numbers.
- On an equation involving fractional powers with one prime and one almost prime variables
- On a binary additive problem involving fractional powers
- A ternary additive problem involving fractional powers
- On a Theorem of Churchhouse Concerning Sums of Fractional Powers
- A binary additive problem with fractional powers
- On cardinality of sumsets
- A diophantine equation involving special prime numbers
- On a conjecture of Petrov and Tolev related to Chen's theorem
- Asymptotic and non-asymptotic results for a binary additive problem involving Piatetski-Shapiro numbers
- Exceptional set of a representation with fractional powers
This page was built for publication: An additive problem with fractional powers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1886142)
