euler-manager 0.0.5 → 0.0.6

data/data/problems/17.yml

@@ -2,10 +2,10 @@
 :id: 17
 :name: Number letter counts
 :url: http://projecteuler.net/problem=17
-:content: "\r\n<p>If the numbers 1 to 5 are written out in words: one, two, three,
-  four, five, then there are 3 + 3 + 5 + 4 + 4 = 19 letters used in total.</p>\r\n<p>If
-  all the numbers from 1 to 1000 (one thousand) inclusive were written out in words,
-  how many letters would be used? </p>\r\n<br><p class=\"note\"><b>NOTE:</b> Do not
-  count spaces or hyphens. For example, 342 (three hundred and forty-two) contains
-  23 letters and 115 (one hundred and fifteen) contains 20 letters. The use of \"and\"
-  when writing out numbers is in compliance with British usage.</p>\r\n"
+:content: "If the numbers 1 to 5 are written out in words: one, two, three, four,
+  five, then there are 3 + 3 + 5 + 4 + 4 = 19 letters used in total.\n\nIf all the
+  numbers from 1 to 1000 (one thousand) inclusive were written out in words, how many
+  letters would be used?\n\n  \n  \n\n**NOTE:** Do not count spaces or hyphens. For
+  example, 342 (three hundred and forty-two) contains 23 letters and 115 (one hundred
+  and fifteen) contains 20 letters. The use of \"and\" when writing out numbers is
+  in compliance with British usage.\n\n"

data/data/problems/170.yml

@@ -2,15 +2,12 @@
 :id: 170
 :name: Find the largest 0 to 9 pandigital that can be formed by concatenating products
 :url: http://projecteuler.net/problem=170
-:content: "\r\n<p>Take the number 6 and multiply it by each of 1273 and 9854:</p>\r\n\r\n<p
-  style=\"margin-left:50px;\">6 <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\"
-  alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"> 1273 =  7638<br>\r\n6 <img
-  src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\"> 9854 = 59124</p>\r\n\r\n<p>By concatenating these
-  products we get the 1 to 9 pandigital 763859124. We will call 763859124 the \"concatenated
-  product of 6 and (1273,9854)\". Notice too, that the concatenation of the input
-  numbers, 612739854, is also 1 to 9 pandigital.</p>\r\n\r\n<p>The same can be done
-  for 0 to 9 pandigital numbers.</p>\r\n\r\n<p>What is the largest 0 to 9 pandigital
+:content: "Take the number 6 and multiply it by each of 1273 and 9854:\n\n6 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  1273 = 7638  \n\r6 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  9854 = 59124\n\nBy concatenating these products we get the 1 to 9 pandigital 763859124.
+  We will call 763859124 the \"concatenated product of 6 and (1273,9854)\". Notice
+  too, that the concatenation of the input numbers, 612739854, is also 1 to 9 pandigital.\n\nThe
+  same can be done for 0 to 9 pandigital numbers.\n\nWhat is the largest 0 to 9 pandigital
   10-digit concatenated product of an integer with two or more other integers, such
   that the concatenation of the input numbers is also a 0 to 9 pandigital 10-digit
-  number?</p>\r\n"
+  number?\n\n"

data/data/problems/171.yml

@@ -2,12 +2,10 @@
 :id: 171
 :name: Finding numbers for which the sum of the squares of the digits is a square
 :url: http://projecteuler.net/problem=171
-:content: "\r\n<p>For a positive integer <var>n</var>, let f(<var>n</var>) be the
-  sum of the squares of the digits (in base 10) of <var>n</var>, e.g.</p>\r\n<p style=\"margin-left:50px;\">f(3)
-  = 3<sup>2</sup> = 9,<br>\r\nf(25) = 2<sup>2</sup> + 5<sup>2</sup> = 4 + 25 = 29,<br>\r\nf(442)
-  = 4<sup>2</sup> + 4<sup>2</sup> + 2<sup>2</sup> = 16 + 16 + 4 = 36</p>\r\n<p>Find
-  the last nine digits of the sum of all <var>n</var>, 0 <img src=\"images/symbol_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\"><var>n</var>
-  <img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\"
-  style=\"vertical-align:middle;\"> 10<sup>20</sup>, such that f(<var>n</var>) is
-  a perfect square.</p>\r\n"
+:content: "For a positive integer <var>n</var>, let f(<var>n</var>) be the sum of
+  the squares of the digits (in base 10) of <var>n</var>, e.g.\n\nf(3) = 3<sup>2</sup>
+  = 9,  \n\rf(25) = 2<sup>2</sup> + 5<sup>2</sup> = 4 + 25 = 29,  \n\rf(442) = 4<sup>2</sup>
+  + 4<sup>2</sup> + 2<sup>2</sup> = 16 + 16 + 4 = 36\n\nFind the last nine digits
+  of the sum of all <var>n</var>, 0 ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)
+  <var>n</var> ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)
+  10<sup>20</sup>, such that f(<var>n</var>) is a perfect square.\n\n"

data/data/problems/172.yml

@@ -2,5 +2,6 @@
 :id: 172
 :name: Investigating numbers with few repeated digits
 :url: http://projecteuler.net/problem=172
-:content: "\r\n<p>How many 18-digit numbers <var>n</var> (without leading zeros) are
-  there such that no digit occurs more than three times in <var>n</var>?</p>\r\n"
+:content: |+
+  How many 18-digit numbers <var>n</var> (without leading zeros) are there such that no digit occurs more than three times in <var>n</var>?
+

data/data/problems/173.yml

@@ -3,10 +3,12 @@
 :name: Using up to one million tiles how many different "hollow" square laminae can
   be formed?
 :url: http://projecteuler.net/problem=173
-:content: "\r\n<p>We shall define a square lamina to be a square outline with a square
-  \"hole\" so that the shape possesses vertical and horizontal symmetry. For example,
-  using exactly thirty-two square tiles we can form two different square laminae:</p>\r\n<div
-  style=\"text-align:center;\">\r\n<img src=\"project/images/p_173_square_laminas.gif\"
-  alt=\"\">\n</div>\r\n<p>With one-hundred tiles, and not necessarily using all of
-  the tiles at one time, it is possible to form forty-one different square laminae.</p>\r\n<p>Using
-  up to one million tiles how many different square laminae can be formed?</p>\r\n"
+:content: |+
+  We shall define a square lamina to be a square outline with a square "hole" so that the shape possesses vertical and horizontal symmetry. For example, using exactly thirty-two square tiles we can form two different square laminae:
+
+   ![](/home/will/src/euler-manager/config/../data/images/p_173_square_laminas.gif)
+
+  With one-hundred tiles, and not necessarily using all of the tiles at one time, it is possible to form forty-one different square laminae.
+
+  Using up to one million tiles how many different square laminae can be formed?
+

data/data/problems/174.yml

@@ -3,18 +3,16 @@
 :name: Counting the number of "hollow" square laminae that can form one, two, three,
   ... distinct arrangements
 :url: http://projecteuler.net/problem=174
-:content: "\r\n<p>We shall define a square lamina to be a square outline with a square
-  \"hole\" so that the shape possesses vertical and horizontal symmetry.</p>\r\n<p>Given
-  eight tiles it is possible to form a lamina in only one way: 3x3 square with a 1x1
-  hole in the middle. However, using thirty-two tiles it is possible to form two distinct
-  laminae.</p>\r\n<div style=\"text-align:center;\">\r\n<img src=\"project/images/p_173_square_laminas.gif\"
-  alt=\"\">\n</div>\r\n<p>If <var>t</var> represents the number of tiles used, we
-  shall say that <var>t</var> = 8 is type L(1) and <var>t</var> = 32 is type L(2).</p>\r\n<p>Let
-  N(<var>n</var>) be the number of <var>t</var> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  1000000 such that <var>t</var> is type L(<var>n</var>); for example, N(15) = 832.</p>\r\n<p>What
-  is <img src=\"images/symbol_sum.gif\" width=\"11\" height=\"14\" alt=\"∑\" border=\"0\"
-  style=\"vertical-align:middle;\"> N(<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?</p>\r\n"
+:content: |+
+  We shall define a square lamina to be a square outline with a square "hole" so that the shape possesses vertical and horizontal symmetry.
+
+  Given eight tiles it is possible to form a lamina in only one way: 3x3 square with a 1x1 hole in the middle. However, using thirty-two tiles it is possible to form two distinct laminae.
+
+   ![](/home/will/src/euler-manager/config/../data/images/p_173_square_laminas.gif)
+
+  If <var>t</var> represents the number of tiles used, we shall say that <var>t</var> = 8 is type L(1) and <var>t</var> = 32 is type L(2).
+
+  Let N(<var>n</var>) be the number of <var>t</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 1000000 such that <var>t</var> is type L(<var>n</var>); for example, N(15) = 832.
+
+  What is ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif) N(<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?
+

data/data/problems/175.yml

@@ -3,19 +3,17 @@
 :name: Fractions involving the number of different ways a number can be expressed
   as a sum of powers of 2
 :url: http://projecteuler.net/problem=175
-:content: "\r\nDefine f(0)=1 and f(<var>n</var>) to be the number of ways to write
-  <var>n</var> as a sum of powers of 2 where no power occurs more than twice. <br><br>\r\n\r\nFor
-  example, f(10)=5 since there are five different ways to express 10:<br>10 = 8+2
-  = 8+1+1 = 4+4+2 = 4+2+2+1+1 = 4+4+1+1<br><br>\r\n\r\nIt can be shown that for every
-  fraction <var>p/q</var> (<var>p</var><img src=\"images/symbol_gt.gif\" width=\"10\"
-  height=\"10\" alt=\"&gt;\" border=\"0\" style=\"vertical-align:middle;\">0, <var>q</var><img
-  src=\"images/symbol_gt.gif\" width=\"10\" height=\"10\" alt=\"&gt;\" border=\"0\"
-  style=\"vertical-align:middle;\">0) there exists at least one integer <var>n</var>
-  such that<br> f(<var>n</var>)/f(<var>n</var>-1)=<var>p/q</var>.<br><br>\r\nFor instance,
-  the smallest <var>n</var> for which f(<var>n</var>)/f(<var>n</var>-1)=13/17 is 241.<br>\r\nThe
-  binary expansion of 241 is 11110001.<br>\r\nReading this binary number from the
-  most significant bit to the least significant bit there are 4 one's, 3 zeroes and
-  1 one. We shall call the string 4,3,1 the <span style=\"font-style: italic\">Shortened
-  Binary Expansion</span> of 241.<br><br>\r\nFind the Shortened Binary Expansion of
-  the smallest <var>n</var> for which<br> f(<var>n</var>)/f(<var>n</var>-1)=123456789/987654321.<br><br>\r\nGive
+:content: "\rDefine f(0)=1 and f(<var>n</var>) to be the number of ways to write <var>n</var>
+  as a sum of powers of 2 where no power occurs more than twice.   \n  \n  \n\r\rFor
+  example, f(10)=5 since there are five different ways to express 10:  \n10 = 8+2
+  = 8+1+1 = 4+4+2 = 4+2+2+1+1 = 4+4+1+1  \n  \n  \n\r\rIt can be shown that for every
+  fraction <var>p/q</var> (<var>p</var> ![>](/home/will/src/euler-manager/config/../data/images/symbol_gt.gif)0,
+  <var>q</var> ![>](/home/will/src/euler-manager/config/../data/images/symbol_gt.gif)0)
+  there exists at least one integer <var>n</var> such that  \n f(<var>n</var>)/f(<var>n</var>-1)=<var>p/q</var>.
+  \ \n  \n  \n\rFor instance, the smallest <var>n</var> for which f(<var>n</var>)/f(<var>n</var>-1)=13/17
+  is 241.  \n\rThe binary expansion of 241 is 11110001.  \n\rReading this binary number
+  from the most significant bit to the least significant bit there are 4 one's, 3
+  zeroes and 1 one. We shall call the string 4,3,1 the Shortened Binary Expansion
+  of 241.  \n  \n  \n\rFind the Shortened Binary Expansion of the smallest <var>n</var>
+  for which  \n f(<var>n</var>)/f(<var>n</var>-1)=123456789/987654321.  \n  \n  \n\rGive
   your answer as comma separated integers, without any whitespaces.\r\n"

data/data/problems/176.yml

@@ -2,8 +2,8 @@
 :id: 176
 :name: Right-angled triangles that share a cathetus
 :url: http://projecteuler.net/problem=176
-:content: "\r\n<p>The four right-angled triangles with sides (9,12,15), (12,16,20),
-  (5,12,13) and (12,35,37) all have one of the shorter sides (catheti) equal to 12.
-  It can be shown that no other integer sided right-angled triangle exists with one
-  of the catheti equal to 12.</p>\r\n<p>Find the smallest integer that can be the
-  length of a cathetus of exactly 47547 different integer sided right-angled triangles.</p>\r\n"
+:content: |+
+  The four right-angled triangles with sides (9,12,15), (12,16,20), (5,12,13) and (12,35,37) all have one of the shorter sides (catheti) equal to 12. It can be shown that no other integer sided right-angled triangle exists with one of the catheti equal to 12.
+
+  Find the smallest integer that can be the length of a cathetus of exactly 47547 different integer sided right-angled triangles.
+

data/data/problems/177.yml

@@ -2,15 +2,16 @@
 :id: 177
 :name: Integer angled Quadrilaterals
 :url: http://projecteuler.net/problem=177
-:content: "\r\n<p>Let ABCD be a convex quadrilateral, with diagonals AC and BD. At
-  each vertex the diagonal makes an angle with each of the two sides, creating eight
-  corner angles.</p>\r\n<p style=\"margin-left:180px;\"><img src=\"project/images/p_177_quad.gif\"
-  alt=\"\"></p>\r\n<p>For example, at vertex A, the two angles are CAD, CAB.</p>\r\n<p>We
-  call such a quadrilateral for which all eight corner angles have integer values
-  when measured in degrees an \"integer angled quadrilateral\". An example of an integer
-  angled quadrilateral is a square, where all eight corner angles are 45°. Another
-  example is given by DAC = 20°, BAC = 60°, ABD = 50°, CBD = 30°, BCA = 40°, DCA =
-  30°, CDB = 80°, ADB = 50°.</p>\r\n<p>What is the total number of non-similar integer
-  angled quadrilaterals?</p>\r\n<p>Note: In your calculations you may assume that
-  a calculated angle is integral if it is within a tolerance of 10<sup>-9</sup> of
-  an integer value.</p>\r\n"
+:content: |+
+  Let ABCD be a convex quadrilateral, with diagonals AC and BD. At each vertex the diagonal makes an angle with each of the two sides, creating eight corner angles.
+
+  ![](/home/will/src/euler-manager/config/../data/images/p_177_quad.gif)
+
+  For example, at vertex A, the two angles are CAD, CAB.
+
+  We call such a quadrilateral for which all eight corner angles have integer values when measured in degrees an "integer angled quadrilateral". An example of an integer angled quadrilateral is a square, where all eight corner angles are 45°. Another example is given by DAC = 20°, BAC = 60°, ABD = 50°, CBD = 30°, BCA = 40°, DCA = 30°, CDB = 80°, ADB = 50°.
+
+  What is the total number of non-similar integer angled quadrilaterals?
+
+  Note: In your calculations you may assume that a calculated angle is integral if it is within a tolerance of 10<sup>-9</sup> of an integer value.
+

data/data/problems/178.yml

@@ -2,8 +2,8 @@
 :id: 178
 :name: Step Numbers
 :url: http://projecteuler.net/problem=178
-:content: "\r\nConsider the number 45656. <br>\r\nIt can be seen that each pair of
-  consecutive digits of 45656 has a difference of one.<br>\r\nA number for which every
-  pair of consecutive digits has a difference of one is called a step number.<br>\r\nA
-  pandigital number  contains every decimal digit from 0 to 9 at least once.<br>\r\n\r\nHow
-  many pandigital step numbers less than 10<sup>40</sup> are there?\r\n\r\n"
+:content: "\rConsider the number 45656.   \n\rIt can be seen that each pair of consecutive
+  digits of 45656 has a difference of one.  \n\rA number for which every pair of consecutive
+  digits has a difference of one is called a step number.  \n\rA pandigital number
+  contains every decimal digit from 0 to 9 at least once.  \n\r\rHow many pandigital
+  step numbers less than 10<sup>40</sup> are there?\r\r\n"

data/data/problems/179.yml

@@ -2,9 +2,6 @@
 :id: 179
 :name: Consecutive positive divisors
 :url: http://projecteuler.net/problem=179
-:content: "\r\n<p>Find the number of integers 1 <img src=\"images/symbol_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\">
-  n <img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\"
-  style=\"vertical-align:middle;\"> 10<sup>7</sup>, for which <var>n</var> and <var>n</var>
-  + 1 have the same number of positive divisors. For example, 14 has the positive
-  divisors 1, 2, 7, 14 while 15 has 1, 3, 5, 15.</p>\r\n"
+:content: |+
+  Find the number of integers 1 ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif) n ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif) 10<sup>7</sup>, for which <var>n</var> and <var>n</var> + 1 have the same number of positive divisors. For example, 14 has the positive divisors 1, 2, 7, 14 while 15 has 1, 3, 5, 15.
+

data/data/problems/18.yml

@@ -2,20 +2,16 @@
 :id: 18
 :name: Maximum path sum I
 :url: http://projecteuler.net/problem=18
-:content: "\r\n<p>By starting at the top of the triangle below and moving to adjacent
-  numbers on the row below, the maximum total from top to bottom is 23.</p>\r\n<p
-  style=\"text-align:center;font-family:courier new;font-size:12pt;\"><span style=\"color:#ff0000;\"><b>3</b></span><br><span
-  style=\"color:#ff0000;\"><b>7</b></span> 4<br>\r\n2 <span style=\"color:#ff0000;\"><b>4</b></span>
-  6<br>\r\n8 5 <span style=\"color:#ff0000;\"><b>9</b></span> 3</p>\r\n<p>That is,
-  3 + 7 + 4 + 9 = 23.</p>\r\n<p>Find the maximum total from top to bottom of the triangle
-  below:</p>\r\n<p style=\"text-align:center;font-family:courier new;\">75<br>\r\n95
-  64<br>\r\n17 47 82<br>\r\n18 35 87 10<br>\r\n20 04 82 47 65<br>\r\n19 01 23 75 03
-  34<br>\r\n88 02 77 73 07 63 67<br>\r\n99 65 04 28 06 16 70 92<br>\r\n41 41 26 56
-  83 40 80 70 33<br>\r\n41 48 72 33 47 32 37 16 94 29<br>\r\n53 71 44 65 25 43 91
-  52 97 51 14<br>\r\n70 11 33 28 77 73 17 78 39 68 17 57<br>\r\n91 71 52 38 17 14
-  91 43 58 50 27 29 48<br>\r\n63 66 04 68 89 53 67 30 73 16 69 87 40 31<br>\r\n04
-  62 98 27 23 09 70 98 73 93 38 53 60 04 23</p>\r\n<p class=\"note\"><b>NOTE:</b>
-  As there are only 16384 routes, it is possible to solve this problem by trying every
-  route. However, <a href=\"problem=67\">Problem 67</a>, is the same challenge with
-  a triangle containing one-hundred rows; it cannot be solved by brute force, and
-  requires a clever method! ;o)</p>\r\n"
+:content: "By starting at the top of the triangle below and moving to adjacent numbers
+  on the row below, the maximum total from top to bottom is 23.\n\n**3**  \n**7**
+  4  \n\r2 **4** 6  \n\r8 5 **9** 3\n\nThat is, 3 + 7 + 4 + 9 = 23.\n\nFind the maximum
+  total from top to bottom of the triangle below:\n\n75  \n\r95 64  \n\r17 47 82  \n\r18
+  35 87 10  \n\r20 04 82 47 65  \n\r19 01 23 75 03 34  \n\r88 02 77 73 07 63 67  \n\r99
+  65 04 28 06 16 70 92  \n\r41 41 26 56 83 40 80 70 33  \n\r41 48 72 33 47 32 37 16
+  94 29  \n\r53 71 44 65 25 43 91 52 97 51 14  \n\r70 11 33 28 77 73 17 78 39 68 17
+  57  \n\r91 71 52 38 17 14 91 43 58 50 27 29 48  \n\r63 66 04 68 89 53 67 30 73 16
+  69 87 40 31  \n\r04 62 98 27 23 09 70 98 73 93 38 53 60 04 23\n\n**NOTE:** As there
+  are only 16384 routes, it is possible to solve this problem by trying every route.
+  However, [Problem 67](problem=67), is the same challenge with a triangle containing
+  one-hundred rows; it cannot be solved by brute force, and requires a clever method!
+  ;o)\n\n"

data/data/problems/180.yml

@@ -2,33 +2,28 @@
 :id: 180
 :name: Rational zeros of a function of three variables
 :url: http://projecteuler.net/problem=180
-:content: "\r\n<p>For any integer <var>n</var>, consider the three functions</p>\r\n<p
-  style=\"margin-left:50px;\"><var>f</var><sub>1,<var>n</var></sub>(<var>x</var>,<var>y</var>,<var>z</var>)
-  = <var>x</var><sup><var>n</var>+1</sup> + <var>y</var><sup><var>n</var>+1</sup><img
-  src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>z</var><sup><var>n</var>+1</sup><br><var>f</var><sub>2,<var>n</var></sub>(<var>x</var>,<var>y</var>,<var>z</var>)
-  = (<var>xy</var> + <var>yz</var> + <var>zx</var>)*(<var>x</var><sup><var>n</var>-1</sup>
-  + <var>y</var><sup><var>n</var>-1</sup><img src=\"images/symbol_minus.gif\" width=\"9\"
-  height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\"><var>z</var><sup><var>n</var>-1</sup>)<br><var>f</var><sub>3,<var>n</var></sub>(<var>x</var>,<var>y</var>,<var>z</var>)
-  = <var>xyz</var>*(<var>x</var><sup><var>n</var>-2</sup> + <var>y</var><sup><var>n</var>-2</sup><img
-  src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>z</var><sup><var>n</var>-2</sup>)</p>\r\n<p>and
-  their combination</p>\r\n<p style=\"margin-left:50px;\"><var>f</var><sub><var>n</var></sub>(<var>x</var>,<var>y</var>,<var>z</var>)
+:content: "For any integer <var>n</var>, consider the three functions\n\n<var>f</var><sub>1,<var>n</var></sub>(<var>x</var>,<var>y</var>,<var>z</var>)
+  = <var>x</var><sup><var>n</var>+1</sup> + <var>y</var><sup><var>n</var>+1</sup>
+  ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif) <var>z</var><sup><var>n</var>+1</sup>
+  \ \n<var>f</var><sub>2,<var>n</var></sub>(<var>x</var>,<var>y</var>,<var>z</var>)
+  = (<var>xy</var> + <var>yz</var> + <var>zx</var>)\\*(<var>x</var><sup><var>n</var>-1</sup>
+  + <var>y</var><sup><var>n</var>-1</sup> ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)
+  <var>z</var><sup><var>n</var>-1</sup>)  \n<var>f</var><sub>3,<var>n</var></sub>(<var>x</var>,<var>y</var>,<var>z</var>)
+  = <var>xyz</var>\\*(<var>x</var><sup><var>n</var>-2</sup> + <var>y</var><sup><var>n</var>-2</sup>
+  ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif) <var>z</var><sup><var>n</var>-2</sup>)\n\nand
+  their combination\n\n<var>f</var><sub><var>n</var></sub>(<var>x</var>,<var>y</var>,<var>z</var>)
   = <var>f</var><sub>1,<var>n</var></sub>(<var>x</var>,<var>y</var>,<var>z</var>)
   + <var>f</var><sub>2,<var>n</var></sub>(<var>x</var>,<var>y</var>,<var>z</var>)
-  <img src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>f</var><sub>3,<var>n</var></sub>(<var>x</var>,<var>y</var>,<var>z</var>)</p>\r\n<p>We
+  ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif) <var>f</var><sub>3,<var>n</var></sub>(<var>x</var>,<var>y</var>,<var>z</var>)\n\nWe
   call (<var>x</var>,<var>y</var>,<var>z</var>) a golden triple of order <var>k</var>
   if <var>x</var>, <var>y</var>, and <var>z</var> are all rational numbers of the
-  form <var>a</var> / <var>b</var> with<br>\r\n0 <img src=\"images/symbol_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\"><var>a</var>
-  <img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\" 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>k</var>
-  and there is (at least) one integer <var>n</var>, so that <var>f</var><sub><var>n</var></sub>(<var>x</var>,<var>y</var>,<var>z</var>)
-  = 0.</p>\r\n<p>Let <var>s</var>(<var>x</var>,<var>y</var>,<var>z</var>) = <var>x</var>
-  + <var>y</var> + <var>z</var>.<br>\r\nLet <var>t</var> = <var>u</var> / <var>v</var>
+  form <var>a</var> / <var>b</var> with  \n\r0 ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)
+  <var>a</var> ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)
+  <var>b</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>k</var> and there is (at least) one integer <var>n</var>, so that <var>f</var><sub><var>n</var></sub>(<var>x</var>,<var>y</var>,<var>z</var>)
+  = 0.\n\nLet <var>s</var>(<var>x</var>,<var>y</var>,<var>z</var>) = <var>x</var>
+  + <var>y</var> + <var>z</var>.  \n\rLet <var>t</var> = <var>u</var> / <var>v</var>
   be the sum of all distinct <var>s</var>(<var>x</var>,<var>y</var>,<var>z</var>)
-  for all golden triples (<var>x</var>,<var>y</var>,<var>z</var>) of order 35.<br>
-  All the <var>s</var>(<var>x</var>,<var>y</var>,<var>z</var>) and <var>t</var>  must
-  be in reduced form.</p>\r\n<p>Find <var>u</var> + <var>v</var>.</p>\r\n"
+  for all golden triples (<var>x</var>,<var>y</var>,<var>z</var>) of order 35.  \n
+  All the <var>s</var>(<var>x</var>,<var>y</var>,<var>z</var>) and <var>t</var> must
+  be in reduced form.\n\nFind <var>u</var> + <var>v</var>.\n\n"

data/data/problems/181.yml

@@ -2,6 +2,10 @@
 :id: 181
 :name: Investigating in how many ways objects of two different colours can be grouped
 :url: http://projecteuler.net/problem=181
-:content: "\r\n<p>Having three black objects B and one white object W they can be
-  grouped in 7 ways like this:</p>\r\n<table cellpadding=\"10\" align=\"center\"><tr>\n<td>(BBBW)</td>\n<td>(B,BBW)</td>\n<td>(B,B,BW)</td>\n<td>(B,B,B,W)</td>\r\n<td>(B,BB,W)</td>\n<td>(BBB,W)</td>\n<td>(BB,BW)</td>\r\n</tr></table>\n<p>In
-  how many ways can sixty black objects B and forty white objects W be  thus grouped?</p>\r\n"
+:content: |+
+  Having three black objects B and one white object W they can be grouped in 7 ways like this:
+
+  | (BBBW) | (B,BBW) | (B,B,BW) | (B,B,B,W) | (B,BB,W) | (BBB,W) | (BB,BW) |
+
+  In how many ways can sixty black objects B and forty white objects W be thus grouped?
+

data/data/problems/182.yml

@@ -2,34 +2,29 @@
 :id: 182
 :name: RSA encryption
 :url: http://projecteuler.net/problem=182
-:content: "\r\n<p>The RSA encryption is based on the following procedure:</p>\r\n<p>Generate
-  two distinct primes <var>p</var> and <var>q</var>.<br>Compute <var>n=pq</var> and
-  φ=(<var>p</var>-1)(<var>q</var>-1).<br>\r\nFind an integer <var>e</var>, 1<img src=\"images/symbol_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\"><var>e</var><img
-  src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\"
-  style=\"vertical-align:middle;\">φ, such that gcd(<var>e</var>,φ)=1.</p>\r\n<p>A
-  message in this system is a number in the interval [0,<var>n</var>-1].<br>\r\nA
-  text to be encrypted is then somehow converted to messages (numbers in the interval
-  [0,<var>n</var>-1]).<br>\r\nTo encrypt the text,  for each message, <var>m</var>,
-  <var>c</var>=<var>m</var><sup><var>e</var></sup> mod <var>n</var> is calculated.</p>\r\n<p>To
+:content: "The RSA encryption is based on the following procedure:\n\nGenerate two
+  distinct primes <var>p</var> and <var>q</var>.  \nCompute <var>n=pq</var> and φ=(<var>p</var>-1)(<var>q</var>-1).
+  \ \n\rFind an integer <var>e</var>, 1 ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)<var>e</var>
+  ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)φ, such that
+  gcd(<var>e</var>,φ)=1.\n\nA message in this system is a number in the interval [0,<var>n</var>-1].
+  \ \n\rA text to be encrypted is then somehow converted to messages (numbers in the
+  interval [0,<var>n</var>-1]).  \n\rTo encrypt the text, for each message, <var>m</var>,
+  <var>c</var>=<var>m</var><sup><var>e</var></sup> mod <var>n</var> is calculated.\n\nTo
   decrypt the text, the following procedure is needed: calculate <var>d</var> such
   that <var>ed</var>=1 mod φ, then for each encrypted message, <var>c</var>, calculate
-  <var>m=c<sup>d</sup></var> mod <var>n</var>.</p>\r\n<p>There exist values of <var>e</var>
-  and <var>m</var>  such that <var>m<sup>e</sup></var> mod <var>n=m</var>.<br>We call
+  <var>m=c<sup>d</sup></var> mod <var>n</var>.\n\nThere exist values of <var>e</var>
+  and <var>m</var> such that <var>m<sup>e</sup></var> mod <var>n=m</var>.  \nWe call
   messages <var>m</var> for which <var>m<sup>e</sup></var> mod <var>n=m</var> unconcealed
-  messages.</p>\r\n<p>An issue when choosing <var>e</var> is that there should not
-  be too many unconcealed messages.  <br>For instance, let <var>p</var>=19 and <var>q</var>=37.<br>\r\nThen
-  <var>n</var>=19*37=703 and φ=18*36=648.<br>\r\nIf we choose <var>e</var>=181, then,
-  although gcd(181,648)=1 it turns out that all possible messages<br><var>m</var>
-  (0<img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>m</var><img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>n</var>-1)
-  are unconcealed when calculating <var>m<sup>e</sup></var> mod <var>n</var>.<br>\r\nFor
-  any valid choice of <var>e</var> there exist some unconcealed messages.<br>\r\nIt's
-  important that the number of unconcealed messages is at a minimum.</p>\r\n<p>Choose
-  <var>p</var>=1009 and <var>q</var>=3643.<br>\r\nFind the sum of all values of <var>e</var>,
-  1<img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>e</var><img src=\"images/symbol_lt.gif\" width=\"10\"
-  height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\">φ(1009,3643)
+  messages.\n\nAn issue when choosing <var>e</var> is that there should not be too
+  many unconcealed messages.   \nFor instance, let <var>p</var>=19 and <var>q</var>=37.
+  \ \n\rThen <var>n</var>=19\\*37=703 and φ=18\\*36=648.  \n\rIf we choose <var>e</var>=181,
+  then, although gcd(181,648)=1 it turns out that all possible messages  \n<var>m</var>
+  (0 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)<var>m</var>
+  ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)<var>n</var>-1)
+  are unconcealed when calculating <var>m<sup>e</sup></var> mod <var>n</var>.  \n\rFor
+  any valid choice of <var>e</var> there exist some unconcealed messages.  \n\rIt's
+  important that the number of unconcealed messages is at a minimum.\n\nChoose <var>p</var>=1009
+  and <var>q</var>=3643.  \n\rFind the sum of all values of <var>e</var>, 1 ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)<var>e</var>
+  ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)φ(1009,3643)
   and gcd(<var>e</var>,φ)=1, so that the number of unconcealed messages for this value
-  of <var>e</var> is at a minimum.</p>\r\n"
+  of <var>e</var> is at a minimum.\n\n"

data/data/problems/183.yml

@@ -2,26 +2,20 @@
 :id: 183
 :name: Maximum product of parts
 :url: http://projecteuler.net/problem=183
-:content: "\r\n<p>Let N be a positive integer and let N be split into <var>k</var>
-  equal parts, <var>r</var> = N/<var>k</var>, so that N = <var>r</var> + <var>r</var>
-  + ... + <var>r</var>.<br>\r\nLet P be the product of these parts, P = <var>r</var>
-  <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>r</var> <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;\"><var>r</var> = <var>r</var><sup><var>k</var></sup>.</p>\r\n\r\n<p>For
-  example, if 11 is split into five equal parts, 11 = 2.2 + 2.2 + 2.2 + 2.2 + 2.2,
-  then P = 2.2<sup>5</sup> = 51.53632.</p>\r\n\r\n<p>Let M(N) = P<sub>max</sub> for
-  a given value of N.</p>\r\n\r\n<p>It turns out that the maximum for N = 11 is found
-  by splitting eleven into four equal parts which leads to P<sub>max</sub> = (11/4)<sup>4</sup>;
-  that is, M(11) = 14641/256 = 57.19140625, which is a terminating decimal.</p>\r\n\r\n<p>However,
-  for N = 8 the maximum is achieved by splitting it into three equal parts, so M(8)
-  = 512/27, which is a non-terminating decimal.</p>\r\n\r\n<p>Let D(N) = N if M(N)
-  is a non-terminating decimal and D(N) = -N if M(N) is a terminating decimal.</p>\r\n\r\n<p>For
-  example, ΣD(N) for 5 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\"
-  alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> N <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  100 is 2438.</p>\r\n\r\n<p>Find ΣD(N) for 5 <img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> N <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  10000.</p>\r\n\r\n"
+:content: "Let N be a positive integer and let N be split into <var>k</var> equal
+  parts, <var>r</var> = N/<var>k</var>, so that N = <var>r</var> + <var>r</var> +
+  ... + <var>r</var>.  \n\rLet P be the product of these parts, P = <var>r</var> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  <var>r</var> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  ... ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) <var>r</var>
+  = <var>r</var><sup><var>k</var></sup>.\n\nFor example, if 11 is split into five
+  equal parts, 11 = 2.2 + 2.2 + 2.2 + 2.2 + 2.2, then P = 2.2<sup>5</sup> = 51.53632.\n\nLet
+  M(N) = P<sub>max</sub> for a given value of N.\n\nIt turns out that the maximum
+  for N = 11 is found by splitting eleven into four equal parts which leads to P<sub>max</sub>
+  = (11/4)<sup>4</sup>; that is, M(11) = 14641/256 = 57.19140625, which is a terminating
+  decimal.\n\nHowever, for N = 8 the maximum is achieved by splitting it into three
+  equal parts, so M(8) = 512/27, which is a non-terminating decimal.\n\nLet D(N) =
+  N if M(N) is a non-terminating decimal and D(N) = -N if M(N) is a terminating decimal.\n\nFor
+  example, ΣD(N) for 5 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  N ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 100 is
+  2438.\n\nFind ΣD(N) for 5 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  N ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 10000.\n\n"

data/data/problems/184.yml

@@ -2,17 +2,14 @@
 :id: 184
 :name: Triangles containing the origin
 :url: http://projecteuler.net/problem=184
-:content: "\r\n<p>Consider the set <var>I<sub>r</sub></var> of points (<var>x</var>,<var>y</var>)
-  with integer co-ordinates in the interior of the circle with radius <var>r</var>,
-  centered at the origin, i.e. <var>x</var><sup>2</sup> + <var>y</var><sup>2</sup><img
-  src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>r</var><sup>2</sup>.</p>\r\n<p>For a radius
-  of 2, <var>I</var><sub>2</sub> contains the nine points (0,0), (1,0), (1,1), (0,1),
-  (-1,1), (-1,0), (-1,-1), (0,-1) and (1,-1). There are eight triangles having all
-  three vertices in <var>I</var><sub>2</sub> which contain the origin in the interior.
-  Two of them are shown below, the others are obtained from these by rotation.</p>\r\n<p
-  style=\"margin-left:240px;\"><img src=\"project/images/p_184.gif\" alt=\"\"></p>\r\n\r\n<p>For
-  a radius of 3, there are 360 triangles containing the origin in the interior and
-  having all vertices in <var>I</var><sub>3</sub> and for <var>I</var><sub>5</sub>
-  the number is 10600.</p>\r\n\r\n<p>How many triangles are there containing the origin
-  in the interior and having all three vertices in <var>I</var><sub>105</sub>?</p>\r\n\r\n"
+:content: |+
+  Consider the set <var>I<sub>r</sub></var> of points (<var>x</var>,<var>y</var>) with integer co-ordinates in the interior of the circle with radius <var>r</var>, centered at the origin, i.e. <var>x</var><sup>2</sup> + <var>y</var><sup>2</sup> ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif) <var>r</var><sup>2</sup>.
+
+  For a radius of 2, <var>I</var><sub>2</sub> contains the nine points (0,0), (1,0), (1,1), (0,1), (-1,1), (-1,0), (-1,-1), (0,-1) and (1,-1). There are eight triangles having all three vertices in <var>I</var><sub>2</sub> which contain the origin in the interior. Two of them are shown below, the others are obtained from these by rotation.
+
+  ![](/home/will/src/euler-manager/config/../data/images/p_184.gif)
+
+  For a radius of 3, there are 360 triangles containing the origin in the interior and having all vertices in <var>I</var><sub>3</sub> and for <var>I</var><sub>5</sub> the number is 10600.
+
+  How many triangles are there containing the origin in the interior and having all three vertices in <var>I</var><sub>105</sub>?
+

data/data/problems/185.yml

@@ -2,21 +2,20 @@
 :id: 185
 :name: Number Mind
 :url: http://projecteuler.net/problem=185
-:content: "\r\n<p>The game Number Mind is a variant of the well known game Master
-  Mind.</p>\r\n<p>Instead of coloured pegs, you have to guess a secret sequence of
-  digits. After each guess you're only told in how many places you've guessed the
-  correct digit. So, if the sequence was 1234 and you guessed 2036, you'd be told
-  that you have one correct digit; however, you would NOT be told that you also have
-  another digit in the wrong place.</p>\r\n\r\n<p>For instance, given the following
-  guesses for a 5-digit secret sequence,</p>\r\n<p style=\"margin-left:50px;\">90342
-  ;2 correct<br>\r\n70794 ;0 correct<br>\r\n39458 ;2 correct<br>\r\n34109 ;1 correct<br>\r\n51545
-  ;2 correct<br>\r\n12531 ;1 correct</p>\r\n<p>The correct sequence 39542 is unique.</p>\r\n\r\n<p>Based
-  on the following guesses,</p>\r\n\r\n<p style=\"margin-left:50px;\">5616185650518293
-  ;2 correct<br>\r\n3847439647293047 ;1 correct<br>\r\n5855462940810587 ;3 correct<br>\r\n9742855507068353
-  ;3 correct<br>\r\n4296849643607543 ;3 correct<br>\r\n3174248439465858 ;1 correct<br>\r\n4513559094146117
-  ;2 correct<br>\r\n7890971548908067 ;3 correct<br>\r\n8157356344118483 ;1 correct<br>\r\n2615250744386899
-  ;2 correct<br>\r\n8690095851526254 ;3 correct<br>\r\n6375711915077050 ;1 correct<br>\r\n6913859173121360
-  ;1 correct<br>\r\n6442889055042768 ;2 correct<br>\r\n2321386104303845 ;0 correct<br>\r\n2326509471271448
-  ;2 correct<br>\r\n5251583379644322 ;2 correct<br>\r\n1748270476758276 ;3 correct<br>\r\n4895722652190306
-  ;1 correct<br>\r\n3041631117224635 ;3 correct<br>\r\n1841236454324589 ;3 correct<br>\r\n2659862637316867
-  ;2 correct</p>\r\n\r\n<p>Find the unique 16-digit secret sequence.</p>\r\n"
+:content: "The game Number Mind is a variant of the well known game Master Mind.\n\nInstead
+  of coloured pegs, you have to guess a secret sequence of digits. After each guess
+  you're only told in how many places you've guessed the correct digit. So, if the
+  sequence was 1234 and you guessed 2036, you'd be told that you have one correct
+  digit; however, you would NOT be told that you also have another digit in the wrong
+  place.\n\nFor instance, given the following guesses for a 5-digit secret sequence,\n\n90342
+  ;2 correct  \n\r70794 ;0 correct  \n\r39458 ;2 correct  \n\r34109 ;1 correct  \n\r51545
+  ;2 correct  \n\r12531 ;1 correct\n\nThe correct sequence 39542 is unique.\n\nBased
+  on the following guesses,\n\n5616185650518293 ;2 correct  \n\r3847439647293047 ;1
+  correct  \n\r5855462940810587 ;3 correct  \n\r9742855507068353 ;3 correct  \n\r4296849643607543
+  ;3 correct  \n\r3174248439465858 ;1 correct  \n\r4513559094146117 ;2 correct  \n\r7890971548908067
+  ;3 correct  \n\r8157356344118483 ;1 correct  \n\r2615250744386899 ;2 correct  \n\r8690095851526254
+  ;3 correct  \n\r6375711915077050 ;1 correct  \n\r6913859173121360 ;1 correct  \n\r6442889055042768
+  ;2 correct  \n\r2321386104303845 ;0 correct  \n\r2326509471271448 ;2 correct  \n\r5251583379644322
+  ;2 correct  \n\r1748270476758276 ;3 correct  \n\r4895722652190306 ;1 correct  \n\r3041631117224635
+  ;3 correct  \n\r1841236454324589 ;3 correct  \n\r2659862637316867 ;2 correct\n\nFind
+  the unique 16-digit secret sequence.\n\n"