A binary additive equation involving fractional powers
classification
🧮 math.NT
keywords
additivebinaryequationnumberfixedfractionalintegerinvolving
read the original abstract
We study the solubility of the binary additive equation $[m^c] + [p^c] = n$, where $m$ is an integer, $p$ is a prime number, and $c$ is a fixed real number in the range $1 < c < 3/2$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.