euler-manager 0.0.5 → 0.0.6

data/data/problems/64.yml

@@ -2,129 +2,55 @@
 :id: 64
 :name: Odd period square roots
 :url: http://projecteuler.net/problem=64
-:content: "\r\n<p>All square roots are periodic when written as continued fractions
-  and can be written in the form:</p>\r\n<div style=\"margin-left:20px;\">\r\n<table
-  border=\"0\" cellspacing=\"0\" cellpadding=\"0\">\n<tr>\n<td>\n<img src=\"images/symbol_radic.gif\"
-  width=\"14\" height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\"><var>N</var>
-  = <var>a</var><sub>0</sub> +</td>\r\n<td colspan=\"3\" style=\"border-bottom:1px
-  solid #000;\"><div style=\"text-align:center;\">1</div></td>\r\n</tr>\n<tr>\n<td> </td>\r\n<td>\n<var>a</var><sub>1</sub>
-  +</td>\r\n<td colspan=\"2\" style=\"border-bottom:1px solid #000;\"><div style=\"text-align:center;\">1</div></td>\r\n</tr>\n<tr>\n<td> </td>\r\n<td> </td>\r\n<td>\n<var>a</var><sub>2</sub>
-  +</td>\r\n<td style=\"border-bottom:1px solid #000;\"><div style=\"text-align:center;\">1</div></td>\r\n</tr>\n<tr>\n<td> </td>\r\n<td> </td>\r\n<td> </td>\r\n<td>\n<var>a</var><sub>3</sub>
-  + ...</td>\r\n</tr>\n</table>\n</div>\r\n<p>For example, let us consider <img src=\"images/symbol_radic.gif\"
-  width=\"14\" height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">23:</p>\r\n<div
-  style=\"margin-left:20px;\">\r\n<table border=\"0\" cellspacing=\"0\" cellpadding=\"0\">\n<tr>\n<td>\n<img
-  src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\" border=\"0\"
-  style=\"vertical-align:middle;\">23 = 4 + <img src=\"images/symbol_radic.gif\" width=\"14\"
-  height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">23 — 4 = 4
-  + </td>\r\n<td style=\"border-bottom:1px solid #000;\"><div style=\"text-align:center;\">1</div></td>\r\n<td> =
-  4 + </td>\r\n<td colspan=\"2\" style=\"border-bottom:1px solid #000;\"><div style=\"text-align:center;\">1</div></td>\r\n</tr>\n<tr>\n<td> </td>\r\n<td><div
-  style=\"text-align:center;\">1<br><span style=\"border-top:1px solid #000;\"><img
-  src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\" border=\"0\"
-  style=\"vertical-align:middle;\">23—4</span>\n</div></td>\r\n<td> </td>\r\n<td>1
-  + </td>\r\n<td><div style=\"text-align:center;\">\n<span style=\"border-bottom:1px
-  solid #000;\"><img src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\"
-  border=\"0\" style=\"vertical-align:middle;\">23 – 3</span><br>7</div></td>\r\n</tr>\n</table>\n</div>\r\n<p>If
-  we continue we would get the following expansion:</p>\r\n<div style=\"margin-left:20px;\">\r\n<table
-  border=\"0\" cellspacing=\"0\" cellpadding=\"0\">\n<tr>\n<td>\n<img src=\"images/symbol_radic.gif\"
-  width=\"14\" height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">23
-  = 4 +</td>\r\n<td colspan=\"4\" style=\"border-bottom:1px solid #000;\"><div style=\"text-align:center;\">1</div></td>\r\n</tr>\n<tr>\n<td> </td>\r\n<td>1
-  +</td>\r\n<td colspan=\"3\" style=\"border-bottom:1px solid #000;\"><div style=\"text-align:center;\">1</div></td>\r\n</tr>\n<tr>\n<td> </td>\r\n<td> </td>\r\n<td>3
-  +</td>\r\n<td colspan=\"2\" style=\"border-bottom:1px solid #000;\"><div style=\"text-align:center;\">1</div></td>\r\n</tr>\n<tr>\n<td> </td>\r\n<td> </td>\r\n<td> </td>\r\n<td>1
-  +</td>\r\n<td style=\"border-bottom:1px solid #000;\"><div style=\"text-align:center;\">1</div></td>\r\n</tr>\n<tr>\n<td> </td>\r\n<td> </td>\r\n<td> </td>\r\n<td> </td>\r\n<td>8
-  + ...</td>\r\n</tr>\n</table>\n</div>\r\n<p>The process can be summarised as follows:</p>\r\n<div
-  style=\"margin-left:20px;\">\r\n<table border=\"0\" cellspacing=\"0\" cellpadding=\"0\">\n<tr>\n<td>\n<var>a</var><sub>0</sub>
-  = 4,</td>\r\n<td> </td>\r\n<td><div style=\"text-align:center;\">1<br><span style=\"border-top:1px
-  solid #000;\"><img src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\"
-  border=\"0\" style=\"vertical-align:middle;\">23—4</span>\n</div></td>\r\n<td> = </td>\r\n<td><div
-  style=\"text-align:center;\">\n<span style=\"border-bottom:1px solid #000;\"><img
-  src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\" border=\"0\"
-  style=\"vertical-align:middle;\">23+4</span><br>7</div></td>\r\n<td> = 1 + </td>\r\n<td><div
-  style=\"text-align:center;\">\n<span style=\"border-bottom:1px solid #000;\"><img
-  src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\" border=\"0\"
-  style=\"vertical-align:middle;\">23—3</span><br>7</div></td>\r\n</tr>\n<tr>\n<td>\n<var>a</var><sub>1</sub>
-  = 1,</td>\r\n<td> </td>\r\n<td><div style=\"text-align:center;\">7<br><span style=\"border-top:1px
-  solid #000;\"><img src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\"
-  border=\"0\" style=\"vertical-align:middle;\">23—3</span>\n</div></td>\r\n<td> = </td>\r\n<td><div
-  style=\"text-align:center;\">\n<span style=\"border-bottom:1px solid #000;\">7(<img
-  src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\" border=\"0\"
-  style=\"vertical-align:middle;\">23+3)</span><br>14</div></td>\r\n<td> = 3 + </td>\r\n<td><div
-  style=\"text-align:center;\">\n<span style=\"border-bottom:1px solid #000;\"><img
-  src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\" border=\"0\"
-  style=\"vertical-align:middle;\">23—3</span><br>2</div></td>\r\n</tr>\n<tr>\n<td>\n<var>a</var><sub>2</sub>
-  = 3,</td>\r\n<td> </td>\r\n<td><div style=\"text-align:center;\">2<br><span style=\"border-top:1px
-  solid #000;\"><img src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\"
-  border=\"0\" style=\"vertical-align:middle;\">23—3</span>\n</div></td>\r\n<td> = </td>\r\n<td><div
-  style=\"text-align:center;\">\n<span style=\"border-bottom:1px solid #000;\">2(<img
-  src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\" border=\"0\"
-  style=\"vertical-align:middle;\">23+3)</span><br>14</div></td>\r\n<td> = 1 + </td>\r\n<td><div
-  style=\"text-align:center;\">\n<span style=\"border-bottom:1px solid #000;\"><img
-  src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\" border=\"0\"
-  style=\"vertical-align:middle;\">23—4</span><br>7</div></td>\r\n</tr>\n<tr>\n<td>\n<var>a</var><sub>3</sub>
-  = 1,</td>\r\n<td> </td>\r\n<td><div style=\"text-align:center;\">7<br><span style=\"border-top:1px
-  solid #000;\"><img src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\"
-  border=\"0\" style=\"vertical-align:middle;\">23—4</span>\n</div></td>\r\n<td> = </td>\r\n<td><div
-  style=\"text-align:center;\">\n<span style=\"border-bottom:1px solid #000;\">7(<img
-  src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\" border=\"0\"
-  style=\"vertical-align:middle;\">23+4)</span><br>7</div></td>\r\n<td> = 8 + </td>\r\n<td>\n<img
-  src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\" border=\"0\"
-  style=\"vertical-align:middle;\">23—4</td>\r\n</tr>\n<tr>\n<td>\n<var>a</var><sub>4</sub>
-  = 8,</td>\r\n<td> </td>\r\n<td><div style=\"text-align:center;\">1<br><span style=\"border-top:1px
-  solid #000;\"><img src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\"
-  border=\"0\" style=\"vertical-align:middle;\">23—4</span>\n</div></td>\r\n<td> = </td>\r\n<td><div
-  style=\"text-align:center;\">\n<span style=\"border-bottom:1px solid #000;\"><img
-  src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\" border=\"0\"
-  style=\"vertical-align:middle;\">23+4</span><br>7</div></td>\r\n<td> = 1 + </td>\r\n<td><div
-  style=\"text-align:center;\">\n<span style=\"border-bottom:1px solid #000;\"><img
-  src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\" border=\"0\"
-  style=\"vertical-align:middle;\">23—3</span><br>7</div></td>\r\n</tr>\n<tr>\n<td>\n<var>a</var><sub>5</sub>
-  = 1,</td>\r\n<td> </td>\r\n<td><div style=\"text-align:center;\">7<br><span style=\"border-top:1px
-  solid #000;\"><img src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\"
-  border=\"0\" style=\"vertical-align:middle;\">23—3</span>\n</div></td>\r\n<td> = </td>\r\n<td><div
-  style=\"text-align:center;\">\n<span style=\"border-bottom:1px solid #000;\">7(<img
-  src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\" border=\"0\"
-  style=\"vertical-align:middle;\">23+3)</span><br>14</div></td>\r\n<td> = 3 + </td>\r\n<td><div
-  style=\"text-align:center;\">\n<span style=\"border-bottom:1px solid #000;\"><img
-  src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\" border=\"0\"
-  style=\"vertical-align:middle;\">23—3</span><br>2</div></td>\r\n</tr>\n<tr>\n<td>\n<var>a</var><sub>6</sub>
-  = 3,</td>\r\n<td> </td>\r\n<td><div style=\"text-align:center;\">2<br><span style=\"border-top:1px
-  solid #000;\"><img src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\"
-  border=\"0\" style=\"vertical-align:middle;\">23—3</span>\n</div></td>\r\n<td> = </td>\r\n<td><div
-  style=\"text-align:center;\">\n<span style=\"border-bottom:1px solid #000;\">2(<img
-  src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\" border=\"0\"
-  style=\"vertical-align:middle;\">23+3)</span><br>14</div></td>\r\n<td> = 1 + </td>\r\n<td><div
-  style=\"text-align:center;\">\n<span style=\"border-bottom:1px solid #000;\"><img
-  src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\" border=\"0\"
-  style=\"vertical-align:middle;\">23—4</span><br>7</div></td>\r\n</tr>\n<tr>\n<td>\n<var>a</var><sub>7</sub>
-  = 1,</td>\r\n<td> </td>\r\n<td><div style=\"text-align:center;\">7<br><span style=\"border-top:1px
-  solid #000;\"><img src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\"
-  border=\"0\" style=\"vertical-align:middle;\">23—4</span>\n</div></td>\r\n<td> = </td>\r\n<td><div
-  style=\"text-align:center;\">\n<span style=\"border-bottom:1px solid #000;\">7(<img
-  src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\" border=\"0\"
-  style=\"vertical-align:middle;\">23+4)</span><br>7</div></td>\r\n<td> = 8 + </td>\r\n<td>\n<img
-  src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\" border=\"0\"
-  style=\"vertical-align:middle;\">23—4</td>\r\n</tr>\n</table>\n</div>\r\n<p>It can
-  be seen that the sequence is repeating. For conciseness, we use the notation <img
-  src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\" border=\"0\"
-  style=\"vertical-align:middle;\">23 = [4;(1,3,1,8)], to indicate that the block
-  (1,3,1,8) repeats indefinitely.</p>\r\n\r\n<p>The first ten continued fraction representations
-  of (irrational) square roots are:</p>\r\n<p style=\"margin-left:20px;\"><img src=\"images/symbol_radic.gif\"
-  width=\"14\" height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">2=[1;(2)],
-  period=1<br><img src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\"
-  border=\"0\" style=\"vertical-align:middle;\">3=[1;(1,2)], period=2<br><img src=\"images/symbol_radic.gif\"
-  width=\"14\" height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">5=[2;(4)],
-  period=1<br><img src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\"
-  border=\"0\" style=\"vertical-align:middle;\">6=[2;(2,4)], period=2<br><img src=\"images/symbol_radic.gif\"
-  width=\"14\" height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">7=[2;(1,1,1,4)],
-  period=4<br><img src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\"
-  border=\"0\" style=\"vertical-align:middle;\">8=[2;(1,4)], period=2<br><img src=\"images/symbol_radic.gif\"
-  width=\"14\" height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">10=[3;(6)],
-  period=1<br><img src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\"
-  border=\"0\" style=\"vertical-align:middle;\">11=[3;(3,6)], period=2<br><img src=\"images/symbol_radic.gif\"
-  width=\"14\" height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">12=
-  [3;(2,6)], period=2<br><img src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\"
-  alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">13=[3;(1,1,1,1,6)], period=5</p>\r\n<p>Exactly
-  four continued fractions, for <var>N</var> <img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> 13, have
-  an odd period.</p>\r\n<p>How many continued fractions for <var>N</var> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  10000 have an odd period?</p>\r\n"
+:content: "All square roots are periodic when written as continued fractions and can
+  be written in the form:\n\n| ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)<var>N</var>
+  = <var>a</var><sub>0</sub> + | \n1\n |\n|   | <var>a</var><sub>1</sub> + | \n1\n
+  |\n|   |   | <var>a</var><sub>2</sub> + | \n1\n |\n|   |   |   | <var>a</var><sub>3</sub>
+  + ... |\n\nFor example, let us consider ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)23:\n\n|
+  ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)23 = 4
+  + ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)23 —
+  4 = 4 +  | \n1\n |  = 4 +  | \n1\n |\n|   | \n1  \n ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)23—4\n
+  |   | 1 +  | \n ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)23
+  – 3  \n7\n |\n\nIf we continue we would get the following expansion:\n\n| ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)23
+  = 4 + | \n1\n |\n|   | 1 + | \n1\n |\n|   |   | 3 + | \n1\n |\n|   |   |   | 1 +
+  | \n1\n |\n|   |   |   |   | 8 + ... |\n\nThe process can be summarised as follows:\n\n|
+  <var>a</var><sub>0</sub> = 4, |   | \n1  \n ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)23—4\n
+  |  =  | \n ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)23+4
+  \ \n7\n |  = 1 +  | \n ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)23—3
+  \ \n7\n |\n| <var>a</var><sub>1</sub> = 1, |   | \n7  \n ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)23—3\n
+  |  =  | \n7( ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)23+3)
+  \ \n14\n |  = 3 +  | \n ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)23—3
+  \ \n2\n |\n| <var>a</var><sub>2</sub> = 3, |   | \n2  \n ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)23—3\n
+  |  =  | \n2( ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)23+3)
+  \ \n14\n |  = 1 +  | \n ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)23—4
+  \ \n7\n |\n| <var>a</var><sub>3</sub> = 1, |   | \n7  \n ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)23—4\n
+  |  =  | \n7( ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)23+4)
+  \ \n7\n |  = 8 +  | ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)23—4
+  |\n| <var>a</var><sub>4</sub> = 8, |   | \n1  \n ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)23—4\n
+  |  =  | \n ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)23+4
+  \ \n7\n |  = 1 +  | \n ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)23—3
+  \ \n7\n |\n| <var>a</var><sub>5</sub> = 1, |   | \n7  \n ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)23—3\n
+  |  =  | \n7( ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)23+3)
+  \ \n14\n |  = 3 +  | \n ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)23—3
+  \ \n2\n |\n| <var>a</var><sub>6</sub> = 3, |   | \n2  \n ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)23—3\n
+  |  =  | \n2( ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)23+3)
+  \ \n14\n |  = 1 +  | \n ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)23—4
+  \ \n7\n |\n| <var>a</var><sub>7</sub> = 1, |   | \n7  \n ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)23—4\n
+  |  =  | \n7( ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)23+4)
+  \ \n7\n |  = 8 +  | ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)23—4
+  |\n\nIt can be seen that the sequence is repeating. For conciseness, we use the
+  notation ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)23
+  = [4;(1,3,1,8)], to indicate that the block (1,3,1,8) repeats indefinitely.\n\nThe
+  first ten continued fraction representations of (irrational) square roots are:\n\n![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)2=[1;(2)],
+  period=1  \n ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)3=[1;(1,2)],
+  period=2  \n ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)5=[2;(4)],
+  period=1  \n ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)6=[2;(2,4)],
+  period=2  \n ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)7=[2;(1,1,1,4)],
+  period=4  \n ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)8=[2;(1,4)],
+  period=2  \n ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)10=[3;(6)],
+  period=1  \n ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)11=[3;(3,6)],
+  period=2  \n ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)12=
+  [3;(2,6)], period=2  \n ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)13=[3;(1,1,1,1,6)],
+  period=5\n\nExactly four continued fractions, for <var>N</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  13, have an odd period.\n\nHow many continued fractions for <var>N</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  10000 have an odd period?\n\n"

data/data/problems/65.yml

@@ -2,51 +2,25 @@
 :id: 65
 :name: Convergents of e
 :url: http://projecteuler.net/problem=65
-:content: "\r\n<p>The square root of 2 can be written as an infinite continued fraction.</p>\r\n<div
-  style=\"margin-left:20px;\">\r\n<table border=\"0\" cellspacing=\"0\" cellpadding=\"0\">\n<tr>\n<td>\n<img
-  src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\" border=\"0\"
-  style=\"vertical-align:middle;\">2 = 1 +</td>\r\n<td colspan=\"4\" style=\"border-bottom:1px
-  solid #000;\"><div style=\"text-align:center;\">1</div></td>\r\n</tr>\n<tr>\n<td> </td>\r\n<td>2
-  +</td>\r\n<td colspan=\"3\" style=\"border-bottom:1px solid #000;\"><div style=\"text-align:center;\">1</div></td>\r\n</tr>\n<tr>\n<td> </td>\r\n<td> </td>\r\n<td>2
-  +</td>\r\n<td colspan=\"2\" style=\"border-bottom:1px solid #000;\"><div style=\"text-align:center;\">1</div></td>\r\n</tr>\n<tr>\n<td> </td>\r\n<td> </td>\r\n<td> </td>\r\n<td>2
-  +</td>\r\n<td style=\"border-bottom:1px solid #000;\"><div style=\"text-align:center;\">1</div></td>\r\n</tr>\n<tr>\n<td> </td>\r\n<td> </td>\r\n<td> </td>\r\n<td> </td>\r\n<td>2
-  + ...</td>\r\n</tr>\n</table>\n</div>\r\n<p>The infinite continued fraction can
-  be written, <img src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\"
-  border=\"0\" style=\"vertical-align:middle;\">2 = [1;(2)], (2) indicates that 2
-  repeats <i>ad infinitum</i>. In a similar way, <img src=\"images/symbol_radic.gif\"
-  width=\"14\" height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">23
-  = [4;(1,3,1,8)].</p>\r\n<p>It turns out that the sequence of partial values of continued
+:content: "The square root of 2 can be written as an infinite continued fraction.\n\n|
+  ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)2 = 1 +
+  | \n1\n |\n|   | 2 + | \n1\n |\n|   |   | 2 + | \n1\n |\n|   |   |   | 2 + | \n1\n
+  |\n|   |   |   |   | 2 + ... |\n\nThe infinite continued fraction can be written,
+  ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)2 = [1;(2)],
+  (2) indicates that 2 repeats _ad infinitum_. In a similar way, ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)23
+  = [4;(1,3,1,8)].\n\nIt turns out that the sequence of partial values of continued
   fractions for square roots provide the best rational approximations. Let us consider
-  the convergents for <img src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\"
-  alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">2.</p>\r\n<div style=\"margin-left:20px;\">\r\n\r\n<table
-  border=\"0\" cellspacing=\"0\" cellpadding=\"0\">\n<tr>\n<td>1 +</td>\r\n<td style=\"border-bottom:1px
-  solid #000;\"><div style=\"text-align:center;\">1</div></td>\r\n<td>= 3/2</td>\r\n</tr>\n<tr>\n<td> </td>\r\n<td><div
-  style=\"text-align:center;\">2</div></td>\r\n<td> </td>\r\n</tr>\n</table>\n<table
-  border=\"0\" cellspacing=\"0\" cellpadding=\"0\">\n<tr>\n<td>1 +</td>\r\n<td colspan=\"2\"
-  style=\"border-bottom:1px solid #000;\"><div style=\"text-align:center;\">1</div></td>\r\n<td>=
-  7/5</td>\r\n</tr>\n<tr>\n<td> </td>\r\n<td>2 +</td>\r\n<td style=\"border-bottom:1px
-  solid #000;\"><div style=\"text-align:center;\">1</div></td>\r\n</tr>\n<tr>\n<td> </td>\r\n<td> </td>\r\n<td><div
-  style=\"text-align:center;\">2</div></td>\r\n<td> </td>\r\n</tr>\n</table>\n<table
-  border=\"0\" cellspacing=\"0\" cellpadding=\"0\">\n<tr>\n<td>1 +</td>\r\n<td colspan=\"3\"
-  style=\"border-bottom:1px solid #000;\"><div style=\"text-align:center;\">1</div></td>\r\n<td>=
-  17/12</td>\r\n</tr>\n<tr>\n<td> </td>\r\n<td>2 +</td>\r\n<td colspan=\"2\" style=\"border-bottom:1px
-  solid #000;\"><div style=\"text-align:center;\">1</div></td>\r\n<td> </td>\r\n</tr>\n<tr>\n<td> </td>\r\n<td> </td>\r\n<td>2
-  +</td>\r\n<td style=\"border-bottom:1px solid #000;\"><div style=\"text-align:center;\">1</div></td>\r\n<td> </td>\r\n</tr>\n<tr>\n<td> </td>\r\n<td> </td>\r\n<td> </td>\r\n<td><div
-  style=\"text-align:center;\">2</div></td>\r\n<td> </td>\r\n</tr>\n</table>\n<table
-  border=\"0\" cellspacing=\"0\" cellpadding=\"0\">\n<tr>\n<td>1 +</td>\r\n<td colspan=\"4\"
-  style=\"border-bottom:1px solid #000;\"><div style=\"text-align:center;\">1</div></td>\r\n<td>=
-  41/29</td>\r\n</tr>\n<tr>\n<td> </td>\r\n<td>2 +</td>\r\n<td colspan=\"3\" style=\"border-bottom:1px
-  solid #000;\"><div style=\"text-align:center;\">1</div></td>\r\n</tr>\n<tr>\n<td> </td>\r\n<td> </td>\r\n<td>2
-  +</td>\r\n<td colspan=\"2\" style=\"border-bottom:1px solid #000;\"><div style=\"text-align:center;\">1</div></td>\r\n<td> </td>\r\n</tr>\n<tr>\n<td> </td>\r\n<td> </td>\r\n<td> </td>\r\n<td>2
-  +</td>\r\n<td style=\"border-bottom:1px solid #000;\"><div style=\"text-align:center;\">1</div></td>\r\n<td> </td>\r\n</tr>\n<tr>\n<td> </td>\r\n<td> </td>\r\n<td> </td>\r\n<td> </td>\r\n<td><div
-  style=\"text-align:center;\">2</div></td>\r\n<td> </td>\r\n</tr>\n</table>\n</div>\r\n<p>Hence
-  the sequence of the first ten convergents for <img src=\"images/symbol_radic.gif\"
-  width=\"14\" height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">2
-  are:</p>\r\n<div class=\"note\">1, 3/2, 7/5, 17/12, 41/29, 99/70, 239/169, 577/408,
-  1393/985, 3363/2378, ...</div>\r\n<p>What is most surprising is that the important
-  mathematical constant,<br><i>e</i> = [2; 1,2,1, 1,4,1, 1,6,1 , ... , 1,2<i>k</i>,1,
-  ...].</p>\r\n<p>The first ten terms in the sequence of convergents for <i>e</i>
-  are:</p>\r\n<div class=\"note\">2, 3, 8/3, 11/4, 19/7, 87/32, 106/39, 193/71, 1264/465,
-  1457/536, ...</div>\r\n<p>The sum of digits in the numerator of the 10<sup>th</sup>
-  convergent is 1+4+5+7=17.</p>\r\n<p>Find the sum of digits in the numerator of the
-  100<sup>th</sup> convergent of the continued fraction for <i>e</i>.</p>\r\n"
+  the convergents for ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)2.\n\n|
+  1 + | \n1\n | = 3/2 |\n|   | \n2\n |   |\n\n| 1 + | \n1\n | = 7/5 |\n|   | 2 + |
+  \n1\n |\n|   |   | \n2\n |   |\n\n| 1 + | \n1\n | = 17/12 |\n|   | 2 + | \n1\n |
+    |\n|   |   | 2 + | \n1\n |   |\n|   |   |   | \n2\n |   |\n\n| 1 + | \n1\n | =
+  41/29 |\n|   | 2 + | \n1\n |\n|   |   | 2 + | \n1\n |   |\n|   |   |   | 2 + | \n1\n
+  |   |\n|   |   |   |   | \n2\n |   |\n\nHence the sequence of the first ten convergents
+  for ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)2 are:\n\n1,
+  3/2, 7/5, 17/12, 41/29, 99/70, 239/169, 577/408, 1393/985, 3363/2378, ...\n\nWhat
+  is most surprising is that the important mathematical constant,  \n_e_ = [2; 1,2,1,
+  1,4,1, 1,6,1 , ... , 1,2_k_,1, ...].\n\nThe first ten terms in the sequence of convergents
+  for _e_ are:\n\n2, 3, 8/3, 11/4, 19/7, 87/32, 106/39, 193/71, 1264/465, 1457/536,
+  ...\n\nThe sum of digits in the numerator of the 10<sup>th</sup> convergent is 1+4+5+7=17.\n\nFind
+  the sum of digits in the numerator of the 100<sup>th</sup> convergent of the continued
+  fraction for _e_.\n\n"

data/data/problems/66.yml

@@ -2,26 +2,16 @@
 :id: 66
 :name: Diophantine equation
 :url: http://projecteuler.net/problem=66
-:content: "\r\n<p>Consider quadratic Diophantine equations of the form:</p>\r\n<p
-  style=\"text-align:center;\"><i>x</i><sup>2</sup> – D<i>y</i><sup>2</sup> = 1</p>\r\n<p>For
-  example, when D=13, the minimal solution in <i>x</i> is 649<sup>2</sup> – 13<img
-  src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\">180<sup>2</sup> = 1.</p>\r\n<p>It can be assumed
-  that there are no solutions in positive integers when D is square.</p>\r\n<p>By
-  finding minimal solutions in <i>x</i> for D = {2, 3, 5, 6, 7}, we obtain the following:</p>\r\n<p
-  style=\"margin-left:20px;\">3<sup>2</sup> – 2<img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">2<sup>2</sup>
-  = 1<br>\r\n2<sup>2</sup> – 3<img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\"
-  alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">1<sup>2</sup> = 1<br><span
-  style=\"color:#dd0000;font-weight:bold;\">9</span><sup>2</sup> – 5<img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">4<sup>2</sup>
-  = 1<br>\r\n5<sup>2</sup> – 6<img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\"
-  alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">2<sup>2</sup> = 1<br>\r\n8<sup>2</sup>
-  – 7<img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\">3<sup>2</sup> = 1</p>\r\n<p>Hence, by considering
-  minimal solutions in <i>x</i> for D <img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> 7, the largest
-  <i>x</i> is obtained when D=5.</p>\r\n<p>Find the value of D <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  1000 in minimal solutions of <i>x</i> for which the largest value of <i>x</i> is
-  obtained.</p>\r\n\r\n"
+:content: "Consider quadratic Diophantine equations of the form:\n\n_x_<sup>2</sup>
+  – D_y_<sup>2</sup> = 1\n\nFor example, when D=13, the minimal solution in _x_ is
+  649<sup>2</sup> – 13 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)180<sup>2</sup>
+  = 1.\n\nIt can be assumed that there are no solutions in positive integers when
+  D is square.\n\nBy finding minimal solutions in _x_ for D = {2, 3, 5, 6, 7}, we
+  obtain the following:\n\n3<sup>2</sup> – 2 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)2<sup>2</sup>
+  = 1  \n\r2<sup>2</sup> – 3 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)1<sup>2</sup>
+  = 1  \n9<sup>2</sup> – 5 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)4<sup>2</sup>
+  = 1  \n\r5<sup>2</sup> – 6 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)2<sup>2</sup>
+  = 1  \n\r8<sup>2</sup> – 7 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)3<sup>2</sup>
+  = 1\n\nHence, by considering minimal solutions in _x_ for D ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  7, the largest _x_ is obtained when D=5.\n\nFind the value of D ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  1000 in minimal solutions of _x_ for which the largest value of _x_ is obtained.\n\n"

data/data/problems/67.yml

@@ -2,16 +2,13 @@
 :id: 67
 :name: Maximum path sum II
 :url: http://projecteuler.net/problem=67
-:content: "\r\n<p>By starting at the top of the triangle below and moving to adjacent
-  numbers on the row below, the maximum total from top to bottom is 23.</p>\r\n<p
-  style=\"text-align:center;font-family:courier new;font-size:12pt;\"><span style=\"color:#ff0000;\"><b>3</b></span><br><span
-  style=\"color:#ff0000;\"><b>7</b></span> 4<br>\r\n2 <span style=\"color:#ff0000;\"><b>4</b></span>
-  6<br>\r\n8 5 <span style=\"color:#ff0000;\"><b>9</b></span> 3</p>\r\n<p>That is,
-  3 + 7 + 4 + 9 = 23.</p>\r\n<p>Find the maximum total from top to bottom in <a href=\"project/triangle.txt\">triangle.txt</a>
-  (right click and 'Save Link/Target As...'), a 15K text file containing a triangle
-  with one-hundred rows.</p>\r\n<p class=\"note\"><b>NOTE:</b> This is a much more
-  difficult version of <a href=\"problem=18\">Problem 18</a>. It is not possible to
-  try every route to solve this problem, as there are 2<sup>99</sup> altogether! If
-  you could check one trillion (10<sup>12</sup>) routes every second it would take
-  over twenty billion years to check them all. There is an efficient algorithm to
-  solve it. ;o)</p>\r\n\r\n"
+:content: "By starting at the top of the triangle below and moving to adjacent numbers
+  on the row below, the maximum total from top to bottom is 23.\n\n**3**  \n**7**
+  4  \n\r2 **4** 6  \n\r8 5 **9** 3\n\nThat is, 3 + 7 + 4 + 9 = 23.\n\nFind the maximum
+  total from top to bottom in [triangle.txt](project/triangle.txt) (right click and
+  'Save Link/Target As...'), a 15K text file containing a triangle with one-hundred
+  rows.\n\n**NOTE:** This is a much more difficult version of [Problem 18](problem=18).
+  It is not possible to try every route to solve this problem, as there are 2<sup>99</sup>
+  altogether! If you could check one trillion (10<sup>12</sup>) routes every second
+  it would take over twenty billion years to check them all. There is an efficient
+  algorithm to solve it. ;o)\n\n"

data/data/problems/68.yml

@@ -2,22 +2,18 @@
 :id: 68
 :name: Magic 5-gon ring
 :url: http://projecteuler.net/problem=68
-:content: "\r\n<p>Consider the following \"magic\" 3-gon ring, filled with the numbers
-  1 to 6, and each line adding to nine.</p>\r\n<div style=\"text-align:center;\">\r\n<img
-  src=\"project/images/p_068_1.gif\" alt=\"\"><br>\n</div>\r\n<p>Working <b>clockwise</b>,
-  and starting from the group of three with the numerically lowest external node (4,3,2
-  in this example), each solution can be described uniquely. For example, the above
-  solution can be described by the set: 4,3,2; 6,2,1; 5,1,3.</p>\r\n<p>It is possible
-  to complete the ring with four different totals: 9, 10, 11, and 12. There are eight
-  solutions in total.</p>\r\n<div style=\"text-align:center;\">\r\n<table width=\"400\"
-  cellspacing=\"0\" cellpadding=\"0\">\n<tr>\n<td width=\"100\"><b>Total</b></td>\n<td
-  width=\"300\"><b>Solution Set</b></td>\r\n</tr>\n<tr>\n<td>9</td>\n<td>4,2,3; 5,3,1;
-  6,1,2</td>\r\n</tr>\n<tr>\n<td>9</td>\n<td>4,3,2; 6,2,1; 5,1,3</td>\r\n</tr>\n<tr>\n<td>10</td>\n<td>2,3,5;
-  4,5,1; 6,1,3</td>\r\n</tr>\n<tr>\n<td>10</td>\n<td>2,5,3; 6,3,1; 4,1,5</td>\r\n</tr>\n<tr>\n<td>11</td>\n<td>1,4,6;
-  3,6,2; 5,2,4</td>\r\n</tr>\n<tr>\n<td>11</td>\n<td>1,6,4; 5,4,2; 3,2,6</td>\r\n</tr>\n<tr>\n<td>12</td>\n<td>1,5,6;
-  2,6,4; 3,4,5</td>\r\n</tr>\n<tr>\n<td>12</td>\n<td>1,6,5; 3,5,4; 2,4,6</td>\r\n</tr>\n</table>\n</div>\r\n<p>By
-  concatenating each group it is possible to form 9-digit strings; the maximum string
-  for a 3-gon ring is 432621513.</p>\r\n<p>Using the numbers 1 to 10, and depending
-  on arrangements, it is possible to form 16- and 17-digit strings. What is the maximum
-  <b>16-digit</b> string for a \"magic\" 5-gon ring?</p>\r\n<div style=\"text-align:center;\">\r\n<img
-  src=\"project/images/p_068_2.gif\" alt=\"\"><br>\n</div>\r\n\r\n"
+:content: "Consider the following \"magic\" 3-gon ring, filled with the numbers 1
+  to 6, and each line adding to nine.\n\n ![](/home/will/src/euler-manager/config/../data/images/p_068_1.gif)
+  \ \n\nWorking **clockwise** , and starting from the group of three with the numerically
+  lowest external node (4,3,2 in this example), each solution can be described uniquely.
+  For example, the above solution can be described by the set: 4,3,2; 6,2,1; 5,1,3.\n\nIt
+  is possible to complete the ring with four different totals: 9, 10, 11, and 12.
+  There are eight solutions in total.\n\n| **Total** | **Solution Set** |\n| 9 | 4,2,3;
+  5,3,1; 6,1,2 |\n| 9 | 4,3,2; 6,2,1; 5,1,3 |\n| 10 | 2,3,5; 4,5,1; 6,1,3 |\n| 10
+  | 2,5,3; 6,3,1; 4,1,5 |\n| 11 | 1,4,6; 3,6,2; 5,2,4 |\n| 11 | 1,6,4; 5,4,2; 3,2,6
+  |\n| 12 | 1,5,6; 2,6,4; 3,4,5 |\n| 12 | 1,6,5; 3,5,4; 2,4,6 |\n\nBy concatenating
+  each group it is possible to form 9-digit strings; the maximum string for a 3-gon
+  ring is 432621513.\n\nUsing the numbers 1 to 10, and depending on arrangements,
+  it is possible to form 16- and 17-digit strings. What is the maximum **16-digit**
+  string for a \"magic\" 5-gon ring?\n\n ![](/home/will/src/euler-manager/config/../data/images/p_068_2.gif)
+  \ \n\n"

data/data/problems/69.yml

@@ -2,13 +2,21 @@
 :id: 69
 :name: Totient maximum
 :url: http://projecteuler.net/problem=69
-:content: "\r\n\n<p>Euler's Totient function, φ(<i>n</i>) [sometimes called the phi
-  function], is used to determine the number of numbers less than <i>n</i> which are
-  relatively prime to <i>n</i>. For example, as 1, 2, 4, 5, 7, and 8, are all less
-  than nine and relatively prime to nine, φ(9)=6.</p>\n<div style=\"margin-left:100px;\">\n<table
-  border=\"1\">\n<tr>\n<td><b><i>n</i></b></td>\n<td><b>Relatively Prime</b></td>\n<td><b>φ(<i>n</i>)</b></td>\n<td><b><i>n</i>/φ(<i>n</i>)</b></td>\n</tr>\n<tr>\n<td>2</td>\n<td>1</td>\n<td>1</td>\n<td>2</td>\n</tr>\n<tr>\n<td>3</td>\n<td>1,2</td>\n<td>2</td>\n<td>1.5</td>\n</tr>\n<tr>\n<td>4</td>\n<td>1,3</td>\n<td>2</td>\n<td>2</td>\n</tr>\n<tr>\n<td>5</td>\n<td>1,2,3,4</td>\n<td>4</td>\n<td>1.25</td>\n</tr>\n<tr>\n<td>6</td>\n<td>1,5</td>\n<td>2</td>\n<td>3</td>\n</tr>\n<tr>\n<td>7</td>\n<td>1,2,3,4,5,6</td>\n<td>6</td>\n<td>1.1666...</td>\n</tr>\n<tr>\n<td>8</td>\n<td>1,3,5,7</td>\n<td>4</td>\n<td>2</td>\n</tr>\n<tr>\n<td>9</td>\n<td>1,2,4,5,7,8</td>\n<td>6</td>\n<td>1.5</td>\n</tr>\n<tr>\n<td>10</td>\n<td>1,3,7,9</td>\n<td>4</td>\n<td>2.5</td>\n</tr>\n</table>\n</div>\n<p>It
-  can be seen that <i>n</i>=6 produces a maximum <i>n</i>/φ(<i>n</i>) for <i>n</i>
-  <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"> 10.</p>\n<p>Find the value of <i>n</i> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  1,000,000 for which <i>n</i>/φ(<i>n</i>) is a maximum.</p>\n\r\n"
+:content: |+
+  Euler's Totient function, φ(_n_) [sometimes called the phi function], is used to determine the number of numbers less than _n_ which are relatively prime to _n_. For example, as 1, 2, 4, 5, 7, and 8, are all less than nine and relatively prime to nine, φ(9)=6.
+
+  | **_n_** | **Relatively Prime** | **φ(_n_)** | **_n_/φ(_n_)** |
+  | 2 | 1 | 1 | 2 |
+  | 3 | 1,2 | 2 | 1.5 |
+  | 4 | 1,3 | 2 | 2 |
+  | 5 | 1,2,3,4 | 4 | 1.25 |
+  | 6 | 1,5 | 2 | 3 |
+  | 7 | 1,2,3,4,5,6 | 6 | 1.1666... |
+  | 8 | 1,3,5,7 | 4 | 2 |
+  | 9 | 1,2,4,5,7,8 | 6 | 1.5 |
+  | 10 | 1,3,7,9 | 4 | 2.5 |
+
+  It can be seen that _n_=6 produces a maximum _n_/φ(_n_) for _n_ ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 10.
+
+  Find the value of _n_ ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 1,000,000 for which _n_/φ(_n_) is a maximum.
+

data/data/problems/7.yml

@@ -2,5 +2,8 @@
 :id: 7
 :name: 10001st prime
 :url: http://projecteuler.net/problem=7
-:content: "\r\n<p>By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13,
-  we can see that the 6th prime is 13.</p>\r\n<p>What is the 10 001st prime number?</p>\r\n\r\n"
+:content: |+
+  By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.
+
+  What is the 10 001st prime number?
+

data/data/problems/70.yml

@@ -2,15 +2,13 @@
 :id: 70
 :name: Totient permutation
 :url: http://projecteuler.net/problem=70
-:content: "\r\n<p>Euler's Totient function, φ(<var>n</var>) [sometimes called the
-  phi function], is used to determine the number of positive numbers less than or
-  equal to <var>n</var> which are relatively prime to <var>n</var>. For example, as
-  1, 2, 4, 5, 7, and 8, are all less than nine and relatively prime to nine, φ(9)=6.<br>The
-  number 1 is considered to be relatively prime to every positive number, so φ(1)=1.
-  </p>\r\n<p>Interestingly, φ(87109)=79180, and it can be seen that 87109 is a permutation
-  of 79180.</p>\r\n<p>Find the value of <var>n</var>, 1 <img src=\"images/symbol_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\"><var>n</var>
-  <img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\"
-  style=\"vertical-align:middle;\"> 10<sup>7</sup>, for which φ(<var>n</var>) is a
-  permutation of <var>n</var> and the ratio <var>n</var>/φ(<var>n</var>) produces
-  a minimum.</p>\r\n\r\n"
+:content: "Euler's Totient function, φ(<var>n</var>) [sometimes called the phi function],
+  is used to determine the number of positive numbers less than or equal to <var>n</var>
+  which are relatively prime to <var>n</var>. For example, as 1, 2, 4, 5, 7, and 8,
+  are all less than nine and relatively prime to nine, φ(9)=6.  \nThe number 1 is
+  considered to be relatively prime to every positive number, so φ(1)=1.\n\nInterestingly,
+  φ(87109)=79180, and it can be seen that 87109 is a permutation of 79180.\n\nFind
+  the value of <var>n</var>, 1 ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)
+  <var>n</var> ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)
+  10<sup>7</sup>, for which φ(<var>n</var>) is a permutation of <var>n</var> and the
+  ratio <var>n</var>/φ(<var>n</var>) produces a minimum.\n\n"

data/data/problems/71.yml

@@ -2,16 +2,14 @@
 :id: 71
 :name: Ordered fractions
 :url: http://projecteuler.net/problem=71
-:content: "\r\n\n<p>Consider the fraction, <i>n/d</i>, where <i>n</i> and <i>d</i>
-  are positive integers. If <i>n</i><img src=\"images/symbol_lt.gif\" width=\"10\"
-  height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\"><i>d</i>
-  and HCF(<i>n,d</i>)=1, it is called a reduced proper fraction.</p>\n<p>If we list
-  the set of reduced proper fractions for <i>d</i> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  8 in ascending order of size, we get:</p>\n<p style=\"text-align:center;font-size:8pt;\">1/8,
-  1/7, 1/6, 1/5, 1/4, 2/7, 1/3, 3/8, <b>2/5</b>, 3/7, 1/2, 4/7, 3/5, 5/8, 2/3, 5/7,
-  3/4, 4/5, 5/6, 6/7, 7/8</p>\n<p>It can be seen that 2/5 is the fraction immediately
-  to the left of 3/7.</p>\n<p>By listing the set of reduced proper fractions for <i>d</i>
-  <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"> 1,000,000 in ascending order of size, find the
-  numerator of the fraction immediately to the left of 3/7.</p>\n\r\n"
+:content: |+
+  Consider the fraction, _n/d_, where _n_ and _d_ are positive integers. If _n_ ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)_d_ and HCF(_n,d_)=1, it is called a reduced proper fraction.
+
+  If we list the set of reduced proper fractions for _d_ ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 8 in ascending order of size, we get:
+
+  1/8, 1/7, 1/6, 1/5, 1/4, 2/7, 1/3, 3/8, **2/5** , 3/7, 1/2, 4/7, 3/5, 5/8, 2/3, 5/7, 3/4, 4/5, 5/6, 6/7, 7/8
+
+  It can be seen that 2/5 is the fraction immediately to the left of 3/7.
+
+  By listing the set of reduced proper fractions for _d_ ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 1,000,000 in ascending order of size, find the numerator of the fraction immediately to the left of 3/7.
+

data/data/problems/72.yml

@@ -2,15 +2,14 @@
 :id: 72
 :name: Counting fractions
 :url: http://projecteuler.net/problem=72
-:content: "\r\n\n<p>Consider the fraction, <i>n/d</i>, where <i>n</i> and <i>d</i>
-  are positive integers. If <i>n</i><img src=\"images/symbol_lt.gif\" width=\"10\"
-  height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\"><i>d</i>
-  and HCF(<i>n,d</i>)=1, it is called a reduced proper fraction.</p>\n<p>If we list
-  the set of reduced proper fractions for <i>d</i> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  8 in ascending order of size, we get:</p>\n<p style=\"text-align:center;font-size:8pt;\">1/8,
-  1/7, 1/6, 1/5, 1/4, 2/7, 1/3, 3/8, 2/5, 3/7, 1/2, 4/7, 3/5, 5/8, 2/3, 5/7, 3/4,
-  4/5, 5/6, 6/7, 7/8</p>\n<p>It can be seen that there are 21 elements in this set.</p>\n<p>How
-  many elements would be contained in the set of reduced proper fractions for <i>d</i>
-  <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"> 1,000,000?</p>\n\r\n"
+:content: |+
+  Consider the fraction, _n/d_, where _n_ and _d_ are positive integers. If _n_ ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)_d_ and HCF(_n,d_)=1, it is called a reduced proper fraction.
+
+  If we list the set of reduced proper fractions for _d_ ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 8 in ascending order of size, we get:
+
+  1/8, 1/7, 1/6, 1/5, 1/4, 2/7, 1/3, 3/8, 2/5, 3/7, 1/2, 4/7, 3/5, 5/8, 2/3, 5/7, 3/4, 4/5, 5/6, 6/7, 7/8
+
+  It can be seen that there are 21 elements in this set.
+
+  How many elements would be contained in the set of reduced proper fractions for _d_ ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 1,000,000?
+