From 42dacb8ce642508b468c3713735ccc0cd1e5e87c Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mike=20Schw=C3=B6rer?= <mailport@mikescher.de>
Date: Mon, 27 May 2019 23:10:30 +0200
Subject: [PATCH] fixed markdown of befunge-92

---
 www/statics/euler/Euler_Problem-092_description.md | 6 ++++--
 1 file changed, 4 insertions(+), 2 deletions(-)

diff --git a/www/statics/euler/Euler_Problem-092_description.md b/www/statics/euler/Euler_Problem-092_description.md
index 6dde08d..76d522c 100644
--- a/www/statics/euler/Euler_Problem-092_description.md
+++ b/www/statics/euler/Euler_Problem-092_description.md
@@ -3,8 +3,10 @@ form a new number until it has been seen before.
 
 For example,
 
-44 ? 32 ? 13 ? 10 ? 1 ? 1
-85 ? 89 ? 145 ? 42 ? 20 ? 4 ? 16 ? 37 ? 58 ? 89
+~~~
+44 -> 32 -> 13  -> 10 -> 1  -> 1  
+85 -> 89 -> 145 -> 42 -> 20 -> 4 -> 16 -> 37 -> 58 -> 89
+~~~
 
 Therefore any chain that arrives at 1 or 89 will become stuck in an endless loop. 
 What is most amazing is that EVERY starting number will eventually arrive at 1 or 89.