www.mikescher.com/www/statics/euler/Euler_Problem-033_explanation.md

This one was relaxing. You can simple iterate through all 8100 cases and test each one in short time.
Three notable things:

• You can test two fraction a/b and c/d simple of equality with the formula a*d == b*c.
• This is my compact GCD algorithm in befunge (stack -> stack)
• This is one of the few real Befunge-93 programs in this series. (It doesn't violate the 80x25 size rule)