euler-manager 0.0.5 → 0.0.6

data/data/problems/236.yml

@@ -2,31 +2,29 @@
 :id: 236
 :name: Luxury Hampers
 :url: http://projecteuler.net/problem=236
-:content: "\r\n<style type=\"text/css\">\r\ntable.p236, table.p236 th, table.p236
+:content: "<style type=\"text/css\"><![CDATA[\r\ntable.p236, table.p236 th, table.p236
   td {\r\n  border-width: 1px 1px 1px 1px;\r\n  border-style: solid solid solid solid;\r\n
   \ border-color: black black black black;\r\n  text-align:right;\r\n  -moz-border-radius:
   0px 0px 0px 0px;\r\n}\r\ntable.p236 {\r\n  border-spacing: 1px;\r\n  border-collapse:
   separate;\r\n  background-color: rgb(224,237,252);\r\n}\r\ntable.p236 th, table.p236
   td {\r\n  padding: 1px 6px 1px 6px;\r\n}\r\ntable.p236 th { background-color: rgb(193,218,249);
-  }\r\ntable.p236 td { background-color: rgb(255,255,255); }\r\n</style>\n<p>Suppliers
-  'A' and 'B' provided the following numbers of products for the luxury hamper market:</p>\r\n\r\n<p></p>\n<center><table
-  class=\"p236\">\n<tr>\n<th>Product</th>\n<th style=\"text-align:center\">'A'</th>\n<th
-  style=\"text-align:center\">'B'</th>\n</tr>\n<tr>\n<td>Beluga Caviar</td>\n<td>5248</td>\n<td>640</td>\n</tr>\n<tr>\n<td>Christmas
-  Cake</td>\n<td>1312</td>\n<td>1888</td>\n</tr>\n<tr>\n<td>Gammon Joint</td>\n<td>2624</td>\n<td>3776</td>\n</tr>\n<tr>\n<td>Vintage
-  Port</td>\n<td>5760</td>\n<td>3776</td>\n</tr>\n<tr>\n<td>Champagne Truffles</td>\n<td>3936</td>\n<td>5664</td>\n</tr>\n</table></center>\r\n\r\n<p>Although
+  }\r\ntable.p236 td { background-color: rgb(255,255,255); }\r\n]]></style>\n\nSuppliers
+  'A' and 'B' provided the following numbers of products for the luxury hamper market:\n\n<center><table
+  class=\"p236\">\r\n<tr>\n<th>Product</th>\n<th style=\"text-align:center\">'A'</th>\n<th
+  style=\"text-align:center\">'B'</th>\n</tr>\r\n<tr>\n<td>Beluga Caviar</td>\n<td>5248</td>\n<td>640</td>\n</tr>\r\n<tr>\n<td>Christmas
+  Cake</td>\n<td>1312</td>\n<td>1888</td>\n</tr>\r\n<tr>\n<td>Gammon Joint</td>\n<td>2624</td>\n<td>3776</td>\n</tr>\r\n<tr>\n<td>Vintage
+  Port</td>\n<td>5760</td>\n<td>3776</td>\n</tr>\r\n<tr>\n<td>Champagne Truffles</td>\n<td>3936</td>\n<td>5664</td>\n</tr>\r\n</table></center>\n\nAlthough
   the suppliers try very hard to ship their goods in perfect condition, there is inevitably
-  some spoilage - <i>i.e.</i> products gone bad.</p>\r\n\r\n<p>The suppliers compare
-  their performance using two types of statistic:</p>\n<ul>\n<li>The five <i>per-product
-  spoilage rates</i> for each supplier are equal to the number of products gone bad
-  divided by the number of products supplied, for each of the five products in turn.</li>\r\n
-  \ <li>The <i>overall spoilage rate</i> for each supplier is equal to the total number
-  of products gone bad divided by the total number of products provided by that supplier.</li>\n</ul>\n<p>To
-  their surprise, the suppliers found that each of the five per-product spoilage rates
-  was worse (higher) for 'B' than for 'A' by the same factor (ratio of spoilage rates),
-  <var>m</var>&gt;1; and yet, paradoxically, the overall spoilage rate was worse for
-  'A' than for 'B', also by a factor of <var>m</var>.</p>\r\n\r\n<p>There are thirty-five
-  <var>m</var><img src=\"images/symbol_gt.gif\" width=\"10\" height=\"10\" alt=\"&gt;\"
-  border=\"0\" style=\"vertical-align:middle;\">1 for which this surprising result
-  could have occurred, the smallest of which is 1476/1475.</p>\r\n\r\n<p>What's the
-  largest possible value of <var>m</var>?<br>\r\nGive your answer as a fraction reduced
-  to its lowest terms, in the form <var>u</var>/<var>v</var>.</p>\r\n"
+  some spoilage - _i.e._ products gone bad.\n\nThe suppliers compare their performance
+  using two types of statistic:\n\n- The five _per-product spoilage rates_ for each
+  supplier are equal to the number of products gone bad divided by the number of products
+  supplied, for each of the five products in turn.\n- The _overall spoilage rate_
+  for each supplier is equal to the total number of products gone bad divided by the
+  total number of products provided by that supplier.\n\nTo their surprise, the suppliers
+  found that each of the five per-product spoilage rates was worse (higher) for 'B'
+  than for 'A' by the same factor (ratio of spoilage rates), <var>m</var>>1; and yet,
+  paradoxically, the overall spoilage rate was worse for 'A' than for 'B', also by
+  a factor of <var>m</var>.\n\nThere are thirty-five <var>m</var> ![>](/home/will/src/euler-manager/config/../data/images/symbol_gt.gif)1
+  for which this surprising result could have occurred, the smallest of which is 1476/1475.\n\nWhat's
+  the largest possible value of <var>m</var>?  \n\rGive your answer as a fraction
+  reduced to its lowest terms, in the form <var>u</var>/<var>v</var>.\n\n"

data/data/problems/237.yml

@@ -2,12 +2,17 @@
 :id: 237
 :name: Tours on a 4 x n playing board
 :url: http://projecteuler.net/problem=237
-:content: "\r\n<p>Let T(<i>n</i>) be the number of tours over a 4 <img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"><i>n</i>
-  playing board such that:</p>\r\n<ul>\n<li>The tour starts in the top left corner.</li>\r\n<li>The
-  tour consists of moves that are up, down, left, or right one square.</li>\r\n<li>The
-  tour visits each square exactly once.</li>\r\n<li>The tour ends in the bottom left
-  corner.</li>\r\n</ul>\n<p>The diagram shows one tour over a 4 <img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">
-  10 board:</p>\r\n\r\n<div style=\"text-align:center;\">\r\n<img src=\"project/images/p_237.gif\"
-  alt=\"\">\n</div>\r\n\r\n<p>T(10) is 2329. What is T(10<sup>12</sup>) modulo 10<sup>8</sup>?</p>\r\n"
+:content: |+
+  Let T(_n_) be the number of tours over a 4 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) _n_ playing board such that:
+
+  - The tour starts in the top left corner.
+  - The tour consists of moves that are up, down, left, or right one square.
+  - The tour visits each square exactly once.
+  - The tour ends in the bottom left corner.
+
+  The diagram shows one tour over a 4 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) 10 board:
+
+   ![](/home/will/src/euler-manager/config/../data/images/p_237.gif)
+
+  T(10) is 2329. What is T(10<sup>12</sup>) modulo 10<sup>8</sup>?
+

data/data/problems/238.yml

@@ -2,41 +2,29 @@
 :id: 238
 :name: Infinite string tour
 :url: http://projecteuler.net/problem=238
-:content: "\r\n<style type=\"text/css\">\r\ntable.p238 td { padding: 0px 3px 0px 3px;
-  }\r\n</style>\n<p>Create a sequence of numbers using the \"Blum Blum Shub\" pseudo-random
-  number generator:</p>\r\n\r\n<center><table class=\"p238\">\n<tr>\n<td style=\"text-align:right\">\n<var>s</var><sub>0</sub>\n</td>\r\n
-  \   <td>=</td>\r\n    <td>14025256</td>\r\n  </tr>\n<tr>\n<td>\n<var>s</var><sub><var>n</var>+1</sub>\n</td>\r\n
+:content: "<style type=\"text/css\"><![CDATA[\r\ntable.p238 td { padding: 0px 3px
+  0px 3px; }\r\n]]></style>\n\nCreate a sequence of numbers using the \"Blum Blum
+  Shub\" pseudo-random number generator:\n\n<center><table class=\"p238\">\r\n  <tr>\r\n
+  \   <td style=\"text-align:right\">\n<var>s</var><sub>0</sub>\n</td>\r\n    <td>=</td>\r\n
+  \   <td>14025256</td>\r\n  </tr>\n<tr>\r\n    <td>\n<var>s</var><sub><var>n</var>+1</sub>\n</td>\r\n
   \   <td>=</td>\r\n    <td>\n<var>s</var><sub><var>n</var></sub><sup>2</sup> mod
-  20300713</td>\r\n  </tr>\n</table></center>\r\n\r\n<p>Concatenate these numbers
-   <var>s</var><sub>0</sub><var>s</var><sub>1</sub><var>s</var><sub>2</sub>… to create
-  a string <var>w</var> of infinite length.<br>\r\nThen, <var>w</var> = <span style=\"font-family:courier
-  new;font-size:12pt;color:#0000ff;\">14025256741014958470038053646…</span></p>\r\n\r\n<p>For
+  20300713</td>\r\n  </tr>\r\n</table></center>\n\nConcatenate these numbers  <var>s</var><sub>0</sub><var>s</var><sub>1</sub><var>s</var><sub>2</sub>…
+  to create a string <var>w</var> of infinite length.  \n\rThen, <var>w</var> = 14025256741014958470038053646…\n\nFor
   a positive integer <var>k</var>, if no substring of <var>w</var> exists with a sum
   of digits equal to <var>k</var>, <var>p</var>(<var>k</var>) is defined to be zero.
   If at least one substring of <var>w</var> exists with a sum of digits equal to <var>k</var>,
   we define <var>p</var>(<var>k</var>) = <var>z</var>, where <var>z</var> is the starting
-  position of the earliest such substring.</p>\r\n\r\n<p>For instance:</p>\r\n\r\n<p>The
-  substrings <span style=\"font-family:courier new;font-size:12pt;color:#0000ff;\">1</span>,
-  <span style=\"font-family:courier new;font-size:12pt;color:#0000ff;\">14</span>,
-  <span style=\"font-family:courier new;font-size:12pt;color:#0000ff;\">1402</span>,
-  … <br>\r\nwith respective sums of digits equal to 1, 5, 7, …<br>\r\nstart at position
-  <b>1</b>, hence <var>p</var>(1) = <var>p</var>(5) = <var>p</var>(7) = … = <b>1</b>.</p>\r\n\r\n<p>The
-  substrings <span style=\"font-family:courier new;font-size:12pt;color:#0000ff;\">4</span>,
-  <span style=\"font-family:courier new;font-size:12pt;color:#0000ff;\">402</span>,
-  <span style=\"font-family:courier new;font-size:12pt;color:#0000ff;\">4025</span>,
-  …<br>\r\nwith respective sums of digits equal to 4, 6, 11, …<br>\r\nstart at position
-  <b>2</b>, hence <var>p</var>(4) = <var>p</var>(6) = <var>p</var>(11) = … = <b>2</b>.</p>\r\n\r\n<p>The
-  substrings <span style=\"font-family:courier new;font-size:12pt;color:#0000ff;\">02</span>,
-  <span style=\"font-family:courier new;font-size:12pt;color:#0000ff;\">0252</span>,
-  …<br>\r\nwith respective sums of digits equal to 2, 9, …<br>\r\nstart at position
-  <b>3</b>, hence <var>p</var>(2) = <var>p</var>(9) = … = <b>3</b>.</p>\n<p>\r\n\r\n</p>\n<p>Note
-  that substring <span style=\"font-family:courier new;font-size:12pt;color:#0000ff;\">025</span>
-  starting at position <b>3</b>, has a sum of digits equal to 7, but there was an
-  earlier substring (starting at position <b>1</b>) with a sum of digits equal to
-  7, so <var>p</var>(7) = 1, <i>not</i> 3.</p>\r\n\r\n<p>We can verify that, for 0 k <img
-  src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> 10<sup>3</sup>,
-  <img src=\"images/symbol_sum.gif\" width=\"11\" height=\"14\" alt=\"∑\" border=\"0\"
-  style=\"vertical-align:middle;\"> <var>p</var>(<var>k</var>) = 4742.</p>\r\n\r\n<p>Find
-  <img src=\"images/symbol_sum.gif\" width=\"11\" height=\"14\" alt=\"∑\" border=\"0\"
-  style=\"vertical-align:middle;\"> <var>p</var>(<var>k</var>), for 0 k <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> 2·10<sup>15</sup>.</p>\r\n"
+  position of the earliest such substring.\n\nFor instance:\n\nThe substrings 1, 14,
+  1402, …   \n\rwith respective sums of digits equal to 1, 5, 7, …  \n\rstart at position
+  **1** , hence <var>p</var>(1) = <var>p</var>(5) = <var>p</var>(7) = … =  **1** .\n\nThe
+  substrings 4, 402, 4025, …  \n\rwith respective sums of digits equal to 4, 6, 11,
+  …  \n\rstart at position **2** , hence <var>p</var>(4) = <var>p</var>(6) = <var>p</var>(11) = … = 
+  **2** .\n\nThe substrings 02, 0252, …  \n\rwith respective sums of digits equal
+  to 2, 9, …  \n\rstart at position **3** , hence <var>p</var>(2) = <var>p</var>(9) = … = 
+  **3** .\n\nNote that substring 025 starting at position **3** , has a sum of digits
+  equal to 7, but there was an earlier substring (starting at position **1** ) with
+  a sum of digits equal to 7, so <var>p</var>(7) = 1, _not_ 3.\n\nWe can verify that,
+  for 0 k  ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 10<sup>3</sup>,
+  ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif) <var>p</var>(<var>k</var>)
+  = 4742.\n\nFind ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif) <var>p</var>(<var>k</var>),
+  for 0 k  ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 2·10<sup>15</sup>.\n\n"

data/data/problems/239.yml

@@ -2,8 +2,8 @@
 :id: 239
 :name: Twenty-two Foolish Primes
 :url: http://projecteuler.net/problem=239
-:content: "\r\n<p>A set of disks numbered 1 through 100 are placed in a line in random
-  order.</p>\r\n\r\n<p>What is the probability that we have a partial derangement
-  such that exactly 22 prime number discs are found away from their natural positions?<br>\r\n(Any
-  number of non-prime disks may also be found in or out of their natural positions.)</p>\r\n\r\n<p>Give
-  your answer rounded to 12 places behind the decimal point in the form 0.abcdefghijkl.</p>\r\n\r\n"
+:content: "A set of disks numbered 1 through 100 are placed in a line in random order.\n\nWhat
+  is the probability that we have a partial derangement such that exactly 22 prime
+  number discs are found away from their natural positions?  \n\r(Any number of non-prime
+  disks may also be found in or out of their natural positions.)\n\nGive your answer
+  rounded to 12 places behind the decimal point in the form 0.abcdefghijkl.\n\n"

data/data/problems/24.yml

@@ -2,9 +2,10 @@
 :id: 24
 :name: Lexicographic permutations
 :url: http://projecteuler.net/problem=24
-:content: "\r\n<p>A permutation is an ordered arrangement of objects. For example,
-  3124 is one possible permutation of the digits 1, 2, 3 and 4. If all of the permutations
-  are listed numerically or alphabetically, we call it lexicographic order. The lexicographic
-  permutations of 0, 1 and 2 are:</p>\r\n<p style=\"text-align:center;\">012   021 
-   102   120   201   210</p>\r\n<p>What is the millionth lexicographic permutation
-  of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9?</p>\r\n\r\n"
+:content: |+
+  A permutation is an ordered arrangement of objects. For example, 3124 is one possible permutation of the digits 1, 2, 3 and 4. If all of the permutations are listed numerically or alphabetically, we call it lexicographic order. The lexicographic permutations of 0, 1 and 2 are:
+
+  012   021   102   120   201   210
+
+  What is the millionth lexicographic permutation of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9?
+

data/data/problems/240.yml

@@ -2,10 +2,10 @@
 :id: 240
 :name: Top Dice
 :url: http://projecteuler.net/problem=240
-:content: "\r\n<p>There are 1111 ways in which five 6-sided dice (sides numbered 1
-  to 6) can be rolled so that the top three sum to 15. Some examples are:\r\n\r\n<br><br>\r\nD<sub>1</sub>,D<sub>2</sub>,D<sub>3</sub>,D<sub>4</sub>,D<sub>5</sub>
-  = 4,3,6,3,5\r\n<br>\r\nD<sub>1</sub>,D<sub>2</sub>,D<sub>3</sub>,D<sub>4</sub>,D<sub>5</sub>
-  = 4,3,3,5,6\r\n<br>\r\nD<sub>1</sub>,D<sub>2</sub>,D<sub>3</sub>,D<sub>4</sub>,D<sub>5</sub>
-  = 3,3,3,6,6\r\n<br>\r\nD<sub>1</sub>,D<sub>2</sub>,D<sub>3</sub>,D<sub>4</sub>,D<sub>5</sub>
-  = 6,6,3,3,3\r\n<br><br>\r\nIn how many ways can twenty 12-sided dice (sides numbered
-  1 to 12) be rolled so that the top ten sum to 70?</p>\r\n"
+:content: "There are 1111 ways in which five 6-sided dice (sides numbered 1 to 6)
+  can be rolled so that the top three sum to 15. Some examples are:\r\r  \n  \n  \n\rD<sub>1</sub>,D<sub>2</sub>,D<sub>3</sub>,D<sub>4</sub>,D<sub>5</sub>
+  = 4,3,6,3,5\r  \n\rD<sub>1</sub>,D<sub>2</sub>,D<sub>3</sub>,D<sub>4</sub>,D<sub>5</sub>
+  = 4,3,3,5,6\r  \n\rD<sub>1</sub>,D<sub>2</sub>,D<sub>3</sub>,D<sub>4</sub>,D<sub>5</sub>
+  = 3,3,3,6,6\r  \n\rD<sub>1</sub>,D<sub>2</sub>,D<sub>3</sub>,D<sub>4</sub>,D<sub>5</sub>
+  = 6,6,3,3,3\r  \n  \n  \n\rIn how many ways can twenty 12-sided dice (sides numbered
+  1 to 12) be rolled so that the top ten sum to 70?\n\n"

data/data/problems/241.yml

@@ -2,16 +2,13 @@
 :id: 241
 :name: Perfection Quotients
 :url: http://projecteuler.net/problem=241
-:content: "\r\n<p>For a positive integer <var>n</var>, let σ(<var>n</var>) be the
-  sum of all divisors of <var>n</var>, so e.g. σ(6) = 1 + 2 + 3 + 6 = 12.\r\n</p>\r\n\r\n<p>A
-  perfect number, as you probably know, is a number with σ(<var>n</var>) = 2<var>n</var>.</p>\r\n\r\n<p></p>\n<div
-  style=\"text-align:left;\">\r\n<table><tr>\n<td>Let us define the <b>perfection
-  quotient</b> of a positive integer as</td>\n<td>\n<var>p</var>(<var>n</var>)</td>\n<td>= </td>\r\n<td><div
-  style=\"text-align:center;\">σ(<var>n</var>)<br><img src=\"images/blackdot.gif\"
-  width=\"30\" height=\"1\" alt=\"\"><br><var>n</var>\n</div></td>\r\n<td>.</td>\r\n</tr></table>\n</div>\r\n\r\n<!--\r\n<p>Let
-  us define the <b>perfection quotient</b> of a positive integer as <var>p</var>(<var>n</var>)
-  = <font \"size=4\"> <sup>&sigma;(<var>n</var>)</sup>&frasl;<sub><var>n</var></sub></font>.</p>\r\n-->\r\n<p>Find
-  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;\">
+:content: "For a positive integer <var>n</var>, let σ(<var>n</var>) be the sum of
+  all divisors of <var>n</var>, so e.g. σ(6) = 1 + 2 + 3 + 6 = 12.\n\nA perfect number,
+  as you probably know, is a number with σ(<var>n</var>) = 2<var>n</var>.\n\n| Let
+  us define the **perfection quotient** of a positive integer as | <var>p</var>(<var>n</var>)
+  | =  | \nσ(<var>n</var>)  \n ![](/home/will/src/euler-manager/config/../data/images/blackdot.gif)
+  \ \n<var>n</var>\n | . |\n\n<!--\r\n<p>Let us define the <b>perfection quotient</b>
+  of a positive integer as <var>p</var>(<var>n</var>) = <font \"size=4\"> <sup>&sigma;(<var>n</var>)</sup>&frasl;<sub><var>n</var></sub></font>.</p>\r\n-->\n\nFind
+  the sum of all positive integers <var>n</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
   10<sup>18</sup> for which <var>p</var>(<var>n</var>) has the form <var>k</var> +
-  <sup>1</sup>⁄<sub>2</sub>, where <var>k</var> is an integer.</p>\r\n\r\n"
+  <sup>1</sup>⁄<sub>2</sub>, where <var>k</var> is an integer.\n\n"

data/data/problems/242.yml

@@ -2,15 +2,13 @@
 :id: 242
 :name: Odd Triplets
 :url: http://projecteuler.net/problem=242
-:content: "\r\n<p>Given the set {1,2,...,<var>n</var>}, we define <var>f</var>(<var>n</var>,<var>k</var>)
+:content: "Given the set {1,2,...,<var>n</var>}, we define <var>f</var>(<var>n</var>,<var>k</var>)
   as the number of its <var>k</var>-element subsets with an odd sum of elements. For
   example, <var>f</var>(5,3) = 4, since the set {1,2,3,4,5} has four 3-element subsets
-  having an odd sum of elements, i.e.: {1,2,4}, {1,3,5}, {2,3,4} and {2,4,5}.</p>\r\n\r\n<p>When
+  having an odd sum of elements, i.e.: {1,2,4}, {1,3,5}, {2,3,4} and {2,4,5}.\n\nWhen
   all three values <var>n</var>, <var>k</var> and <var>f</var>(<var>n</var>,<var>k</var>)
-  are odd, we say that they make <br>\r\nan <i>odd-triplet</i> [<var>n</var>,<var>k</var>,<var>f</var>(<var>n</var>,<var>k</var>)].</p>\r\n\r\n<p>There
-  are exactly five odd-triplets with <var>n</var> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> 10,
-  namely:<br>\r\n[1,1,<var>f</var>(1,1) = 1], [5,1,<var>f</var>(5,1) = 3], [5,5,<var>f</var>(5,5) = 1],
-  [9,1,<var>f</var>(9,1) = 5] and [9,9,<var>f</var>(9,9) = 1].</p>\r\n\r\n<p>How many
-  odd-triplets are there with <var>n</var> <img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> 10<sup>12</sup> ?</p>\r\n"
+  are odd, we say that they make   \n\ran _odd-triplet_ [<var>n</var>,<var>k</var>,<var>f</var>(<var>n</var>,<var>k</var>)].\n\nThere
+  are exactly five odd-triplets with <var>n</var>  ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 10,
+  namely:  \n\r[1,1,<var>f</var>(1,1) = 1], [5,1,<var>f</var>(5,1) = 3], [5,5,<var>f</var>(5,5) = 1],
+  [9,1,<var>f</var>(9,1) = 5] and [9,9,<var>f</var>(9,9) = 1].\n\nHow many odd-triplets
+  are there with <var>n</var>  ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 10<sup>12</sup> ?\n\n"

data/data/problems/243.yml

@@ -2,18 +2,17 @@
 :id: 243
 :name: Resilience
 :url: http://projecteuler.net/problem=243
-:content: "\r\n<p> </p>\r\n<p>A positive fraction whose numerator is less than its
-  denominator is called a proper fraction.<br>\r\nFor any denominator, <var>d</var>,
-  there will be <var>d</var><img src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\"
-  alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">1 proper fractions; for
-  example, with <var>d</var> = 12:<br><sup>1</sup>/<sub>12</sub> , <sup>2</sup>/<sub>12</sub>
-  , <sup>3</sup>/<sub>12</sub> , <sup>4</sup>/<sub>12</sub> , <sup>5</sup>/<sub>12</sub>
-  , <sup>6</sup>/<sub>12</sub> , <sup>7</sup>/<sub>12</sub> , <sup>8</sup>/<sub>12</sub>
-  , <sup>9</sup>/<sub>12</sub> , <sup>10</sup>/<sub>12</sub> , <sup>11</sup>/<sub>12</sub>
-  .\r\n</p>\r\n\r\n<p>We shall call a fraction that cannot be cancelled down a <i>resilient
-  fraction</i>.<br>\r\nFurthermore we shall define the <i>resilience</i> of a denominator,
-  <var>R</var>(<var>d</var>), to be the ratio of its proper fractions that are resilient;
-  for example, <var>R</var>(12) = <sup>4</sup>/<sub>11</sub> .<br>\r\nIn fact, <var>d</var> = 12
-  is the smallest denominator having a resilience <var>R</var>(<var>d</var>) 4/<sub>10</sub>
-  .</p>\r\n\r\n<p>Find the smallest denominator <var>d</var>, having a resilience
-  <var>R</var>(<var>d</var>) 15499/<sub>94744</sub> .</p>\r\n\r\n"
+:content: "A positive fraction whose numerator is less than its denominator is called
+  a proper fraction.  \n\rFor any denominator, <var>d</var>, there will be <var>d</var>
+  ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)1 proper
+  fractions; for example, with <var>d</var> = 12:  \n<sup>1</sup>/<sub>12</sub> ,
+  <sup>2</sup>/<sub>12</sub> , <sup>3</sup>/<sub>12</sub> , <sup>4</sup>/<sub>12</sub>
+  , <sup>5</sup>/<sub>12</sub> , <sup>6</sup>/<sub>12</sub> , <sup>7</sup>/<sub>12</sub>
+  , <sup>8</sup>/<sub>12</sub> , <sup>9</sup>/<sub>12</sub> , <sup>10</sup>/<sub>12</sub>
+  , <sup>11</sup>/<sub>12</sub> .\n\nWe shall call a fraction that cannot be cancelled
+  down a _resilient fraction_.  \n\rFurthermore we shall define the _resilience_ of
+  a denominator, <var>R</var>(<var>d</var>), to be the ratio of its proper fractions
+  that are resilient; for example, <var>R</var>(12) = <sup>4</sup>/<sub>11</sub> .
+  \ \n\rIn fact, <var>d</var> = 12 is the smallest denominator having a resilience
+  <var>R</var>(<var>d</var>) 4/<sub>10</sub> .\n\nFind the smallest denominator <var>d</var>,
+  having a resilience <var>R</var>(<var>d</var>) 15499/<sub>94744</sub> .\n\n"

data/data/problems/244.yml

@@ -2,31 +2,22 @@
 :id: 244
 :name: Sliders
 :url: http://projecteuler.net/problem=244
-:content: "\r\n<p>You probably know the game <i>Fifteen Puzzle</i>. Here, instead
-  of numbered tiles, we have seven red tiles and eight blue tiles.</p>\r\n<p>A move
-  is denoted by the uppercase initial of the direction (Left, Right, Up, Down) in
-  which the tile is slid, e.g. starting from configuration (<b>S</b>), by the sequence
-  <b>LULUR</b> we reach the configuration (<b>E</b>):</p>\r\n<p></p>\n<div style=\"text-align:
-  center;\">\r\n<table cellspacing=\"0\" cellpadding=\"2\" border=\"0\" align=\"center\"><tr>\n<td
-  width=\"25\">(<b>S</b>)</td>\n<td width=\"100\"><img src=\"project/images/p_244_start.gif\"></td>\n<td
-  width=\"25\">, (<b>E</b>)</td>\n<td width=\"100\"><img src=\"project/images/p_244_example.gif\"></td>\r\n</tr></table>\n</div>\r\n\r\n<p>For
-  each path, its checksum is calculated by (pseudocode):\r\n</p>\n<div style=\"margin-left:
-  100px;\">\r\nchecksum = 0<br>\r\nchecksum = (checksum <img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">
-  243 + <var>m</var><sub>1</sub>) mod 100 000 007<br>\r\nchecksum = (checksum <img
-  src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\"> 243 + <var>m</var><sub>2</sub>) mod 100 000 007<br>\r\n   …<br>\r\nchecksum
-  = (checksum <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\"
-  border=\"0\" style=\"vertical-align:middle;\"> 243 + <var>m</var><sub><var>n</var></sub>)
-  mod 100 000 007<br>\n</div>\r\nwhere <var>m</var><sub><var>k</var></sub> is the
-  ASCII value of the <var>k</var><sup><var>th</var></sup> letter in the move sequence
-  and the ASCII values for the moves are:\r\n\r\n<div style=\"text-align:center;\">\r\n<table
-  cellspacing=\"0\" cellpadding=\"2\" border=\"1\" align=\"center\">\n<tr>\n<td width=\"30\"><b>L</b></td>\n<td
-  width=\"30\">76</td>\n</tr>\n<tr>\n<td><b>R</b></td>\n<td>82</td>\n</tr>\n<tr>\n<td><b>U</b></td>\n<td>85</td>\n</tr>\n<tr>\n<td><b>D</b></td>\n<td>68</td>\n</tr>\n</table>\n</div>\r\n\r\n<p>For
-  the sequence <b>LULUR</b> given above, the checksum would be 19761398.</p>\r\n<p>Now,
-  starting from configuration (<b>S</b>),\r\nfind all shortest ways to reach configuration
-  (<b>T</b>).</p>\r\n<p></p>\n<div style=\"text-align: center;\">\r\n<table cellspacing=\"0\"
-  cellpadding=\"2\" border=\"0\" align=\"center\"><tr>\n<td width=\"25\">(<b>S</b>)</td>\n<td
-  width=\"100\"><img src=\"project/images/p_244_start.gif\"></td>\n<td width=\"25\">, (<b>T</b>)</td>\n<td
-  width=\"100\"><img src=\"project/images/p_244_target.gif\"></td>\r\n</tr></table>\n</div>\r\n\r\n<p>What
-  is the sum of all checksums for the paths having the minimal length?</p>\r\n"
+:content: "You probably know the game _Fifteen Puzzle_. Here, instead of numbered
+  tiles, we have seven red tiles and eight blue tiles.\n\nA move is denoted by the
+  uppercase initial of the direction (Left, Right, Up, Down) in which the tile is
+  slid, e.g. starting from configuration ( **S** ), by the sequence **LULUR** we reach
+  the configuration ( **E** ):\n\n| ( **S** ) | ![](/home/will/src/euler-manager/config/../data/images/p_244_start.gif)
+  | , ( **E** ) | ![](/home/will/src/euler-manager/config/../data/images/p_244_example.gif)
+  |\n\nFor each path, its checksum is calculated by (pseudocode):\n\n\rchecksum =
+  0  \n\rchecksum = (checksum ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  243 + <var>m</var><sub>1</sub>) mod 100 000 007  \n\rchecksum = (checksum ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  243 + <var>m</var><sub>2</sub>) mod 100 000 007  \n\r   …  \n\rchecksum = (checksum
+  ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) 243 +
+  <var>m</var><sub><var>n</var></sub>) mod 100 000 007  \n\n\rwhere <var>m</var><sub><var>k</var></sub>
+  is the ASCII value of the <var>k</var><sup><var>th</var></sup> letter in the move
+  sequence and the ASCII values for the moves are:\r\r\n\n| **L** | 76 |\n| **R**
+  | 82 |\n| **U** | 85 |\n| **D** | 68 |\n\nFor the sequence **LULUR** given above,
+  the checksum would be 19761398.\n\nNow, starting from configuration ( **S** ),\rfind
+  all shortest ways to reach configuration ( **T** ).\n\n| ( **S** ) | ![](/home/will/src/euler-manager/config/../data/images/p_244_start.gif)
+  | , ( **T** ) | ![](/home/will/src/euler-manager/config/../data/images/p_244_target.gif)
+  |\n\nWhat is the sum of all checksums for the paths having the minimal length?\n\n"

data/data/problems/245.yml

@@ -2,35 +2,27 @@
 :id: 245
 :name: Coresilience
 :url: http://projecteuler.net/problem=245
-:content: "\r\n<p>We shall call a fraction that cannot be cancelled down a resilient
-  fraction.<br> Furthermore we shall define the resilience of a denominator, <var>R</var>(<var>d</var>),
+:content: "We shall call a fraction that cannot be cancelled down a resilient fraction.
+  \ \n Furthermore we shall define the resilience of a denominator, <var>R</var>(<var>d</var>),
   to be the ratio of its proper fractions that are resilient; for example, <var>R</var>(12)
-  = <sup>4</sup>⁄<sub>11</sub>.</p>\r\n\r\n\r\n<div style=\"text-align:left;\">\r\n<table><tr>\n<td>The
-  resilience of a number <var>d</var> <img src=\"images/symbol_gt.gif\" width=\"10\"
-  height=\"10\" alt=\"&gt;\" border=\"0\" style=\"vertical-align:middle;\"> 1 is then</td>\r\n<td><div
-  style=\"text-align:center;\">φ(<var>d</var>)<br><img src=\"images/blackdot.gif\"
-  width=\"36\" height=\"1\" alt=\"\"><br><var>d</var> - 1</div></td>\n<td>, where
-  φ is Euler's totient function.</td>\r\n</tr></table>\n<table><tr>\n<td>We further
-  define the <b>coresilience</b> of a number <var>n</var> <img src=\"images/symbol_gt.gif\"
-  width=\"10\" height=\"10\" alt=\"&gt;\" border=\"0\" style=\"vertical-align:middle;\">
-  1 as <var>C</var>(<var>n</var>)</td>\n<td>= </td>\r\n<td><div style=\"text-align:center;\">\n<var>n</var>
-  - φ(<var>n</var>)<br><img src=\"images/blackdot.gif\" width=\"54\" height=\"1\"
-  alt=\"\"><br><var>n</var> - 1</div></td>\n<td>.</td>\r\n</tr></table>\n<table><tr>\n<td>The
-  coresilience of a prime <var>p</var> is <var>C</var>(<var>p</var>)</td>\r\n<td>= </td>\r\n<td><div
-  style=\"text-align:center;\">1<br><img src=\"images/blackdot.gif\" width=\"34\"
-  height=\"1\" alt=\"\"><br><var>p</var> - 1</div></td>\n<td>.</td>\r\n</tr></table>\n</div>\r\n\r\n<!--\r\n<p>The
-  resilience of a number <var>d</var> <img src='images/symbol_gt.gif' width='10' height='10'
-  alt='&gt;' border='0' style='vertical-align:middle;' /> 1 is then <font \"size=4\"><sup>&phi;(<var>d</var>)</sup>&frasl;<sub>(<var>d</var>-1)</sub></font>,
-  where &phi; is Euler's totient function.</p>\r\n\r\n<p>We further define the <b>coresilience</b>
-  of a number <var>n</var> <img src='images/symbol_gt.gif' width='10' height='10'
-  alt='&gt;' border='0' style='vertical-align:middle;' /> 1 as <var>C</var>(<var>n</var>)
+  = <sup>4</sup>⁄<sub>11</sub>.\n\n| The resilience of a number <var>d</var> ![>](/home/will/src/euler-manager/config/../data/images/symbol_gt.gif)
+  1 is then | \nφ(<var>d</var>)  \n ![](/home/will/src/euler-manager/config/../data/images/blackdot.gif)
+  \ \n<var>d</var> - 1\n | , where φ is Euler's totient function. |\n\n| We further
+  define the **coresilience** of a number <var>n</var> ![>](/home/will/src/euler-manager/config/../data/images/symbol_gt.gif)
+  1 as <var>C</var>(<var>n</var>) | =  | \n<var>n</var> - φ(<var>n</var>)  \n ![](/home/will/src/euler-manager/config/../data/images/blackdot.gif)
+  \ \n<var>n</var> - 1\n | . |\n\n| The coresilience of a prime <var>p</var> is <var>C</var>(<var>p</var>)
+  | =  | \n1  \n ![](/home/will/src/euler-manager/config/../data/images/blackdot.gif)
+  \ \n<var>p</var> - 1\n | . |\n\n<!--\r\n<p>The resilience of a number <var>d</var>
+  <img src='images/symbol_gt.gif' width='10' height='10' alt='&gt;' border='0' style='vertical-align:middle;'
+  /> 1 is then <font \"size=4\"><sup>&phi;(<var>d</var>)</sup>&frasl;<sub>(<var>d</var>-1)</sub></font>,
+  where &phi; is Euler's totient function.</p>\r\n\r\n\r\n<p>We further define the
+  <b>coresilience</b> of a number <var>n</var> <img src='images/symbol_gt.gif' width='10'
+  height='10' alt='&gt;' border='0' style='vertical-align:middle;' /> 1 as <var>C</var>(<var>n</var>)
   = <font \"size=4\"><sup>(<var>n</var> - &phi;(<var>n</var>))</sup>&frasl;<sub>(<var>n</var>
-  - 1)</sub></font>.\r\n</p>\r\n\r\n<p>The coresilience of a prime <var>p</var> is
-  <var>C</var>(<var>p</var>) = <font \"size=4\"><sup>1</sup>&frasl;<sub>(<var>p</var>
-  - 1)</sub></font>.</p>\r\n-->\r\n\r\n<p>Find the sum of all <b>composite</b> integers
-  1 <img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>n</var> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" 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;\">10<sup>11</sup>, for which <var>C</var>(<var>n</var>)
-  is a <dfn title=\"A fraction with numerator 1\">unit fraction</dfn>.\r\n</p>\r\n\r\n"
+  - 1)</sub></font>.\r\n</p>\r\n\r\n\r\n<p>The coresilience of a prime <var>p</var>
+  is <var>C</var>(<var>p</var>) = <font \"size=4\"><sup>1</sup>&frasl;<sub>(<var>p</var>
+  - 1)</sub></font>.</p>\r\n-->\n\nFind the sum of all **composite** integers 1 ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)
+  <var>n</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  2 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)10<sup>11</sup>,
+  for which <var>C</var>(<var>n</var>) is a <dfn title=\"A fraction with numerator
+  1\">unit fraction</dfn>.\n\n"

data/data/problems/246.yml

@@ -2,16 +2,13 @@
 :id: 246
 :name: Tangents to an ellipse
 :url: http://projecteuler.net/problem=246
-:content: "\r\n<p>\r\nA definition for an ellipse is:<br>\r\nGiven a circle c with
-  centre M and radius r and a point G such that d(G,M)<img src=\"images/symbol_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\">r,
-  the locus of the points that are equidistant from c and G form an ellipse.\r\n</p>\r\nThe
-  construction of the points of the ellipse is shown below.\r\n\r\n<div style=\"text-align:center;\">\r\n<img
-  src=\"project/images/p_246_anim.gif\" alt=\"\">\n</div>\r\n\r\n<p>\r\nGiven are
-  the points M(-2000,1500) and G(8000,1500).<br> \r\nGiven is also the circle c with
-  centre M and radius 15000.<br>\r\nThe locus of the points that are equidistant from
-  G and c form an ellipse e.<br>\r\nFrom a point P outside e the two tangents t<sub>1</sub>
-  and t<sub>2</sub> to the ellipse are drawn.<br>\r\nLet the points where t<sub>1</sub>
-  and t<sub>2</sub> touch the ellipse be R and S.\r\n</p>\r\n<div style=\"text-align:center;\">\r\n<img
-  src=\"project/images/p_246_ellipse.gif\" alt=\"\">\n</div>\r\n<p>\r\nFor how many
-  lattice points P is angle RPS greater than 45 degrees?\r\n</p>\r\n\r\n"
+:content: "A definition for an ellipse is:  \n\rGiven a circle c with centre M and
+  radius r and a point G such that d(G,M) ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)r,
+  the locus of the points that are equidistant from c and G form an ellipse.\n\n\rThe
+  construction of the points of the ellipse is shown below.\r\r\n ![](/home/will/src/euler-manager/config/../data/images/p_246_anim.gif)\n\nGiven
+  are the points M(-2000,1500) and G(8000,1500).  \n \rGiven is also the circle c
+  with centre M and radius 15000.  \n\rThe locus of the points that are equidistant
+  from G and c form an ellipse e.  \n\rFrom a point P outside e the two tangents t<sub>1</sub>
+  and t<sub>2</sub> to the ellipse are drawn.  \n\rLet the points where t<sub>1</sub>
+  and t<sub>2</sub> touch the ellipse be R and S.\n\n ![](/home/will/src/euler-manager/config/../data/images/p_246_ellipse.gif)\n\nFor
+  how many lattice points P is angle RPS greater than 45 degrees?\n\n"

data/data/problems/247.yml

@@ -2,20 +2,17 @@
 :id: 247
 :name: Squares under a hyperbola
 :url: http://projecteuler.net/problem=247
-:content: "\r\n<p>Consider the region constrained by 1 <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>x</var>
-  and 0 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" 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;\"><sup>1</sup>/<sub><var>x</var></sub>.\r\n</p>\n<p>\r\nLet
-  S<sub>1</sub> be the largest square that can fit under the curve.<br>\r\nLet S<sub>2</sub>
-  be the largest square that fits in the remaining area, and so on. <br>\r\nLet the
-  <i>index</i> of S<sub><var>n</var></sub> be the pair (left, below) indicating the
-  number of squares to the left of S<sub><var>n</var></sub> and the number of squares
-  below S<sub><var>n</var></sub>.\r\n</p>\r\n<div style=\"text-align:center;\">\r\n<img
-  src=\"project/images/p_247_hypersquares.gif\" alt=\"\">\n</div>\r\n<p>\r\nThe diagram
-  shows some such squares labelled by number. <br>\r\nS<sub>2</sub> has one square
-  to its left and none below, so the index of S<sub>2</sub> is (1,0).<br>\r\nIt can
-  be seen that the index of S<sub>32</sub> is (1,1) as is the index of S<sub>50</sub>.
-  <br>\r\n50 is the largest <var>n</var> for which the index of S<sub><var>n</var></sub>
-  is (1,1).\r\n</p>\r\n<p>\r\nWhat is the largest <var>n</var> for which the index
-  of S<sub><var>n</var></sub> is (3,3)?\r\n</p>\r\n\r\n\r\n"
+:content: "Consider the region constrained by 1 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>x</var> and 0 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>y</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <sup>1</sup>/<sub><var>x</var></sub>.\n\nLet S<sub>1</sub> be the largest square
+  that can fit under the curve.  \n\rLet S<sub>2</sub> be the largest square that
+  fits in the remaining area, and so on.   \n\rLet the _index_ of S<sub><var>n</var></sub>
+  be the pair (left, below) indicating the number of squares to the left of S<sub><var>n</var></sub>
+  and the number of squares below S<sub><var>n</var></sub>.\n\n ![](/home/will/src/euler-manager/config/../data/images/p_247_hypersquares.gif)\n\nThe
+  diagram shows some such squares labelled by number.   \n\rS<sub>2</sub> has one
+  square to its left and none below, so the index of S<sub>2</sub> is (1,0).  \n\rIt
+  can be seen that the index of S<sub>32</sub> is (1,1) as is the index of S<sub>50</sub>.
+  \  \n\r50 is the largest <var>n</var> for which the index of S<sub><var>n</var></sub>
+  is (1,1).\n\nWhat is the largest <var>n</var> for which the index of S<sub><var>n</var></sub>
+  is (3,3)?\n\n"

data/data/problems/248.yml

@@ -2,5 +2,8 @@
 :id: 248
 :name: Numbers for which Euler’s totient function equals 13!
 :url: http://projecteuler.net/problem=248
-:content: "\r\n<p>The first number n for which φ(n)=13! is 6227180929.</p>\r\n<p>Find
-  the 150,000<sup>th</sup> such number.</p>\r\n\r\n"
+:content: |+
+  The first number n for which φ(n)=13! is 6227180929.
+
+  Find the 150,000<sup>th</sup> such number.
+

data/data/problems/249.yml

@@ -2,6 +2,6 @@
 :id: 249
 :name: Prime Subset Sums
 :url: http://projecteuler.net/problem=249
-:content: "\r\n<p>Let <var>S</var> = {2, 3, 5, ..., 4999} be the set of prime numbers
-  less than 5000.</p>\r\n<p>Find the number of subsets of <var>S</var>, the sum of
-  whose elements is a prime number.<br>\r\nEnter the rightmost 16 digits as your answer.</p>\r\n"
+:content: "Let <var>S</var> = {2, 3, 5, ..., 4999} be the set of prime numbers less
+  than 5000.\n\nFind the number of subsets of <var>S</var>, the sum of whose elements
+  is a prime number.  \n\rEnter the rightmost 16 digits as your answer.\n\n"

data/data/problems/25.yml

@@ -2,14 +2,15 @@
 :id: 25
 :name: 1000-digit Fibonacci number
 :url: http://projecteuler.net/problem=25
-:content: "\r\n<p>The Fibonacci sequence is defined by the recurrence relation:</p>\r\n<blockquote>F<sub><i>n</i></sub>
-  = F<sub><i>n</i><img src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\"
-  border=\"0\" style=\"vertical-align:middle;\">1</sub> + F<sub><i>n</i><img src=\"images/symbol_minus.gif\"
-  width=\"9\" height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">2</sub>,
-  where F<sub>1</sub> = 1 and F<sub>2</sub> = 1.</blockquote>\r\n<p>Hence the first
-  12 terms will be:</p>\r\n<blockquote>F<sub>1</sub> = 1<br>\r\nF<sub>2</sub> = 1<br>\r\nF<sub>3</sub>
-  = 2<br>\r\nF<sub>4</sub> = 3<br>\r\nF<sub>5</sub> = 5<br>\r\nF<sub>6</sub> = 8<br>\r\nF<sub>7</sub>
-  = 13<br>\r\nF<sub>8</sub> = 21<br>\r\nF<sub>9</sub> = 34<br>\r\nF<sub>10</sub> =
-  55<br>\r\nF<sub>11</sub> = 89<br>\r\nF<sub>12</sub> = 144</blockquote>\r\n<p>The
-  12th term, F<sub>12</sub>, is the first term to contain three digits.</p>\r\n<p>What
-  is the first term in the Fibonacci sequence to contain 1000 digits?</p>\r\n\r\n"
+:content: "The Fibonacci sequence is defined by the recurrence relation:\n\n> F<sub><i>n</i></sub>
+  = F<sub><i>n</i><img src=\"%7B%7B%20images_dir%20%7D%7D/symbol_minus.gif\" width=\"9\"
+  height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">1</sub> + F<sub><i>n</i><img
+  src=\"%7B%7B%20images_dir%20%7D%7D/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\"
+  border=\"0\" style=\"vertical-align:middle;\">2</sub>, where F<sub>1</sub> = 1 and
+  F<sub>2</sub> = 1.\n\nHence the first 12 terms will be:\n\n> F<sub>1</sub> = 1  \n>
+  \rF<sub>2</sub> = 1  \n> \rF<sub>3</sub> = 2  \n> \rF<sub>4</sub> = 3  \n> \rF<sub>5</sub>
+  = 5  \n> \rF<sub>6</sub> = 8  \n> \rF<sub>7</sub> = 13  \n> \rF<sub>8</sub> = 21
+  \ \n> \rF<sub>9</sub> = 34  \n> \rF<sub>10</sub> = 55  \n> \rF<sub>11</sub> = 89
+  \ \n> \rF<sub>12</sub> = 144\n\nThe 12th term, F<sub>12</sub>, is the first term
+  to contain three digits.\n\nWhat is the first term in the Fibonacci sequence to
+  contain 1000 digits?\n\n"