diff --git a/16_security_privacy_ln.asciidoc b/16_security_privacy_ln.asciidoc
index 41427d9..a6ca5e5 100644
--- a/16_security_privacy_ln.asciidoc
+++ b/16_security_privacy_ln.asciidoc
@@ -241,7 +241,7 @@ Note that in any case, Mallory's estimation becomes twice as precise after just
 She can continue probing, choosing the next probing amount such that it divides the current estimation interval in half.
 This well-known search technique is called _binary search_.
 With binary search, the number of probes is _logarithmic_ in the desired precision.
-For example, to obtain Alice's balance in a channel of 1 million satoshis up to a single satoshi, Mallory would only have to perform latexmath:[\log_2(1000000) \approx 20] probings.
+For example, to obtain Alice's balance in a channel of 1 million satoshis up to a single satoshi, Mallory would only have to perform latexmath:[$\log_2(1000000) \approx 20$] probings.
 If one probing takes 3 seconds, one channel can be precisely probed in only about a minute!
 
 Channel probing can be made even more efficient.