You will need to solve it numerically, guess and check or technology.
Graph & , to get a rough idea on where they intersect.
The equation You have written is trascendental and its solution has to be found numerically. A non well popular but elegant way to solve it is to writre the equation as [th sign '-' has a precise scope...] and then compute for n large enough the n-th term of the sequence defined by the 'recursive relation' ...
(1)
In few step You arrive at the solution . The reason for which tends to the [real] solution of Your equation will be explained in a tutorial post written in the section 'Discrete mathematics'...
Kind regards
The equation...
(1)
... cannot be solved using simple log laws!... once You have found in graphical way that the solution is between -1 and 0, if You need better accuracy the only choice You have are numerical methods. Among them one of the most simple [and elegant...] even if not widely used is to consider the solution as the limit [if it exists...] of the sequence defined by the recursive relation...
(1)
In Your case the (1) is...
(2)
What You have to do now is to compute iteratively the till to an n 'large enough'. Starting with You easily find...
... and so one. The convergence to the solution is evident...
Kind regards
Clearly you are not expected to solve it by hand, for the simple fact that it cannot be solved exactly by hand or otherwise (unless you use a special function called the Lambert W-function).
Did you have a graphics or CAS calculator in the exam? You are expected to know how to use your calculator to solve it.