I've been looking at the ceiling/floor functions and the fractional part function ($\left\{ x \right\}$) and I came across this type of problem. I am aware of the series expansions one can use the express $\left\lfloor x \right\rfloor$ and therefore $\left\{ x \right\}$, but I don't think that provides a way to deal with this (at least not directly). Is there any approach that allows us to enumerate the number of cases without having to resort to brute calculation? Could this be generalized to any for any $n$ for which $x\le n$ ? I would be very grateful for insights into this.
(Insterestinly, WA provides a single $x\cong 30.55$.I am not sure how plausible this is, especially considering the shape of the graph.)
Let $x=n+\varepsilon$ where $n = \lfloor x \rfloor$ and $\varepsilon = \{x\}$. Then there are solutions for $x \{x\}=17$ if and only if $$ \varepsilon^2 + n\varepsilon - 17 = 0. $$ Solve for $\varepsilon$ and find solutions where $\varepsilon\in[0,1)$.
$$ \varepsilon_{1,2}=\frac{-n\pm\sqrt{n^2+4*17}}{2}. $$
One root is negative and the other is positive, so we must have $$ \varepsilon=\frac{-n+\sqrt{n^2+4*17}}{2}. $$ Since $\varepsilon \in [0,1)$ this boils to $$ \sqrt{n^2+4*17} < 2+n,\\ n^2+4*17 < 4+4n+n^2 . $$ Therefore we have a solution for any $n > 16$