euler-manager 0.0.5 → 0.0.6

data/data/problems/22.yml

@@ -2,12 +2,10 @@
 :id: 22
 :name: Names scores
 :url: http://projecteuler.net/problem=22
-:content: "\r\n\n<p>Using <a href=\"project/names.txt\">names.txt</a> (right click
-  and 'Save Link/Target As...'), a 46K text file containing over five-thousand first
-  names, begin by sorting it into alphabetical order. Then working out the alphabetical
-  value for each name, multiply this value by its alphabetical position in the list
-  to obtain a name score.</p>\n<p>For example, when the list is sorted into alphabetical
-  order, COLIN, which is worth 3 + 15 + 12 + 9 + 14 = 53, is the 938th name in the
-  list. So, COLIN would obtain a score of 938 <img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">
-  53 = 49714.</p>\n<p>What is the total of all the name scores in the file?</p>\n\r\n"
+:content: |+
+  Using [names.txt](project/names.txt) (right click and 'Save Link/Target As...'), a 46K text file containing over five-thousand first names, begin by sorting it into alphabetical order. Then working out the alphabetical value for each name, multiply this value by its alphabetical position in the list to obtain a name score.
+
+  For example, when the list is sorted into alphabetical order, COLIN, which is worth 3 + 15 + 12 + 9 + 14 = 53, is the 938th name in the list. So, COLIN would obtain a score of 938 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) 53 = 49714.
+
+  What is the total of all the name scores in the file?
+

data/data/problems/220.yml

@@ -2,23 +2,18 @@
 :id: 220
 :name: Heighway Dragon
 :url: http://projecteuler.net/problem=220
-:content: "\r\n<p>Let <b><i>D</i></b><sub>0</sub> be the two-letter string \"Fa\".
-  \ For n<img src=\"images/symbol_ge.gif\" width=\"10\" height=\"12\" alt=\"≥\" border=\"0\"
-  style=\"vertical-align:middle;\">1, derive <b><i>D</i></b><sub>n</sub> from <b><i>D</i></b><sub>n-1</sub>
-  by the string-rewriting rules:</p>\r\n\r\n<p style=\"margin-left:40px;\">\"a\" <img
-  src=\"images/symbol_maps.gif\" width=\"15\" height=\"7\" alt=\"→\" border=\"0\"
-  style=\"vertical-align:middle;\"> \"aRbFR\"<br>\r\n\"b\" <img src=\"images/symbol_maps.gif\"
-  width=\"15\" height=\"7\" alt=\"→\" border=\"0\" style=\"vertical-align:middle;\">
-  \"LFaLb\"</p>\r\n\r\n<p>Thus, <b><i>D</i></b><sub>0</sub> = \"Fa\", <b><i>D</i></b><sub>1</sub>
-  = \"FaRbFR\", <b><i>D</i></b><sub>2</sub> = \"FaRbFRRLFaLbFR\", and so on.</p>\r\n\r\n<p>These
-  strings can be interpreted as instructions to a computer graphics program, with
-  \"F\" meaning \"draw forward one unit\", \"L\" meaning \"turn left 90 degrees\",
-  \"R\" meaning \"turn right 90 degrees\", and \"a\" and \"b\" being ignored.  The
-  initial position of the computer cursor is (0,0), pointing up towards (0,1).</p>\r\n\r\n<p>Then
-  <b><i>D</i></b><sub>n</sub> is an exotic drawing known as the <i>Heighway Dragon</i>
-  of order <i>n</i>.  For example, <b><i>D</i></b><sub>10</sub> is shown below; counting
-  each \"F\" as one step, the highlighted spot at (18,16) is the position reached
-  after 500 steps.</p>\r\n\r\n<div style=\"text-align:center;\">\r\n<img src=\"project/images/p_220.gif\"
-  alt=\"\">\n</div>\r\n\r\n<p>What is the position of the cursor after 10<sup>12</sup>
-  steps in <b><i>D</i></b><sub>50</sub> ?<br>\r\nGive your answer in the form <i>x</i>,<i>y</i>
-  with no spaces.</p>\r\n\r\n"
+:content: "Let **_D_** <sub>0</sub> be the two-letter string \"Fa\". For n ![≥](/home/will/src/euler-manager/config/../data/images/symbol_ge.gif)1,
+  derive **_D_** <sub>n</sub> from **_D_** <sub>n-1</sub> by the string-rewriting
+  rules:\n\n\"a\" ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif)
+  \"aRbFR\"  \n\r\"b\" ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif)
+  \"LFaLb\"\n\nThus, **_D_** <sub>0</sub> = \"Fa\", **_D_** <sub>1</sub> = \"FaRbFR\",
+  **_D_** <sub>2</sub> = \"FaRbFRRLFaLbFR\", and so on.\n\nThese strings can be interpreted
+  as instructions to a computer graphics program, with \"F\" meaning \"draw forward
+  one unit\", \"L\" meaning \"turn left 90 degrees\", \"R\" meaning \"turn right 90
+  degrees\", and \"a\" and \"b\" being ignored. The initial position of the computer
+  cursor is (0,0), pointing up towards (0,1).\n\nThen **_D_** <sub>n</sub> is an exotic
+  drawing known as the _Heighway Dragon_ of order _n_. For example, **_D_** <sub>10</sub>
+  is shown below; counting each \"F\" as one step, the highlighted spot at (18,16)
+  is the position reached after 500 steps.\n\n ![](/home/will/src/euler-manager/config/../data/images/p_220.gif)\n\nWhat
+  is the position of the cursor after 10<sup>12</sup> steps in **_D_** <sub>50</sub>
+  ?  \n\rGive your answer in the form _x_,_y_ with no spaces.\n\n"

data/data/problems/221.yml

@@ -2,19 +2,13 @@
 :id: 221
 :name: Alexandrian Integers
 :url: http://projecteuler.net/problem=221
-:content: "\r\n<p>We shall call a positive integer <var>A</var> an \"Alexandrian integer\",
-  if there exist integers <var>p</var>, <var>q</var>, <var>r</var> such that:</p>\r\n\r\n<table
-  class=\"formula\" style=\"margin-left:50px;\"><tr>\n<td>\r\n      <var>A</var> =
-  <var>p</var> · <var>q</var> · <var>r</var>    and  \r\n   </td>\r\n   <td>\r\n      <table
-  class=\"frac\">\n<tr><td>1</td></tr>\n<tr><td class=\"overline\"><var>A</var></td></tr>\n</table>\n</td>\r\n
-  \  <td>=</td>\r\n   <td>\r\n      <table class=\"frac\">\n<tr><td>1</td></tr>\n<tr><td
-  class=\"overline\"><var>p</var></td></tr>\n</table>\n</td>\r\n   <td>+</td>\r\n
-  \  <td>\r\n      <table class=\"frac\">\n<tr><td>1</td></tr>\n<tr><td class=\"overline\"><var>q</var></td></tr>\n</table>\n</td>\r\n
-  \  <td>+</td>\r\n   <td>\r\n      <table class=\"frac\">\n<tr><td>1</td></tr>\n<tr><td
-  class=\"overline\"><var>r</var></td></tr>\n</table>\n</td>\r\n</tr></table>\n<p>For
-  example, 630 is an Alexandrian integer (<var>p</var> = 5, <var>q</var> = <img src=\"images/symbol_minus.gif\"
-  width=\"9\" height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">7,
-  <var>r</var> = <img src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\"
-  border=\"0\" style=\"vertical-align:middle;\">18).\r\nIn fact, 630 is the 6<sup>th</sup>
-  Alexandrian integer,  the first 6 Alexandrian integers being: 6, 42, 120, 156, 420
-  and 630.</p>\r\n\r\n<p>Find the 150000<sup>th</sup> Alexandrian integer.</p>\r\n"
+:content: "We shall call a positive integer <var>A</var> an \"Alexandrian integer\",
+  if there exist integers <var>p</var>, <var>q</var>, <var>r</var> such that:\n\n|
+  <var>A</var> = <var>p</var> · <var>q</var> · <var>r</var>    and  \r | \n\n| 1 |\n|
+  <var>A</var> |\n\n | = | \n\n| 1 |\n| <var>p</var> |\n\n | + | \n\n| 1 |\n| <var>q</var>
+  |\n\n | + | \n\n| 1 |\n| <var>r</var> |\n\n |\n\nFor example, 630 is an Alexandrian
+  integer (<var>p</var> = 5, <var>q</var> =  ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)7,
+  <var>r</var> =  ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)18).\rIn
+  fact, 630 is the 6<sup>th</sup> Alexandrian integer, the first 6 Alexandrian integers
+  being: 6, 42, 120, 156, 420 and 630.\n\nFind the 150000<sup>th</sup> Alexandrian
+  integer.\n\n"

data/data/problems/222.yml

@@ -2,6 +2,8 @@
 :id: 222
 :name: Sphere Packing
 :url: http://projecteuler.net/problem=222
-:content: "\r\n<p>What is the length of the shortest pipe, of internal radius 50mm,
-  that can fully contain 21 balls of radii 30mm, 31mm, ..., 50mm?</p>\r\n\r\n<p>Give
-  your answer in micrometres (10<sup>-6</sup> m) rounded to the nearest integer.</p>\r\n"
+:content: |+
+  What is the length of the shortest pipe, of internal radius 50mm, that can fully contain 21 balls of radii 30mm, 31mm, ..., 50mm?
+
+  Give your answer in micrometres (10<sup>-6</sup> m) rounded to the nearest integer.
+

data/data/problems/223.yml

@@ -2,11 +2,9 @@
 :id: 223
 :name: Almost right-angled triangles I
 :url: http://projecteuler.net/problem=223
-:content: "\r\n<p>Let us call an integer sided triangle with sides <var>a</var> <img
-  src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>b</var>
-  <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>c</var> <i>barely acute</i> if the sides satisfy
-  <br><var>a</var><sup>2</sup> + <var>b</var><sup>2</sup> = <var>c</var><sup>2</sup>
-  + 1.</p>\r\n\r\n<p>How many barely acute triangles are there with perimeter <img
-  src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  25,000,000?</p>\r\n\r\n \r\n\r\n"
+:content: "Let us call an integer sided triangle with sides <var>a</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>b</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>c</var> _barely acute_ if the sides satisfy   \n <var>a</var><sup>2</sup> +
+  <var>b</var><sup>2</sup> = <var>c</var><sup>2</sup> + 1.\n\nHow many barely acute
+  triangles are there with perimeter ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  25,000,000?\n\n"

data/data/problems/224.yml

@@ -2,11 +2,9 @@
 :id: 224
 :name: Almost right-angled triangles II
 :url: http://projecteuler.net/problem=224
-:content: "\r\n<p>Let us call an integer sided triangle with sides <var>a</var> <img
-  src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>b</var>
-  <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>c</var> <i>barely obtuse</i> if the sides
-  satisfy <br><var>a</var><sup>2</sup> + <var>b</var><sup>2</sup> = <var>c</var><sup>2</sup>
-  - 1.</p>\r\n\r\n<p>How many barely obtuse triangles are there with perimeter <img
-  src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  75,000,000?</p>\r\n\r\n"
+:content: "Let us call an integer sided triangle with sides <var>a</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>b</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>c</var> _barely obtuse_ if the sides satisfy   \n <var>a</var><sup>2</sup>
+  + <var>b</var><sup>2</sup> = <var>c</var><sup>2</sup> - 1.\n\nHow many barely obtuse
+  triangles are there with perimeter ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  75,000,000?\n\n"

data/data/problems/225.yml

@@ -2,10 +2,9 @@
 :id: 225
 :name: Tribonacci non-divisors
 :url: http://projecteuler.net/problem=225
-:content: "\r\n<p>\r\nThe sequence 1, 1, 1, 3, 5, 9, 17, 31, 57, 105, 193, 355, 653,
-  1201 ...<br>\r\nis defined by T<sub>1</sub> = T<sub>2</sub> = T<sub>3</sub> = 1
-  and T<sub><var>n</var></sub> = T<sub><var>n</var>-1</sub> + T<sub><var>n</var>-2</sub>
-  + T<sub><var>n</var>-3</sub>.\r\n</p>\r\n<p>\r\nIt can be shown that 27 does not
-  divide any terms of this sequence.<br>In fact, 27 is the first odd number with this
-  property.</p>\r\n<p>\r\nFind the 124<sup>th</sup> odd number that does not divide
-  any terms of the above sequence.</p>\r\n"
+:content: "The sequence 1, 1, 1, 3, 5, 9, 17, 31, 57, 105, 193, 355, 653, 1201 ...
+  \ \n\ris defined by T<sub>1</sub> = T<sub>2</sub> = T<sub>3</sub> = 1 and T<sub><var>n</var></sub>
+  = T<sub><var>n</var>-1</sub> + T<sub><var>n</var>-2</sub> + T<sub><var>n</var>-3</sub>.\n\nIt
+  can be shown that 27 does not divide any terms of this sequence.  \nIn fact, 27
+  is the first odd number with this property.\n\nFind the 124<sup>th</sup> odd number
+  that does not divide any terms of the above sequence.\n\n"

data/data/problems/226.yml

@@ -2,15 +2,12 @@
 :id: 226
 :name: A Scoop of Blancmange
 :url: http://projecteuler.net/problem=226
-:content: "\r\n<p>The <i>blancmange curve</i> is the set of points (<var>x</var>,<var>y</var>)
-  such that 0 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\"
-  border=\"0\" style=\"vertical-align:middle;\"> <var>x</var> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> 1
-  and <img src=\"project/images/p_226_formula.gif\" style=\"vertical-align:middle;\"
-  alt=\"\"> ,<br>where <var>s</var>(<var>x</var>) = the distance from <var>x</var>
-  to the nearest integer.</p>\r\n\r\n<p>The area under the blancmange curve is equal
-  to ½, shown in pink in the diagram below.</p>\r\n\r\n<div style=\"text-align:center;\">\r\n<img
-  src=\"project/images/p_226_scoop2.gif\" alt=\"blancmange curve\">\n</div>\r\n\r\n<p>Let
-  <var>C</var> be the circle with centre (¼,&amp;frac12) and radius ¼, shown in black
-  in the diagram.</p>\r\n\r\n<p>What area under the blancmange curve is enclosed by
-  <var>C</var>?<br>Give your answer rounded to eight decimal places in the form <i>0.abcdefgh</i></p>\r\n\r\n"
+:content: "The _blancmange curve_ is the set of points (<var>x</var>,<var>y</var>)
+  such that 0  ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) <var>x</var> 
+  ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 1 and ![](/home/will/src/euler-manager/config/../data/images/p_226_formula.gif)
+  ,  \nwhere <var>s</var>(<var>x</var>) = the distance from <var>x</var> to the nearest
+  integer.\n\nThe area under the blancmange curve is equal to ½, shown in pink in
+  the diagram below.\n\n ![blancmange curve](/home/will/src/euler-manager/config/../data/images/p_226_scoop2.gif)\n\nLet
+  <var>C</var> be the circle with centre (¼,&frac12) and radius ¼, shown in black
+  in the diagram.\n\nWhat area under the blancmange curve is enclosed by <var>C</var>?
+  \ \nGive your answer rounded to eight decimal places in the form _0.abcdefgh_\n\n"

data/data/problems/227.yml

@@ -2,12 +2,12 @@
 :id: 227
 :name: The Chase
 :url: http://projecteuler.net/problem=227
-:content: "\r\n<p>\"<i>The Chase</i>\" is a game played with two dice and an even
-  number of players.</p>\r\n\r\n<p>The players sit around a table; the game begins
-  with two opposite players having one die each. On each turn, the two players with
-  a die roll it.<br>\r\nIf a player rolls a 1, he passes the die to his neighbour
-  on the left; if he rolls a 6, he passes the die to his neighbour on the right; otherwise,
-  he keeps the die for the next turn.<br>\r\nThe game ends when one player has both
-  dice after they have been rolled and passed; that player has then lost.</p>\r\n\r\n<p>In
-  a game with 100 players, what is the expected number of turns the game lasts?</p>\r\n<p>Give
-  your answer rounded to ten significant digits.</p>\r\n"
+:content: "\"_The Chase_\" is a game played with two dice and an even number of players.\n\nThe
+  players sit around a table; the game begins with two opposite players having one
+  die each. On each turn, the two players with a die roll it.  \n\rIf a player rolls
+  a 1, he passes the die to his neighbour on the left; if he rolls a 6, he passes
+  the die to his neighbour on the right; otherwise, he keeps the die for the next
+  turn.  \n\rThe game ends when one player has both dice after they have been rolled
+  and passed; that player has then lost.\n\nIn a game with 100 players, what is the
+  expected number of turns the game lasts?\n\nGive your answer rounded to ten significant
+  digits.\n\n"

data/data/problems/228.yml

@@ -2,22 +2,19 @@
 :id: 228
 :name: Minkowski Sums
 :url: http://projecteuler.net/problem=228
-:content: "\r\n<p>Let <var>S</var><sub>n</sub> be the regular <var>n</var>-sided polygon
-  – or <i>shape</i> – whose vertices \r\n\r\n<var>v</var><sub><var>k</var></sub> (<var>k</var> = 1,2,…,<var>n</var>)
-  have coordinates:</p>\r\n<table>\n<tr>\n<td width=\"40\"></td>\r\n    <td>\n<var>x</var><sub><var>k</var></sub>   =
-   \r\n        cos( <sup>2<var>k</var>-1</sup>/<sub><var>n</var></sub><img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">180° )</td>\r\n
-  \ </tr>\n<tr>\n<td width=\"40\"></td>\r\n    <td>\n<var>y</var><sub><var>k</var></sub>   =
-   \r\n        sin( <sup>2<var>k</var>-1</sup>/<sub><var>n</var></sub><img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">180° )</td>\r\n
-  \ </tr>\n</table>\n<p>Each <var>S</var><sub><var>n</var></sub> is to be interpreted
-  as a filled shape consisting of all points on the perimeter and in the interior.</p>\r\n\r\n<p>The
-  <i>Minkowski sum</i>, <var>S</var>+<var>T</var>, of two shapes <var>S</var> and
-  <var>T</var> is the result of \r\n\r\nadding every point in <var>S</var> to every
-  point in <var>T</var>, where point addition is performed coordinate-wise: \r\n\r\n(<var>u</var>, <var>v</var>)
-  + (<var>x</var>, <var>y</var>) = (<var>u</var>+<var>x</var>, <var>v</var>+<var>y</var>).</p>\r\n\r\n<p>For
+:content: "Let <var>S</var><sub>n</sub> be the regular <var>n</var>-sided polygon
+  – or _shape_ – whose vertices \r\r<var>v</var><sub><var>k</var></sub> (<var>k</var> = 1,2,…,<var>n</var>)
+  have coordinates:\n\n| | <var>x</var><sub><var>k</var></sub>   =  \r cos( <sup>2<var>k</var>-1</sup>/<sub><var>n</var></sub>
+  ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)180° )
+  |\n| | <var>y</var><sub><var>k</var></sub>   =  \r sin( <sup>2<var>k</var>-1</sup>/<sub><var>n</var></sub>
+  ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)180° )
+  |\n\nEach <var>S</var><sub><var>n</var></sub> is to be interpreted as a filled shape
+  consisting of all points on the perimeter and in the interior.\n\nThe _Minkowski
+  sum_, <var>S</var>+<var>T</var>, of two shapes <var>S</var> and <var>T</var> is
+  the result of \r\radding every point in <var>S</var> to every point in <var>T</var>,
+  where point addition is performed coordinate-wise: \r\r(<var>u</var>, <var>v</var>)
+  + (<var>x</var>, <var>y</var>) = (<var>u</var>+<var>x</var>, <var>v</var>+<var>y</var>).\n\nFor
   example, the sum of <var>S</var><sub>3</sub> and <var>S</var><sub>4</sub> is the
-  six-sided shape shown in pink below:</p>\r\n\r\n<div style=\"text-align:center;\">\r\n<img
-  src=\"project/images/p_228.png\" alt=\"picture showing S_3 + S_4\">\n</div>\r\n\r\n<p>How
+  six-sided shape shown in pink below:\n\n ![picture showing S_3 + S_4](/home/will/src/euler-manager/config/../data/images/p_228.png)\n\nHow
   many sides does <var>S</var><sub>1864</sub> + <var>S</var><sub>1865</sub> + … + <var>S</var><sub>1909</sub>
-  have?</p>\r\n"
+  have?\n\n"

data/data/problems/229.yml

@@ -2,29 +2,21 @@
 :id: 229
 :name: Four Representations using Squares
 :url: http://projecteuler.net/problem=229
-:content: "\r\n<p>Consider the number 3600. It is very special, because</p>\r\n<div
-  style=\"margin-left:200px;\">\r\n3600 = 48<sup>2</sup> +     36<sup>2</sup><br><br>\r\n3600
-  = 20<sup>2</sup> + 2<img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\"
-  alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">40<sup>2</sup><br><br>\r\n3600
-  = 30<sup>2</sup> + 3<img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\"
-  alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">30<sup>2</sup><br><br>\r\n3600
-  = 45<sup>2</sup> + 7<img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\"
-  alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">15<sup>2</sup><br><br>\n</div>\r\n\r\n<p>Similarly,
-  we find that 88201 = 99<sup>2</sup> + 280<sup>2</sup> = 287<sup>2</sup> + 2<img
-  src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\">54<sup>2</sup> = 283<sup>2</sup> + 3<img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">52<sup>2</sup>
-  = 197<sup>2</sup> + 7<img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\"
-  alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">84<sup>2</sup>.</p>\r\n\r\n<p>In
-  1747, Euler proved which numbers are representable as a sum of two squares.\r\nWe
+:content: "Consider the number 3600. It is very special, because\n\n\r3600 = 48<sup>2</sup>
+  +     36<sup>2</sup>  \n  \n  \n\r3600 = 20<sup>2</sup> + 2 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)40<sup>2</sup>
+  \ \n  \n  \n\r3600 = 30<sup>2</sup> + 3 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)30<sup>2</sup>
+  \ \n  \n  \n\r3600 = 45<sup>2</sup> + 7 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)15<sup>2</sup>
+  \ \n  \n  \n\nSimilarly, we find that 88201 = 99<sup>2</sup> + 280<sup>2</sup> =
+  287<sup>2</sup> + 2 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)54<sup>2</sup>
+  = 283<sup>2</sup> + 3 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)52<sup>2</sup>
+  = 197<sup>2</sup> + 7 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)84<sup>2</sup>.\n\nIn
+  1747, Euler proved which numbers are representable as a sum of two squares.\rWe
   are interested in the numbers <var>n</var> which admit representations of all of
-  the following four types:</p>\r\n<div style=\"margin-left:200px;\">\r\n<var>n</var>
-  = <var>a<sub>1</sub></var><sup>2</sup> +   <var>b<sub>1</sub></var><sup>2</sup><br><br><var>n</var>
-  = <var>a<sub>2</sub></var><sup>2</sup> + 2 <var>b<sub>2</sub></var><sup>2</sup><br><br><var>n</var>
-  = <var>a<sub>3</sub></var><sup>2</sup> + 3 <var>b<sub>3</sub></var><sup>2</sup><br><br><var>n</var>
-  = <var>a<sub>7</sub></var><sup>2</sup> + 7 <var>b<sub>7</sub></var><sup>2</sup>,\r\n</div>\r\n<p>where
-  the <var>a</var><sub><var>k</var></sub> and <var>b</var><sub><var>k</var></sub>
-  are positive integers.</p>\r\n\r\n<p>There are 75373 such numbers that do not exceed
-  10<sup>7</sup>.<br>\r\n\r\nHow many such numbers are there that do not exceed 2<img
-  src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\">10<sup>9</sup>?</p>\r\n"
+  the following four types:\n\n<var>n</var> = <var>a<sub>1</sub></var><sup>2</sup>
+  +   <var>b<sub>1</sub></var><sup>2</sup>  \n  \n  \n<var>n</var> = <var>a<sub>2</sub></var><sup>2</sup>
+  + 2 <var>b<sub>2</sub></var><sup>2</sup>  \n  \n  \n<var>n</var> = <var>a<sub>3</sub></var><sup>2</sup>
+  + 3 <var>b<sub>3</sub></var><sup>2</sup>  \n  \n  \n<var>n</var> = <var>a<sub>7</sub></var><sup>2</sup>
+  + 7 <var>b<sub>7</sub></var><sup>2</sup>,\r\n\nwhere the <var>a</var><sub><var>k</var></sub>
+  and <var>b</var><sub><var>k</var></sub> are positive integers.\n\nThere are 75373
+  such numbers that do not exceed 10<sup>7</sup>.  \n\r\rHow many such numbers are
+  there that do not exceed 2 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)10<sup>9</sup>?\n\n"

data/data/problems/23.yml

@@ -2,18 +2,14 @@
 :id: 23
 :name: Non-abundant sums
 :url: http://projecteuler.net/problem=23
-:content: "\r\n<p>A perfect number is a number for which the sum of its proper divisors
-  is exactly equal to the number. For example, the sum of the proper divisors of 28
-  would be 1 + 2 + 4 + 7 + 14 = 28, which means that 28 is a perfect number.</p>\r\n<p>A
-  number <var>n</var> is called deficient if the sum of its proper divisors is less
-  than <var>n</var> and it is called abundant if this sum exceeds <var>n</var>.</p>\r\n<!--
-  <p>A number whose proper divisors are less than the number is called deficient and
-  a number whose proper divisors exceed the number is called abundant.</p> -->\r\n<p>As
-  12 is the smallest abundant number, 1 + 2 + 3 + 4 + 6 = 16, the smallest number
-  that can be written as the sum of two abundant numbers is 24. By mathematical analysis,
-  it can be shown that all integers greater than 28123 can be written as the sum of
-  two abundant numbers. However, this upper limit cannot be reduced any further by
-  analysis even though it is known that the greatest number that cannot be expressed
-  as the sum of two abundant numbers is less than this limit.</p>\r\n<p>Find the sum
-  of all the positive integers which cannot be written as the sum of two abundant
-  numbers.</p>\r\n\r\n"
+:content: |+
+  A perfect number is a number for which the sum of its proper divisors is exactly equal to the number. For example, the sum of the proper divisors of 28 would be 1 + 2 + 4 + 7 + 14 = 28, which means that 28 is a perfect number.
+
+  A number <var>n</var> is called deficient if the sum of its proper divisors is less than <var>n</var> and it is called abundant if this sum exceeds <var>n</var>.
+
+  <!-- <p>A number whose proper divisors are less than the number is called deficient and a number whose proper divisors exceed the number is called abundant.</p> -->
+
+  As 12 is the smallest abundant number, 1 + 2 + 3 + 4 + 6 = 16, the smallest number that can be written as the sum of two abundant numbers is 24. By mathematical analysis, it can be shown that all integers greater than 28123 can be written as the sum of two abundant numbers. However, this upper limit cannot be reduced any further by analysis even though it is known that the greatest number that cannot be expressed as the sum of two abundant numbers is less than this limit.
+
+  Find the sum of all the positive integers which cannot be written as the sum of two abundant numbers.
+

data/data/problems/230.yml

@@ -2,22 +2,18 @@
 :id: 230
 :name: Fibonacci Words
 :url: http://projecteuler.net/problem=230
-:content: "\r\n<p>For any two strings of digits, A and B, we define F<sub>A,B</sub>
-  to be the sequence (A,B,AB,BAB,ABBAB,...) in which each term is the concatenation
-  of the previous two.</p>\r\n\r\n<p>Further, we define D<sub>A,B</sub>(<var>n</var>)
-  to be the <var>n</var><sup>th</sup> digit in the first term of F<sub>A,B</sub> that
-  contains at least <var>n</var> digits.</p>\r\n\r\n<p>Example:</p>\r\n\r\n<p>Let
-  A=1415926535, B=8979323846. We wish to find D<sub>A,B</sub>(35), say.</p>\r\n\r\n<p>The
-  first few terms of F<sub>A,B</sub> are:<br>\r\n1415926535<br>\r\n8979323846<br>\r\n14159265358979323846<br>\r\n897932384614159265358979323846<br>\r\n1415926535897932384689793238461415<span
-  style=\"color: #FF0000\"><b>9</b></span>265358979323846<br></p>\r\n\r\n<p>Then D<sub>A,B</sub>(35)
-  is the 35<sup>th</sup> digit in the fifth term, which is 9.</p>\r\n\r\n<p>Now we
-  use for A the first 100 digits of π behind the decimal point:</p>\r\n<p>14159265358979323846264338327950288419716939937510
-  <br>\r\n58209749445923078164062862089986280348253421170679 </p>\r\n\r\n<p>and for
-  B the next hundred digits:</p>\r\n\r\n<p>82148086513282306647093844609550582231725359408128
-  <br>\r\n48111745028410270193852110555964462294895493038196 .</p>\r\n\r\n<p>Find
-  <img src=\"images/symbol_sum.gif\" width=\"11\" height=\"14\" alt=\"∑\" border=\"0\"
-  style=\"vertical-align:middle;\"><sub><var>n</var> = 0,1,...,17</sub>   10<sup><var>n</var></sup><img
-  src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\"> D<sub>A,B</sub>((127+19<var>n</var>)<img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">7<sup><var>n</var></sup>)
-  .</p>\r\n\r\n\r\n\r\n \r\n\r\n"
+:content: "For any two strings of digits, A and B, we define F<sub>A,B</sub> to be
+  the sequence (A,B,AB,BAB,ABBAB,...) in which each term is the concatenation of the
+  previous two.\n\nFurther, we define D<sub>A,B</sub>(<var>n</var>) to be the <var>n</var><sup>th</sup>
+  digit in the first term of F<sub>A,B</sub> that contains at least <var>n</var> digits.\n\nExample:\n\nLet
+  A=1415926535, B=8979323846. We wish to find D<sub>A,B</sub>(35), say.\n\nThe first
+  few terms of F<sub>A,B</sub> are:  \n\r1415926535  \n\r8979323846  \n\r14159265358979323846
+  \ \n\r897932384614159265358979323846  \n\r1415926535897932384689793238461415 **9**
+  265358979323846\n\nThen D<sub>A,B</sub>(35) is the 35<sup>th</sup> digit in the
+  fifth term, which is 9.\n\nNow we use for A the first 100 digits of π behind the
+  decimal point:\n\n14159265358979323846264338327950288419716939937510   \n\r58209749445923078164062862089986280348253421170679\n\nand
+  for B the next hundred digits:\n\n82148086513282306647093844609550582231725359408128
+  \  \n\r48111745028410270193852110555964462294895493038196 .\n\nFind ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif)<sub><var>n</var>
+  = 0,1,...,17</sub>   10<sup><var>n</var></sup> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  D<sub>A,B</sub>((127+19<var>n</var>) ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)7<sup><var>n</var></sup>)
+  .\n\n"

data/data/problems/231.yml

@@ -2,15 +2,11 @@
 :id: 231
 :name: The prime factorisation of binomial coefficients
 :url: http://projecteuler.net/problem=231
-:content: "\r\n<p>The binomial coefficient <sup>10</sup>C<sub>3</sub> = 120.<br>\r\n120
-  = 2<sup>3</sup><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;\">
-  5 = 2 <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\"> 2 <img src=\"images/symbol_times.gif\" width=\"9\"
-  height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"> 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;\"> 5, and 2 + 2 + 2 + 3 + 5 = 14.<br>\r\nSo the sum
-  of the terms in the prime factorisation of <sup>10</sup>C<sub>3</sub> is 14.\r\n<br><br>\r\nFind
-  the sum of the terms in the prime factorisation of <sup>20000000</sup>C<sub>15000000</sub>.\r\n</p>\r\n"
+:content: "The binomial coefficient <sup>10</sup>C<sub>3</sub> = 120.  \n\r120 = 2<sup>3</sup>
+  ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) 3 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  5 = 2 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  2 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) 2 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  3 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) 5, and
+  2 + 2 + 2 + 3 + 5 = 14.  \n\rSo the sum of the terms in the prime factorisation
+  of <sup>10</sup>C<sub>3</sub> is 14.\r  \n  \n  \n\rFind the sum of the terms in
+  the prime factorisation of <sup>20000000</sup>C<sub>15000000</sub>.\n\n"

data/data/problems/232.yml

@@ -2,13 +2,12 @@
 :id: 232
 :name: The Race
 :url: http://projecteuler.net/problem=232
-:content: "\r\n<p>Two players share an unbiased coin and take it in turns to play
-  \"The Race\". On Player 1's turn, he tosses the coin once: if it comes up Heads,
-  he scores one point; if it comes up Tails, he scores nothing. On Player 2's turn,
-  she chooses a positive integer <var>T</var> and tosses the coin <var>T</var> times:
-  if it comes up all Heads, she scores 2<sup><var>T</var>-1</sup> points; otherwise,
-  she scores nothing. Player 1 goes first. The winner is the first to 100 or more
-  points.</p>\r\n\r\n<p>On each turn Player 2 selects the number, <var>T</var>, of
-  coin tosses that maximises the probability of her winning.</p>\r\n\r\n<p>What is
-  the probability that Player 2 wins?</p>\r\n\r\n<p>Give your answer rounded to eight
-  decimal places in the form 0.<i>abcdefgh</i> .</p>\r\n"
+:content: |+
+  Two players share an unbiased coin and take it in turns to play "The Race". On Player 1's turn, he tosses the coin once: if it comes up Heads, he scores one point; if it comes up Tails, he scores nothing. On Player 2's turn, she chooses a positive integer <var>T</var> and tosses the coin <var>T</var> times: if it comes up all Heads, she scores 2<sup><var>T</var>-1</sup> points; otherwise, she scores nothing. Player 1 goes first. The winner is the first to 100 or more points.
+
+  On each turn Player 2 selects the number, <var>T</var>, of coin tosses that maximises the probability of her winning.
+
+  What is the probability that Player 2 wins?
+
+  Give your answer rounded to eight decimal places in the form 0._abcdefgh_ .
+

data/data/problems/233.yml

@@ -2,9 +2,10 @@
 :id: 233
 :name: Lattice points on a circle
 :url: http://projecteuler.net/problem=233
-:content: "\r\n<p>Let <var>f</var>(<var>N</var>) be the number of points with integer
-  coordinates that are on a circle passing through (0,0), (<var>N</var>,0),(0,<var>N</var>),
-  and (<var>N</var>,<var>N</var>).</p>\r\n<p>It can be shown that <var>f</var>(10000) = 36.</p>\r\n\r\n<p>What
-  is the sum of all positive integers <var>N</var> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> 10<sup>11</sup>
-  such that <var>f</var>(<var>N</var>) = 420 ?</p>\r\n"
+:content: |+
+  Let <var>f</var>(<var>N</var>) be the number of points with integer coordinates that are on a circle passing through (0,0), (<var>N</var>,0),(0,<var>N</var>), and (<var>N</var>,<var>N</var>).
+
+  It can be shown that <var>f</var>(10000) = 36.
+
+  What is the sum of all positive integers <var>N</var>  ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 10<sup>11</sup> such that <var>f</var>(<var>N</var>) = 420 ?
+

data/data/problems/234.yml

@@ -2,22 +2,17 @@
 :id: 234
 :name: Semidivisible numbers
 :url: http://projecteuler.net/problem=234
-:content: "\r\n<p>For an integer <var>n</var> <img src=\"images/symbol_ge.gif\" width=\"10\"
-  height=\"12\" alt=\"≥\" border=\"0\" style=\"vertical-align:middle;\"> 4, we define
-  the <i>lower prime square root</i> of <var>n</var>, denoted by lps(<var>n</var>),
-  as the largest prime <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\"
-  alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><img src=\"images/symbol_radic.gif\"
-  width=\"14\" height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\"><var>n</var>
-  and the <i>upper prime square root</i> of <var>n</var>, ups(<var>n</var>), as the
-  smallest prime <img src=\"images/symbol_ge.gif\" width=\"10\" height=\"12\" alt=\"≥\"
-  border=\"0\" style=\"vertical-align:middle;\"><img src=\"images/symbol_radic.gif\"
-  width=\"14\" height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\"><var>n</var>.</p>\r\n<p>So,
-  for example, lps(4) = 2 = ups(4), lps(1000) = 31, ups(1000) = 37.<br>\r\nLet us
-  call an integer <var>n</var> <img src=\"images/symbol_ge.gif\" width=\"10\" height=\"12\"
-  alt=\"≥\" border=\"0\" style=\"vertical-align:middle;\"> 4 <i>semidivisible</i>,
-  if one of lps(<var>n</var>) and ups(<var>n</var>) divides <var>n</var>, but not
-  both.</p>\r\n\r\n<p>The sum of the semidivisible numbers not exceeding 15 is 30,
-  the numbers are 8, 10 and 12.<br> 15 is not semidivisible because it is a multiple
-  of both lps(15) = 3 and ups(15) = 5.<br>\r\nAs a further example, the sum of the
-  92 semidivisible numbers up to 1000 is 34825.</p>\r\n\r\n<p>What is the sum of all
-  semidivisible numbers not exceeding 999966663333 ?</p>\r\n"
+:content: "For an integer <var>n</var> ![≥](/home/will/src/euler-manager/config/../data/images/symbol_ge.gif)
+  4, we define the _lower prime square root_ of <var>n</var>, denoted by lps(<var>n</var>),
+  as the largest prime ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)<var>n</var>
+  and the _upper prime square root_ of <var>n</var>, ups(<var>n</var>), as the smallest
+  prime ![≥](/home/will/src/euler-manager/config/../data/images/symbol_ge.gif) ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)<var>n</var>.\n\nSo,
+  for example, lps(4) = 2 = ups(4), lps(1000) = 31, ups(1000) = 37.  \n\rLet us call
+  an integer <var>n</var> ![≥](/home/will/src/euler-manager/config/../data/images/symbol_ge.gif)
+  4 _semidivisible_, if one of lps(<var>n</var>) and ups(<var>n</var>) divides <var>n</var>,
+  but not both.\n\nThe sum of the semidivisible numbers not exceeding 15 is 30, the
+  numbers are 8, 10 and 12.  \n 15 is not semidivisible because it is a multiple of
+  both lps(15) = 3 and ups(15) = 5.  \n\rAs a further example, the sum of the 92 semidivisible
+  numbers up to 1000 is 34825.\n\nWhat is the sum of all semidivisible numbers not
+  exceeding 999966663333 ?\n\n"

data/data/problems/235.yml

@@ -2,8 +2,7 @@
 :id: 235
 :name: An Arithmetic Geometric sequence
 :url: http://projecteuler.net/problem=235
-:content: "\r\n<p>\r\nGiven is the arithmetic-geometric sequence u(<var>k</var>) =
-  (900-3<var>k</var>)<var>r</var><sup><var>k</var>-1</sup>.<br>\r\nLet s(<var>n</var>)
-  = Σ<sub><var>k</var>=1...<var>n</var></sub>u(<var>k</var>).\r\n</p>\r\n<p>\r\nFind
-  the value of <var>r</var> for which s(5000) = -600,000,000,000.\r\n</p>\r\n<p>\r\nGive
-  your answer rounded to 12 places behind the decimal point.\r\n</p>\r\n\r\n\r\n\r\n"
+:content: "Given is the arithmetic-geometric sequence u(<var>k</var>) = (900-3<var>k</var>)<var>r</var><sup><var>k</var>-1</sup>.
+  \ \n\rLet s(<var>n</var>) = Σ<sub><var>k</var>=1...<var>n</var></sub>u(<var>k</var>).\n\nFind
+  the value of <var>r</var> for which s(5000) = -600,000,000,000.\n\nGive your answer
+  rounded to 12 places behind the decimal point.\n\n"