euler-manager 0.0.5 → 0.0.6

data/data/problems/141.yml

@@ -1,14 +1,13 @@
 ---
 :id: 141
-:name: Investigating progressive numbers, <i>n</i>, which are also square
+:name: Investigating progressive numbers, _n_, which are also square
 :url: http://projecteuler.net/problem=141
-:content: "\r\n<p>A positive integer, <i>n</i>, is divided by <i>d</i> and the quotient
-  and remainder are <i>q</i> and <i>r</i> respectively. In addition <i>d</i>, <i>q</i>,
-  and <i>r</i> are consecutive positive integer terms in a geometric sequence, but
-  not necessarily in that order.</p>\r\n<p>For example, 58 divided by 6 has quotient
-  9 and remainder 4. It can also be seen that 4, 6, 9 are consecutive terms in a geometric
-  sequence (common ratio 3/2).<br>\r\nWe will call such numbers, <i>n</i>, progressive.</p>\r\n<p>Some
-  progressive numbers, such as 9 and 10404 = 102<sup>2</sup>, happen to also be perfect
-  squares.<br> The sum of all progressive perfect squares below one hundred thousand
-  is 124657.</p>\r\n<p>Find the sum of all progressive perfect squares below one trillion
-  (10<sup>12</sup>).</p>\r\n\r\n"
+:content: "A positive integer, _n_, is divided by _d_ and the quotient and remainder
+  are _q_ and _r_ respectively. In addition _d_, _q_, and _r_ are consecutive positive
+  integer terms in a geometric sequence, but not necessarily in that order.\n\nFor
+  example, 58 divided by 6 has quotient 9 and remainder 4. It can also be seen that
+  4, 6, 9 are consecutive terms in a geometric sequence (common ratio 3/2).  \n\rWe
+  will call such numbers, _n_, progressive.\n\nSome progressive numbers, such as 9
+  and 10404 = 102<sup>2</sup>, happen to also be perfect squares.  \n The sum of all
+  progressive perfect squares below one hundred thousand is 124657.\n\nFind the sum
+  of all progressive perfect squares below one trillion (10<sup>12</sup>).\n\n"

data/data/problems/142.yml

@@ -2,13 +2,6 @@
 :id: 142
 :name: Perfect Square Collection
 :url: http://projecteuler.net/problem=142
-:content: "\r\n<p>Find the smallest x + y + z with integers x <img src=\"images/symbol_gt.gif\"
-  width=\"10\" height=\"10\" alt=\"&gt;\" border=\"0\" style=\"vertical-align:middle;\">
-  y <img src=\"images/symbol_gt.gif\" width=\"10\" height=\"10\" alt=\"&gt;\" border=\"0\"
-  style=\"vertical-align:middle;\"> z <img src=\"images/symbol_gt.gif\" width=\"10\"
-  height=\"10\" alt=\"&gt;\" border=\"0\" style=\"vertical-align:middle;\"> 0 such
-  that x + y, x <img src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\"
-  border=\"0\" style=\"vertical-align:middle;\"> y, x + z, x <img src=\"images/symbol_minus.gif\"
-  width=\"9\" height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">
-  z, y + z, y <img src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\"
-  border=\"0\" style=\"vertical-align:middle;\"> z are all perfect squares.</p>\r\n"
+:content: |+
+  Find the smallest x + y + z with integers x ![>](/home/will/src/euler-manager/config/../data/images/symbol_gt.gif) y ![>](/home/will/src/euler-manager/config/../data/images/symbol_gt.gif) z ![>](/home/will/src/euler-manager/config/../data/images/symbol_gt.gif) 0 such that x + y, x ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif) y, x + z, x ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif) z, y + z, y ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif) z are all perfect squares.
+

data/data/problems/143.yml

@@ -2,19 +2,16 @@
 :id: 143
 :name: Investigating the Torricelli point of a triangle
 :url: http://projecteuler.net/problem=143
-:content: "\r\n<p>Let ABC be a triangle with all interior angles being less than 120
-  degrees. Let X be any point inside the triangle and let XA = p, XC = q, and XB =
-  r.</p>\r\n<p>Fermat challenged Torricelli to find the position of X such that p
-  + q + r was minimised.</p>\r\n<p>Torricelli was able to prove that if equilateral
-  triangles AOB, BNC and AMC are constructed on each side of triangle ABC, the circumscribed
-  circles of AOB, BNC, and AMC will intersect at a single point, T, inside the triangle.
-  Moreover he proved that T, called the Torricelli/Fermat point, minimises p + q +
-  r. Even more remarkable, it can be shown that when the sum is minimised, AN = BM
-  = CO = p + q + r and that AN, BM and CO also intersect at T.</p>\r\n<div style=\"text-align:center;\"><img
-  src=\"project/images/p_143_torricelli.gif\" width=\"564\" height=\"560\" alt=\"\"></div>\r\n<p>If
-  the sum is minimised and a, b, c, p, q and r are all positive integers we shall
-  call triangle ABC a Torricelli triangle. For example, a = 399, b = 455, c = 511
-  is an example of a Torricelli triangle, with p + q + r = 784.</p>\r\n<p>Find the
-  sum of all distinct values of p + q + r <img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> 120000 for
-  Torricelli triangles.</p>\r\n\r\n"
+:content: |+
+  Let ABC be a triangle with all interior angles being less than 120 degrees. Let X be any point inside the triangle and let XA = p, XC = q, and XB = r.
+
+  Fermat challenged Torricelli to find the position of X such that p + q + r was minimised.
+
+  Torricelli was able to prove that if equilateral triangles AOB, BNC and AMC are constructed on each side of triangle ABC, the circumscribed circles of AOB, BNC, and AMC will intersect at a single point, T, inside the triangle. Moreover he proved that T, called the Torricelli/Fermat point, minimises p + q + r. Even more remarkable, it can be shown that when the sum is minimised, AN = BM = CO = p + q + r and that AN, BM and CO also intersect at T.
+
+   ![](/home/will/src/euler-manager/config/../data/images/p_143_torricelli.gif)
+
+  If the sum is minimised and a, b, c, p, q and r are all positive integers we shall call triangle ABC a Torricelli triangle. For example, a = 399, b = 455, c = 511 is an example of a Torricelli triangle, with p + q + r = 784.
+
+  Find the sum of all distinct values of p + q + r ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 120000 for Torricelli triangles.
+

data/data/problems/144.yml

@@ -2,29 +2,26 @@
 :id: 144
 :name: Investigating multiple reflections of a laser beam
 :url: http://projecteuler.net/problem=144
-:content: "\r\n<p>In laser physics, a \"white cell\" is a mirror system that acts
-  as a delay line for the laser beam. The beam enters the cell, bounces around on
-  the mirrors, and eventually works its way back out.</p>\r\n<p>The specific white
-  cell we will be considering is an ellipse with the equation 4<i>x</i><sup>2</sup>
-  + <i>y</i><sup>2</sup> = 100</p>\r\n<p>The section corresponding to <img src=\"images/symbol_minus.gif\"
-  width=\"9\" height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">0.01
-  <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"><i>x</i> <img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> +0.01 at
-  the top is missing, allowing the light to enter and exit through the hole.</p>\r\n<div
-  style=\"text-align:center;\">\n<img src=\"project/images/p_144_1.gif\" width=\"268\"
-  height=\"240\" alt=\"\"><img src=\"project/images/p_144_2.gif\" width=\"141\" height=\"287\"
-  alt=\"\">\n</div>\r\n<p>The light beam in this problem starts at the point (0.0,10.1)
-  just outside the white cell, and the beam first impacts the mirror at (1.4,-9.6).</p>\r\n<p>Each
-  time the laser beam hits the surface of the ellipse, it follows the usual law of
-  reflection \"angle of incidence equals angle of reflection.\" That is, both the
-  incident and reflected beams make the same angle with the normal line at the point
-  of incidence.</p>\r\n<p>In the figure on the left, the red line shows the first
-  two points of contact between the laser beam and the wall of the white cell; the
-  blue line shows the line tangent to the ellipse at the point of incidence of the
-  first bounce.</p>\n<p>The slope <i>m</i> of the tangent line at any point (<i>x</i>,<i>y</i>)
-  of the given ellipse is: <i>m</i> = <img src=\"images/symbol_minus.gif\" width=\"9\"
-  height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">4<i>x</i>/<i>y</i></p>\n<p>The
-  normal line is perpendicular to this tangent line at the point of incidence.</p>\r\n<p>The
-  animation on the right shows the first 10 reflections of the beam.</p>\r\n\r\n<p>How
-  many times does the beam hit the internal surface of the white cell before exiting?</p>\r\n"
+:content: |+
+  In laser physics, a "white cell" is a mirror system that acts as a delay line for the laser beam. The beam enters the cell, bounces around on the mirrors, and eventually works its way back out.
+
+  The specific white cell we will be considering is an ellipse with the equation 4_x_<sup>2</sup> + _y_<sup>2</sup> = 100
+
+  The section corresponding to ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)0.01 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) _x_ ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) +0.01 at the top is missing, allowing the light to enter and exit through the hole.
+
+   ![](/home/will/src/euler-manager/config/../data/images/p_144_1.gif) ![](/home/will/src/euler-manager/config/../data/images/p_144_2.gif)
+
+  The light beam in this problem starts at the point (0.0,10.1) just outside the white cell, and the beam first impacts the mirror at (1.4,-9.6).
+
+  Each time the laser beam hits the surface of the ellipse, it follows the usual law of reflection "angle of incidence equals angle of reflection." That is, both the incident and reflected beams make the same angle with the normal line at the point of incidence.
+
+  In the figure on the left, the red line shows the first two points of contact between the laser beam and the wall of the white cell; the blue line shows the line tangent to the ellipse at the point of incidence of the first bounce.
+
+  The slope _m_ of the tangent line at any point (_x_,_y_) of the given ellipse is: _m_ = ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)4_x_/_y_
+
+  The normal line is perpendicular to this tangent line at the point of incidence.
+
+  The animation on the right shows the first 10 reflections of the beam.
+
+  How many times does the beam hit the internal surface of the white cell before exiting?
+

data/data/problems/145.yml

@@ -2,10 +2,10 @@
 :id: 145
 :name: How many reversible numbers are there below one-billion?
 :url: http://projecteuler.net/problem=145
-:content: "\r\n<p>Some positive integers <i>n</i> have the property that the sum [
-  <i>n</i> + reverse(<i>n</i>) ] consists entirely of odd (decimal) digits. For instance,
-  36 + 63 = 99 and 409 + 904 = 1313. We will call such numbers <em>reversible</em>;
-  so 36, 63, 409, and 904 are reversible. Leading zeroes are not allowed in either
-  <i>n</i> or reverse(<i>n</i>).</p>\r\n\r\n<p>There are 120 reversible numbers below
-  one-thousand.</p>\r\n\r\n<p>How many reversible numbers are there below one-billion
-  (10<sup>9</sup>)?</p>\r\n"
+:content: |+
+  Some positive integers _n_ have the property that the sum [_n_ + reverse(_n_)] consists entirely of odd (decimal) digits. For instance, 36 + 63 = 99 and 409 + 904 = 1313. We will call such numbers _reversible_; so 36, 63, 409, and 904 are reversible. Leading zeroes are not allowed in either _n_ or reverse(_n_).
+
+  There are 120 reversible numbers below one-thousand.
+
+  How many reversible numbers are there below one-billion (10<sup>9</sup>)?
+

data/data/problems/146.yml

@@ -1,9 +1,9 @@
 ---
 :id: 146
-:name: 'Investigating a Prime Pattern '
+:name: Investigating a Prime Pattern
 :url: http://projecteuler.net/problem=146
-:content: "\r\n<p>The smallest positive integer <i>n</i> for which the numbers <i>n</i><sup>2</sup>+1,
-  <i>n</i><sup>2</sup>+3, <i>n</i><sup>2</sup>+7, <i>n</i><sup>2</sup>+9, <i>n</i><sup>2</sup>+13,
-  and <i>n</i><sup>2</sup>+27 are consecutive primes is 10. The sum of all such integers
-  <i>n</i> below one-million is 1242490.</p>\r\n\r\n<p>What is the sum of all such
-  integers <i>n</i> below 150 million?</p>\r\n"
+:content: |+
+  The smallest positive integer _n_ for which the numbers _n_<sup>2</sup>+1, _n_<sup>2</sup>+3, _n_<sup>2</sup>+7, _n_<sup>2</sup>+9, _n_<sup>2</sup>+13, and _n_<sup>2</sup>+27 are consecutive primes is 10. The sum of all such integers _n_ below one-million is 1242490.
+
+  What is the sum of all such integers _n_ below 150 million?
+

data/data/problems/147.yml

@@ -2,13 +2,12 @@
 :id: 147
 :name: Rectangles in cross-hatched grids
 :url: http://projecteuler.net/problem=147
-:content: "\r\n<p>In a 3x2 cross-hatched grid, a total of 37 different rectangles
-  could be situated within that grid as indicated in the sketch.</p>\r\n<div style=\"text-align:center;\"><img
-  src=\"project/images/p_147.gif\" width=\"361\" height=\"176\" alt=\"\"></div>\r\n<p>There
+:content: "In a 3x2 cross-hatched grid, a total of 37 different rectangles could be
+  situated within that grid as indicated in the sketch.\n\n ![](/home/will/src/euler-manager/config/../data/images/p_147.gif)\n\nThere
   are 5 grids smaller than 3x2, vertical and horizontal dimensions being important,
   i.e. 1x1, 2x1, 3x1, 1x2 and 2x2. If each of them is cross-hatched, the following
-  number of different rectangles could be situated within those smaller grids:</p>\r\n<p>1x1:
-  1\r\n<br>2x1: 4\r\n<br>3x1: 8\r\n<br>1x2: 4\r\n<br>2x2: 18</p>\r\n\r\n<p>Adding
-  those to the 37 of the 3x2 grid, a total of 72 different rectangles could be situated
-  within 3x2 and smaller grids.</p>\r\n\r\n<p>How many different rectangles could
-  be situated within 47x43 and smaller grids?</p>\r\n"
+  number of different rectangles could be situated within those smaller grids:\n\n1x1:
+  1\r  \n2x1: 4\r  \n3x1: 8\r  \n1x2: 4\r  \n2x2: 18\n\nAdding those to the 37 of
+  the 3x2 grid, a total of 72 different rectangles could be situated within 3x2 and
+  smaller grids.\n\nHow many different rectangles could be situated within 47x43 and
+  smaller grids?\n\n"

data/data/problems/148.yml

@@ -2,10 +2,18 @@
 :id: 148
 :name: Exploring Pascal's triangle
 :url: http://projecteuler.net/problem=148
-:content: "\r\n<p>We can easily verify that none of the entries in the first seven
-  rows of Pascal's triangle are divisible by 7:</p>\r\n<table cellpadding=\"0\" cellspacing=\"0\"
-  border=\"0\" align=\"center\">\n<tr>\n<td> </td>\r\n<td> </td>\r\n<td> </td>\r\n<td> </td>\r\n<td> </td>\r\n<td> </td>\r\n<td> 1</td>\r\n</tr>\n<tr>\n<td> </td>\r\n<td> </td>\r\n<td> </td>\r\n<td> </td>\r\n<td> </td>\r\n<td> 1</td>\r\n<td> </td>\r\n<td> 1</td>\r\n</tr>\n<tr>\n<td> </td>\r\n<td> </td>\r\n<td> </td>\r\n<td> </td>\r\n<td> 1</td>\r\n<td> </td>\r\n<td> 2</td>\r\n<td> </td>\r\n<td> 1</td>\r\n</tr>\n<tr>\n<td> </td>\r\n<td> </td>\r\n<td> </td>\r\n<td> 1</td>\r\n<td> </td>\r\n<td> 3</td>\r\n<td> </td>\r\n<td> 3</td>\r\n<td> </td>\r\n<td> 1</td>\r\n</tr>\n<tr>\n<td> </td>\r\n<td> </td>\r\n<td> 1</td>\r\n<td> </td>\r\n<td> 4</td>\r\n<td> </td>\r\n<td> 6</td>\r\n<td> </td>\r\n<td> 4</td>\r\n<td> </td>\r\n<td> 1</td>\r\n</tr>\n<tr>\n<td> </td>\r\n<td> 1</td>\r\n<td> </td>\r\n<td> 5</td>\r\n<td> </td>\r\n<td>10</td>\r\n<td> </td>\r\n<td>10</td>\r\n<td> </td>\r\n<td> 5</td>\r\n<td> </td>\r\n<td> 1</td>\r\n</tr>\n<tr>\n<td>1</td>\r\n<td> </td>\r\n<td> 6</td>\r\n<td> </td>\r\n<td>15</td>\r\n<td> </td>\r\n<td>20</td>\r\n<td> </td>\r\n<td>15</td>\r\n<td> </td>\r\n<td> 6</td>\r\n<td> </td>\r\n<td> 1</td>\r\n</tr>\n</table>\n<p>However,
-  if we check the first one hundred rows, we will find that only 2361 of the 5050
-  entries are <i>not</i> divisible by 7.</p>\r\n\r\n<p>Find the number of entries
-  which are <i>not</i> divisible by 7 in the first one billion (10<sup>9</sup>) rows
-  of Pascal's triangle.</p>\r\n"
+:content: |+
+  We can easily verify that none of the entries in the first seven rows of Pascal's triangle are divisible by 7:
+
+  |   |   |   |   |   |   |  1 |
+  |   |   |   |   |   |  1 |   |  1 |
+  |   |   |   |   |  1 |   |  2 |   |  1 |
+  |   |   |   |  1 |   |  3 |   |  3 |   |  1 |
+  |   |   |  1 |   |  4 |   |  6 |   |  4 |   |  1 |
+  |   |  1 |   |  5 |   | 10 |   | 10 |   |  5 |   |  1 |
+  | 1 |   |  6 |   | 15 |   | 20 |   | 15 |   |  6 |   |  1 |
+
+  However, if we check the first one hundred rows, we will find that only 2361 of the 5050 entries are _not_ divisible by 7.
+
+  Find the number of entries which are _not_ divisible by 7 in the first one billion (10<sup>9</sup>) rows of Pascal's triangle.
+

data/data/problems/149.yml

@@ -2,40 +2,31 @@
 :id: 149
 :name: Searching for a maximum-sum subsequence
 :url: http://projecteuler.net/problem=149
-:content: "\r\n<p>Looking at the table below, it is easy to verify that the maximum
-  possible sum of adjacent numbers in any direction (horizontal, vertical, diagonal
-  or anti-diagonal) <span style=\"white-space:nowrap\">is 16 (= 8 + 7 + 1).</span></p>\r\n\r\n<div
-  style=\"text-align:center\">\r\n<table border=\"1\" cellpadding=\"6\" cellspacing=\"0\"
-  style=\"margin:auto\"><tbody align=\"right\">\n<tr>\n<td>\n<img src=\"images/symbol_minus.gif\"
-  width=\"9\" height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">2</td>\n<td>5</td>\n<td>3</td>\n<td>2</td>\n</tr>\n<tr>\n<td>9</td>\n<td>\n<img
-  src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\" border=\"0\"
-  style=\"vertical-align:middle;\">6</td>\n<td>5</td>\n<td>1</td>\n</tr>\n<tr>\n<td>3</td>\n<td>2</td>\n<td>7</td>\n<td>3</td>\n</tr>\n<tr>\n<td>\n<img
-  src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\" border=\"0\"
-  style=\"vertical-align:middle;\">1</td>\n<td>8</td>\n<td>\n<img src=\"images/symbol_minus.gif\"
+:content: "Looking at the table below, it is easy to verify that the maximum possible
+  sum of adjacent numbers in any direction (horizontal, vertical, diagonal or anti-diagonal)
+  is 16 (= 8 + 7 + 1).\n\n<tbody align=\"right\">\n<tr>\n<td>\n<img src=\"%7B%7B%20images_dir%20%7D%7D/symbol_minus.gif\"
+  width=\"9\" height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">2</td>\n<td>5</td>\n<td>3</td>\n<td>2</td>\n</tr>\r\n<tr>\n<td>9</td>\n<td>\n<img
+  src=\"%7B%7B%20images_dir%20%7D%7D/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\"
+  border=\"0\" style=\"vertical-align:middle;\">6</td>\n<td>5</td>\n<td>1</td>\n</tr>\r\n<tr>\n<td>3</td>\n<td>2</td>\n<td>7</td>\n<td>3</td>\n</tr>\r\n<tr>\n<td>\n<img
+  src=\"%7B%7B%20images_dir%20%7D%7D/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\"
+  border=\"0\" style=\"vertical-align:middle;\">1</td>\n<td>8</td>\n<td>\n<img src=\"%7B%7B%20images_dir%20%7D%7D/symbol_minus.gif\"
   width=\"9\" height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">4</td>\n<td> 
-  8</td>\n</tr>\n</tbody></table>\n</div>\r\n\r\n<p>Now, let us repeat the search,
-  but on a much larger scale:</p>\r\n\r\n<p>First, generate four million pseudo-random
-  numbers using a specific form of what is known as a \"Lagged Fibonacci Generator\":</p>\r\n\r\n<p>For
-  1 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"><i>k</i> <img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> 55, <i>s</i><sub><i>k</i></sub>
-  = [100003 <img src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\"
-  border=\"0\" style=\"vertical-align:middle;\"> 200003<i>k</i> + 300007<i>k</i><sup>3</sup>]
-  (modulo 1000000) <img src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\"
-  border=\"0\" style=\"vertical-align:middle;\"> 500000.<br>\r\nFor 56 <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><i>k</i>
-  <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"> 4000000, <i>s</i><sub><i>k</i></sub> = [<i>s</i><sub><i>k<img
-  src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\" border=\"0\"
-  style=\"vertical-align:middle;\">24</i></sub> + <i>s</i><sub><i>k<img src=\"images/symbol_minus.gif\"
-  width=\"9\" height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">55</i></sub>
-  + 1000000] (modulo 1000000) <img src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\"
-  alt=\"−\" border=\"0\" style=\"vertical-align:middle;\"> 500000.</p>\r\n\r\n<p>Thus,
-  <i>s</i><sub>10</sub> = <img src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\"
-  alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">393027 and <i>s</i><sub>100</sub>
-  = 86613.</p>\r\n\r\n<p>The terms of <i>s</i> are then arranged in a 2000<img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">2000
+  8</td>\n</tr>\n</tbody>\n\nNow, let us repeat the search, but on a much larger scale:\n\nFirst,
+  generate four million pseudo-random numbers using a specific form of what is known
+  as a \"Lagged Fibonacci Generator\":\n\nFor 1 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  _k_ ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 55, _s_<sub><i>k</i></sub>
+  = [100003 ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)
+  200003_k_ + 300007_k_<sup>3</sup>] (modulo 1000000) ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)
+  500000.  \n\rFor 56 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  _k_ ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 4000000,
+  _s_<sub><i>k</i></sub> = [_s_<sub><i>k<img src=\"%7B%7B%20images_dir%20%7D%7D/symbol_minus.gif\"
+  width=\"9\" height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">24</i></sub>
+  + _s_<sub><i>k<img src=\"%7B%7B%20images_dir%20%7D%7D/symbol_minus.gif\" width=\"9\"
+  height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">55</i></sub>
+  + 1000000] (modulo 1000000) ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)
+  500000.\n\nThus, _s_<sub>10</sub> = ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)393027
+  and _s_<sub>100</sub> = 86613.\n\nThe terms of _s_ are then arranged in a 2000 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)2000
   table, using the first 2000 numbers to fill the first row (sequentially), the next
-  2000 numbers to fill the second row, and so on.</p>\r\n\r\n<p>Finally, find the
-  greatest sum of (any number of) adjacent entries in any direction (horizontal, vertical,
-  diagonal or anti-diagonal).</p>\r\n"
+  2000 numbers to fill the second row, and so on.\n\nFinally, find the greatest sum
+  of (any number of) adjacent entries in any direction (horizontal, vertical, diagonal
+  or anti-diagonal).\n\n"

data/data/problems/15.yml

@@ -2,10 +2,10 @@
 :id: 15
 :name: Lattice paths
 :url: http://projecteuler.net/problem=15
-:content: "\r\n<p>Starting in the top left corner of a 2<img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">2
-  grid, and only being able to move to the right and down, there are exactly 6 routes
-  to the bottom right corner.</p>\r\n<div style=\"text-align:center;\">\r\n<img src=\"project/images/p_015.gif\"
-  alt=\"\">\n</div>\r\n<p>How many such routes are there through a 20<img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">20
-  grid?</p>\r\n\r\n"
+:content: |+
+  Starting in the top left corner of a 2 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)2 grid, and only being able to move to the right and down, there are exactly 6 routes to the bottom right corner.
+
+   ![](/home/will/src/euler-manager/config/../data/images/p_015.gif)
+
+  How many such routes are there through a 20 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)20 grid?
+

data/data/problems/150.yml

@@ -2,33 +2,22 @@
 :id: 150
 :name: Searching a triangular array for a sub-triangle having minimum-sum
 :url: http://projecteuler.net/problem=150
-:content: "\r\n<p>In a triangular array of positive and negative integers, we wish
-  to find a sub-triangle such that the sum of the numbers it contains is the smallest
-  possible.</p>\r\n<p>In the example below, it can be easily verified that the marked
-  triangle satisfies this condition having a sum of <img src=\"images/symbol_minus.gif\"
-  width=\"9\" height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">42.</p>\r\n<div
-  style=\"text-align:center;\">\r\n<img src=\"http://projecteuler.net/project/images/p_150.gif\"
-  border=\"0\" alt=\"\">\n</div>\r\n<p>We wish to make such a triangular array with
-  one thousand rows, so we generate 500500 pseudo-random numbers <span style=\"font-style:
-  italic\">s<sub>k</sub></span> in the range <img src=\"images/symbol_plusmn.gif\"
-  width=\"11\" height=\"11\" alt=\"±\" border=\"0\" style=\"vertical-align:middle;\">2<sup>19</sup>,
+:content: "In a triangular array of positive and negative integers, we wish to find
+  a sub-triangle such that the sum of the numbers it contains is the smallest possible.\n\nIn
+  the example below, it can be easily verified that the marked triangle satisfies
+  this condition having a sum of ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)42.\n\n
+  ![](/home/will/src/euler-manager/config/../data/images/p_150.gif)\n\nWe wish to
+  make such a triangular array with one thousand rows, so we generate 500500 pseudo-random
+  numbers s<sub>k</sub> in the range ![±](/home/will/src/euler-manager/config/../data/images/symbol_plusmn.gif)2<sup>19</sup>,
   using a type of random number generator (known as a Linear Congruential Generator)
-  as follows:</p>\r\n<p style=\"margin-left:50px;\"><span style=\"font-style: italic\">t</span>
-  := 0\r\n<br>\r\nfor k = 1 up to k = 500500:\r\n<br>\r\n    <span style=\"font-style:
-  italic\">t</span> := (615949*<span style=\"font-style: italic\">t</span> + 797807)
-  modulo 2<sup>20</sup><br>\r\n    <span style=\"font-style: italic\">s<sub>k</sub></span>
-  := <span style=\"font-style: italic\">t</span><img src=\"images/symbol_minus.gif\"
-  width=\"9\" height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">2<sup>19</sup></p>\r\n<p>Thus:
-  <span style=\"font-style: italic\">s<sub>1</sub></span> = 273519, <span style=\"font-style:
-  italic\">s<sub>2</sub></span> = <img src=\"images/symbol_minus.gif\" width=\"9\"
-  height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">153582, <span
-  style=\"font-style: italic\">s<sub>3</sub></span> = 450905 etc</p>\r\n<p>Our triangular
-  array is then formed using the pseudo-random numbers thus:</p>\r\n<div style=\"text-align:center;font-style:
-  italic;\">\r\ns<sub>1</sub><br>\r\ns<sub>2</sub>  s<sub>3</sub><br>\r\ns<sub>4</sub> 
-  s<sub>5</sub>  s<sub>6</sub>  \r\n<br>\r\ns<sub>7</sub>  s<sub>8</sub>  s<sub>9</sub> 
-  s<sub>10</sub><br>\r\n...\r\n</div>\r\n<p>Sub-triangles can start at any element
-  of the array and extend down as far as we like (taking-in the two elements directly
-  below it from the next row, the three elements directly below from the row after
-  that, and so on).\r\n<br>\r\nThe \"sum of a sub-triangle\" is defined as the sum
-  of all the elements it contains.\r\n<br>\r\nFind the smallest possible sub-triangle
-  sum.</p>\r\n"
+  as follows:\n\nt := 0\r  \n\rfor k = 1 up to k = 500500:\r  \n\r    t := (615949\\*t
+  + 797807) modulo 2<sup>20</sup>  \n\r    s<sub>k</sub> := t ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)2<sup>19</sup>\n\nThus:
+  s<sub>1</sub> = 273519, s<sub>2</sub> = ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)153582,
+  s<sub>3</sub> = 450905 etc\n\nOur triangular array is then formed using the pseudo-random
+  numbers thus:\n\n\rs<sub>1</sub>  \n\rs<sub>2</sub>  s<sub>3</sub>  \n\rs<sub>4</sub> 
+  s<sub>5</sub>  s<sub>6</sub>  \r  \n\rs<sub>7</sub>  s<sub>8</sub>  s<sub>9</sub> 
+  s<sub>10</sub>  \n\r...\r\n\nSub-triangles can start at any element of the array
+  and extend down as far as we like (taking-in the two elements directly below it
+  from the next row, the three elements directly below from the row after that, and
+  so on).\r  \n\rThe \"sum of a sub-triangle\" is defined as the sum of all the elements
+  it contains.\r  \n\rFind the smallest possible sub-triangle sum.\n\n"

data/data/problems/151.yml

@@ -2,18 +2,20 @@
 :id: 151
 :name: 'Paper sheets of standard sizes: an expected-value problem'
 :url: http://projecteuler.net/problem=151
-:content: "\r\n<p>A printing shop runs 16 batches (jobs) every week and each batch
-  requires a sheet of special colour-proofing paper of size A5.</p>\r\n<p>Every Monday
-  morning, the foreman opens a new envelope, containing a large sheet of the special
-  paper with size A1.</p>\r\n<p>He proceeds to cut it in half, thus getting two sheets
-  of size A2. Then he cuts one of them in half to get two sheets of size A3 and so
-  on until he obtains the A5-size sheet needed for the first batch of the week.</p>\r\n<p>All
-  the unused sheets are placed back in the envelope.</p>\r\n<div style=\"text-align:center;\"><img
-  src=\"project/images/p_151.gif\" width=\"314\" height=\"227\" alt=\"\"></div>\r\n<p>At
-  the beginning of each subsequent batch, he takes from the envelope one sheet of
-  paper at random. If it is of size A5, he uses it. If it is larger, he repeats the
-  'cut-in-half' procedure until he has what he needs and any remaining sheets are
-  always placed back in the envelope.</p>\r\n<p>Excluding the first and last batch
-  of the week, find the expected number of times (during each week) that the foreman
-  finds a single sheet of paper in the envelope.</p>\r\n<p>Give your answer rounded
-  to six decimal places using the format x.xxxxxx .</p>\r\n"
+:content: |+
+  A printing shop runs 16 batches (jobs) every week and each batch requires a sheet of special colour-proofing paper of size A5.
+
+  Every Monday morning, the foreman opens a new envelope, containing a large sheet of the special paper with size A1.
+
+  He proceeds to cut it in half, thus getting two sheets of size A2. Then he cuts one of them in half to get two sheets of size A3 and so on until he obtains the A5-size sheet needed for the first batch of the week.
+
+  All the unused sheets are placed back in the envelope.
+
+   ![](/home/will/src/euler-manager/config/../data/images/p_151.gif)
+
+  At the beginning of each subsequent batch, he takes from the envelope one sheet of paper at random. If it is of size A5, he uses it. If it is larger, he repeats the 'cut-in-half' procedure until he has what he needs and any remaining sheets are always placed back in the envelope.
+
+  Excluding the first and last batch of the week, find the expected number of times (during each week) that the foreman finds a single sheet of paper in the envelope.
+
+  Give your answer rounded to six decimal places using the format x.xxxxxx .
+

data/data/problems/152.yml

@@ -2,11 +2,14 @@
 :id: 152
 :name: Writing 1/2 as a sum of inverse squares
 :url: http://projecteuler.net/problem=152
-:content: "\r\n<p>There are several ways to write the number 1/2 as a sum of inverse
-  squares using <i>distinct</i> integers.</p>\r\n<p>For instance, the numbers {2,3,4,5,7,12,15,20,28,35}
-  can be used:</p>\r\n<p style=\"margin-left:50px;\"><img src=\"http://projecteuler.net/project/images/p_152_sum.gif\"
-  border=\"0\" alt=\"\"></p>\r\n<p>In fact, only using integers between 2 and 45 inclusive,
-  there are exactly three ways to do it, the remaining two being: {2,3,4,6,7,9,10,20,28,35,36,45}
-  and {2,3,4,6,7,9,12,15,28,30,35,36,45}.</p>\r\n<p>How many ways are there to write
-  the number 1/2 as a sum of inverse squares using distinct integers between 2 and
-  80 inclusive?</p>\r\n"
+:content: |+
+  There are several ways to write the number 1/2 as a sum of inverse squares using _distinct_ integers.
+
+  For instance, the numbers {2,3,4,5,7,12,15,20,28,35} can be used:
+
+  ![](/home/will/src/euler-manager/config/../data/images/p_152_sum.gif)
+
+  In fact, only using integers between 2 and 45 inclusive, there are exactly three ways to do it, the remaining two being: {2,3,4,6,7,9,10,20,28,35,36,45} and {2,3,4,6,7,9,12,15,28,30,35,36,45}.
+
+  How many ways are there to write the number 1/2 as a sum of inverse squares using distinct integers between 2 and 80 inclusive?
+

data/data/problems/153.yml

@@ -2,56 +2,41 @@
 :id: 153
 :name: Investigating Gaussian Integers
 :url: http://projecteuler.net/problem=153
-:content: "\r\n<p>As we all know the equation <var>x</var><sup>2</sup>=-1 has no solutions
-  for real <var>x</var>.\r\n<br>\r\nIf we however introduce the imaginary number <var>i</var>
-  this equation has two solutions: <var>x=i</var> and <var>x=-i</var>.\r\n<br>\r\nIf
-  we go a step further the equation (<var>x</var>-3)<sup>2</sup>=-4 has two complex
-  solutions: <var>x</var>=3+2<var>i</var> and <var>x</var>=3-2<var>i</var>.\r\n<br><var>x</var>=3+2<var>i</var>
-  and <var>x</var>=3-2<var>i</var> are called each others' complex conjugate.\r\n<br>\r\nNumbers
-  of the form <var>a</var>+<var>bi</var> are called complex numbers.\r\n<br>\r\nIn
-  general <var>a</var>+<var>bi</var> and <var>a</var><img src=\"images/symbol_minus.gif\"
-  width=\"9\" height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\"><var>bi</var>
-  are each other's complex conjugate.</p>\r\n<p>A Gaussian Integer is a complex number
-  <var>a</var>+<var>bi</var> such that both <var>a</var> and <var>b</var> are integers.\r\n<br>\r\nThe
-  regular integers are also Gaussian integers (with <var>b</var>=0).\r\n<br>\r\nTo
-  distinguish them from Gaussian integers with <var>b</var> <img src=\"images/symbol_ne.gif\"
-  width=\"11\" height=\"10\" alt=\"≠\" border=\"0\" style=\"vertical-align:middle;\">
-  0 we call such integers \"rational integers.\"\r\n<br>\r\nA Gaussian integer is
-  called a divisor of a rational integer <var>n</var> if the result is also a Gaussian
-  integer.\r\n<br>\r\nIf for example we divide 5 by 1+2<var>i</var> we can simplify
-  <img src=\"project/images/p_153_formule1.gif\" border=\"0\" style=\"vertical-align:middle\"
-  alt=\"\"> in the following manner:\r\n<br>\r\nMultiply numerator and denominator
-  by the complex conjugate of 1+2<var>i</var>: 1<img src=\"images/symbol_minus.gif\"
-  width=\"9\" height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">2<var>i</var>.\r\n<br>\r\nThe
-  result is \r\n<img src=\"project/images/p_153_formule2.gif\" border=\"0\" alt=\"\"
-  style=\"vertical-align:middle;\">.\r\n<br>\r\nSo 1+2<var>i</var> is a divisor of
-  5.\r\n<br>\r\nNote that 1+<var>i</var> is not a divisor of 5 because <img src=\"project/images/p_153_formule5.gif\"
-  border=\"0\" style=\"vertical-align:middle;\" alt=\"\">.\r\n<br>\r\nNote also that
-  if the Gaussian Integer (<var>a</var>+<var>bi</var>) is a divisor of a rational
-  integer <var>n</var>, then its complex conjugate (<var>a</var><img src=\"images/symbol_minus.gif\"
-  width=\"9\" height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\"><var>bi</var>)
-  is also a divisor of <var>n</var>.</p>\r\n<p>In fact, 5 has six divisors such that
-  the real part is positive: {1, 1 + 2<var>i</var>, 1 <img src=\"images/symbol_minus.gif\"
-  width=\"9\" height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">
-  2<var>i</var>, 2 + <var>i</var>, 2 <img src=\"images/symbol_minus.gif\" width=\"9\"
-  height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\"><var>i</var>,
-  5}.\r\n<br>\r\nThe following is a table of all of the divisors for the first five
-  positive rational integers:</p>\r\n<table align=\"center\" border=\"1\">\n<tr>\n<td
-  width=\"20\">\r\n<var>n</var>\n</td>\n<td> Gaussian integer divisors<br>\r\nwith
-  positive real part</td>\n<td>Sum s(<var>n</var>) of <br>these\r\n\r\ndivisors</td>\n</tr>\n<tr>\n<td>1</td>\n<td>1</td>\n<td>1</td>\r\n</tr>\n<tr>\n<td>2</td>\n<td>1,
-  1+<var>i</var>, 1-<var>i</var>, 2</td>\n<td>5</td>\r\n</tr>\n<tr>\n<td>3</td>\n<td>1,
-  3</td>\n<td>4</td>\r\n</tr>\n<tr>\n<td>4</td>\n<td>1, 1+<var>i</var>, 1-<var>i</var>,
-  2, 2+2<var>i</var>, 2-2<var>i</var>,4</td>\n<td>13</td>\r\n</tr>\n<tr>\n<td>5</td>\n<td>1,
-  1+2<var>i</var>, 1-2<var>i</var>, 2+<var>i</var>, 2-<var>i</var>, 5</td>\n<td>12</td>\r\n</tr>\n</table>\n<p>For
-  divisors with positive real parts, then, we have: <img src=\"project/images/p_153_formule6.gif\"
-  border=\"0\" style=\"vertical-align:middle\" alt=\"\">.</p>\r\n<p>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>5</sup>, <img src=\"images/symbol_sum.gif\"
-  width=\"11\" height=\"14\" alt=\"∑\" border=\"0\" style=\"vertical-align:middle;\">
-  s(<var>n</var>)=17924657155.</p>\r\n<p>What is <img src=\"images/symbol_sum.gif\"
-  width=\"11\" height=\"14\" alt=\"∑\" border=\"0\" style=\"vertical-align:middle;\">
-  s(<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>8</sup>?</p>\r\n"
+:content: "As we all know the equation <var>x</var><sup>2</sup>=-1 has no solutions
+  for real <var>x</var>.\r  \n\rIf we however introduce the imaginary number <var>i</var>
+  this equation has two solutions: <var>x=i</var> and <var>x=-i</var>.\r  \n\rIf we
+  go a step further the equation (<var>x</var>-3)<sup>2</sup>=-4 has two complex solutions:
+  <var>x</var>=3+2<var>i</var> and <var>x</var>=3-2<var>i</var>.\r  \n<var>x</var>=3+2<var>i</var>
+  and <var>x</var>=3-2<var>i</var> are called each others' complex conjugate.\r  \n\rNumbers
+  of the form <var>a</var>+<var>bi</var> are called complex numbers.\r  \n\rIn general
+  <var>a</var>+<var>bi</var> and <var>a</var> ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)<var>bi</var>
+  are each other's complex conjugate.\n\nA Gaussian Integer is a complex number <var>a</var>+<var>bi</var>
+  such that both <var>a</var> and <var>b</var> are integers.\r  \n\rThe regular integers
+  are also Gaussian integers (with <var>b</var>=0).\r  \n\rTo distinguish them from
+  Gaussian integers with <var>b</var> ![≠](/home/will/src/euler-manager/config/../data/images/symbol_ne.gif)
+  0 we call such integers \"rational integers.\"\r  \n\rA Gaussian integer is called
+  a divisor of a rational integer <var>n</var> if the result is also a Gaussian integer.\r
+  \ \n\rIf for example we divide 5 by 1+2<var>i</var> we can simplify ![](/home/will/src/euler-manager/config/../data/images/p_153_formule1.gif)
+  in the following manner:\r  \n\rMultiply numerator and denominator by the complex
+  conjugate of 1+2<var>i</var>: 1 ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)2<var>i</var>.\r
+  \ \n\rThe result is \r ![](/home/will/src/euler-manager/config/../data/images/p_153_formule2.gif).\r
+  \ \n\rSo 1+2<var>i</var> is a divisor of 5.\r  \n\rNote that 1+<var>i</var> is not
+  a divisor of 5 because ![](/home/will/src/euler-manager/config/../data/images/p_153_formule5.gif).\r
+  \ \n\rNote also that if the Gaussian Integer (<var>a</var>+<var>bi</var>) is a divisor
+  of a rational integer <var>n</var>, then its complex conjugate (<var>a</var> ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)<var>bi</var>)
+  is also a divisor of <var>n</var>.\n\nIn fact, 5 has six divisors such that the
+  real part is positive: {1, 1 + 2<var>i</var>, 1 ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)
+  2<var>i</var>, 2 + <var>i</var>, 2 ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)
+  <var>i</var>, 5}.\r  \n\rThe following is a table of all of the divisors for the
+  first five positive rational integers:\n\n| <var>n</var> | Gaussian integer divisors
+  \ \n\rwith positive real part | Sum s(<var>n</var>) of   \nthese\r\rdivisors |\n|
+  1 | 1 | 1 |\n| 2 | 1, 1+<var>i</var>, 1-<var>i</var>, 2 | 5 |\n| 3 | 1, 3 | 4 |\n|
+  4 | 1, 1+<var>i</var>, 1-<var>i</var>, 2, 2+2<var>i</var>, 2-2<var>i</var>,4 | 13
+  |\n| 5 | 1, 1+2<var>i</var>, 1-2<var>i</var>, 2+<var>i</var>, 2-<var>i</var>, 5
+  | 12 |\n\nFor divisors with positive real parts, then, we have: ![](/home/will/src/euler-manager/config/../data/images/p_153_formule6.gif).\n\nFor
+  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>5</sup>,
+  ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif) s(<var>n</var>)=17924657155.\n\nWhat
+  is ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif) s(<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>8</sup>?\n\n"