“…However, they are rather more complicated with these equations involving S (1) f (τ), which, in principle, is known as the solution to (3.1) and (3.2) for the call and (3.3) and (3.4) for the put as well as S (2) f (τ). As with the one-shout option, we solve these equations close to expiry to find expressions for the location of the free boundary x (2) f (τ) = ln(S (2) f (τ)/E (2) ) in the limit τ → 0. In doing so, we will use the series we found for x (1) f (τ) earlier and this again is an example of how the pricing of shout options is a recursive problem: to find the free boundary S (n) f (τ) for an n-shout option, we first need to know S (1) f (τ), S (2) f (τ), .…”