euler-manager 0.0.5 → 0.0.6

data/data/problems/365.yml

@@ -2,16 +2,10 @@
 :id: 365
 :name: A huge binomial coefficient
 :url: http://projecteuler.net/problem=365
-:content: "\r\n<p>\r\nThe binomial coeffient C(10<sup>18</sup>,10<sup>9</sup>) is
-  a number with more than 9 billion (9<img src=\"images/symbol_times.gif\" width=\"9\"
-  height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">10<sup>9</sup>)
-  digits.\r\n</p>\r\n<p>\r\nLet M(n,k,m) denote the binomial coefficient C(n,k) modulo
-  m.\r\n</p>\r\n<p>\r\nCalculate <img src=\"images/symbol_sum.gif\" width=\"11\" height=\"14\"
-  alt=\"∑\" border=\"0\" style=\"vertical-align:middle;\">M(10<sup>18</sup>,10<sup>9</sup>,p*q*r)
-  for 1000<img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\"
-  border=\"0\" style=\"vertical-align:middle;\">p<img src=\"images/symbol_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\">q<img
-  src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\"
-  style=\"vertical-align:middle;\">r<img src=\"images/symbol_lt.gif\" width=\"10\"
-  height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\">5000 and
-  p,q,r prime.\r\n</p>\r\n\r\n\r\n\r\n\r\n"
+:content: |+
+  The binomial coeffient C(10<sup>18</sup>,10<sup>9</sup>) is a number with more than 9 billion (9 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)10<sup>9</sup>) digits.
+
+  Let M(n,k,m) denote the binomial coefficient C(n,k) modulo m.
+
+  Calculate ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif)M(10<sup>18</sup>,10<sup>9</sup>,p\*q\*r) for 1000 ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)p ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)q ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)r ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)5000 and p,q,r prime.
+

data/data/problems/366.yml

@@ -2,25 +2,22 @@
 :id: 366
 :name: Stone Game III
 :url: http://projecteuler.net/problem=366
-:content: "\r\n<p>\r\nTwo players, Anton and Bernhard, are playing the following game.<br>\r\nThere
-  is one pile of n stones.<br>\r\nThe first player may remove any positive number
-  of stones, but not the whole pile.<br>\r\nThereafter, each player may remove at
-  most twice the number of stones his opponent took on the previous move.<br>\r\nThe
-  player who removes the last stone wins.\r\n</p>\r\n<p>\r\nE.g. n=5<br>\r\nIf the
-  first player takes anything more than one stone the next player will be able to
-  take all remaining stones.<br>\r\nIf the first player takes one stone, leaving four,
-  his opponent will take also one stone, leaving three stones.<br>\r\nThe first player
-  cannot take all three because he may take at most 2x1=2 stones. So let's say he
-  takes also one stone, leaving 2. The second player can take the two remaining stones
-  and wins.<br>\r\nSo 5 is a losing position for the first player.<br>\r\nFor some
-  winning positions there is more than one possible move for the first player.<br>\r\nE.g.
-  when n=17 the first player can remove one or four stones.\r\n</p>\r\n<p>\r\nLet
-  M(n) be the maximum number of stones the first player can take from a winning position
-  <i>at his first turn</i> and M(n)=0 for any other position.\r\n</p>\r\n<p>\r\n<img
-  src=\"images/symbol_sum.gif\" width=\"11\" height=\"14\" alt=\"∑\" border=\"0\"
-  style=\"vertical-align:middle;\">M(n) for n<img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">100 is 728.\r\n</p>\r\n<p>\r\nFind
-  \ <img src=\"images/symbol_sum.gif\" width=\"11\" height=\"14\" alt=\"∑\" border=\"0\"
-  style=\"vertical-align:middle;\">M(n) for n<img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">10<sup>18</sup>.\r\nGive
-  your answer modulo 10<sup>8</sup>.\r\n</p>\r\n"
+:content: "Two players, Anton and Bernhard, are playing the following game.  \n\rThere
+  is one pile of n stones.  \n\rThe first player may remove any positive number of
+  stones, but not the whole pile.  \n\rThereafter, each player may remove at most
+  twice the number of stones his opponent took on the previous move.  \n\rThe player
+  who removes the last stone wins.\n\nE.g. n=5  \n\rIf the first player takes anything
+  more than one stone the next player will be able to take all remaining stones.  \n\rIf
+  the first player takes one stone, leaving four, his opponent will take also one
+  stone, leaving three stones.  \n\rThe first player cannot take all three because
+  he may take at most 2x1=2 stones. So let's say he takes also one stone, leaving
+  2. The second player can take the two remaining stones and wins.  \n\rSo 5 is a
+  losing position for the first player.  \n\rFor some winning positions there is more
+  than one possible move for the first player.  \n\rE.g. when n=17 the first player
+  can remove one or four stones.\n\nLet M(n) be the maximum number of stones the first
+  player can take from a winning position _at his first turn_ and M(n)=0 for any other
+  position.\n\n![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif)M(n)
+  for n ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)100
+  is 728.\n\nFind ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif)M(n)
+  for n ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)10<sup>18</sup>.\rGive
+  your answer modulo 10<sup>8</sup>.\n\n"

data/data/problems/367.yml

@@ -2,19 +2,18 @@
 :id: 367
 :name: Bozo sort
 :url: http://projecteuler.net/problem=367
-:content: "\r\n<p>\r\n<b>Bozo sort</b>, not to be confused with the slightly less
-  efficient <b>bogo sort</b>, consists out of checking if the input sequence is sorted
-  and if not swapping randomly two elements. This is repeated until eventually the
-  sequence is sorted.\r\n</p>\r\n<p>\r\nIf we consider all permutations of the first
-  4 natural numbers as input the expectation value of the number of swaps, averaged
-  over all 4! input sequences is 24.75.<br>\r\nThe already sorted sequence takes 0
-  steps. \r\n</p>\r\n<p>\r\nIn this problem we consider the following variant on bozo
-  sort.<br>\r\nIf the sequence is not in order we pick three elements at random and
-  shuffle these three elements randomly.<br>\r\nAll 3!=6 permutations of those three
-  elements are equally likely. <br>\r\nThe already sorted sequence will take 0 steps.<br>\r\nIf
+:content: " **Bozo sort** , not to be confused with the slightly less efficient **bogo
+  sort** , consists out of checking if the input sequence is sorted and if not swapping
+  randomly two elements. This is repeated until eventually the sequence is sorted.\n\nIf
   we consider all permutations of the first 4 natural numbers as input the expectation
-  value of the number of shuffles, averaged over all 4! input sequences is 27.5. <br>\r\nConsider
-  as input sequences the permutations of the first 11 natural numbers.<br>\r\nAveraged
-  over all 11! input sequences, what is the expected number of shuffles this sorting
-  algorithm will perform?\r\n</p>\r\n<p>\r\nGive your answer rounded to the nearest
-  integer.\r\n</p>\r\n"
+  value of the number of swaps, averaged over all 4! input sequences is 24.75.  \n\rThe
+  already sorted sequence takes 0 steps.\n\nIn this problem we consider the following
+  variant on bozo sort.  \n\rIf the sequence is not in order we pick three elements
+  at random and shuffle these three elements randomly.  \n\rAll 3!=6 permutations
+  of those three elements are equally likely.   \n\rThe already sorted sequence will
+  take 0 steps.  \n\rIf we consider all permutations of the first 4 natural numbers
+  as input the expectation value of the number of shuffles, averaged over all 4! input
+  sequences is 27.5.   \n\rConsider as input sequences the permutations of the first
+  11 natural numbers.  \n\rAveraged over all 11! input sequences, what is the expected
+  number of shuffles this sorting algorithm will perform?\n\nGive your answer rounded
+  to the nearest integer.\n\n"

data/data/problems/368.yml

@@ -2,38 +2,21 @@
 :id: 368
 :name: A Kempner-like series
 :url: http://projecteuler.net/problem=368
-:content: "\r\n<p>\r\n</p>\n<table><tr>\n<td>The <b> harmonic series </b> 1</td>\r\n
-  \   <td>+</td>\n<td><table class=\"frac\">\n<tr><td>1</td></tr>\n<tr><td class=\"overline\">2</td></tr>\n</table></td>\r\n
-  \   <td>+</td>\r\n    <td><table class=\"frac\">\n<tr><td>1</td></tr>\n<tr><td class=\"overline\">3</td></tr>\n</table></td>\r\n
-  \   <td>+</td>\r\n    <td><table class=\"frac\">\n<tr><td>1</td></tr>\n<tr><td class=\"overline\">4</td></tr>\n</table></td>\r\n
-  \   <td>+ ... is well known to be divergent. </td>\r\n</tr></table>\n<p>\r\nIf we
-  however omit from this series every term where the denominator has a 9 in it, the
-  series remarkably enough converges to approximately 22.9206766193.<br>\r\nThis modified
-  harmonic series is called the <b>Kempner</b> series.\r\n</p>\r\n<p>\r\nLet us now
-  consider another modified harmonic series by omitting from the harmonic series every
-  term where the denominator has 3 or more equal consecutive digits.\r\nOne can verify
-  that out of the first 1200 terms of the harmonic series, only 20 terms will be omitted.<br>\r\nThese
-  20 omitted terms are:\r\n</p>\r\n<table>\n<td><table class=\"frac\" style=\"text-align:center;\">\n<tr><td>1</td></tr>\n<tr><td
-  class=\"overline\">111</td></tr>\n</table></td>\r\n<td>,</td>\r\n<td><table class=\"frac\"
-  style=\"text-align:center;\">\n<tr><td>1</td></tr>\n<tr><td class=\"overline\">222</td></tr>\n</table></td>\r\n<td>,</td>\r\n<td><table
-  class=\"frac\" style=\"text-align:center;\">\n<tr><td>1</td></tr>\n<tr><td class=\"overline\">333</td></tr>\n</table></td>\r\n<td>,</td>\r\n<td><table
-  class=\"frac\" style=\"text-align:center;\">\n<tr><td>1</td></tr>\n<tr><td class=\"overline\">444</td></tr>\n</table></td>\r\n<td>,</td>\r\n<td><table
-  class=\"frac\" style=\"text-align:center;\">\n<tr><td>1</td></tr>\n<tr><td class=\"overline\">555</td></tr>\n</table></td>\r\n<td>,</td>\r\n<td><table
-  class=\"frac\" style=\"text-align:center;\">\n<tr><td>1</td></tr>\n<tr><td class=\"overline\">666</td></tr>\n</table></td>\r\n<td>,</td>\r\n<td><table
-  class=\"frac\" style=\"text-align:center;\">\n<tr><td>1</td></tr>\n<tr><td class=\"overline\">777</td></tr>\n</table></td>\r\n<td>,</td>\r\n<td><table
-  class=\"frac\" style=\"text-align:center;\">\n<tr><td>1</td></tr>\n<tr><td class=\"overline\">888</td></tr>\n</table></td>\r\n<td>,</td>\r\n<td><table
-  class=\"frac\" style=\"text-align:center;\">\n<tr><td>1</td></tr>\n<tr><td class=\"overline\">999</td></tr>\n</table></td>\r\n<td>,</td>\r\n<td><table
-  class=\"frac\" style=\"text-align:center;\">\n<tr><td>1</td></tr>\n<tr><td class=\"overline\">1000</td></tr>\n</table></td>\r\n<td>,</td>\r\n<td><table
-  class=\"frac\" style=\"text-align:center;\">\n<tr><td>1</td></tr>\n<tr><td class=\"overline\">1110</td></tr>\n</table></td>\r\n<td>,</td>\r\n</table>\n<table>\n<td><table
-  class=\"frac\" style=\"text-align:center;\">\n<tr><td>1</td></tr>\n<tr><td class=\"overline\">1111</td></tr>\n</table></td>\r\n<td>,</td>\r\n<td><table
-  class=\"frac\" style=\"text-align:center;\">\n<tr><td>1</td></tr>\n<tr><td class=\"overline\">1112</td></tr>\n</table></td>\r\n<td>,</td>\r\n<td><table
-  class=\"frac\" style=\"text-align:center;\">\n<tr><td>1</td></tr>\n<tr><td class=\"overline\">1113</td></tr>\n</table></td>\r\n<td>,</td>\r\n<td><table
-  class=\"frac\" style=\"text-align:center;\">\n<tr><td>1</td></tr>\n<tr><td class=\"overline\">1114</td></tr>\n</table></td>\r\n<td>,</td>\r\n<td><table
-  class=\"frac\" style=\"text-align:center;\">\n<tr><td>1</td></tr>\n<tr><td class=\"overline\">1115</td></tr>\n</table></td>\r\n<td>,</td>\r\n<td><table
-  class=\"frac\" style=\"text-align:center;\">\n<tr><td>1</td></tr>\n<tr><td class=\"overline\">1116</td></tr>\n</table></td>\r\n<td>,</td>\r\n<td><table
-  class=\"frac\" style=\"text-align:center;\">\n<tr><td>1</td></tr>\n<tr><td class=\"overline\">1117</td></tr>\n</table></td>\r\n<td>,</td>\r\n<td><table
-  class=\"frac\" style=\"text-align:center;\">\n<tr><td>1</td></tr>\n<tr><td class=\"overline\">1118</td></tr>\n</table></td>\r\n<td>
-  and </td>\r\n<td><table class=\"frac\" style=\"text-align:center;\">\n<tr><td>1</td></tr>\n<tr><td
-  class=\"overline\">1119</td></tr>\n</table></td>\r\n<td>.</td>\r\n\r\n</table>\n<p>\r\nThis
-  series converges as well.\r\n</p>\r\n<p> \r\nFind the value the series converges
-  to.<br>\r\nGive your answer rounded to 10 digits behind the decimal point.\r\n</p>\r\n\r\n\r\n"
+:content: "| The **harmonic series** 1 | + | \n\n| 1 |\n| 2 |\n\n | + | \n\n| 1 |\n|
+  3 |\n\n | + | \n\n| 1 |\n| 4 |\n\n | + ... is well known to be divergent. |\n\nIf
+  we however omit from this series every term where the denominator has a 9 in it,
+  the series remarkably enough converges to approximately 22.9206766193.  \n\rThis
+  modified harmonic series is called the **Kempner** series.\n\nLet us now consider
+  another modified harmonic series by omitting from the harmonic series every term
+  where the denominator has 3 or more equal consecutive digits.\rOne can verify that
+  out of the first 1200 terms of the harmonic series, only 20 terms will be omitted.
+  \ \n\rThese 20 omitted terms are:\n\n \n \n\n| 1 |\n| 111 |\n\n | , | \n\n| 1 |\n|
+  222 |\n\n | , | \n\n| 1 |\n| 333 |\n\n | , | \n\n| 1 |\n| 444 |\n\n | , | \n\n|
+  1 |\n| 555 |\n\n | , | \n\n| 1 |\n| 666 |\n\n | , | \n\n| 1 |\n| 777 |\n\n | , |
+  \n\n| 1 |\n| 888 |\n\n | , | \n\n| 1 |\n| 999 |\n\n | , | \n\n| 1 |\n| 1000 |\n\n
+  | , | \n\n| 1 |\n| 1110 |\n\n | , |\n\n \n \n\n| 1 |\n| 1111 |\n\n | , | \n\n| 1
+  |\n| 1112 |\n\n | , | \n\n| 1 |\n| 1113 |\n\n | , | \n\n| 1 |\n| 1114 |\n\n | ,
+  | \n\n| 1 |\n| 1115 |\n\n | , | \n\n| 1 |\n| 1116 |\n\n | , | \n\n| 1 |\n| 1117
+  |\n\n | , | \n\n| 1 |\n| 1118 |\n\n | and | \n\n| 1 |\n| 1119 |\n\n | . |\n\nThis
+  series converges as well.\n\nFind the value the series converges to.  \n\rGive your
+  answer rounded to 10 digits behind the decimal point.\n\n"

data/data/problems/369.yml

@@ -2,14 +2,10 @@
 :id: 369
 :name: Badugi
 :url: http://projecteuler.net/problem=369
-:content: "\r\n<p>In a standard 52 card deck of playing cards, a set of 4 cards is
-  a <b>Badugi</b> if it contains 4 cards with no pairs and no two cards of the same
-  suit.</p>\r\n\r\n<p>Let f(<var>n</var>) be the number of ways to choose <var>n</var>
-  cards with a 4 card subset that is a Badugi.  For example, there are 2598960 ways
-  to choose five cards from a standard 52 card deck, of which 514800 contain a 4 card
-  subset that is a Badugi, so f(5) = 514800.</p>\r\n\r\n<p>Find <img src=\"images/symbol_sum.gif\"
-  width=\"11\" height=\"14\" alt=\"∑\" border=\"0\" style=\"vertical-align:middle;\">f(<var>n</var>)
-  \ for 4 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>n</var> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  13.</p>\r\n\r\n"
+:content: |+
+  In a standard 52 card deck of playing cards, a set of 4 cards is a **Badugi** if it contains 4 cards with no pairs and no two cards of the same suit.
+
+  Let f(<var>n</var>) be the number of ways to choose <var>n</var> cards with a 4 card subset that is a Badugi. For example, there are 2598960 ways to choose five cards from a standard 52 card deck, of which 514800 contain a 4 card subset that is a Badugi, so f(5) = 514800.
+
+  Find ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif)f(<var>n</var>) for 4 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) <var>n</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 13.
+

data/data/problems/37.yml

@@ -2,9 +2,10 @@
 :id: 37
 :name: Truncatable primes
 :url: http://projecteuler.net/problem=37
-:content: "\r\n\n<p>The number 3797 has an interesting property. Being prime itself,
-  it is possible to continuously remove digits from left to right, and remain prime
-  at each stage: 3797, 797, 97, and 7. Similarly we can work from right to left: 3797,
-  379, 37, and 3.</p>\n<p>Find the sum of the only eleven primes that are both truncatable
-  from left to right and right to left.</p>\n<p class=\"info\">NOTE: 2, 3, 5, and
-  7 are not considered to be truncatable primes.</p>\n\r\n"
+:content: |+
+  The number 3797 has an interesting property. Being prime itself, it is possible to continuously remove digits from left to right, and remain prime at each stage: 3797, 797, 97, and 7. Similarly we can work from right to left: 3797, 379, 37, and 3.
+
+  Find the sum of the only eleven primes that are both truncatable from left to right and right to left.
+
+  NOTE: 2, 3, 5, and 7 are not considered to be truncatable primes.
+

data/data/problems/370.yml

@@ -1,16 +1,13 @@
 ---
 :id: 370
-:name: "Geometric triangles\r\n"
+:name: Geometric triangles
 :url: http://projecteuler.net/problem=370
-:content: "\r\n<p>Let us define a <i>geometric triangle</i> as 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>
-  so that its sides form a <b>geometric progression</b>, i.e. <var>b<sup>2</sup></var> = <var>a</var> · <var>c</var> . </p>
-  \r\n\r\n<p>An example of such a geometric triangle is the triangle with sides <var>a</var>
-  = 144, <var>b</var> = 156 and <var>c</var> = 169.</p>\r\n\r\n<p>There are 861805
-  geometric triangles with perimeter <img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> 10<sup>6</sup>
-  .</p>\r\n\r\n<p>How many geometric triangles exist with perimeter <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  2.5·10<sup>13</sup> ?</p>\r\n\r\n"
+:content: |+
+  Let us define a _geometric triangle_ as 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> so that its sides form a **geometric progression** , i.e. <var>b<sup>2</sup></var> = <var>a</var> · <var>c</var> . 
+
+  An example of such a geometric triangle is the triangle with sides <var>a</var> = 144, <var>b</var> = 156 and <var>c</var> = 169.
+
+  There are 861805 geometric triangles with perimeter ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 10<sup>6</sup> .
+
+  How many geometric triangles exist with perimeter ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 2.5·10<sup>13</sup> ?
+

data/data/problems/371.yml

@@ -2,12 +2,11 @@
 :id: 371
 :name: Licence plates
 :url: http://projecteuler.net/problem=371
-:content: "\r\n<p>\r\nOregon licence plates consist of three letters followed by a
-  three digit number (each digit can be from [0..9]).<br>\r\nWhile driving to work
-  Seth plays the following game:<br>\r\nWhenever the numbers of two licence plates
-  seen on his trip add to 1000 that's a win.\r\n</p>\r\n<p>\r\nE.g. MIC-012 and HAN-988
-  is a win and RYU-500 and SET-500 too. (as long as he sees them in the same trip).
-  \r\n</p>\n<p>\r\n</p>\n<p>\r\nFind the expected number of plates he needs to see
-  for a win.<br>\r\nGive your answer rounded to 8 decimal places behind the decimal
-  point.\r\n</p>\r\n<p style=\"font-size:88%\">\r\n<b>Note:</b> We assume that each
-  licence plate seen is equally likely to have any three digit number on it.\r\n</p>\r\n\r\n\r\n\r\n\r\n"
+:content: "Oregon licence plates consist of three letters followed by a three digit
+  number (each digit can be from [0..9]).  \n\rWhile driving to work Seth plays the
+  following game:  \n\rWhenever the numbers of two licence plates seen on his trip
+  add to 1000 that's a win.\n\nE.g. MIC-012 and HAN-988 is a win and RYU-500 and SET-500
+  too. (as long as he sees them in the same trip).\n\nFind the expected number of
+  plates he needs to see for a win.  \n\rGive your answer rounded to 8 decimal places
+  behind the decimal point.\n\n**Note:** We assume that each licence plate seen is
+  equally likely to have any three digit number on it.\n\n"

data/data/problems/372.yml

@@ -2,15 +2,12 @@
 :id: 372
 :name: Pencils of rays
 :url: http://projecteuler.net/problem=372
-:content: "\r\n<p>\r\nLet R(<var>M</var>, <var>N</var>) be the number of lattice points
-  (<var>x</var>, <var>y</var>) which satisfy <var>M</var><img src=\"images/symbol_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" 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;\"><var>N</var>,
-  <var>M</var><img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\"
-  border=\"0\" style=\"vertical-align:middle;\"><var>y</var><img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>N</var>
-  and <img style=\"vertical-align:middle\" src=\"project/images/p_372_pencilray1.jpg\">
-  is odd.<br>\r\nWe can verify that R(0, 100) = 3019 and R(100, 10000) = 29750422.<br>\r\nFind
-  R(2·10<sup>6</sup>, 10<sup>9</sup>).\r\n</p>\r\n\r\n<p>\r\n<u><i>Note</i></u>: <img
-  style=\"vertical-align:middle\" src=\"project/images/p_372_pencilray2.gif\"> represents
-  the floor function.</p>\r\n\r\n"
+:content: "Let R(<var>M</var>, <var>N</var>) be the number of lattice points (<var>x</var>,
+  <var>y</var>) which satisfy <var>M</var> ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)<var>x</var>
+  ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)<var>N</var>,
+  <var>M</var> ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)<var>y</var>
+  ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)<var>N</var>
+  and ![](/home/will/src/euler-manager/config/../data/images/p_372_pencilray1.jpg)
+  is odd.  \n\rWe can verify that R(0, 100) = 3019 and R(100, 10000) = 29750422.  \n\rFind
+  R(2·10<sup>6</sup>, 10<sup>9</sup>).\n\n<u><i>Note</i></u>: ![](/home/will/src/euler-manager/config/../data/images/p_372_pencilray2.gif)
+  represents the floor function.\n\n"

data/data/problems/373.yml

@@ -2,9 +2,8 @@
 :id: 373
 :name: Circumscribed Circles
 :url: http://projecteuler.net/problem=373
-:content: "\r\n<p>\r\nEvery triangle has a circumscribed circle that goes through
-  the three vertices.\r\nConsider all integer sided triangles for which the radius
-  of the circumscribed circle is integral as well.\r\n</p>\r\n<p>\r\nLet S(<var>n</var>)
-  be the sum of the radii of the circumscribed circles of all such triangles for which
-  the radius does not exceed <var>n</var>.\r\n</p>\r\n<p>S(100)=4950 and S(1200)=1653605.\r\n</p>\r\n<p>\r\nFind
-  S(10<sup>7</sup>).\r\n</p>\r\n\r\n"
+:content: "Every triangle has a circumscribed circle that goes through the three vertices.\rConsider
+  all integer sided triangles for which the radius of the circumscribed circle is
+  integral as well.\n\nLet S(<var>n</var>) be the sum of the radii of the circumscribed
+  circles of all such triangles for which the radius does not exceed <var>n</var>.\n\nS(100)=4950
+  and S(1200)=1653605.\n\nFind S(10<sup>7</sup>).\n\n"

data/data/problems/374.yml

@@ -2,24 +2,20 @@
 :id: 374
 :name: Maximum Integer Partition Product
 :url: http://projecteuler.net/problem=374
-:content: "\r\n<p>An integer partition of a number <var>n</var> is a way of writing
-  <var>n</var> as a sum of positive integers.</p>\r\n\r\n<p>Partitions that differ
-  only in the order of their summands are considered the same.\r\nA partition of <var>n</var>
-  into <b>distinct parts</b> is a partition of <var>n</var> in which every part occurs
-  at most once.</p>\r\n\r\n<p>The partitions of 5 into distinct parts are:\r\n<br>5,
-  4+1 and 3+2.</p>\r\n\r\n<p>Let f(<var>n</var>) be the maximum product of the parts
-  of any such partition of <var>n</var> into distinct parts and let m(<var>n</var>)
-  be the number of elements of any such partition of <var>n</var> with that product.</p>\r\n\r\n<p>So
-  f(5)=6 and m(5)=2.</p>\r\n\r\n<p>For <var>n</var>=10 the partition with the largest
-  product is 10=2+3+5, which gives f(10)=30 and m(10)=3.\r\n<br>And their product,
-  f(10)·m(10) = 30·3 = 90</p>\r\n\r\n<p>It can be verified that\r\n<br><img src=\"images/symbol_sum.gif\"
-  width=\"11\" height=\"14\" alt=\"∑\" border=\"0\" style=\"vertical-align:middle;\">f(<var>n</var>)·m(<var>n</var>)
-  for 1 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>n</var> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  100 = 1683550844462.</p>\r\n\r\n<p>Find <img src=\"images/symbol_sum.gif\" width=\"11\"
-  height=\"14\" alt=\"∑\" border=\"0\" style=\"vertical-align:middle;\">f(<var>n</var>)·m(<var>n</var>)
-  for 1 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>n</var> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  10<sup>14</sup>.\r\n<br>Give your answer modulo 982451653, the 50 millionth prime.</p>\r\n\r\n"
+:content: "An integer partition of a number <var>n</var> is a way of writing <var>n</var>
+  as a sum of positive integers.\n\nPartitions that differ only in the order of their
+  summands are considered the same.\rA partition of <var>n</var> into **distinct parts**
+  is a partition of <var>n</var> in which every part occurs at most once.\n\nThe partitions
+  of 5 into distinct parts are:\r  \n5, 4+1 and 3+2.\n\nLet f(<var>n</var>) be the
+  maximum product of the parts of any such partition of <var>n</var> into distinct
+  parts and let m(<var>n</var>) be the number of elements of any such partition of
+  <var>n</var> with that product.\n\nSo f(5)=6 and m(5)=2.\n\nFor <var>n</var>=10
+  the partition with the largest product is 10=2+3+5, which gives f(10)=30 and m(10)=3.\r
+  \ \nAnd their product, f(10)·m(10) = 30·3 = 90\n\nIt can be verified that\r  \n
+  ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif)f(<var>n</var>)·m(<var>n</var>)
+  for 1 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) <var>n</var>
+  ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 100 = 1683550844462.\n\nFind
+  ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif)f(<var>n</var>)·m(<var>n</var>)
+  for 1 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) <var>n</var>
+  ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 10<sup>14</sup>.\r
+  \ \nGive your answer modulo 982451653, the 50 millionth prime.\n\n"

data/data/problems/375.yml

@@ -2,22 +2,18 @@
 :id: 375
 :name: Minimum of subsequences
 :url: http://projecteuler.net/problem=375
-:content: "\r\n<style type=\"text/css\">\r\ntable.p375 td {\r\n  padding: 0px 3px
-  0px 3px;\r\n  vertical-align: bottom;\r\n  text-align: left;\r\n}\r\n</style>\n<p>Let
+:content: "<style type=\"text/css\"><![CDATA[\r\ntable.p375 td {\r\n  padding: 0px
+  3px 0px 3px;\r\n  vertical-align: bottom;\r\n  text-align: left;\r\n}\r\n]]></style>\n\nLet
   <var>S</var><sub><var>n</var></sub> be an integer sequence produced with the following
-  pseudo-random number generator:</p>\r\n<center><table class=\"p375\">\n<tr>\n<td
-  style=\"text-align:right\">\n<var>S</var><sub>0</sub>\n</td>\r\n    <td>=<sub> </sub>\n</td>\r\n
-  \   <td>290797<sub> </sub>\n</td>\r\n  </tr>\n<tr>\n<td>\n<var>S</var><sub><var>n</var>+1</sub>\n</td>\r\n
+  pseudo-random number generator:\n\n<center><table class=\"p375\">\r\n  <tr>\r\n
+  \   <td style=\"text-align:right\">\n<var>S</var><sub>0</sub>\n</td>\r\n    <td>=<sub> </sub>\n</td>\r\n
+  \   <td>290797<sub> </sub>\n</td>\r\n  </tr>\n<tr>\r\n    <td>\n<var>S</var><sub><var>n</var>+1</sub>\n</td>\r\n
   \   <td>=<sub> </sub>\n</td>\r\n    <td>\n<var>S</var><sub><var>n</var></sub><sup>2</sup>
-  mod 50515093</td>\r\n  </tr>\n</table></center>\r\n\r\n<p>\r\nLet A(<var>i</var>,
-  <var>j</var>) be the minimum of the numbers <var>S</var><sub><var>i</var></sub>,
-  <var>S</var><sub><var>i</var>+1</sub>, ... , <var>S</var><sub><var>j</var></sub>
-  for <var>i</var> <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\"
-  border=\"0\" style=\"vertical-align:middle;\"><var>j</var>.<br>\r\nLet M(<var>N</var>)
-  = ΣA(<var>i</var>, <var>j</var>) for 1 <img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>i</var>
-  <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>j</var> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>N</var>.<br>\r\nWe
-  can verify that M(10) = 432256955 and M(10 000) = 3264567774119.</p>\r\n\r\n<p>\r\nFind
-  M(2 000 000 000).\r\n</p>\r\n"
+  mod 50515093</td>\r\n  </tr>\r\n</table></center>\n\nLet A(<var>i</var>, <var>j</var>)
+  be the minimum of the numbers <var>S</var><sub><var>i</var></sub>, <var>S</var><sub><var>i</var>+1</sub>,
+  ... , <var>S</var><sub><var>j</var></sub> for <var>i</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>j</var>.  \n\rLet M(<var>N</var>) = ΣA(<var>i</var>, <var>j</var>) for 1 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>i</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>j</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>N</var>.  \n\rWe can verify that M(10) = 432256955 and M(10 000) = 3264567774119.\n\nFind
+  M(2 000 000 000).\n\n"

data/data/problems/376.yml

@@ -2,24 +2,22 @@
 :id: 376
 :name: Nontransitive sets of dice
 :url: http://projecteuler.net/problem=376
-:content: "\r\n<p>\r\nConsider the following set of dice with nonstandard pips:\r\n</p>\r\n\r\n<p>\r\nDie
-  A: 1 4 4 4 4 4<br>\r\nDie B: 2 2 2 5 5 5<br>\r\nDie C: 3 3 3 3 3 6<br></p>\r\n\r\n<p>\r\nA
-  game is played by two players picking a die in turn and rolling it. The player who
-  rolls the highest value wins.\r\n</p>\r\n\r\n<p>\r\nIf the first player picks die
-  A and the second player picks die B we get<br>\r\nP(second player wins) = <sup>7</sup>/<sub>12</sub>
-  &gt; <sup>1</sup>/<sub>2</sub></p>\r\n\r\n<p>\r\nIf the first player picks die B
-  and the second player picks die C we get<br>\r\nP(second player wins) = <sup>7</sup>/<sub>12</sub>
-  &gt; <sup>1</sup>/<sub>2</sub></p>\r\n\r\n<p>\r\nIf the first player picks die C
-  and the second player picks die A we get<br>\r\nP(second player wins) = <sup>25</sup>/<sub>36</sub>
-  &gt; <sup>1</sup>/<sub>2</sub></p>\r\n\r\n<p>\r\nSo whatever die the first player
-  picks, the second player can pick another die and have a larger than 50% chance
-  of winning.<br>\r\nA set of dice having this property is called a <b>nontransitive
-  set of dice</b>.\r\n</p>\r\n\r\n<p>\r\nWe wish to investigate how many sets of nontransitive
-  dice exist. We will assume the following conditions:</p>\n<ul>\n<li>There are three
-  six-sided dice with each side having between 1 and <var>N</var> pips, inclusive.</li>\r\n<li>Dice
-  with the same set of pips are equal, regardless of which side on the die the pips
-  are located.</li>\r\n<li>The same pip value may appear on multiple dice; if both
-  players roll the same value neither player wins.</li>\r\n<li>The sets of dice {A,B,C},
-  {B,C,A} and {C,A,B} are the same set.</li>\r\n</ul>\n<p>\r\nFor <var>N</var> = 7
-  we find there are 9780 such sets.<br>\r\nHow many are there for <var>N</var> = 30
-  ?\r\n</p>\r\n"
+:content: "Consider the following set of dice with nonstandard pips:\n\nDie A: 1 4
+  4 4 4 4  \n\rDie B: 2 2 2 5 5 5  \n\rDie C: 3 3 3 3 3 6\n\nA game is played by two
+  players picking a die in turn and rolling it. The player who rolls the highest value
+  wins.\n\nIf the first player picks die A and the second player picks die B we get
+  \ \n\rP(second player wins) = <sup>7</sup>/<sub>12</sub> > <sup>1</sup>/<sub>2</sub>\n\nIf
+  the first player picks die B and the second player picks die C we get  \n\rP(second
+  player wins) = <sup>7</sup>/<sub>12</sub> > <sup>1</sup>/<sub>2</sub>\n\nIf the
+  first player picks die C and the second player picks die A we get  \n\rP(second
+  player wins) = <sup>25</sup>/<sub>36</sub> > <sup>1</sup>/<sub>2</sub>\n\nSo whatever
+  die the first player picks, the second player can pick another die and have a larger
+  than 50% chance of winning.  \n\rA set of dice having this property is called a
+  **nontransitive set of dice** .\n\nWe wish to investigate how many sets of nontransitive
+  dice exist. We will assume the following conditions:\n\n- There are three six-sided
+  dice with each side having between 1 and <var>N</var> pips, inclusive.\n- Dice with
+  the same set of pips are equal, regardless of which side on the die the pips are
+  located.\n- The same pip value may appear on multiple dice; if both players roll
+  the same value neither player wins.\n- The sets of dice {A,B,C}, {B,C,A} and {C,A,B}
+  are the same set.\n\nFor <var>N</var> = 7 we find there are 9780 such sets.  \n\rHow
+  many are there for <var>N</var> = 30 ?\n\n"

data/data/problems/377.yml

@@ -2,10 +2,9 @@
 :id: 377
 :name: Sum of digits, experience 13
 :url: http://projecteuler.net/problem=377
-:content: "\r\n<p>\r\nThere are 16 positive integers that do not have a zero in their
-  digits and that have a digital sum equal to 5, namely: <br>\r\n5, 14, 23, 32, 41,
-  113, 122, 131, 212, 221, 311, 1112, 1121, 1211, 2111 and 11111.<br>\r\nTheir sum
-  is 17891.\r\n</p>\r\n<p>\r\nLet <var>f</var>(<var>n</var>) be the sum of all positive
-  integers that do not have a zero in their digits and have a digital sum equal to
-  <var>n</var>.\r\n</p>\r\n<p>\r\nFind <img src=\"project/images/sod_13.gif\" style=\"margin-top:-8px;\">.<br>\r\nGive
-  the last 9 digits as your answer.\r\n</p>\r\n\r\n"
+:content: "There are 16 positive integers that do not have a zero in their digits
+  and that have a digital sum equal to 5, namely:   \n\r5, 14, 23, 32, 41, 113, 122,
+  131, 212, 221, 311, 1112, 1121, 1211, 2111 and 11111.  \n\rTheir sum is 17891.\n\nLet
+  <var>f</var>(<var>n</var>) be the sum of all positive integers that do not have
+  a zero in their digits and have a digital sum equal to <var>n</var>.\n\nFind ![](/home/will/src/euler-manager/config/../data/images/sod_13.gif).
+  \ \n\rGive the last 9 digits as your answer.\n\n"

data/data/problems/378.yml

@@ -2,14 +2,11 @@
 :id: 378
 :name: Triangle Triples
 :url: http://projecteuler.net/problem=378
-:content: "\r\n<p>\r\n</p>\n<table class=\"formula\"><tr>\n<td>\r\nLet T(<var>n</var>)
-  be the <var>n</var><sup>th</sup> triangle number, so T(<var>n</var>) =\r\n</td>\r\n<td>\r\n<table
-  class=\"frac\" style=\"font-size: smaller\">\n<tr><td>\n<var>n</var> (<var>n</var>+1)</td></tr>\n<tr><td
-  class=\"overline\" text-align:center>2</td></tr>\n</table>\n</td>\r\n<td>\r\n.\r\n</td>\r\n</tr></table>\n<p>\r\nLet
-  dT(<var>n</var>) be the number of divisors of T(<var>n</var>).<br>\r\nE.g.:\r\nT(7)
-  = 28 and dT(7) = 6.\r\n</p>\r\n<p>\r\nLet Tr(<var>n</var>) be the number of triples
-  (<var>i</var>, <var>j</var>, <var>k</var>) such that 1 <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>i
-  \ n</var> and dT(<var>i</var>) &gt; dT(<var>j</var>) &gt; dT(<var>k</var>).<br>\r\nTr(20)
-  = 14, Tr(100) = 5772 and Tr(1000) = 11174776.\r\n</p>\r\n<p>\r\nFind Tr(60 000 000).
-  <br>\r\nGive the last 18 digits of your answer.\r\n</p>\r\n\r\n"
+:content: "| \rLet T(<var>n</var>) be the <var>n</var><sup>th</sup> triangle number,
+  so T(<var>n</var>) =\r | \n\n| <var>n</var> (<var>n</var>+1) |\n| 2 |\n\n | \r.\r
+  |\n\nLet dT(<var>n</var>) be the number of divisors of T(<var>n</var>).  \n\rE.g.:\rT(7)
+  = 28 and dT(7) = 6.\n\nLet Tr(<var>n</var>) be the number of triples (<var>i</var>,
+  <var>j</var>, <var>k</var>) such that 1 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>i n</var> and dT(<var>i</var>) > dT(<var>j</var>) > dT(<var>k</var>).  \n\rTr(20)
+  = 14, Tr(100) = 5772 and Tr(1000) = 11174776.\n\nFind Tr(60 000 000).   \n\rGive
+  the last 18 digits of your answer.\n\n"

data/data/problems/379.yml

@@ -2,14 +2,12 @@
 :id: 379
 :name: Least common multiple count
 :url: http://projecteuler.net/problem=379
-:content: "\r\n<p>\r\nLet <var>f</var>(<var>n</var>) be the number of couples (<var>x</var>,<var>y</var>)
-  with <var>x</var> and <var>y</var> positive integers, <var>x</var> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>y</var>
-  and the least common multiple of <var>x</var> and <var>y</var> equal to <var>n</var>.\r\n</p>\r\n<p>\r\nLet
-  <var>g</var> be the <b>summatory function</b> of <var>f</var>, i.e.: \r\n<var>g</var>(<var>n</var>)
-  = <img src=\"images/symbol_sum.gif\" width=\"11\" height=\"14\" alt=\"∑\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>f</var>(<var>i</var>)  for 1 <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>i</var>
-  <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>n</var>.\r\n</p>\n<p>\r\n</p>\n<p>\r\nYou
-  are given that <var>g</var>(10<sup>6</sup>) = 37429395.\r\n</p>\r\n<p>\r\nFind <var>g</var>(10<sup>12</sup>).\r\n</p>\r\n\r\n\r\n\r\n\r\n\r\n\r\n"
+:content: "Let <var>f</var>(<var>n</var>) be the number of couples (<var>x</var>,<var>y</var>)
+  with <var>x</var> and <var>y</var> positive integers, <var>x</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>y</var> and the least common multiple of <var>x</var> and <var>y</var> equal
+  to <var>n</var>.\n\nLet <var>g</var> be the **summatory function** of <var>f</var>,
+  i.e.: \r<var>g</var>(<var>n</var>) = ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif)
+  <var>f</var>(<var>i</var>) for 1 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>i</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>n</var>.\n\nYou are given that <var>g</var>(10<sup>6</sup>) = 37429395.\n\nFind
+  <var>g</var>(10<sup>12</sup>).\n\n"

data/data/problems/38.yml

@@ -2,17 +2,13 @@
 :id: 38
 :name: Pandigital multiples
 :url: http://projecteuler.net/problem=38
-:content: "\r\n<p>Take the number 192 and multiply it by each of 1, 2, and 3:</p>\r\n<blockquote>192
-  <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\"> 1 = 192<br>\r\n192 <img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">
-  2 = 384<br>\r\n192 <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\"
-  alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"> 3 = 576</blockquote>\r\n<p>By
-  concatenating each product we get the 1 to 9 pandigital, 192384576. We will call
-  192384576 the concatenated product of 192 and (1,2,3)</p>\r\n<p>The same can be
-  achieved by starting with 9 and multiplying by 1, 2, 3, 4, and 5, giving the pandigital,
-  918273645, which is the concatenated product of 9 and (1,2,3,4,5).</p>\r\n<p>What
+:content: "Take the number 192 and multiply it by each of 1, 2, and 3:\n\n> 192 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  1 = 192  \n> \r192 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  2 = 384  \n> \r192 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  3 = 576\n\nBy concatenating each product we get the 1 to 9 pandigital, 192384576.
+  We will call 192384576 the concatenated product of 192 and (1,2,3)\n\nThe same can
+  be achieved by starting with 9 and multiplying by 1, 2, 3, 4, and 5, giving the
+  pandigital, 918273645, which is the concatenated product of 9 and (1,2,3,4,5).\n\nWhat
   is the largest 1 to 9 pandigital 9-digit number that can be formed as the concatenated
-  product of an integer with (1,2, ... , <var>n</var>) where <var>n</var> <img src=\"images/symbol_gt.gif\"
-  width=\"10\" height=\"10\" alt=\"&gt;\" border=\"0\" style=\"vertical-align:middle;\">
-  1?</p>\r\n\r\n"
+  product of an integer with (1,2, ... , <var>n</var>) where <var>n</var> ![>](/home/will/src/euler-manager/config/../data/images/symbol_gt.gif)
+  1?\n\n"