euler-manager 0.0.5 → 0.0.6

data/data/problems/421.yml

@@ -2,28 +2,17 @@
 :id: 421
 :name: Prime factors of <var>n</var><sup>15</sup>+1
 :url: http://projecteuler.net/problem=421
-:content: "\r\n<p>\r\nNumbers of the form <var>n</var><sup>15</sup>+1 are composite
-  for every integer <var>n</var> <img src=\"images/symbol_gt.gif\" width=\"10\" height=\"10\"
-  alt=\"&gt;\" border=\"0\" style=\"vertical-align:middle;\"> 1.<br>\r\nFor positive
-  integers <var>n</var> and <var>m</var> let <var>s</var>(<var>n,m</var>) be defined
-  as the sum of the <i>distinct</i> prime factors of <var>n</var><sup>15</sup>+1 not
-  exceeding <var>m</var>.\r\n</p>\r\nE.g. 2<sup>15</sup>+1 = 3<img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">3<img
-  src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\">11<img src=\"images/symbol_times.gif\" width=\"9\"
-  height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">331.<br>\r\nSo
-  <var>s</var>(2,10) = 3 and <var>s</var>(2,1000) = 3+11+331 = 345.<br><br>\r\n\r\nAlso
-  10<sup>15</sup>+1 = 7<img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\"
-  alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">11<img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">13<img
-  src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\">211<img src=\"images/symbol_times.gif\" width=\"9\"
-  height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">241<img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">2161<img
-  src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\">9091.<br>\r\nSo <var>s</var>(10,100) = 31 and <var>s</var>(10,1000)
-  = 483.<br><p>\r\nFind &amp;Sum; <var>s</var>(<var>n</var>,10<sup>8</sup>) 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>11</sup>.\r\n</p>\r\n\r\n"
+:content: "Numbers of the form <var>n</var><sup>15</sup>+1 are composite for every
+  integer <var>n</var> ![>](/home/will/src/euler-manager/config/../data/images/symbol_gt.gif)
+  1.  \n\rFor positive integers <var>n</var> and <var>m</var> let <var>s</var>(<var>n,m</var>)
+  be defined as the sum of the _distinct_ prime factors of <var>n</var><sup>15</sup>+1
+  not exceeding <var>m</var>.\n\n\rE.g. 2<sup>15</sup>+1 = 3 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)3
+  ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)11 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)331.
+  \ \n\rSo <var>s</var>(2,10) = 3 and <var>s</var>(2,1000) = 3+11+331 = 345.  \n  \n
+  \ \n\r\rAlso 10<sup>15</sup>+1 = 7 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)11
+  ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)13 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)211
+  ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)241 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)2161
+  ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)9091.  \n\rSo
+  <var>s</var>(10,100) = 31 and <var>s</var>(10,1000) = 483.  \n\nFind &Sum; <var>s</var>(<var>n</var>,10<sup>8</sup>)
+  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>11</sup>.\n\n"

data/data/problems/422.yml

@@ -2,21 +2,19 @@
 :id: 422
 :name: Sequence of points on a hyperbola
 :url: http://projecteuler.net/problem=422
-:content: "\r\n<p>Let H be the hyperbola defined by the equation 12<var>x</var><sup>2</sup>
-  + 7<var>x</var><var>y</var> - 12<var>y</var><sup>2</sup> = 625.</p>\r\n\r\n<p>Next,
-  define X as the point (7, 1). It can be seen that X is in H.</p>\r\n\r\n<p>Now we
-  define a sequence of points in H, {P<sub><var>i</var></sub> : <var>i</var> <img
-  src=\"images/symbol_ge.gif\" width=\"10\" height=\"12\" alt=\"≥\" border=\"0\" style=\"vertical-align:middle;\">
-  1}, as:\r\n</p>\n<ul>\n<li> P<sub>1</sub> = (13, 61/4).\r\n</li>\n<li> P<sub>2</sub>
-  = (-43/6, -4).\r\n</li>\n<li> For <var>i</var> &gt; 2, P<sub><var>i</var></sub>
-  is the unique point in H that is different from P<sub><var>i</var>-1</sub> and such
-  that line P<sub><var>i</var></sub>P<sub><var>i</var>-1</sub> is parallel to line
-  P<sub><var>i</var>-2</sub>X. It can be shown that P<sub><var>i</var></sub> is well-defined,
-  and that its coordinates are always rational.\r\n</li>\n</ul>\n<img src=\"project/images/p422_hyperbola.gif\"><p>You
-  are given that P<sub>3</sub>  = (-19/2, -229/24), P<sub>4</sub> = (1267/144, -37/12)
-  and P<sub>7</sub> = (17194218091/143327232, 274748766781/1719926784).</p>\r\n\r\n<p>Find
-  P<sub><var>n</var></sub> for <var>n</var> = 11<sup>14</sup> in the following format:<br>If
-  P<sub><var>n</var></sub> = (<var>a</var>/<var>b</var>, <var>c</var>/<var>d</var>)
-  where the fractions are in lowest terms and the denominators are positive, then
-  the answer is (<var>a</var> + <var>b</var> + <var>c</var> + <var>d</var>) mod 1 000 000 007.</p>\r\n\r\n<p>For
-  <var>n</var> = 7, the answer would have been: 806236837.</p>\r\n"
+:content: "Let H be the hyperbola defined by the equation 12<var>x</var><sup>2</sup>
+  + 7<var>x</var><var>y</var> - 12<var>y</var><sup>2</sup> = 625.\n\nNext, define
+  X as the point (7, 1). It can be seen that X is in H.\n\nNow we define a sequence
+  of points in H, {P<sub><var>i</var></sub> : <var>i</var> ![≥](/home/will/src/euler-manager/config/../data/images/symbol_ge.gif)
+  1}, as:\n\n- P<sub>1</sub> = (13, 61/4).\r\n- P<sub>2</sub> = (-43/6, -4).\r\n-
+  For <var>i</var> > 2, P<sub><var>i</var></sub> is the unique point in H that is
+  different from P<sub><var>i</var>-1</sub> and such that line P<sub><var>i</var></sub>P<sub><var>i</var>-1</sub>
+  is parallel to line P<sub><var>i</var>-2</sub>X. It can be shown that P<sub><var>i</var></sub>
+  is well-defined, and that its coordinates are always rational.\r\n ![](/home/will/src/euler-manager/config/../data/images/p422_hyperbola.gif)\n\nYou
+  are given that P<sub>3</sub> = (-19/2, -229/24), P<sub>4</sub> = (1267/144, -37/12)
+  and P<sub>7</sub> = (17194218091/143327232, 274748766781/1719926784).\n\nFind P<sub><var>n</var></sub>
+  for <var>n</var> = 11<sup>14</sup> in the following format:  \nIf P<sub><var>n</var></sub>
+  = (<var>a</var>/<var>b</var>, <var>c</var>/<var>d</var>) where the fractions are
+  in lowest terms and the denominators are positive, then the answer is (<var>a</var>
+  + <var>b</var> + <var>c</var> + <var>d</var>) mod 1 000 000 007.\n\nFor <var>n</var>
+  = 7, the answer would have been: 806236837.\n\n"

data/data/problems/423.yml

@@ -2,21 +2,19 @@
 :id: 423
 :name: Consecutive die throws
 :url: http://projecteuler.net/problem=423
-:content: "\r\n<p>Let <var>n</var> be a positive integer.<br>\r\nA 6-sided die is
-  thrown <var>n</var> times. Let <var>c</var> be the number of pairs of consecutive
-  throws that give the same value.</p>\r\n\r\n<p>For example, if <var>n</var> = 7
-  and the values of the die throws are (1,1,5,6,6,6,3), then the following pairs of
-  consecutive throws give the same value:<br>\r\n(<u>1,1</u>,5,6,6,6,3)<br>\r\n(1,1,5,<u>6,6</u>,6,3)<br>\r\n(1,1,5,6,<u>6,6</u>,3)<br>\r\nTherefore,
-  <var>c</var> = 3 for (1,1,5,6,6,6,3).</p>\r\n\r\n<p>Define C(<var>n</var>) as the
-  number of outcomes of throwing a 6-sided die <var>n</var> times such that <var>c</var>
-  does not exceed π(<var>n</var>).<sup>1</sup><br>\r\nFor example, C(3) = 216, C(4)
-  = 1290, C(11) = 361912500 and C(24) = 4727547363281250000.</p>\r\n\r\n<p>Define
-  S(<var>L</var>) as <img src=\"images/symbol_sum.gif\" width=\"11\" height=\"14\"
-  alt=\"∑\" border=\"0\" style=\"vertical-align:middle;\"> C(<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;\"><var>L</var>.<br>\r\nFor example, S(50) mod 1 000 000 007
-  = 832833871.</p>\r\n\r\n<p>Find S(50 000 000) mod 1 000 000 007.</p>\r\n\r\n<p><sup>1</sup>
-  π denotes the <b>prime-counting function</b>, i.e. π(<var>n</var>) is the number
-  of primes <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\"
-  border=\"0\" style=\"vertical-align:middle;\"><var>n</var>.</p>\r\n"
+:content: "Let <var>n</var> be a positive integer.  \n\rA 6-sided die is thrown <var>n</var>
+  times. Let <var>c</var> be the number of pairs of consecutive throws that give the
+  same value.\n\nFor example, if <var>n</var> = 7 and the values of the die throws
+  are (1,1,5,6,6,6,3), then the following pairs of consecutive throws give the same
+  value:  \n\r(<u>1,1</u>,5,6,6,6,3)  \n\r(1,1,5,<u>6,6</u>,6,3)  \n\r(1,1,5,6,<u>6,6</u>,3)
+  \ \n\rTherefore, <var>c</var> = 3 for (1,1,5,6,6,6,3).\n\nDefine C(<var>n</var>)
+  as the number of outcomes of throwing a 6-sided die <var>n</var> times such that
+  <var>c</var> does not exceed π(<var>n</var>).<sup>1</sup>  \n\rFor example, C(3)
+  = 216, C(4) = 1290, C(11) = 361912500 and C(24) = 4727547363281250000.\n\nDefine
+  S(<var>L</var>) as ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif)
+  C(<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)
+  <var>L</var>.  \n\rFor example, S(50) mod 1 000 000 007 = 832833871.\n\nFind S(50 000 000)
+  mod 1 000 000 007.\n\n<sup>1</sup> π denotes the **prime-counting function** , i.e.
+  π(<var>n</var>) is the number of primes ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>n</var>.\n\n"

data/data/problems/424.yml

@@ -2,23 +2,23 @@
 :id: 424
 :name: Kakuro
 :url: http://projecteuler.net/problem=424
-:content: "\r\n<p align=\"center\">\r\n<img src=\"project/images/p_424_kakuro1.gif\"></p>\r\n<p>\r\nThe
+:content: "![](/home/will/src/euler-manager/config/../data/images/p_424_kakuro1.gif)\n\nThe
   above is an example of a cryptic kakuro (also known as cross sums, or even sums
   cross) puzzle, with its final solution on the right. (The common rules of kakuro
   puzzles can be found easily on numerous internet sites. Other related information
-  can also be currently found at <a href=\"http://krazydad.com/\">krazydad.com</a>
-  whose author has provided the puzzle data for this challenge.)\r\n</p>\n<p>\r\n</p>\n<p>\r\nThe
-  downloadable text file (<a href=\"project/kakuro200.txt\">kakuro200.txt</a>) contains
-  the description of 200 such puzzles, a mix of 5x5 and 6x6 types. The first puzzle
-  in the file is the above example which is coded as follows:\r\n</p>\r\n<p>\r\n6,X,X,(vCC),(vI),X,X,X,(hH),B,O,(vCA),(vJE),X,(hFE,vD),O,O,O,O,(hA),O,I,(hJC,vB),O,O,(hJC),H,O,O,O,X,X,X,(hJE),O,O,X\r\n</p>\r\n<p>\r\nThe
+  can also be currently found at [krazydad.com](http://krazydad.com/) whose author
+  has provided the puzzle data for this challenge.)\n\nThe downloadable text file
+  ( [kakuro200.txt](project/kakuro200.txt)) contains the description of 200 such puzzles,
+  a mix of 5x5 and 6x6 types. The first puzzle in the file is the above example which
+  is coded as follows:\n\n6,X,X,(vCC),(vI),X,X,X,(hH),B,O,(vCA),(vJE),X,(hFE,vD),O,O,O,O,(hA),O,I,(hJC,vB),O,O,(hJC),H,O,O,O,X,X,X,(hJE),O,O,X\n\nThe
   first character is a numerical digit indicating the size of the information grid.
   It would be either a 6 (for a 5x5 kakuro puzzle) or a 7 (for a 6x6 puzzle) followed
-  by a comma (,). The extra top line and left column are needed to insert information.\r\n</p>\r\n<p>\r\nThe
+  by a comma (,). The extra top line and left column are needed to insert information.\n\nThe
   content of each cell is then described and followed by a comma, going left to right
-  and starting with the top line.<br>\r\nX = Gray cell, not required to be filled
-  by a digit.<br>\r\nO (upper case letter)= White empty cell to be filled by a digit.<br>\r\nA
+  and starting with the top line.  \n\rX = Gray cell, not required to be filled by
+  a digit.  \n\rO (upper case letter)= White empty cell to be filled by a digit.  \n\rA
   = Or any one of the upper case letters from A to J to be replaced by its equivalent
-  digit in the solved puzzle.<br>\r\n( ) = Location of the encrypted sums. Horizontal
+  digit in the solved puzzle.  \n\r( ) = Location of the encrypted sums. Horizontal
   sums are preceded by a lower case \"h\" and vertical sums are preceded by a lower
   case \"v\". Those are followed by one or two upper case letters depending if the
   sum is a single digit or double digit one. For double digit sums, the first letter
@@ -26,12 +26,11 @@
   contain information for both a horizontal and a vertical sum, the first one is always
   for the horizontal sum and the two are separated by a comma within the same set
   of brackets, ex.: (hFE,vD). Each set of brackets is also immediately followed by
-  a comma.\r\n</p>\r\n<p>\r\nThe description of the last cell is followed by a Carriage
-  Return/Line Feed (CRLF) instead of a comma.\r\n</p>\r\n<p>\r\nThe required answer
-  to each puzzle is based on the value of each letter necessary to arrive at the solution
-  and according to the alphabetical order. As indicated under the example puzzle,
-  its answer would be 8426039571. At least 9 out of the 10 encrypting letters are
-  always part of the problem description. When only 9 are given, the missing one must
-  be assigned the remaining digit.\r\n</p>\r\n<p>\r\nYou are given that the sum of
-  the answers for the first 10 puzzles in the file is 64414157580.\r\n</p>\r\n<p>\r\nFind
-  the sum of the answers for the 200 puzzles.\r\n</p>\r\n\r\n\r\n\r\n"
+  a comma.\n\nThe description of the last cell is followed by a Carriage Return/Line
+  Feed (CRLF) instead of a comma.\n\nThe required answer to each puzzle is based on
+  the value of each letter necessary to arrive at the solution and according to the
+  alphabetical order. As indicated under the example puzzle, its answer would be 8426039571.
+  At least 9 out of the 10 encrypting letters are always part of the problem description.
+  When only 9 are given, the missing one must be assigned the remaining digit.\n\nYou
+  are given that the sum of the answers for the first 10 puzzles in the file is 64414157580.\n\nFind
+  the sum of the answers for the 200 puzzles.\n\n"

data/data/problems/425.yml

@@ -2,15 +2,14 @@
 :id: 425
 :name: Prime connection
 :url: http://projecteuler.net/problem=425
-:content: "\r\n<p>\r\nTwo positive numbers A and B are said to be <i>connected</i>
-  (denoted by \"A ↔ B\") if one of these conditions holds:<br>\r\n(1) A and B have
-  the same length and differ in exactly one digit; for example, 123 ↔ 173.<br>\r\n(2)
-  Adding one digit to the left of A (or B) makes B (or A); for example, 23 ↔ 223 and
-  123 ↔ 23.\r\n</p>\r\n<p>\r\nWe call a prime P a <i>2's relative</i> if there exists
-  a chain of connected primes between 2 and P and no prime in the chain exceeds P.\r\n</p>\r\n<p>\r\nFor
-  example, 127 is a 2's relative. One of the possible chains is shown below:<br>\r\n2
-  ↔ 3 ↔ 13 ↔ 113 ↔ 103 ↔ 107 ↔ 127<br>\r\nHowever, 11 and 103 are not 2's relatives.\r\n</p>\r\n<p>\r\nLet
-  F(N) be the sum of the primes <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\"
-  alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> N which are not 2's relatives.<br>\r\nWe
-  can verify that F(10<sup>3</sup>) = 431 and F(10<sup>4</sup>) = 78728.\r\n</p>\r\n<p>\r\nFind
-  F(10<sup>7</sup>).\r\n</p>\r\n"
+:content: "Two positive numbers A and B are said to be _connected_ (denoted by \"A
+  ↔ B\") if one of these conditions holds:  \n\r(1) A and B have the same length and
+  differ in exactly one digit; for example, 123 ↔ 173.  \n\r(2) Adding one digit to
+  the left of A (or B) makes B (or A); for example, 23 ↔ 223 and 123 ↔ 23.\n\nWe call
+  a prime P a _2's relative_ if there exists a chain of connected primes between 2
+  and P and no prime in the chain exceeds P.\n\nFor example, 127 is a 2's relative.
+  One of the possible chains is shown below:  \n\r2 ↔ 3 ↔ 13 ↔ 113 ↔ 103 ↔ 107 ↔ 127
+  \ \n\rHowever, 11 and 103 are not 2's relatives.\n\nLet F(N) be the sum of the primes
+  ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) N which are
+  not 2's relatives.  \n\rWe can verify that F(10<sup>3</sup>) = 431 and F(10<sup>4</sup>)
+  = 78728.\n\nFind F(10<sup>7</sup>).\n\n"

data/data/problems/426.yml

@@ -2,28 +2,27 @@
 :id: 426
 :name: Box-ball system
 :url: http://projecteuler.net/problem=426
-:content: "\r\n<p>\r\nConsider an infinite row of boxes. Some of the boxes contain
-  a ball. For example, an initial configuration of 2 consecutive occupied boxes followed
-  by 2 empty boxes, 2 occupied boxes, 1 empty box, and 2 occupied boxes can be denoted
+:content: "Consider an infinite row of boxes. Some of the boxes contain a ball. For
+  example, an initial configuration of 2 consecutive occupied boxes followed by 2
+  empty boxes, 2 occupied boxes, 1 empty box, and 2 occupied boxes can be denoted
   by the sequence (2, 2, 2, 1, 2), in which the number of consecutive occupied and
-  empty boxes appear alternately.\r\n</p>\r\n<p>\r\nA turn consists of moving each
-  ball exactly once according to the following rule: Transfer the leftmost ball which
-  has not been moved to the nearest empty box to its right.\r\n</p>\r\n<p>\r\nAfter
-  one turn the sequence (2, 2, 2, 1, 2) becomes (2, 2, 1, 2, 3) as can be seen below;
-  note that we begin the new sequence starting at the first occupied box.\r\n</p>\r\n\r\n<div
-  align=\"center\">\r\n<img src=\"project/images/p_426_baxball1.gif\">\n</div>\r\n\r\n<p>\r\nA
-  system like this is called a <b>Box-Ball System</b> or <b>BBS</b> for short.\r\n</p>\r\n<p>\r\nIt
-  can be shown that after a sufficient number of turns, the system evolves to a state
+  empty boxes appear alternately.\n\nA turn consists of moving each ball exactly once
+  according to the following rule: Transfer the leftmost ball which has not been moved
+  to the nearest empty box to its right.\n\nAfter one turn the sequence (2, 2, 2,
+  1, 2) becomes (2, 2, 1, 2, 3) as can be seen below; note that we begin the new sequence
+  starting at the first occupied box.\n\n ![](/home/will/src/euler-manager/config/../data/images/p_426_baxball1.gif)\n\nA
+  system like this is called a **Box-Ball System** or **BBS** for short.\n\nIt can
+  be shown that after a sufficient number of turns, the system evolves to a state
   where the consecutive numbers of occupied boxes is invariant. In the example below,
-  the consecutive numbers of <b>occupied boxes</b> evolves to [1, 2, 3]; we shall
-  call this the final state.\r\n</p>\r\n\r\n<div align=\"center\">\r\n<img src=\"project/images/p_426_baxball2.gif\">\n</div>\r\n\r\n<p>\r\nWe
-  define the sequence {<var>t</var><sub><var>i</var></sub>}:<br></p>\n<ul>\n<li>\n<var>s</var><sub>0</sub>
-  = 290797\r\n</li>\n<li>\n<var>s</var><sub><var>k</var>+1</sub> = <var>s</var><sub><var>k</var></sub><sup>2</sup>
-  mod 50515093\r\n</li>\n<li>\n<var>t</var><sub><var>k</var></sub> = (<var>s</var><sub><var>k</var></sub>
-  mod 64) + 1\r\n</li>\n</ul>\n<p>\r\nStarting from the initial configuration (<var>t</var><sub>0</sub>,
+  the consecutive numbers of **occupied boxes** evolves to [1, 2, 3]; we shall call
+  this the final state.\n\n ![](/home/will/src/euler-manager/config/../data/images/p_426_baxball2.gif)\n\nWe
+  define the sequence {<var>t</var><sub><var>i</var></sub>}:\n\n- <var>s</var><sub>0</sub>
+  = 290797\r\n- <var>s</var><sub><var>k</var>+1</sub> = <var>s</var><sub><var>k</var></sub><sup>2</sup>
+  mod 50515093\r\n- <var>t</var><sub><var>k</var></sub> = (<var>s</var><sub><var>k</var></sub>
+  mod 64) + 1\r\n\nStarting from the initial configuration (<var>t</var><sub>0</sub>,
   <var>t</var><sub>1</sub>, …, <var>t</var><sub>10</sub>), the final state becomes
-  [1, 3, 10, 24, 51, 75].<br>\r\nStarting from the initial configuration (<var>t</var><sub>0</sub>,
+  [1, 3, 10, 24, 51, 75].  \n\rStarting from the initial configuration (<var>t</var><sub>0</sub>,
   <var>t</var><sub>1</sub>, …, <var>t</var><sub>10 000 000</sub>), find the final
-  state.<br>\r\nGive as your answer the sum of the squares of the elements of the
-  final state. For example, if the final state is [1, 2, 3] then 14 ( = 1<sup>2</sup>
-  + 2<sup>2</sup> + 3<sup>2</sup>) is your answer.\r\n</p>\r\n"
+  state.  \n\rGive as your answer the sum of the squares of the elements of the final
+  state. For example, if the final state is [1, 2, 3] then 14 ( = 1<sup>2</sup> +
+  2<sup>2</sup> + 3<sup>2</sup>) is your answer.\n\n"

data/data/problems/427.yml

@@ -2,17 +2,15 @@
 :id: 427
 :name: n-sequences
 :url: http://projecteuler.net/problem=427
-:content: "\r\n<p>A sequence of integers S = {s<sub><var>i</var></sub>} is called
-  an <var>n-sequence</var> if it has <var>n</var> elements and each element s<sub><var>i</var></sub>
-  satisfies 1 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\"
-  border=\"0\" style=\"vertical-align:middle;\"> s<sub><var>i</var></sub><img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>n</var>.
+:content: "A sequence of integers S = {s<sub><var>i</var></sub>} is called an <var>n-sequence</var>
+  if it has <var>n</var> elements and each element s<sub><var>i</var></sub> satisfies
+  1 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) s<sub><var>i</var></sub>
+  ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) <var>n</var>.
   Thus there are <var>n</var><sup><var>n</var></sup> distinct <var>n</var>-sequences
-  in total.\r\nFor example, the sequence S = {1, 5, 5, 10, 7, 7, 7, 2, 3, 7} is a
-  10-sequence.</p>\r\n\r\n<p>For any sequence S, let L(S) be the length of the longest
-  contiguous subsequence of S with the same value.\r\nFor example, for the given sequence
-  S above, L(S) = 3, because of the three consecutive 7's.</p>\r\n\r\n<p>Let <var>f</var>(<var>n</var>)
-  = <img src=\"images/symbol_sum.gif\" width=\"11\" height=\"14\" alt=\"∑\" border=\"0\"
-  style=\"vertical-align:middle;\"> L(S) for all <var>n</var>-sequences S.</p>\r\n\r\n<p>For
-  example, <var>f</var>(3) = 45, <var>f</var>(7) = 1403689 and <var>f</var>(11) =
-  481496895121.</p>\r\n\r\n<p>Find <var>f</var>(7 500 000) mod 1 000 000 009.</p>\r\n\r\n\r\n"
+  in total.\rFor example, the sequence S = {1, 5, 5, 10, 7, 7, 7, 2, 3, 7} is a 10-sequence.\n\nFor
+  any sequence S, let L(S) be the length of the longest contiguous subsequence of
+  S with the same value.\rFor example, for the given sequence S above, L(S) = 3, because
+  of the three consecutive 7's.\n\nLet <var>f</var>(<var>n</var>) = ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif)
+  L(S) for all <var>n</var>-sequences S.\n\nFor example, <var>f</var>(3) = 45, <var>f</var>(7)
+  = 1403689 and <var>f</var>(11) = 481496895121.\n\nFind <var>f</var>(7 500 000) mod
+  1 000 000 009.\n\n"

data/data/problems/428.yml

@@ -2,31 +2,27 @@
 :id: 428
 :name: Necklace of circles
 :url: http://projecteuler.net/problem=428
-:content: "\r\n<p>Let <var>a</var>, <var>b</var> and <var>c</var> be positive numbers.<br>\r\nLet
+:content: "Let <var>a</var>, <var>b</var> and <var>c</var> be positive numbers.  \n\rLet
   W, X, Y, Z be four collinear points where |WX| = <var>a</var>, |XY| = <var>b</var>,
-  |YZ| = <var>c</var> and |WZ| = <var>a</var> + <var>b</var> + <var>c</var>.<br>\r\nLet
-  C<sub>in</sub> be the circle having the diameter XY.<br>\r\nLet C<sub>out</sub>
-  be the circle having the diameter WZ.<br></p>\r\n\r\n<p>\r\nThe triplet (<var>a</var>,
-  <var>b</var>, <var>c</var>) is called a <em>necklace triplet</em> if you can place
-  <var>k</var> <img src=\"images/symbol_ge.gif\" width=\"10\" height=\"12\" alt=\"≥\"
-  border=\"0\" style=\"vertical-align:middle;\"> 3 distinct circles C<sub>1</sub>,
-  C<sub>2</sub>, ..., C<sub><var>k</var></sub> such that:\r\n</p>\n<ul>\n<li>C<sub><var>i</var></sub>
-  has no common interior points with any C<sub><var>j</var></sub> for 1 <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>i</var>,
-  <var>j</var> <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\"
-  border=\"0\" style=\"vertical-align:middle;\"><var>k</var> and <var>i</var> <img
-  src=\"images/symbol_ne.gif\" width=\"11\" height=\"10\" alt=\"≠\" border=\"0\" style=\"vertical-align:middle;\"><var>j</var>,\r\n</li>\n<li>C<sub><var>i</var></sub>
-  is tangent to both C<sub>in</sub> and C<sub>out</sub> for 1 <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>i</var>
-  <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>k</var>,\r\n</li>\n<li>C<sub><var>i</var></sub>
-  is tangent to C<sub><var>i</var>+1</sub> for 1 <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>i</var>
-  k, and\r\n</li>\n<li>C<sub><var>k</var></sub> is tangent to C<sub>1</sub>.\r\n</li>\n</ul>\n<p>\r\nFor
-  example, (5, 5, 5) and (4, 3, 21) are necklace triplets, while it can be shown that
-  (2, 2, 5) is not.\r\n</p>\r\n<p align=\"center\"><img src=\"project/images/p428_necklace.png\"></p>\r\n\r\n<p>\r\nLet
+  |YZ| = <var>c</var> and |WZ| = <var>a</var> + <var>b</var> + <var>c</var>.  \n\rLet
+  C<sub>in</sub> be the circle having the diameter XY.  \n\rLet C<sub>out</sub> be
+  the circle having the diameter WZ.\n\nThe triplet (<var>a</var>, <var>b</var>, <var>c</var>)
+  is called a _necklace triplet_ if you can place <var>k</var> ![≥](/home/will/src/euler-manager/config/../data/images/symbol_ge.gif)
+  3 distinct circles C<sub>1</sub>, C<sub>2</sub>, ..., C<sub><var>k</var></sub> such
+  that:\n\n- C<sub><var>i</var></sub> has no common interior points with any C<sub><var>j</var></sub>
+  for 1 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) <var>i</var>,
+  <var>j</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>k</var> and <var>i</var> ![≠](/home/will/src/euler-manager/config/../data/images/symbol_ne.gif)
+  <var>j</var>,\r\n- C<sub><var>i</var></sub> is tangent to both C<sub>in</sub> and
+  C<sub>out</sub> for 1 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>i</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>k</var>,\r\n- C<sub><var>i</var></sub> is tangent to C<sub><var>i</var>+1</sub>
+  for 1 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) <var>i</var>
+  k, and\r\n- C<sub><var>k</var></sub> is tangent to C<sub>1</sub>.\r\n\nFor example,
+  (5, 5, 5) and (4, 3, 21) are necklace triplets, while it can be shown that (2, 2,
+  5) is not.\n\n![](/home/will/src/euler-manager/config/../data/images/p428_necklace.png)\n\nLet
   T(<var>n</var>) be the number of necklace triplets (<var>a</var>, <var>b</var>,
   <var>c</var>) such that <var>a</var>, <var>b</var> and <var>c</var> are positive
-  integers, and <var>b</var> <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\"
-  alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>n</var>.\r\nFor example,
-  T(1) = 9, T(20) = 732 and T(3000) = 438106.\r\n</p>\r\n<p>\r\nFind T(1 000 000 000).\r\n</p>\r\n"
+  integers, and <var>b</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>n</var>.\rFor example, T(1) = 9, T(20) = 732 and T(3000) = 438106.\n\nFind
+  T(1 000 000 000).\n\n"

data/data/problems/429.yml

@@ -2,9 +2,9 @@
 :id: 429
 :name: Sum of squares of unitary divisors
 :url: http://projecteuler.net/problem=429
-:content: "\r\n<p>\r\nA unitary divisor <var>d</var> of a number <var>n</var> is a
-  divisor of <var>n</var> that has the property gcd(<var>d, n/d</var>) = 1.<br>\r\nThe
-  unitary divisors of 4! = 24 are 1, 3, 8 and 24.<br>\r\nThe sum of their squares
-  is 1<sup>2</sup> + 3<sup>2</sup> + 8<sup>2</sup> + 24<sup>2</sup> = 650.\r\n</p>\r\n<p>\r\nLet
-  S(<var>n</var>) represent the sum of the squares of the unitary divisors of <var>n</var>.
-  Thus S(4!)=650.\r\n</p>\r\n<p>\r\nFind S(100 000 000!) modulo 1 000 000 009.\r\n</p>\r\n"
+:content: "A unitary divisor <var>d</var> of a number <var>n</var> is a divisor of
+  <var>n</var> that has the property gcd(<var>d, n/d</var>) = 1.  \n\rThe unitary
+  divisors of 4! = 24 are 1, 3, 8 and 24.  \n\rThe sum of their squares is 1<sup>2</sup>
+  + 3<sup>2</sup> + 8<sup>2</sup> + 24<sup>2</sup> = 650.\n\nLet S(<var>n</var>) represent
+  the sum of the squares of the unitary divisors of <var>n</var>. Thus S(4!)=650.\n\nFind
+  S(100 000 000!) modulo 1 000 000 009.\n\n"

data/data/problems/43.yml

@@ -2,16 +2,18 @@
 :id: 43
 :name: Sub-string divisibility
 :url: http://projecteuler.net/problem=43
-:content: "\r\n<p>The number, 1406357289, is a 0 to 9 pandigital number because it
-  is made up of each of the digits 0 to 9 in some order, but it also has a rather
-  interesting sub-string divisibility property.</p>\r\n<p>Let <i>d</i><sub>1</sub>
-  be the 1<sup>st</sup> digit, <i>d</i><sub>2</sub> be the 2<sup>nd</sup> digit, and
-  so on. In this way, we note the following:</p>\r\n<ul>\n<li>\n<i>d</i><sub>2</sub><i>d</i><sub>3</sub><i>d</i><sub>4</sub>=406
-  is divisible by 2</li>\r\n<li>\n<i>d</i><sub>3</sub><i>d</i><sub>4</sub><i>d</i><sub>5</sub>=063
-  is divisible by 3</li>\r\n<li>\n<i>d</i><sub>4</sub><i>d</i><sub>5</sub><i>d</i><sub>6</sub>=635
-  is divisible by 5</li>\r\n<li>\n<i>d</i><sub>5</sub><i>d</i><sub>6</sub><i>d</i><sub>7</sub>=357
-  is divisible by 7</li>\r\n<li>\n<i>d</i><sub>6</sub><i>d</i><sub>7</sub><i>d</i><sub>8</sub>=572
-  is divisible by 11</li>\r\n<li>\n<i>d</i><sub>7</sub><i>d</i><sub>8</sub><i>d</i><sub>9</sub>=728
-  is divisible by 13</li>\r\n<li>\n<i>d</i><sub>8</sub><i>d</i><sub>9</sub><i>d</i><sub>10</sub>=289
-  is divisible by 17</li>\r\n</ul>\n<p>Find the sum of all 0 to 9 pandigital numbers
-  with this property.</p>\r\n\r\n"
+:content: |+
+  The number, 1406357289, is a 0 to 9 pandigital number because it is made up of each of the digits 0 to 9 in some order, but it also has a rather interesting sub-string divisibility property.
+
+  Let _d_<sub>1</sub> be the 1<sup>st</sup> digit, _d_<sub>2</sub> be the 2<sup>nd</sup> digit, and so on. In this way, we note the following:
+
+  - _d_<sub>2</sub>_d_<sub>3</sub>_d_<sub>4</sub>=406 is divisible by 2
+  - _d_<sub>3</sub>_d_<sub>4</sub>_d_<sub>5</sub>=063 is divisible by 3
+  - _d_<sub>4</sub>_d_<sub>5</sub>_d_<sub>6</sub>=635 is divisible by 5
+  - _d_<sub>5</sub>_d_<sub>6</sub>_d_<sub>7</sub>=357 is divisible by 7
+  - _d_<sub>6</sub>_d_<sub>7</sub>_d_<sub>8</sub>=572 is divisible by 11
+  - _d_<sub>7</sub>_d_<sub>8</sub>_d_<sub>9</sub>=728 is divisible by 13
+  - _d_<sub>8</sub>_d_<sub>9</sub>_d_<sub>10</sub>=289 is divisible by 17
+
+  Find the sum of all 0 to 9 pandigital numbers with this property.
+

data/data/problems/430.yml

@@ -2,19 +2,17 @@
 :id: 430
 :name: Range flips
 :url: http://projecteuler.net/problem=430
-:content: "\r\n<p><var>N</var> disks are placed in a row, indexed 1 to <var>N</var>
-  from left to right.<br>\r\nEach disk has a black side and white side. Initially
-  all disks show their white side.</p>\r\n\r\n<p>At each turn, two, not necessarily
-  distinct, integers <var>A</var> and <var>B</var> between 1 and <var>N</var> (inclusive)
-  are chosen uniformly at random.<br>\r\nAll disks with an index from <var>A</var>
-  to <var>B</var> (inclusive) are flipped.</p>\r\n\r\n<p>The following example shows
-  the case <var>N</var> = 8. At the first turn <var>A</var> = 5 and <var>B</var> =
-  2, and at the second turn <var>A</var> = 4 and <var>B</var> = 6.</p>\r\n\r\n<p align=\"center\"><img
-  src=\"project/images/p_430_flips.gif\"></p>\r\n\r\n<p>Let E(<var>N</var>, <var>M</var>)
-  be the expected number of disks that show their white side after <var>M</var> turns.<br>\r\nWe
-  can verify that E(3, 1) = 10/9, E(3, 2) = 5/3, E(10, 4) <img src=\"images/symbol_asymp.gif\"
-  width=\"11\" height=\"9\" alt=\"≈\" border=\"0\" style=\"vertical-align:middle;\">
-  5.157 and E(100, 10) <img src=\"images/symbol_asymp.gif\" width=\"11\" height=\"9\"
-  alt=\"≈\" border=\"0\" style=\"vertical-align:middle;\"> 51.893.</p>\r\n\r\n<p>Find
-  E(10<sup>10</sup>, 4000).<br>\r\nGive your answer rounded to 2 decimal places behind
-  the decimal point.</p>\r\n"
+:content: "<var>N</var> disks are placed in a row, indexed 1 to <var>N</var> from
+  left to right.  \n\rEach disk has a black side and white side. Initially all disks
+  show their white side.\n\nAt each turn, two, not necessarily distinct, integers
+  <var>A</var> and <var>B</var> between 1 and <var>N</var> (inclusive) are chosen
+  uniformly at random.  \n\rAll disks with an index from <var>A</var> to <var>B</var>
+  (inclusive) are flipped.\n\nThe following example shows the case <var>N</var> =
+  8. At the first turn <var>A</var> = 5 and <var>B</var> = 2, and at the second turn
+  <var>A</var> = 4 and <var>B</var> = 6.\n\n![](/home/will/src/euler-manager/config/../data/images/p_430_flips.gif)\n\nLet
+  E(<var>N</var>, <var>M</var>) be the expected number of disks that show their white
+  side after <var>M</var> turns.  \n\rWe can verify that E(3, 1) = 10/9, E(3, 2) =
+  5/3, E(10, 4) ![≈](/home/will/src/euler-manager/config/../data/images/symbol_asymp.gif)
+  5.157 and E(100, 10) ![≈](/home/will/src/euler-manager/config/../data/images/symbol_asymp.gif)
+  51.893.\n\nFind E(10<sup>10</sup>, 4000).  \n\rGive your answer rounded to 2 decimal
+  places behind the decimal point.\n\n"

data/data/problems/44.yml

@@ -2,15 +2,12 @@
 :id: 44
 :name: Pentagon numbers
 :url: http://projecteuler.net/problem=44
-:content: "\r\n<p>Pentagonal numbers are generated by the formula, P<sub><var>n</var></sub>=<var>n</var>(3<var>n</var><img
-  src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\" border=\"0\"
-  style=\"vertical-align:middle;\">1)/2. The first ten pentagonal numbers are:</p>\r\n<p
-  style=\"text-align:center;\">1, 5, 12, 22, 35, 51, 70, 92, 117, 145, ...</p>\r\n<p>It
-  can be seen that P<sub>4</sub> + P<sub>7</sub> = 22 + 70 = 92 = P<sub>8</sub>. However,
-  their difference, 70 <img src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\"
-  alt=\"−\" border=\"0\" style=\"vertical-align:middle;\"> 22 = 48, is not pentagonal.</p>\r\n<p>Find
-  the pair of pentagonal numbers, P<sub><var>j</var></sub> and P<sub><var>k</var></sub>,
-  for which their sum and difference are pentagonal and D = |P<sub><var>k</var></sub><img
-  src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\" border=\"0\"
-  style=\"vertical-align:middle;\"> P<sub><var>j</var></sub>| is minimised; what is
-  the value of D?</p>\r\n"
+:content: |+
+  Pentagonal numbers are generated by the formula, P<sub><var>n</var></sub>=<var>n</var>(3<var>n</var> ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)1)/2. The first ten pentagonal numbers are:
+
+  1, 5, 12, 22, 35, 51, 70, 92, 117, 145, ...
+
+  It can be seen that P<sub>4</sub> + P<sub>7</sub> = 22 + 70 = 92 = P<sub>8</sub>. However, their difference, 70 ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif) 22 = 48, is not pentagonal.
+
+  Find the pair of pentagonal numbers, P<sub><var>j</var></sub> and P<sub><var>k</var></sub>, for which their sum and difference are pentagonal and D = |P<sub><var>k</var></sub> ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif) P<sub><var>j</var></sub>| is minimised; what is the value of D?
+

data/data/problems/45.yml

@@ -2,14 +2,14 @@
 :id: 45
 :name: Triangular, pentagonal, and hexagonal
 :url: http://projecteuler.net/problem=45
-:content: "\r\n<p>Triangle, pentagonal, and hexagonal numbers are generated by the
-  following formulae:</p>\r\n<table>\n<tr>\n<td>Triangle</td>\r\n<td> </td>\r\n<td>T<sub><i>n</i></sub>=<i>n</i>(<i>n</i>+1)/2</td>\r\n<td> </td>\r\n<td>1,
-  3, 6, 10, 15, ...</td>\r\n</tr>\n<tr>\n<td>Pentagonal</td>\r\n<td> </td>\r\n<td>P<sub><i>n</i></sub>=<i>n</i>(3<i>n</i><img
-  src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\" border=\"0\"
-  style=\"vertical-align:middle;\">1)/2</td>\r\n<td> </td>\r\n<td>1, 5, 12, 22, 35,
-  ...</td>\r\n</tr>\n<tr>\n<td>Hexagonal</td>\r\n<td> </td>\r\n<td>H<sub><i>n</i></sub>=<i>n</i>(2<i>n</i><img
-  src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\" border=\"0\"
-  style=\"vertical-align:middle;\">1)</td>\r\n<td> </td>\r\n<td>1, 6, 15, 28, 45,
-  ...</td>\r\n</tr>\n</table>\n<p>It can be verified that T<sub>285</sub> = P<sub>165</sub>
-  = H<sub>143</sub> = 40755.</p>\r\n<p>Find the next triangle number that is also
-  pentagonal and hexagonal.</p>\r\n\r\n"
+:content: |+
+  Triangle, pentagonal, and hexagonal numbers are generated by the following formulae:
+
+  | Triangle |   | T<sub><i>n</i></sub>=_n_(_n_+1)/2 |   | 1, 3, 6, 10, 15, ... |
+  | Pentagonal |   | P<sub><i>n</i></sub>=_n_(3_n_ ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)1)/2 |   | 1, 5, 12, 22, 35, ... |
+  | Hexagonal |   | H<sub><i>n</i></sub>=_n_(2_n_ ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)1) |   | 1, 6, 15, 28, 45, ... |
+
+  It can be verified that T<sub>285</sub> = P<sub>165</sub> = H<sub>143</sub> = 40755.
+
+  Find the next triangle number that is also pentagonal and hexagonal.
+

data/data/problems/46.yml

@@ -2,17 +2,12 @@
 :id: 46
 :name: Goldbach's other conjecture
 :url: http://projecteuler.net/problem=46
-:content: "\r\n<p>It was proposed by Christian Goldbach that every odd composite number
-  can be written as the sum of a prime and twice a square.</p>\r\n<p style=\"margin-left:10px;\">9
-  = 7 + 2<img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\">1<sup>2</sup><br>\r\n15 = 7 + 2<img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">2<sup>2</sup><br>\r\n21
-  = 3 + 2<img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\">3<sup>2</sup><br>\r\n25 = 7 + 2<img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">3<sup>2</sup><br>\r\n27
-  = 19 + 2<img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\"
-  border=\"0\" style=\"vertical-align:middle;\">2<sup>2</sup><br>\r\n33 = 31 + 2<img
-  src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\">1<sup>2</sup></p>\r\n<p>It turns out that the conjecture
-  was false.</p>\r\n<p>What is the smallest odd composite that cannot be written as
-  the sum of a prime and twice a square?</p>\r\n\r\n"
+:content: "It was proposed by Christian Goldbach that every odd composite number can
+  be written as the sum of a prime and twice a square.\n\n9 = 7 + 2 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)1<sup>2</sup>
+  \ \n\r15 = 7 + 2 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)2<sup>2</sup>
+  \ \n\r21 = 3 + 2 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)3<sup>2</sup>
+  \ \n\r25 = 7 + 2 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)3<sup>2</sup>
+  \ \n\r27 = 19 + 2 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)2<sup>2</sup>
+  \ \n\r33 = 31 + 2 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)1<sup>2</sup>\n\nIt
+  turns out that the conjecture was false.\n\nWhat is the smallest odd composite that
+  cannot be written as the sum of a prime and twice a square?\n\n"