euler-manager 0.0.5 → 0.0.6

data/data/problems/117.yml

@@ -2,81 +2,39 @@
 :id: 117
 :name: Red, green, and blue tiles
 :url: http://projecteuler.net/problem=117
-:content: "\r\n<p>Using a combination of black square tiles and oblong tiles chosen
-  from: red tiles measuring two units, green tiles measuring three units, and blue
-  tiles measuring four units, it is possible to tile a row measuring five units in
-  length in exactly fifteen different ways.</p>\r\n\r\n<table cellpadding=\"10\" cellspacing=\"0\"
-  border=\"0\" align=\"center\">\n<tr>\n<td>\r\n<table cellspacing=\"2\" cellpadding=\"0\"
-  border=\"1\"><tr>\n<td style=\"background-color:#000000\"><img src=\"images/spacer.gif\"
-  width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n</tr></table>\n</td>\r\n<td>\r\n<table
-  cellspacing=\"2\" cellpadding=\"0\" border=\"1\"><tr>\n<td colspan=\"2\" style=\"background-color:#cc0000\"><img
-  src=\"images/spacer.gif\" width=\"44\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n</tr></table>\n</td>\r\n<td>\r\n<table
-  cellspacing=\"2\" cellpadding=\"0\" border=\"1\"><tr>\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td colspan=\"2\"
-  style=\"background-color:#cc0000\"><img src=\"images/spacer.gif\" width=\"44\" height=\"20\"
-  alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img src=\"images/spacer.gif\"
-  width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n</tr></table>\n</td>\r\n<td>\r\n<table
-  cellspacing=\"2\" cellpadding=\"0\" border=\"1\"><tr>\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td colspan=\"2\"
-  style=\"background-color:#cc0000\"><img src=\"images/spacer.gif\" width=\"44\" height=\"20\"
-  alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img src=\"images/spacer.gif\"
-  width=\"20\" height=\"20\" alt=\"\"></td>\r\n</tr></table>\n</td>\r\n</tr>\n<tr>\n<td>\r\n<table
-  cellspacing=\"2\" cellpadding=\"0\" border=\"1\"><tr>\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td colspan=\"2\"
-  style=\"background-color:#cc0000\"><img src=\"images/spacer.gif\" width=\"44\" height=\"20\"
-  alt=\"\"></td>\r\n</tr></table>\n</td>\r\n<td>\r\n<table cellspacing=\"2\" cellpadding=\"0\"
-  border=\"1\"><tr>\n<td colspan=\"2\" style=\"background-color:#cc0000\"><img src=\"images/spacer.gif\"
-  width=\"44\" height=\"20\" alt=\"\"></td>\r\n<td colspan=\"2\" style=\"background-color:#cc0000\"><img
-  src=\"images/spacer.gif\" width=\"44\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n</tr></table>\n</td>\r\n<td>\r\n<table
-  cellspacing=\"2\" cellpadding=\"0\" border=\"1\"><tr>\n<td colspan=\"2\" style=\"background-color:#cc0000\"><img
-  src=\"images/spacer.gif\" width=\"44\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td colspan=\"2\"
-  style=\"background-color:#cc0000\"><img src=\"images/spacer.gif\" width=\"44\" height=\"20\"
-  alt=\"\"></td>\r\n</tr></table>\n</td>\r\n<td>\r\n<table cellspacing=\"2\" cellpadding=\"0\"
-  border=\"1\"><tr>\n<td style=\"background-color:#000000\"><img src=\"images/spacer.gif\"
-  width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td colspan=\"2\" style=\"background-color:#cc0000\"><img
-  src=\"images/spacer.gif\" width=\"44\" height=\"20\" alt=\"\"></td>\r\n<td colspan=\"2\"
-  style=\"background-color:#cc0000\"><img src=\"images/spacer.gif\" width=\"44\" height=\"20\"
-  alt=\"\"></td>\r\n</tr></table>\n</td>\r\n</tr>\n<tr>\n<td>\r\n<table cellspacing=\"2\"
-  cellpadding=\"0\" border=\"1\"><tr>\n<td colspan=\"3\" style=\"background-color:#00cc00\"><img
-  src=\"images/spacer.gif\" width=\"68\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n</tr></table>\n</td>\r\n<td>\r\n<table
-  cellspacing=\"2\" cellpadding=\"0\" border=\"1\"><tr>\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td colspan=\"3\"
-  style=\"background-color:#00cc00\"><img src=\"images/spacer.gif\" width=\"68\" height=\"20\"
-  alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img src=\"images/spacer.gif\"
-  width=\"20\" height=\"20\" alt=\"\"></td>\r\n</tr></table>\n</td>\r\n<td>\r\n<table
-  cellspacing=\"2\" cellpadding=\"0\" border=\"1\"><tr>\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td colspan=\"3\"
-  style=\"background-color:#00cc00\"><img src=\"images/spacer.gif\" width=\"68\" height=\"20\"
-  alt=\"\"></td>\r\n</tr></table>\n</td>\r\n<td>\r\n<table cellspacing=\"2\" cellpadding=\"0\"
-  border=\"1\"><tr>\n<td colspan=\"2\" style=\"background-color:#cc0000\"><img src=\"images/spacer.gif\"
-  width=\"44\" height=\"20\" alt=\"\"></td>\r\n<td colspan=\"3\" style=\"background-color:#00cc00\"><img
-  src=\"images/spacer.gif\" width=\"68\" height=\"20\" alt=\"\"></td>\r\n</tr></table>\n</td>\r\n</tr>\n<tr>\n<td>\r\n<table
-  cellspacing=\"2\" cellpadding=\"0\" border=\"1\"><tr>\n<td colspan=\"3\" style=\"background-color:#00cc00\"><img
-  src=\"images/spacer.gif\" width=\"68\" height=\"20\" alt=\"\"></td>\r\n<td colspan=\"2\"
-  style=\"background-color:#cc0000\"><img src=\"images/spacer.gif\" width=\"44\" height=\"20\"
-  alt=\"\"></td>\r\n</tr></table>\n</td>\r\n<td>\r\n<table cellspacing=\"2\" cellpadding=\"0\"
-  border=\"1\"><tr>\n<td colspan=\"4\" style=\"background-color:#0000cc\"><img src=\"images/spacer.gif\"
-  width=\"92\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n</tr></table>\n</td>\r\n<td>\r\n<table
-  cellspacing=\"2\" cellpadding=\"0\" border=\"1\"><tr>\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td colspan=\"4\"
-  style=\"background-color:#0000cc\"><img src=\"images/spacer.gif\" width=\"92\" height=\"20\"
-  alt=\"\"></td>\r\n</tr></table>\n</td>\r\n<td> </td>\r\n</tr>\n</table>\n<p>How
-  many ways can a row measuring fifty units in length be tiled?</p>\r\n<p class=\"note\">NOTE:
-  This is related to <a href=\"problem=116\">Problem 116</a>.</p>\r\n"
+:content: "Using a combination of black square tiles and oblong tiles chosen from:
+  red tiles measuring two units, green tiles measuring three units, and blue tiles
+  measuring four units, it is possible to tile a row measuring five units in length
+  in exactly fifteen different ways.\n\n| \n\n| ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  |\n\n | \n\n| ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) |\n\n | \n\n|
+  ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  |\n\n | \n\n| ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) |\n\n |\n|
+  \n\n| ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  |\n\n | \n\n| ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  |\n\n | \n\n| ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  |\n\n | \n\n| ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  |\n\n |\n| \n\n| ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  |\n\n | \n\n| ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  |\n\n | \n\n| ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  |\n\n | \n\n| ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) |\n\n |\n|
+  \n\n| ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  |\n\n | \n\n| ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) |\n\n | \n\n|
+  ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  |\n\n |   |\n\nHow many ways can a row measuring fifty units in length be tiled?\n\nNOTE:
+  This is related to [Problem 116](problem=116).\n\n"

data/data/problems/118.yml

@@ -2,8 +2,8 @@
 :id: 118
 :name: Pandigital prime sets
 :url: http://projecteuler.net/problem=118
-:content: "\r\n<p>Using all of the digits 1 through 9 and concatenating them freely
-  to form decimal integers, different sets can be formed. Interestingly with the set
-  {2,5,47,89,631}, all of the elements belonging to it are prime.</p>\r\n<p>How many
-  distinct sets containing each of the digits one through nine exactly once contain
-  only prime elements?</p>\r\n\r\n"
+:content: |+
+  Using all of the digits 1 through 9 and concatenating them freely to form decimal integers, different sets can be formed. Interestingly with the set {2,5,47,89,631}, all of the elements belonging to it are prime.
+
+  How many distinct sets containing each of the digits one through nine exactly once contain only prime elements?
+

data/data/problems/119.yml

@@ -2,10 +2,12 @@
 :id: 119
 :name: Digit power sum
 :url: http://projecteuler.net/problem=119
-:content: "\r\n<p>The number 512 is interesting because it is equal to the sum of
-  its digits raised to some power: 5 + 1 + 2 = 8, and 8<sup>3</sup> = 512. Another
-  example of a number with this property is 614656 = 28<sup>4</sup>.</p>\r\n<p>We
-  shall define <i>a</i><sub>n</sub> to be the <i>n</i>th term of this sequence and
-  insist that a number must contain at least two digits to have a sum.</p>\r\n<p>You
-  are given that <i>a</i><sub>2</sub> = 512 and <i>a</i><sub>10</sub> = 614656.</p>\r\n<p>Find
-  <i>a</i><sub>30</sub>.</p>\r\n\r\n"
+:content: |+
+  The number 512 is interesting because it is equal to the sum of its digits raised to some power: 5 + 1 + 2 = 8, and 8<sup>3</sup> = 512. Another example of a number with this property is 614656 = 28<sup>4</sup>.
+
+  We shall define _a_<sub>n</sub> to be the _n_th term of this sequence and insist that a number must contain at least two digits to have a sum.
+
+  You are given that _a_<sub>2</sub> = 512 and _a_<sub>10</sub> = 614656.
+
+  Find _a_<sub>30</sub>.
+

data/data/problems/12.yml

@@ -2,12 +2,11 @@
 :id: 12
 :name: Highly divisible triangular number
 :url: http://projecteuler.net/problem=12
-:content: "\r\n<p>The sequence of triangle numbers is generated by adding the natural
-  numbers. So the 7<sup>th</sup> triangle number would be 1 + 2 + 3 + 4 + 5 + 6 +
-  7 = 28. The first ten terms would be:</p>\r\n<p style=\"text-align:center;\">1,
-  3, 6, 10, 15, 21, 28, 36, 45, 55, ...</p>\r\n<p>Let us list the factors of the first
-  seven triangle numbers:</p>\r\n<blockquote style=\"font-family:courier new;\">\n<b> 1</b>:
-  1<br><b> 3</b>: 1,3<br><b> 6</b>: 1,2,3,6<br><b>10</b>: 1,2,5,10<br><b>15</b>: 1,3,5,15<br><b>21</b>:
-  1,3,7,21<br><b>28</b>: 1,2,4,7,14,28</blockquote>\r\n<p>We can see that 28 is the
-  first triangle number to have over five divisors.</p>\r\n<p>What is the value of
-  the first triangle number to have over five hundred divisors?</p>\r\n\r\n"
+:content: "The sequence of triangle numbers is generated by adding the natural numbers.
+  So the 7<sup>th</sup> triangle number would be 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28. The
+  first ten terms would be:\n\n1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...\n\nLet us
+  list the factors of the first seven triangle numbers:\n\n> ** 1** : 1  \n> ** 3**
+  : 1,3  \n> ** 6** : 1,2,3,6  \n> **10** : 1,2,5,10  \n> **15** : 1,3,5,15  \n> **21**
+  : 1,3,7,21  \n> **28** : 1,2,4,7,14,28\n\nWe can see that 28 is the first triangle
+  number to have over five divisors.\n\nWhat is the value of the first triangle number
+  to have over five hundred divisors?\n\n"

data/data/problems/120.yml

@@ -2,16 +2,10 @@
 :id: 120
 :name: Square remainders
 :url: http://projecteuler.net/problem=120
-:content: "\r\n\n<p>Let <i>r</i> be the remainder when (<i>a</i><img src=\"images/symbol_minus.gif\"
-  width=\"9\" height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">1)<sup><i>n</i></sup>
-  + (<i>a</i>+1)<sup><i>n</i></sup> is divided by <i>a</i><sup>2</sup>.</p>\n<p>For
-  example, if <i>a</i> = 7 and <i>n</i> = 3, then <i>r</i> = 42: 6<sup>3</sup> + 8<sup>3</sup>
-  = 728 <img src=\"images/symbol_cong.gif\" width=\"9\" height=\"11\" alt=\"≡\" border=\"0\"
-  style=\"vertical-align:middle;\"> 42 mod 49. And as <i>n</i> varies, so too will
-  <i>r</i>, but for <i>a</i> = 7 it turns out that <i>r</i><sub>max</sub> = 42.</p>\n<p>For
-  3 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"><i>a</i> <img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> 1000, find
-  <span style=\"font-family:times new roman;font-size:13pt;\"><img src=\"images/symbol_sum.gif\"
-  width=\"11\" height=\"14\" alt=\"∑\" border=\"0\" style=\"vertical-align:middle;\"></span>
-  <i>r</i><sub>max</sub>.</p>\n\r\n"
+:content: |+
+  Let _r_ be the remainder when (_a_ ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)1)<sup><i>n</i></sup> + (_a_+1)<sup><i>n</i></sup> is divided by _a_<sup>2</sup>.
+
+  For example, if _a_ = 7 and _n_ = 3, then _r_ = 42: 6<sup>3</sup> + 8<sup>3</sup> = 728 ![≡](/home/will/src/euler-manager/config/../data/images/symbol_cong.gif) 42 mod 49. And as _n_ varies, so too will _r_, but for _a_ = 7 it turns out that _r_<sub>max</sub> = 42.
+
+  For 3 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) _a_ ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 1000, find ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif) _r_<sub>max</sub>.
+

data/data/problems/121.yml

@@ -2,14 +2,12 @@
 :id: 121
 :name: Disc game prize fund
 :url: http://projecteuler.net/problem=121
-:content: "\r\n<p>A bag contains one red disc and one blue disc. In a game of chance
-  a player takes a disc at random and its colour is noted. After each turn the disc
-  is returned to the bag, an extra red disc is added, and another disc is taken at
-  random.</p>\r\n<p>The player pays £1 to play and wins if they have taken more blue
-  discs than red discs at the end of the game.</p>\r\n<p>If the game is played for
-  four turns, the probability of a player winning is exactly 11/120, and so the maximum
-  prize fund the banker should allocate for winning in this game would be £10 before
-  they would expect to incur a loss. Note that any payout will be a whole number of
-  pounds and also includes the original £1 paid to play the game, so in the example
-  given the player actually wins £9.</p>\r\n<p>Find the maximum prize fund that should
-  be allocated to a single game in which fifteen turns are played.</p>\r\n\r\n"
+:content: |+
+  A bag contains one red disc and one blue disc. In a game of chance a player takes a disc at random and its colour is noted. After each turn the disc is returned to the bag, an extra red disc is added, and another disc is taken at random.
+
+  The player pays £1 to play and wins if they have taken more blue discs than red discs at the end of the game.
+
+  If the game is played for four turns, the probability of a player winning is exactly 11/120, and so the maximum prize fund the banker should allocate for winning in this game would be £10 before they would expect to incur a loss. Note that any payout will be a whole number of pounds and also includes the original £1 paid to play the game, so in the example given the player actually wins £9.
+
+  Find the maximum prize fund that should be allocated to a single game in which fifteen turns are played.
+

data/data/problems/122.yml

@@ -2,41 +2,24 @@
 :id: 122
 :name: Efficient exponentiation
 :url: http://projecteuler.net/problem=122
-:content: "\r\n<p>The most naive way of computing <i>n</i><sup>15</sup> requires fourteen
-  multiplications:</p>\r\n<p style=\"margin-left:100px;\"><i>n</i> <img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"><i>n</i>
-  <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\"> ... <img src=\"images/symbol_times.gif\" width=\"9\"
-  height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"><i>n</i> =
-  <i>n</i><sup>15</sup></p>\r\n<p>But using a \"binary\" method you can compute it
-  in six multiplications:</p>\r\n<p style=\"margin-left:100px;\"><i>n</i> <img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"><i>n</i>
-  = <i>n</i><sup>2</sup><br><i>n</i><sup>2</sup><img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"><i>n</i><sup>2</sup>
-  = <i>n</i><sup>4</sup><br><i>n</i><sup>4</sup><img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"><i>n</i><sup>4</sup>
-  = <i>n</i><sup>8</sup><br><i>n</i><sup>8</sup><img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"><i>n</i><sup>4</sup>
-  = <i>n</i><sup>12</sup><br><i>n</i><sup>12</sup><img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"><i>n</i><sup>2</sup>
-  = <i>n</i><sup>14</sup><br><i>n</i><sup>14</sup><img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"><i>n</i>
-  = <i>n</i><sup>15</sup></p>\r\n<p>However it is yet possible to compute it in only
-  five multiplications:</p>\r\n<p style=\"margin-left:100px;\"><i>n</i> <img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"><i>n</i>
-  = <i>n</i><sup>2</sup><br><i>n</i><sup>2</sup><img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"><i>n</i>
-  = <i>n</i><sup>3</sup><br><i>n</i><sup>3</sup><img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"><i>n</i><sup>3</sup>
-  = <i>n</i><sup>6</sup><br><i>n</i><sup>6</sup><img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"><i>n</i><sup>6</sup>
-  = <i>n</i><sup>12</sup><br><i>n</i><sup>12</sup><img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"><i>n</i><sup>3</sup>
-  = <i>n</i><sup>15</sup></p>\r\n<p>We shall define m(<i>k</i>) to be the minimum
-  number of multiplications to compute <i>n</i><sup><i>k</i></sup>; for example m(15)
-  = 5.</p>\r\n<p>For 1 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\"
-  alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><i>k</i> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  200, find <span style=\"font-family:times new roman;font-size:13pt;\"><img src=\"images/symbol_sum.gif\"
-  width=\"11\" height=\"14\" alt=\"∑\" border=\"0\" style=\"vertical-align:middle;\"></span>
-  m(<i>k</i>).</p>\r\n\r\n"
+:content: "The most naive way of computing _n_<sup>15</sup> requires fourteen multiplications:\n\n_n_
+  ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) _n_ ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  ... ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) _n_
+  = _n_<sup>15</sup>\n\nBut using a \"binary\" method you can compute it in six multiplications:\n\n_n_
+  ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) _n_ =
+  _n_<sup>2</sup>  \n_n_<sup>2</sup> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  _n_<sup>2</sup> = _n_<sup>4</sup>  \n_n_<sup>4</sup> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  _n_<sup>4</sup> = _n_<sup>8</sup>  \n_n_<sup>8</sup> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  _n_<sup>4</sup> = _n_<sup>12</sup>  \n_n_<sup>12</sup> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  _n_<sup>2</sup> = _n_<sup>14</sup>  \n_n_<sup>14</sup> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  _n_ = _n_<sup>15</sup>\n\nHowever it is yet possible to compute it in only five
+  multiplications:\n\n_n_ ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  _n_ = _n_<sup>2</sup>  \n_n_<sup>2</sup> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  _n_ = _n_<sup>3</sup>  \n_n_<sup>3</sup> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  _n_<sup>3</sup> = _n_<sup>6</sup>  \n_n_<sup>6</sup> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  _n_<sup>6</sup> = _n_<sup>12</sup>  \n_n_<sup>12</sup> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  _n_<sup>3</sup> = _n_<sup>15</sup>\n\nWe shall define m(_k_) to be the minimum number
+  of multiplications to compute _n_<sup><i>k</i></sup>; for example m(15) = 5.\n\nFor
+  1 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) _k_ ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  200, find ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif)
+  m(_k_).\n\n"

data/data/problems/123.yml

@@ -2,12 +2,12 @@
 :id: 123
 :name: Prime square remainders
 :url: http://projecteuler.net/problem=123
-:content: "\r\n\n<p>Let <i>p</i><sub>n</sub> be the <i>n</i>th prime: 2, 3, 5, 7,
-  11, ..., and let <i>r</i> be the remainder when (<i>p</i><sub>n</sub><img src=\"images/symbol_minus.gif\"
-  width=\"9\" height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">1)<sup><i>n</i></sup>
-  + (<i>p</i><sub>n</sub>+1)<sup><i>n</i></sup> is divided by <i>p</i><sub>n</sub><sup>2</sup>.</p>\n<p>For
-  example, when <i>n</i> = 3, <i>p</i><sub>3</sub> = 5, and 4<sup>3</sup> + 6<sup>3</sup>
-  = 280 <img src=\"images/symbol_cong.gif\" width=\"9\" height=\"11\" alt=\"≡\" border=\"0\"
-  style=\"vertical-align:middle;\"> 5 mod 25.</p>\n<p>The least value of <i>n</i>
-  for which the remainder first exceeds 10<sup>9</sup> is 7037.</p>\n<p>Find the least
-  value of <i>n</i> for which the remainder first exceeds 10<sup>10</sup>.</p>\n\r\n"
+:content: |+
+  Let _p_<sub>n</sub> be the _n_th prime: 2, 3, 5, 7, 11, ..., and let _r_ be the remainder when (_p_<sub>n</sub> ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)1)<sup><i>n</i></sup> + (_p_<sub>n</sub>+1)<sup><i>n</i></sup> is divided by _p_<sub>n</sub><sup>2</sup>.
+
+  For example, when _n_ = 3, _p_<sub>3</sub> = 5, and 4<sup>3</sup> + 6<sup>3</sup> = 280 ![≡](/home/will/src/euler-manager/config/../data/images/symbol_cong.gif) 5 mod 25.
+
+  The least value of _n_ for which the remainder first exceeds 10<sup>9</sup> is 7037.
+
+  Find the least value of _n_ for which the remainder first exceeds 10<sup>10</sup>.
+

data/data/problems/124.yml

@@ -2,57 +2,27 @@
 :id: 124
 :name: Ordered radicals
 :url: http://projecteuler.net/problem=124
-:content: "\r\n<p>The radical of <i>n</i>, rad(<i>n</i>), is the product of the distinct
-  prime factors of <i>n</i>. For example, 504 = 2<sup>3</sup><img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">
-  3<sup>2</sup><img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\"
-  border=\"0\" style=\"vertical-align:middle;\"> 7, so rad(504) = 2 <img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">
-  3 <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\"> 7 = 42.</p>\r\n<p>If we calculate rad(<i>n</i>)
-  for <i>1</i> <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\"
-  border=\"0\" style=\"vertical-align:middle;\"><i>n</i> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  10, then sort them on rad(<i>n</i>), and sorting on <i>n</i> if the radical values
-  are equal, we get:</p>\r\n<table cellpadding=\"2\" cellspacing=\"0\" border=\"0\"
-  align=\"center\">\n<tr>\n<td colspan=\"2\"><div style=\"text-align:center;\"><b>Unsorted</b></div></td>\r\n<td> </td>\r\n<td
-  colspan=\"3\"><div style=\"text-align:center;\"><b>Sorted</b></div></td>\r\n</tr>\n<tr>\n<td><div
-  style=\"text-align:center;\">\n<img src=\"images/spacer.gif\" width=\"50\" height=\"1\"
-  alt=\"\"><br><b><i>n</i></b>\n</div></td>\r\n<td><div style=\"text-align:center;\">\n<img
-  src=\"images/spacer.gif\" width=\"50\" height=\"1\" alt=\"\"><br><b>rad(<i>n</i>)</b>\n</div></td>\r\n<td>\n<img
-  src=\"images/spacer.gif\" width=\"50\" height=\"1\" alt=\"\"><br>\n</td>\r\n<td><div
-  style=\"text-align:center;\">\n<img src=\"images/spacer.gif\" width=\"50\" height=\"1\"
-  alt=\"\"><br><b><i>n</i></b>\n</div></td>\r\n<td><div style=\"text-align:center;\">\n<img
-  src=\"images/spacer.gif\" width=\"50\" height=\"1\" alt=\"\"><br><b>rad(<i>n</i>)</b>\n</div></td>\r\n<td><div
-  style=\"text-align:center;\">\n<img src=\"images/spacer.gif\" width=\"50\" height=\"1\"
-  alt=\"\"><br><b>k</b>\n</div></td>\r\n</tr>\n<tr>\n<td><div style=\"text-align:center;\">1</div></td>\n<td><div
-  style=\"text-align:center;\">1</div></td>\r\n<td> </td>\r\n<td><div style=\"text-align:center;\">1</div></td>\n<td><div
-  style=\"text-align:center;\">1</div></td>\n<td><div style=\"text-align:center;\">1</div></td>\r\n</tr>\n<tr>\n<td><div
-  style=\"text-align:center;\">2</div></td>\n<td><div style=\"text-align:center;\">2</div></td>\r\n<td> </td>\r\n<td><div
-  style=\"text-align:center;\">2</div></td>\n<td><div style=\"text-align:center;\">2</div></td>\n<td><div
-  style=\"text-align:center;\">2</div></td>\r\n</tr>\n<tr>\n<td><div style=\"text-align:center;\">3</div></td>\n<td><div
-  style=\"text-align:center;\">3</div></td>\r\n<td> </td>\r\n<td><div style=\"text-align:center;\">4</div></td>\n<td><div
-  style=\"text-align:center;\">2</div></td>\n<td><div style=\"text-align:center;\">3</div></td>\r\n</tr>\n<tr>\n<td><div
-  style=\"text-align:center;\">4</div></td>\n<td><div style=\"text-align:center;\">2</div></td>\r\n<td> </td>\r\n<td><div
-  style=\"text-align:center;\">8</div></td>\n<td><div style=\"text-align:center;\">2</div></td>\n<td><div
-  style=\"text-align:center;\">4</div></td>\r\n</tr>\n<tr>\n<td><div style=\"text-align:center;\">5</div></td>\n<td><div
-  style=\"text-align:center;\">5</div></td>\r\n<td> </td>\r\n<td><div style=\"text-align:center;\">3</div></td>\n<td><div
-  style=\"text-align:center;\">3</div></td>\n<td><div style=\"text-align:center;\">5</div></td>\r\n</tr>\n<tr>\n<td><div
-  style=\"text-align:center;\">6</div></td>\n<td><div style=\"text-align:center;\">6</div></td>\r\n<td> </td>\r\n<td><div
-  style=\"text-align:center;\">9</div></td>\n<td><div style=\"text-align:center;\">3</div></td>\n<td><div
-  style=\"text-align:center;\">6</div></td>\r\n</tr>\n<tr>\n<td><div style=\"text-align:center;\">7</div></td>\n<td><div
-  style=\"text-align:center;\">7</div></td>\r\n<td> </td>\r\n<td><div style=\"text-align:center;\">5</div></td>\n<td><div
-  style=\"text-align:center;\">5</div></td>\n<td><div style=\"text-align:center;\">7</div></td>\r\n</tr>\n<tr>\n<td><div
-  style=\"text-align:center;\">8</div></td>\n<td><div style=\"text-align:center;\">2</div></td>\r\n<td> </td>\r\n<td><div
-  style=\"text-align:center;\">6</div></td>\n<td><div style=\"text-align:center;\">6</div></td>\n<td><div
-  style=\"text-align:center;\">8</div></td>\r\n</tr>\n<tr>\n<td><div style=\"text-align:center;\">9</div></td>\n<td><div
-  style=\"text-align:center;\">3</div></td>\r\n<td> </td>\r\n<td><div style=\"text-align:center;\">7</div></td>\n<td><div
-  style=\"text-align:center;\">7</div></td>\n<td><div style=\"text-align:center;\">9</div></td>\r\n</tr>\n<tr>\n<td><div
-  style=\"text-align:center;\">10</div></td>\n<td><div style=\"text-align:center;\">10</div></td>\r\n<td> </td>\r\n<td><div
-  style=\"text-align:center;\">10</div></td>\n<td><div style=\"text-align:center;\">10</div></td>\n<td><div
-  style=\"text-align:center;\">10</div></td>\r\n</tr>\n</table>\n<p>Let E(<i>k</i>)
-  be the <i>k</i>th element in the sorted <i>n</i> column; for example, E(4) = 8 and
-  E(6) = 9.</p>\r\n<p>If rad(<i>n</i>) is sorted for 1 <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><i>n</i>
-  <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"> 100000, find E(10000).</p>\r\n\r\n"
+:content: "The radical of _n_, rad(_n_), is the product of the distinct prime factors
+  of _n_. For example, 504 = 2<sup>3</sup> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  3<sup>2</sup> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  7, so rad(504) = 2 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  3 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) 7 =
+  42.\n\nIf we calculate rad(_n_) for _1_ ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  _n_ ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 10, then
+  sort them on rad(_n_), and sorting on _n_ if the radical values are equal, we get:\n\n|
+  \n**Unsorted**\n |   | \n**Sorted**\n |\n| \n ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  \ \n**_n_**\n | \n ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  \ \n**rad(_n_)**\n | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  \ \n | \n ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)  \n**_n_**\n
+  | \n ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)  \n**rad(_n_)**\n
+  | \n ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)  \n**k**\n
+  |\n| \n1\n | \n1\n |   | \n1\n | \n1\n | \n1\n |\n| \n2\n | \n2\n |   | \n2\n |
+  \n2\n | \n2\n |\n| \n3\n | \n3\n |   | \n4\n | \n2\n | \n3\n |\n| \n4\n | \n2\n
+  |   | \n8\n | \n2\n | \n4\n |\n| \n5\n | \n5\n |   | \n3\n | \n3\n | \n5\n |\n|
+  \n6\n | \n6\n |   | \n9\n | \n3\n | \n6\n |\n| \n7\n | \n7\n |   | \n5\n | \n5\n
+  | \n7\n |\n| \n8\n | \n2\n |   | \n6\n | \n6\n | \n8\n |\n| \n9\n | \n3\n |   |
+  \n7\n | \n7\n | \n9\n |\n| \n10\n | \n10\n |   | \n10\n | \n10\n | \n10\n |\n\nLet
+  E(_k_) be the _k_th element in the sorted _n_ column; for example, E(4) = 8 and
+  E(6) = 9.\n\nIf rad(_n_) is sorted for 1 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  _n_ ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 100000,
+  find E(10000).\n\n"

data/data/problems/125.yml

@@ -2,11 +2,10 @@
 :id: 125
 :name: Palindromic sums
 :url: http://projecteuler.net/problem=125
-:content: "\r\n\n<p>The palindromic number 595 is interesting because it can be written
-  as the sum of consecutive squares: 6<sup>2</sup> + 7<sup>2</sup> + 8<sup>2</sup>
-  + 9<sup>2</sup> + 10<sup>2</sup> + 11<sup>2</sup> + 12<sup>2</sup>.</p>\n<p>There
-  are exactly eleven palindromes below one-thousand that can be written as consecutive
-  square sums, and the sum of these palindromes is 4164. Note that 1 = 0<sup>2</sup>
-  + 1<sup>2</sup> has not been included as this problem is concerned with the squares
-  of positive integers.</p>\n<p>Find the sum of all the numbers less than 10<sup>8</sup>
-  that are both palindromic and can be written as the sum of consecutive squares.</p>\n\r\n"
+:content: |+
+  The palindromic number 595 is interesting because it can be written as the sum of consecutive squares: 6<sup>2</sup> + 7<sup>2</sup> + 8<sup>2</sup> + 9<sup>2</sup> + 10<sup>2</sup> + 11<sup>2</sup> + 12<sup>2</sup>.
+
+  There are exactly eleven palindromes below one-thousand that can be written as consecutive square sums, and the sum of these palindromes is 4164. Note that 1 = 0<sup>2</sup> + 1<sup>2</sup> has not been included as this problem is concerned with the squares of positive integers.
+
+  Find the sum of all the numbers less than 10<sup>8</sup> that are both palindromic and can be written as the sum of consecutive squares.
+

data/data/problems/126.yml

@@ -2,16 +2,15 @@
 :id: 126
 :name: Cuboid layers
 :url: http://projecteuler.net/problem=126
-:content: "\r\n<p>The minimum number of cubes to cover every visible face on a cuboid
-  measuring 3 x 2 x 1 is twenty-two.</p>\r\n<div style=\"text-align:center;\">\r\n<img
-  src=\"project/images/p_126.gif\" width=\"499\" height=\"247\" alt=\"\"><br>\n</div>\r\n<p>If
-  we then add a second layer to this solid it would require forty-six cubes to cover
-  every visible face, the third layer would require seventy-eight cubes, and the fourth
-  layer would require one-hundred and eighteen cubes to cover every visible face.</p>\r\n<p>However,
-  the first layer on a cuboid measuring 5 x 1 x 1 also requires twenty-two cubes;
-  similarly the first layer on cuboids measuring 5 x 3 x 1, 7 x 2 x 1, and 11 x 1 x 1
-  all contain forty-six cubes.</p>\r\n<p>We shall define C(<i>n</i>) to represent
-  the number of cuboids that contain <i>n</i> cubes in one of its layers. So C(22)
-  = 2, C(46) = 4, C(78) = 5, and C(118) = 8.</p>\r\n<p>It turns out that 154 is the
-  least value of <i>n</i> for which C(<i>n</i>) = 10.</p>\r\n<p>Find the least value
-  of <i>n</i> for which C(<i>n</i>) = 1000.</p>\r\n\r\n"
+:content: "The minimum number of cubes to cover every visible face on a cuboid measuring
+  3 x 2 x 1 is twenty-two.\n\n ![](/home/will/src/euler-manager/config/../data/images/p_126.gif)
+  \ \n\nIf we then add a second layer to this solid it would require forty-six cubes
+  to cover every visible face, the third layer would require seventy-eight cubes,
+  and the fourth layer would require one-hundred and eighteen cubes to cover every
+  visible face.\n\nHowever, the first layer on a cuboid measuring 5 x 1 x 1 also requires
+  twenty-two cubes; similarly the first layer on cuboids measuring 5 x 3 x 1, 7 x 2 x 1,
+  and 11 x 1 x 1 all contain forty-six cubes.\n\nWe shall define C(_n_) to represent
+  the number of cuboids that contain _n_ cubes in one of its layers. So C(22) = 2,
+  C(46) = 4, C(78) = 5, and C(118) = 8.\n\nIt turns out that 154 is the least value
+  of _n_ for which C(_n_) = 10.\n\nFind the least value of _n_ for which C(_n_) =
+  1000.\n\n"

data/data/problems/127.yml

@@ -2,30 +2,24 @@
 :id: 127
 :name: abc-hits
 :url: http://projecteuler.net/problem=127
-:content: "\r\n<p>The radical of <i>n</i>, rad(<i>n</i>), is the product of distinct
-  prime factors of <i>n</i>. For example, 504 = 2<sup>3</sup><img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">
-  3<sup>2</sup><img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\"
-  border=\"0\" style=\"vertical-align:middle;\"> 7, so rad(504) = 2 <img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">
-  3 <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\"> 7 = 42.</p>\r\n<p>We shall define the triplet
-  of positive integers (<i>a</i>, <i>b</i>, <i>c</i>) to be an abc-hit if:</p>\r\n<ol>\n<li>GCD(<i>a,</i>
-  <i>b</i>) = GCD(<i>a</i>, <i>c</i>) = GCD(<i>b</i>, <i>c</i>) = 1</li>\r\n<li>\n<i>a</i>
-  <img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\"
-  style=\"vertical-align:middle;\"><i>b</i>\n</li>\r\n<li>\n<i>a</i> + <i>b</i> =
-  <i>c</i>\n</li>\r\n<li>rad(<i>abc</i>) <img src=\"images/symbol_lt.gif\" width=\"10\"
-  height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\"><i>c</i>\n</li>\r\n</ol>\n<p>For
-  example, (5, 27, 32) is an abc-hit, because:</p>\r\n<ol>\n<li>GCD(5, 27) = GCD(5,
-  32) = GCD(27, 32) = 1</li>\r\n<li>5 <img src=\"images/symbol_lt.gif\" width=\"10\"
-  height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\"> 27</li>\r\n<li>5
-  + 27 = 32</li>\r\n<li>rad(4320) = 30 <img src=\"images/symbol_lt.gif\" width=\"10\"
-  height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\"> 32</li>\r\n</ol>\n<p>It
-  turns out that abc-hits are quite rare and there are only thirty-one abc-hits for
-  <i>c</i> <img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\"
-  border=\"0\" style=\"vertical-align:middle;\"> 1000, with <img src=\"images/symbol_sum.gif\"
-  width=\"11\" height=\"14\" alt=\"∑\" border=\"0\" style=\"vertical-align:middle;\"><i>c</i>
-  = 12523.</p>\r\n<p>Find <img src=\"images/symbol_sum.gif\" width=\"11\" height=\"14\"
-  alt=\"∑\" border=\"0\" style=\"vertical-align:middle;\"><i>c</i> for <i>c</i> <img
-  src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\"
-  style=\"vertical-align:middle;\"> 120000.</p>\r\n\r\n"
+:content: |+
+  The radical of _n_, rad(_n_), is the product of distinct prime factors of _n_. For example, 504 = 2<sup>3</sup> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) 3<sup>2</sup> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) 7, so rad(504) = 2 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) 3 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) 7 = 42.
+
+  We shall define the triplet of positive integers (_a_, _b_, _c_) to be an abc-hit if:
+
+  1. GCD(_a,_ _b_) = GCD(_a_, _c_) = GCD(_b_, _c_) = 1
+  2. _a_ ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif) _b_
+  3. _a_ + _b_ = _c_
+  4. rad(_abc_) ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif) _c_
+
+  For example, (5, 27, 32) is an abc-hit, because:
+
+  1. GCD(5, 27) = GCD(5, 32) = GCD(27, 32) = 1
+  2. 5 ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif) 27
+  3. 5 + 27 = 32
+  4. rad(4320) = 30 ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif) 32
+
+  It turns out that abc-hits are quite rare and there are only thirty-one abc-hits for _c_ ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif) 1000, with ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif)_c_ = 12523.
+
+  Find ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif)_c_ for _c_ ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif) 120000.
+