In Pattern Recognition and Machine Learning by Christopher M. Bishop
Equation (2.196) refers to the Bernoulli distribution:
$$\mu^x (1-\mu)^{1-x}$$
And Bishop says that expressing this as the exponential of the logarithm becomes (2.197): $$\begin{align} \mu^x (1-\mu)^{1-x} &= \exp \left[ x\ln{\mu} + (1-x)\ln{(1-\mu)} \right] \\ &= (1 -\mu) \exp{ \left[ \ln \left(\frac{\mu}{1-u} \right)x \right] } \end{align}$$
I understand what he’s doing in the first shown step of (2.197). However, how does he get to the last step shown?
I figured it out:
$$\begin{align} \mu^x (1-\mu)^{1-x} &= e^{x\ln{(\mu)} + (1-x)\ln{(1-\mu)}} \\ &= e^{x\ln{(\mu)} + \ln{(1-\mu)}-x\ln{(1-\mu)}} \\ &=(1-\mu) e^{x\ln{(\mu)} - x\ln{(1-\mu)}} \\ &=(1-\mu) e^{x(\ln{(\mu)} - \ln{(1-\mu)})}\\ &=(1-\mu) e^{\ln{\left(\frac{\mu}{1-\mu}\right)}x} \end{align}$$