euler-manager 0.0.5 → 0.0.6

data/data/problems/395.yml

@@ -2,18 +2,17 @@
 :id: 395
 :name: Pythagorean tree
 :url: http://projecteuler.net/problem=395
-:content: "\r\n<p>\r\nThe <b>Pythagorean tree</b> is a fractal generated by the following
-  procedure:\r\n</p>\r\n\r\n<p>\r\nStart with a unit square. Then, calling one of
-  the sides its base (in the animation, the bottom side is the base):\r\n</p>\n<ol>\n<li>
-  Attach a right triangle to the side opposite the base, with the hypotenuse coinciding
-  with that side and with the sides in a 3-4-5 ratio. Note that the smaller side of
-  the triangle must be on the 'right' side with respect to the base (see animation).</li>\r\n<li>
-  Attach a square to each leg of the right triangle, with one of its sides coinciding
-  with that leg.</li>\r\n<li> Repeat this procedure for both squares, considering
-  as their bases the sides touching the triangle.</li>\r\n</ol>\r\nThe resulting figure,
-  after an infinite number of iterations, is the Pythagorean tree.\r\n\r\n\r\n<div
-  align=\"center\"><img src=\"project/images/p_395_pythagorean.gif\"></div>\r\n\r\n<p>\r\nIt
+:content: "The **Pythagorean tree** is a fractal generated by the following procedure:\n\nStart
+  with a unit square. Then, calling one of the sides its base (in the animation, the
+  bottom side is the base):\n\n1. Attach a right triangle to the side opposite the
+  base, with the hypotenuse coinciding with that side and with the sides in a 3-4-5
+  ratio. Note that the smaller side of the triangle must be on the 'right' side with
+  respect to the base (see animation).\n2. Attach a square to each leg of the right
+  triangle, with one of its sides coinciding with that leg.\n3. Repeat this procedure
+  for both squares, considering as their bases the sides touching the triangle.\n\rThe
+  resulting figure, after an infinite number of iterations, is the Pythagorean tree.\r\r\r\n
+  ![](/home/will/src/euler-manager/config/../data/images/p_395_pythagorean.gif)\n\nIt
   can be shown that there exists at least one rectangle, whose sides are parallel
   to the largest square of the Pythagorean tree, which encloses the Pythagorean tree
-  completely.\r\n</p>\r\n<p>\r\nFind the smallest area possible for such a bounding
-  rectangle, and give your answer rounded to 10 decimal places.\r\n</p>\r\n"
+  completely.\n\nFind the smallest area possible for such a bounding rectangle, and
+  give your answer rounded to 10 decimal places.\n\n"

data/data/problems/396.yml

@@ -2,27 +2,22 @@
 :id: 396
 :name: Weak Goodstein sequence
 :url: http://projecteuler.net/problem=396
-:content: "\r\n<p>\r\nFor any positive integer n, the <b>nth weak Goodstein sequence</b>
-  {g<sub>1</sub>, g<sub>2</sub>, g<sub>3</sub>, ...} is defined as:\r\n</p>\n<ul>\n<li>
-  g<sub>1</sub> = <var>n</var>\r\n</li>\n<li> for <var>k</var> <img src=\"images/symbol_gt.gif\"
-  width=\"10\" height=\"10\" alt=\"&gt;\" border=\"0\" style=\"vertical-align:middle;\">
+:content: "For any positive integer n, the **nth weak Goodstein sequence** {g<sub>1</sub>,
+  g<sub>2</sub>, g<sub>3</sub>, ...} is defined as:\n\n- g<sub>1</sub> = <var>n</var>\n-
+  for <var>k</var> ![>](/home/will/src/euler-manager/config/../data/images/symbol_gt.gif)
   1, g<sub><var>k</var></sub> is obtained by writing g<sub><var>k</var>-1</sub> in
   base <var>k</var>, interpreting it as a base <var>k</var> + 1 number, and subtracting
-  1.\r\n</li>\n</ul>\r\nThe sequence terminates when g<sub><var>k</var></sub> becomes
-  0.\r\n\r\n<p>\r\nFor example, the 6th weak Goodstein sequence is {6, 11, 17, 25,
-  ...}:\r\n</p>\n<ul>\n<li> g<sub>1</sub> = 6.\r\n</li>\n<li> g<sub>2</sub> = 11 since
-  6 = 110<sub>2</sub>, 110<sub>3</sub> = 12, and 12 - 1 = 11.\r\n</li>\n<li> g<sub>3</sub>
-  = 17 since 11 = 102<sub>3</sub>, 102<sub>4</sub> = 18, and 18 - 1 = 17.\r\n</li>\n<li>
-  g<sub>4</sub> = 25 since 17 = 101<sub>4</sub>, 101<sub>5</sub> = 26, and 26 - 1
-  = 25.\r\n</li>\n</ul>\r\nand so on.\r\n\r\n<p>\r\nIt can be shown that every weak
-  Goodstein sequence terminates.\r\n</p>\r\n<p>\r\nLet G(<var>n</var>) be the number
-  of nonzero elements in the <var>n</var>th weak Goodstein sequence.<br>\r\nIt can
-  be verified that G(2) = 3, G(4) = 21 and G(6) = 381.<br>\r\nIt can also be verified
-  that ΣG(<var>n</var>) = 2517 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_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\"
-  style=\"vertical-align:middle;\"> 8.\r\n</p>\r\n<p>\r\nFind the last 9 digits of
-  ΣG(<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_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\">
-  16.\r\n</p>\r\n"
+  1.\r\n\rThe sequence terminates when g<sub><var>k</var></sub> becomes 0.\r\r\n\nFor
+  example, the 6th weak Goodstein sequence is {6, 11, 17, 25, ...}:\n\n- g<sub>1</sub>
+  = 6.\r\n- g<sub>2</sub> = 11 since 6 = 110<sub>2</sub>, 110<sub>3</sub> = 12, and
+  12 - 1 = 11.\r\n- g<sub>3</sub> = 17 since 11 = 102<sub>3</sub>, 102<sub>4</sub>
+  = 18, and 18 - 1 = 17.\r\n- g<sub>4</sub> = 25 since 17 = 101<sub>4</sub>, 101<sub>5</sub>
+  = 26, and 26 - 1 = 25.\r\n\rand so on.\r\r\n\nIt can be shown that every weak Goodstein
+  sequence terminates.\n\nLet G(<var>n</var>) be the number of nonzero elements in
+  the <var>n</var>th weak Goodstein sequence.  \n\rIt can be verified that G(2) =
+  3, G(4) = 21 and G(6) = 381.  \n\rIt can also be verified that ΣG(<var>n</var>)
+  = 2517 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_lt.gif)
+  8.\n\nFind the last 9 digits of ΣG(<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_lt.gif)
+  16.\n\n"

data/data/problems/397.yml

@@ -2,19 +2,16 @@
 :id: 397
 :name: Triangle on parabola
 :url: http://projecteuler.net/problem=397
-:content: "\r\n<p>\r\nOn the parabola <var>y</var> = <var>x</var><sup>2</sup>/<var>k</var>,
-  three points A(<var>a</var>, <var>a</var><sup>2</sup>/<var>k</var>), B(<var>b</var>,
-  <var>b</var><sup>2</sup>/<var>k</var>) and C(<var>c</var>, <var>c</var><sup>2</sup>/<var>k</var>)
-  are chosen.\r\n</p>\r\n<p>\r\nLet F(<var>K</var>, <var>X</var>) be the number of
-  the integer quadruplets (<var>k</var>, <var>a</var>, <var>b</var>, <var>c</var>)
-  such that at least one angle of the triangle ABC is 45-degree, with 1 <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>k</var>
-  <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>K</var> and -<var>X</var> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" 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_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\"><var>c</var>
-  <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>X</var>.\r\n</p>\r\n<p>\r\nFor example, F(1,
-  10) = 41 and F(10, 100) = 12492.<br>\r\nFind F(10<sup>6</sup>, 10<sup>9</sup>).\r\n</p>\r\n"
+:content: "On the parabola <var>y</var> = <var>x</var><sup>2</sup>/<var>k</var>, three
+  points A(<var>a</var>, <var>a</var><sup>2</sup>/<var>k</var>), B(<var>b</var>, <var>b</var><sup>2</sup>/<var>k</var>)
+  and C(<var>c</var>, <var>c</var><sup>2</sup>/<var>k</var>) are chosen.\n\nLet F(<var>K</var>,
+  <var>X</var>) be the number of the integer quadruplets (<var>k</var>, <var>a</var>,
+  <var>b</var>, <var>c</var>) such that at least one angle of the triangle ABC is
+  45-degree, with 1 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>k</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>K</var> and -<var>X</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.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_lt.gif)
+  <var>c</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>X</var>.\n\nFor example, F(1, 10) = 41 and F(10, 100) = 12492.  \n\rFind F(10<sup>6</sup>,
+  10<sup>9</sup>).\n\n"

data/data/problems/398.yml

@@ -2,12 +2,11 @@
 :id: 398
 :name: Cutting rope
 :url: http://projecteuler.net/problem=398
-:content: "\r\n<p>\r\nInside a rope of length <var>n</var>, <var>n</var>-1 points
-  are placed with distance 1 from each other and from the endpoints. Among these points,
-  we choose <var>m</var>-1 points at random and cut the rope at these points to create
-  <var>m</var> segments.\r\n</p>\r\n<p>\r\nLet E(<var>n</var>, <var>m</var>) be the
-  expected length of the second-shortest segment.\r\nFor example, E(3, 2) = 2 and
-  E(8, 3) = 16/7.\r\nNote that if multiple segments have the same shortest length
-  the length of the second-shortest segment is defined as the same as the shortest
-  length.\r\n</p>\r\n<p>\r\nFind E(10<sup>7</sup>, 100).\r\nGive your answer rounded
-  to 5 decimal places behind the decimal point.\r\n</p>\r\n"
+:content: "Inside a rope of length <var>n</var>, <var>n</var>-1 points are placed
+  with distance 1 from each other and from the endpoints. Among these points, we choose
+  <var>m</var>-1 points at random and cut the rope at these points to create <var>m</var>
+  segments.\n\nLet E(<var>n</var>, <var>m</var>) be the expected length of the second-shortest
+  segment.\rFor example, E(3, 2) = 2 and E(8, 3) = 16/7.\rNote that if multiple segments
+  have the same shortest length the length of the second-shortest segment is defined
+  as the same as the shortest length.\n\nFind E(10<sup>7</sup>, 100).\rGive your answer
+  rounded to 5 decimal places behind the decimal point.\n\n"

data/data/problems/399.yml

@@ -2,21 +2,21 @@
 :id: 399
 :name: Squarefree Fibonacci Numbers
 :url: http://projecteuler.net/problem=399
-:content: "\r\n<p>\r\nThe first 15 fibonacci numbers are:<br>\r\n1,1,2,3,5,8,13,21,34,55,89,144,233,377,610.<br>\r\nIt
-  can be seen that 8 and 144 are not squarefree: 8 is divisible by 4 and 144 is divisible
-  by 4 and by 9.<br> \r\nSo the first 13 squarefree fibonacci numbers are:<br>\r\n1,1,2,3,5,13,21,34,55,89,233,377
-  and 610.\r\n</p>\r\n<p>\r\nThe 200th squarefree fibonacci number is:\r\n971183874599339129547649988289594072811608739584170445.<br>\r\nThe
-  last sixteen digits of this number are: 1608739584170445 and in scientific notation
-  this number can be written as 9.7e53.\r\n</p>\r\n<p>\r\nFind the 100 000 000th squarefree
-  fibonacci number.<br>\r\nGive as your answer its last sixteen digits followed by
-  a comma followed by the number in scientific notation (rounded to one digit after
-  the decimal point).<br>\r\nFor the 200th squarefree number the answer would have
-  been: 1608739584170445,9.7e53\r\n</p>\r\n<p>\r\n<font size=\"-1\">\r\nNote:<br>
-  \r\nFor this problem, assume that for every prime p, the first fibonacci number
-  divisible by p is not divisible by p<sup>2</sup> (this is part of <b>Wall's conjecture</b>).
-  This has been verified for primes <img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> 3·10<sup>15</sup>,
-  but has not been proven in general.<br>\r\n\r\nIf it happens that the conjecture
-  is false, then the accepted answer to this problem isn't guaranteed to be the 100
-  000 000th squarefree fibonacci number, rather it represents only a lower bound for
-  that number.\r\n</font>\r\n</p>\r\n\r\n\r\n\r\n"
+:content: "The first 15 fibonacci numbers are:  \n\r1,1,2,3,5,8,13,21,34,55,89,144,233,377,610.
+  \ \n\rIt can be seen that 8 and 144 are not squarefree: 8 is divisible by 4 and
+  144 is divisible by 4 and by 9.  \n \rSo the first 13 squarefree fibonacci numbers
+  are:  \n\r1,1,2,3,5,13,21,34,55,89,233,377 and 610.\n\nThe 200th squarefree fibonacci
+  number is:\r971183874599339129547649988289594072811608739584170445.  \n\rThe last
+  sixteen digits of this number are: 1608739584170445 and in scientific notation this
+  number can be written as 9.7e53.\n\nFind the 100 000 000th squarefree fibonacci
+  number.  \n\rGive as your answer its last sixteen digits followed by a comma followed
+  by the number in scientific notation (rounded to one digit after the decimal point).
+  \ \n\rFor the 200th squarefree number the answer would have been: 1608739584170445,9.7e53\n\n<font
+  size=\"-1\">\r\nNote:<br> \r\nFor this problem, assume that for every prime p, the
+  first fibonacci number divisible by p is not divisible by p<sup>2</sup> (this is
+  part of <b>Wall's conjecture</b>). This has been verified for primes <img src=\"%7B%7B%20images_dir%20%7D%7D/symbol_le.gif\"
+  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
+  3·10<sup>15</sup>, but has not been proven in general.<br>\r\n\r\n\r\nIf it happens
+  that the conjecture is false, then the accepted answer to this problem isn't guaranteed
+  to be the 100 000 000th squarefree fibonacci number, rather it represents only a
+  lower bound for that number.\r\n</font>\n\n"

data/data/problems/4.yml

@@ -2,7 +2,8 @@
 :id: 4
 :name: Largest palindrome product
 :url: http://projecteuler.net/problem=4
-:content: "\r\n\n<p>A palindromic number reads the same both ways. The largest palindrome
-  made from the product of two 2-digit numbers is 9009 = 91 <img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">
-  99.</p>\n<p>Find the largest palindrome made from the product of two 3-digit numbers.</p>\n\r\n"
+:content: |+
+  A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) 99.
+
+  Find the largest palindrome made from the product of two 3-digit numbers.
+

data/data/problems/40.yml

@@ -2,17 +2,14 @@
 :id: 40
 :name: Champernowne's constant
 :url: http://projecteuler.net/problem=40
-:content: "\r\n<p>An irrational decimal fraction is created by concatenating the positive
-  integers:</p>\r\n<p style=\"text-align:center;\">0.12345678910<span style=\"color:#dd0000;font-size:14pt;\">1</span>112131415161718192021...</p>\r\n<p>It
-  can be seen that the 12<sup>th</sup> digit of the fractional part is 1.</p>\r\n<p>If
-  <i>d</i><sub><i>n</i></sub> represents the <i>n</i><sup>th</sup> digit of the fractional
-  part, find the value of the following expression.</p>\r\n<p style=\"text-align:center;\"><i>d</i><sub>1</sub><img
-  src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\"><i>d</i><sub>10</sub><img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"><i>d</i><sub>100</sub><img
-  src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\"><i>d</i><sub>1000</sub><img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"><i>d</i><sub>10000</sub><img
-  src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\"><i>d</i><sub>100000</sub><img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"><i>d</i><sub>1000000</sub></p>\r\n\r\n"
+:content: |+
+  An irrational decimal fraction is created by concatenating the positive integers:
+
+  0.123456789101112131415161718192021...
+
+  It can be seen that the 12<sup>th</sup> digit of the fractional part is 1.
+
+  If _d_<sub><i>n</i></sub> represents the _n_<sup>th</sup> digit of the fractional part, find the value of the following expression.
+
+  _d_<sub>1</sub> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) _d_<sub>10</sub> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) _d_<sub>100</sub> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) _d_<sub>1000</sub> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) _d_<sub>10000</sub> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) _d_<sub>100000</sub> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) _d_<sub>1000000</sub>
+

data/data/problems/400.yml

@@ -2,17 +2,16 @@
 :id: 400
 :name: Fibonacci tree game
 :url: http://projecteuler.net/problem=400
-:content: "\r\n<p>\r\nA <b>Fibonacci tree</b> is a binary tree recursively defined
-  as:</p>\n<ul>\n<li>T(0) is the empty tree.\r\n</li>\n<li>T(1) is the binary tree
-  with only one node.\r\n</li>\n<li>T(<var>k</var>) consists of a root node that has
-  T(<var>k</var>-1) and T(<var>k</var>-2) as children.\r\n</li>\n</ul>\n<p>\r\nOn
+:content: "A **Fibonacci tree** is a binary tree recursively defined as:\n\n- T(0)
+  is the empty tree.\r\n- T(1) is the binary tree with only one node.\r\n- T(<var>k</var>)
+  consists of a root node that has T(<var>k</var>-1) and T(<var>k</var>-2) as children.\r\n\nOn
   such a tree two players play a take-away game. On each turn a player selects a node
-  and removes that node along with the subtree rooted at that node.<br>\r\nThe player
-  who is forced to take the root node of the entire tree loses.</p>\n<p>\r\n\r\n</p>\n<p>\r\nHere
-  are the winning moves of the first player on the first turn for T(<var>k</var>)
-  from <var>k</var>=1 to <var>k</var>=6.\r\n</p>\n<p align=\"center\"><img src=\"project/images/p400_winning.png\"></p>\r\n\r\n\r\n\r\nLet
+  and removes that node along with the subtree rooted at that node.  \n\rThe player
+  who is forced to take the root node of the entire tree loses.\n\nHere are the winning
+  moves of the first player on the first turn for T(<var>k</var>) from <var>k</var>=1
+  to <var>k</var>=6.\n\n![](/home/will/src/euler-manager/config/../data/images/p400_winning.png)\n\n\r\r\r\rLet
   <var>f</var>(<var>k</var>) be the number of winning moves of the first player (i.e.
   the moves for which the second player has no winning strategy) on the first turn
-  of the game when this game is played on T(<var>k</var>).\r\n\r\n\r\n<p>\r\nFor example,
-  <var>f</var>(5) = 1 and <var>f</var>(10) = 17.\r\n</p>\r\n\r\n<p>\r\nFind <var>f</var>(10000).
-  Give the last 18 digits of your answer.\r\n</p>\r\n"
+  of the game when this game is played on T(<var>k</var>).\r\r\r\n\nFor example, <var>f</var>(5)
+  = 1 and <var>f</var>(10) = 17.\n\nFind <var>f</var>(10000). Give the last 18 digits
+  of your answer.\n\n"

data/data/problems/401.yml

@@ -2,10 +2,9 @@
 :id: 401
 :name: Sum of squares of divisors
 :url: http://projecteuler.net/problem=401
-:content: "\r\n<p>\r\nThe divisors of 6 are 1,2,3 and 6.<br>\r\nThe sum of the squares
-  of these numbers is 1+4+9+36=50.\r\n</p>\r\n<p>\r\nLet sigma2(n) represent the sum
-  of the squares of the divisors of n.\r\nThus sigma2(6)=50.\r\n</p>\r\nLet SIGMA2
-  represent the summatory function of sigma2, that is SIGMA2(n)=<img src=\"images/symbol_sum.gif\"
-  width=\"11\" height=\"14\" alt=\"∑\" border=\"0\" style=\"vertical-align:middle;\">sigma2(i)
-  for i=1 to n.<br>\r\nThe first 6 values of SIGMA2 are: 1,6,16,37,63 and 113.\r\n\r\n<p>\r\nFind
-  SIGMA2(10<sup>15</sup>) modulo 10<sup>9</sup>. \r\n</p>\r\n"
+:content: "The divisors of 6 are 1,2,3 and 6.  \n\rThe sum of the squares of these
+  numbers is 1+4+9+36=50.\n\nLet sigma2(n) represent the sum of the squares of the
+  divisors of n.\rThus sigma2(6)=50.\n\n\rLet SIGMA2 represent the summatory function
+  of sigma2, that is SIGMA2(n)= ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif)sigma2(i)
+  for i=1 to n.  \n\rThe first 6 values of SIGMA2 are: 1,6,16,37,63 and 113.\r\r\n\nFind
+  SIGMA2(10<sup>15</sup>) modulo 10<sup>9</sup>.\n\n"

data/data/problems/402.yml

@@ -2,24 +2,19 @@
 :id: 402
 :name: Integer-valued polynomials
 :url: http://projecteuler.net/problem=402
-:content: "\r\n<p>\r\nIt can be shown that the polynomial <var>n</var><sup>4</sup>
-  + 4<var>n</var><sup>3</sup> + 2<var>n</var><sup>2</sup> + 5<var>n</var> is a multiple
-  of 6 for every integer <var>n</var>. It can also be shown that 6 is the largest
-  integer satisfying this property.\r\n</p>\r\n<p>\r\nDefine M(<var>a</var>, <var>b</var>,
-  <var>c</var>) as the maximum <var>m</var> such that <var>n</var><sup>4</sup> + <var>a</var><var>n</var><sup>3</sup>
-  + <var>b</var><var>n</var><sup>2</sup> + <var>c</var><var>n</var> is a multiple
-  of <var>m</var> for all integers <var>n</var>. For example, M(4, 2, 5) = 6.\r\n</p>\r\n<p>\r\nAlso,
-  define S(<var>N</var>) as the sum of M(<var>a</var>, <var>b</var>, <var>c</var>)
-  for all 0 <img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\"
-  border=\"0\" style=\"vertical-align:middle;\"><var>a</var>, <var>b</var>, <var>c</var>
-  <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>N</var>.\r\n</p>\r\n<p>\r\nWe can verify that
-  S(10) = 1972 and S(10000) = 2024258331114.\r\n</p>\r\n<p>\r\nLet F<sub><var>k</var></sub>
-  be the Fibonacci sequence:<br>\r\nF<sub>0</sub> = 0, F<sub>1</sub> = 1 and<br>\r\nF<sub><var>k</var></sub>
-  = F<sub><var>k</var>-1</sub> + F<sub><var>k</var>-2</sub> for <var>k</var> <img
-  src=\"images/symbol_ge.gif\" width=\"10\" height=\"12\" alt=\"≥\" border=\"0\" style=\"vertical-align:middle;\">
-  2.\r\n</p>\r\n<p>\r\nFind the last 9 digits of Σ S(F<sub><var>k</var></sub>) for
-  2 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>k</var> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  1234567890123.\r\n</p>\r\n"
+:content: "It can be shown that the polynomial <var>n</var><sup>4</sup> + 4<var>n</var><sup>3</sup>
+  + 2<var>n</var><sup>2</sup> + 5<var>n</var> is a multiple of 6 for every integer
+  <var>n</var>. It can also be shown that 6 is the largest integer satisfying this
+  property.\n\nDefine M(<var>a</var>, <var>b</var>, <var>c</var>) as the maximum <var>m</var>
+  such that <var>n</var><sup>4</sup> + <var>a</var><var>n</var><sup>3</sup> + <var>b</var><var>n</var><sup>2</sup>
+  + <var>c</var><var>n</var> is a multiple of <var>m</var> for all integers <var>n</var>.
+  For example, M(4, 2, 5) = 6.\n\nAlso, define S(<var>N</var>) as the sum of M(<var>a</var>,
+  <var>b</var>, <var>c</var>) for all 0 ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)
+  <var>a</var>, <var>b</var>, <var>c</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>N</var>.\n\nWe can verify that S(10) = 1972 and S(10000) = 2024258331114.\n\nLet
+  F<sub><var>k</var></sub> be the Fibonacci sequence:  \n\rF<sub>0</sub> = 0, F<sub>1</sub>
+  = 1 and  \n\rF<sub><var>k</var></sub> = F<sub><var>k</var>-1</sub> + F<sub><var>k</var>-2</sub>
+  for <var>k</var> ![≥](/home/will/src/euler-manager/config/../data/images/symbol_ge.gif)
+  2.\n\nFind the last 9 digits of Σ S(F<sub><var>k</var></sub>) for 2 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>k</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  1234567890123.\n\n"

data/data/problems/403.yml

@@ -2,18 +2,16 @@
 :id: 403
 :name: Lattice points enclosed by parabola and line
 :url: http://projecteuler.net/problem=403
-:content: "\r\n<p>\r\nFor integers <var>a</var> and <var>b</var>, we define <var>D</var>(<var>a</var>,
+:content: "For integers <var>a</var> and <var>b</var>, we define <var>D</var>(<var>a</var>,
   <var>b</var>) as the domain enclosed by the parabola <var>y</var> = <var>x</var><sup>2</sup>
-  and the line <var>y</var> = <var>a</var>·<var>x</var> + <var>b</var>:<br><var>D</var>(<var>a</var>,
-  <var>b</var>) = { (<var>x</var>, <var>y</var>) | <var>x</var><sup>2</sup><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;\"><var>a</var>·<var>x</var> + <var>b</var> }.\r\n</p>\r\n<p>\r\nL(<var>a</var>,
-  <var>b</var>) is defined as the number of lattice points contained in <var>D</var>(<var>a</var>,
-  <var>b</var>).<br>\r\nFor example, L(1, 2) = 8 and L(2, -1) = 1.\r\n</p>\r\n<p>\r\nWe
-  also define S(<var>N</var>) as the sum of L(<var>a</var>, <var>b</var>) for all
-  the pairs (<var>a</var>, <var>b</var>) such that the area of <var>D</var>(<var>a</var>,
-  <var>b</var>) is a rational number and |<var>a</var>|,|<var>b</var>| <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>N</var>.<br>\r\nWe
-  can verify that S(5) = 344 and S(100) = 26709528.\r\n</p>\r\n<p>\r\nFind S(10<sup>12</sup>).
-  Give your answer mod 10<sup>8</sup>.\r\n</p>\r\n"
+  and the line <var>y</var> = <var>a</var>·<var>x</var> + <var>b</var>:  \n<var>D</var>(<var>a</var>,
+  <var>b</var>) = { (<var>x</var>, <var>y</var>) | <var>x</var><sup>2</sup> ![≤](/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)
+  <var>a</var>·<var>x</var> + <var>b</var> }.\n\nL(<var>a</var>, <var>b</var>) is
+  defined as the number of lattice points contained in <var>D</var>(<var>a</var>,
+  <var>b</var>).  \n\rFor example, L(1, 2) = 8 and L(2, -1) = 1.\n\nWe also define
+  S(<var>N</var>) as the sum of L(<var>a</var>, <var>b</var>) for all the pairs (<var>a</var>,
+  <var>b</var>) such that the area of <var>D</var>(<var>a</var>, <var>b</var>) is
+  a rational number and |<var>a</var>|,|<var>b</var>| ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>N</var>.  \n\rWe can verify that S(5) = 344 and S(100) = 26709528.\n\nFind
+  S(10<sup>12</sup>). Give your answer mod 10<sup>8</sup>.\n\n"

data/data/problems/404.yml

@@ -2,20 +2,18 @@
 :id: 404
 :name: Crisscross Ellipses
 :url: http://projecteuler.net/problem=404
-:content: "\r\n<p>\r\nE<sub><var>a</var></sub> is an ellipse with an equation of the
-  form x<sup>2</sup> + 4y<sup>2</sup> = 4<var>a</var><sup>2</sup>.<br>\r\nE<sub><var>a</var></sub>'
-  is the rotated image of E<sub><var>a</var></sub> by θ degrees counterclockwise around
-  the origin O(0, 0) for 0° <img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\"
-  alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\"> θ <img src=\"images/symbol_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\">
-  90°.\r\n</p>\r\n\r\n<div align=\"center\">\r\n<img src=\"project/images/p_404_c_ellipse.gif\">\n</div>\r\n\r\n<p>\r\n<var>b</var>
+:content: "E<sub><var>a</var></sub> is an ellipse with an equation of the form x<sup>2</sup>
+  + 4y<sup>2</sup> = 4<var>a</var><sup>2</sup>.  \n\rE<sub><var>a</var></sub>' is
+  the rotated image of E<sub><var>a</var></sub> by θ degrees counterclockwise around
+  the origin O(0, 0) for 0° ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)
+  θ ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif) 90°.\n\n
+  ![](/home/will/src/euler-manager/config/../data/images/p_404_c_ellipse.gif)\n\n<var>b</var>
   is the distance to the origin of the two intersection points closest to the origin
-  and <var>c</var> is the distance of the two other intersection points.<br>\r\nWe
-  call an ordered triplet (<var>a</var>, <var>b</var>, <var>c</var>) a <i>canonical
-  ellipsoidal triplet</i> if <var>a</var>, <var>b</var> and <var>c</var> are positive
-  integers.<br>\r\nFor example, (209, 247, 286) is a canonical ellipsoidal triplet.\r\n</p>\r\n\r\n<p>\r\nLet
-  C(<var>N</var>) be the number of distinct canonical ellipsoidal triplets (<var>a</var>,
-  <var>b</var>, <var>c</var>) for <var>a</var> <img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>N</var>.<br>\r\nIt
-  can be verified that C(10<sup>3</sup>) = 7, C(10<sup>4</sup>) = 106 and C(10<sup>6</sup>)
-  = 11845.\r\n</p>\r\n\r\n<p>\r\nFind C(10<sup>17</sup>).\r\n</p>\r\n"
+  and <var>c</var> is the distance of the two other intersection points.  \n\rWe call
+  an ordered triplet (<var>a</var>, <var>b</var>, <var>c</var>) a _canonical ellipsoidal
+  triplet_ if <var>a</var>, <var>b</var> and <var>c</var> are positive integers.  \n\rFor
+  example, (209, 247, 286) is a canonical ellipsoidal triplet.\n\nLet C(<var>N</var>)
+  be the number of distinct canonical ellipsoidal triplets (<var>a</var>, <var>b</var>,
+  <var>c</var>) for <var>a</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>N</var>.  \n\rIt can be verified that C(10<sup>3</sup>) = 7, C(10<sup>4</sup>)
+  = 106 and C(10<sup>6</sup>) = 11845.\n\nFind C(10<sup>17</sup>).\n\n"

data/data/problems/405.yml

@@ -2,14 +2,13 @@
 :id: 405
 :name: A rectangular tiling
 :url: http://projecteuler.net/problem=405
-:content: "\r\n<p>\r\nWe wish to tile a rectangle whose length is twice its width.<br>\r\nLet
-  <var>T</var>(0) be the tiling consisting of a single rectangle.<br>\r\nFor <var>n</var>
-  &gt; 0, let <var>T</var>(<var>n</var>) be obtained from <var>T</var>(<var>n</var>-1)
-  by replacing all tiles in the following manner:\r\n</p>\r\n\r\n<div align=\"center\">\r\n<img
-  src=\"project/images/p_405_tile1.png\">\n</div>\r\n\r\n<p>\r\nThe following animation
-  demonstrates the tilings <var>T</var>(<var>n</var>) for <var>n</var> from 0 to 5:\r\n</p>\r\n\r\n<div
-  align=\"center\">\r\n<img src=\"project/images/p_405_tile2.gif\">\n</div>\r\n\r\n<p>\r\nLet
-  <var>f</var>(<var>n</var>) be the number of points where four tiles meet in <var>T</var>(<var>n</var>).<br>\r\nFor
-  example, <var>f</var>(1) = 0, <var>f</var>(4) = 82 and <var>f</var>(10<sup>9</sup>)
-  mod 17<sup>7</sup> = 126897180.\r\n</p>\r\n\r\n<p>\r\nFind <var>f</var>(10<sup><var>k</var></sup>)
-  for <var>k</var> = 10<sup>18</sup>, give your answer modulo 17<sup>7</sup>.\r\n</p>\r\n"
+:content: "We wish to tile a rectangle whose length is twice its width.  \n\rLet <var>T</var>(0)
+  be the tiling consisting of a single rectangle.  \n\rFor <var>n</var> > 0, let <var>T</var>(<var>n</var>)
+  be obtained from <var>T</var>(<var>n</var>-1) by replacing all tiles in the following
+  manner:\n\n ![](/home/will/src/euler-manager/config/../data/images/p_405_tile1.png)\n\nThe
+  following animation demonstrates the tilings <var>T</var>(<var>n</var>) for <var>n</var>
+  from 0 to 5:\n\n ![](/home/will/src/euler-manager/config/../data/images/p_405_tile2.gif)\n\nLet
+  <var>f</var>(<var>n</var>) be the number of points where four tiles meet in <var>T</var>(<var>n</var>).
+  \ \n\rFor example, <var>f</var>(1) = 0, <var>f</var>(4) = 82 and <var>f</var>(10<sup>9</sup>)
+  mod 17<sup>7</sup> = 126897180.\n\nFind <var>f</var>(10<sup><var>k</var></sup>)
+  for <var>k</var> = 10<sup>18</sup>, give your answer modulo 17<sup>7</sup>.\n\n"

data/data/problems/406.yml

@@ -2,45 +2,39 @@
 :id: 406
 :name: Guessing Game
 :url: http://projecteuler.net/problem=406
-:content: "\r\n<p>We are trying to find a hidden number selected from the set of integers
-  {1, 2, ..., <var>n</var>} by asking questions. \r\nEach number (question) we ask,
-  we get one of three possible answers:<br></p>\n<ul>\n<li> \"Your guess is lower
-  than the hidden number\" (and you incur a cost of <var>a</var>), or</li>\r\n<li>
-  \"Your guess is higher than the hidden number\" (and you incur a cost of <var>b</var>),
-  or</li>\r\n<li> \"Yes, that's it!\" (and the game ends).</li>\r\n</ul>\n<p>Given
-  the value of <var>n</var>, <var>a</var>, and <var>b</var>, an <i>optimal strategy</i>
-  minimizes the total cost <u>for the worst possible case</u>.</p>\r\n\r\n<p>For example,
-  if <var>n</var> = 5, <var>a</var> = 2, and <var>b</var> = 3, then we may begin by
-  asking \"<b>2</b>\" as our first question.</p>\r\n\r\n<p>If we are told that 2 is
-  higher than the hidden number (for a cost of <var>b</var>=3), then we are sure that
-  \"<b>1</b>\" is the hidden number (for a total cost of <span style=\"color:blue;\"><b>3</b></span>).<br>\r\nIf
-  we are told that 2 is lower than the hidden number (for a cost of <var>a</var>=2),
-  then our next question will be \"<b>4</b>\".<br>\r\nIf we are told that 4 is higher
-  than the hidden number (for a cost of <var>b</var>=3), then we are sure that \"<b>3</b>\"
-  is the hidden number (for a total cost of 2+3=<span style=\"color:blue;\"><b>5</b></span>).<br>\r\nIf
-  we are told that 4 is lower than the hidden number (for a cost of <var>a</var>=2),
-  then we are sure that \"<b>5</b>\" is the hidden number (for a total cost of 2+2=<span
-  style=\"color:blue;\"><b>4</b></span>).<br>\r\nThus, the worst-case cost achieved
-  by this strategy is <span style=\"color:red;\"><b>5</b></span>. It can also be shown
-  that this is the lowest worst-case cost that can be achieved. \r\nSo, in fact, we
-  have just described an optimal strategy for the given values of <var>n</var>, <var>a</var>,
-  and <var>b</var>.</p>\r\n\r\n<p>Let C(<var>n</var>, <var>a</var>, <var>b</var>)
+:content: "We are trying to find a hidden number selected from the set of integers
+  {1, 2, ..., <var>n</var>} by asking questions. \rEach number (question) we ask,
+  we get one of three possible answers:\n\n- \"Your guess is lower than the hidden
+  number\" (and you incur a cost of <var>a</var>), or\n- \"Your guess is higher than
+  the hidden number\" (and you incur a cost of <var>b</var>), or\n- \"Yes, that's
+  it!\" (and the game ends).\n\nGiven the value of <var>n</var>, <var>a</var>, and
+  <var>b</var>, an _optimal strategy_ minimizes the total cost <u>for the worst possible
+  case</u>.\n\nFor example, if <var>n</var> = 5, <var>a</var> = 2, and <var>b</var>
+  = 3, then we may begin by asking \" **2** \" as our first question.\n\nIf we are
+  told that 2 is higher than the hidden number (for a cost of <var>b</var>=3), then
+  we are sure that \" **1** \" is the hidden number (for a total cost of **3** ).
+  \ \n\rIf we are told that 2 is lower than the hidden number (for a cost of <var>a</var>=2),
+  then our next question will be \" **4** \".  \n\rIf we are told that 4 is higher
+  than the hidden number (for a cost of <var>b</var>=3), then we are sure that \"
+  **3** \" is the hidden number (for a total cost of 2+3= **5** ).  \n\rIf we are
+  told that 4 is lower than the hidden number (for a cost of <var>a</var>=2), then
+  we are sure that \" **5** \" is the hidden number (for a total cost of 2+2= **4**
+  ).  \n\rThus, the worst-case cost achieved by this strategy is **5** . It can also
+  be shown that this is the lowest worst-case cost that can be achieved. \rSo, in
+  fact, we have just described an optimal strategy for the given values of <var>n</var>,
+  <var>a</var>, and <var>b</var>.\n\nLet C(<var>n</var>, <var>a</var>, <var>b</var>)
   be the worst-case cost achieved by an optimal strategy for the given values of <var>n</var>,
-  <var>a</var>, and <var>b</var>.</p>\r\n\r\n<p>Here are a few examples:<br>\r\nC(5,
-  2, 3) = 5<br>\r\nC(500, <img src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\"
-  alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">2, <img src=\"images/symbol_radic.gif\"
-  width=\"14\" height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">3)
-  = 13.22073197...<br>\r\nC(20000, 5, 7) = 82<br>\r\nC(2000000, <img src=\"images/symbol_radic.gif\"
-  width=\"14\" height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">5,
-  <img src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\" border=\"0\"
-  style=\"vertical-align:middle;\">7) = 49.63755955...</p>\r\n\r\n<p>Let F<sub><var>k</var></sub>
-  be the Fibonacci numbers: F<sub><var>k</var></sub> = F<sub><var>k</var>-1</sub>
-  + F<sub><var>k</var>-2</sub> with base cases F<sub>1</sub> = F<sub>2</sub> = 1.<br>Find
-  <img src=\"images/symbol_sum.gif\" width=\"11\" height=\"14\" alt=\"∑\" border=\"0\"
-  style=\"vertical-align:middle;\"><sub>1<img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>k</var><img
-  src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">30</sub> C(10<sup>12</sup>,
-  <img src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>k</var>, <img src=\"images/symbol_radic.gif\"
-  width=\"14\" height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">F<sub><var>k</var></sub>),
-  and give your answer rounded to 8 decimal places behind the decimal point.</p>\r\n"
+  <var>a</var>, and <var>b</var>.\n\nHere are a few examples:  \n\rC(5, 2, 3) = 5
+  \ \n\rC(500, ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)2,
+  ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)3) = 13.22073197...
+  \ \n\rC(20000, 5, 7) = 82  \n\rC(2000000, ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)5,
+  ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)7) = 49.63755955...\n\nLet
+  F<sub><var>k</var></sub> be the Fibonacci numbers: F<sub><var>k</var></sub> = F<sub><var>k</var>-1</sub>
+  + F<sub><var>k</var>-2</sub> with base cases F<sub>1</sub> = F<sub>2</sub> = 1.
+  \ \nFind ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif)<sub>1<img
+  src=\"%7B%7B%20images_dir%20%7D%7D/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\"
+  border=\"0\" style=\"vertical-align:middle;\"><var>k</var><img src=\"%7B%7B%20images_dir%20%7D%7D/symbol_le.gif\"
+  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">30</sub> C(10<sup>12</sup>,
+  ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)<var>k</var>,
+  ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)F<sub><var>k</var></sub>),
+  and give your answer rounded to 8 decimal places behind the decimal point.\n\n"