I am trying to solve the following equation:
Where Floor function returns the greatest integer smaller than the value in bracket.
e.g. Floor[3.3] = 3
And the logarithm is to the base 10
I tried using WolframAlpha, but it's timing out.
EDIT: I gather from the responses that a solution does not have a method. ----- If I change the equation to the following:
log(x) + x = 11
Here logarithm is to the base 10. Is it solvable now? I am more interested in method.