euler-manager 0.0.5 → 0.0.6

data/data/problems/128.yml

@@ -2,17 +2,22 @@
 :id: 128
 :name: Hexagonal tile differences
 :url: http://projecteuler.net/problem=128
-:content: "\r\n\n<p>A hexagonal tile with number 1 is surrounded by a ring of six
-  hexagonal tiles, starting at \"12 o'clock\" and numbering the tiles 2 to 7 in an
-  anti-clockwise direction.</p>\n<p>New rings are added in the same fashion, with
-  the next rings being numbered 8 to 19, 20 to 37, 38 to 61, and so on. The diagram
-  below shows the first three rings.</p>\n<div style=\"text-align:center;\">\n<img
-  src=\"project/images/p_128.gif\" width=\"400\" height=\"431\" alt=\"\">\n</div>\n<p>By
-  finding the difference between tile <i>n</i> and each its six neighbours we shall
-  define PD(<i>n</i>) to be the number of those differences which are prime.</p>\n<p>For
-  example, working clockwise around tile 8 the differences are 12, 29, 11, 6, 1, and
-  13. So PD(8) = 3.</p>\n<p>In the same way, the differences around tile 17 are 1,
-  17, 16, 1, 11, and 10, hence PD(17) = 2.</p>\n<p>It can be shown that the maximum
-  value of PD(<i>n</i>) is 3.</p>\n<p>If all of the tiles for which PD(<i>n</i>) =
-  3 are listed in ascending order to form a sequence, the 10th tile would be 271.</p>\n<p>Find
-  the 2000th tile in this sequence.</p>\n\r\n"
+:content: |+
+  A hexagonal tile with number 1 is surrounded by a ring of six hexagonal tiles, starting at "12 o'clock" and numbering the tiles 2 to 7 in an anti-clockwise direction.
+
+  New rings are added in the same fashion, with the next rings being numbered 8 to 19, 20 to 37, 38 to 61, and so on. The diagram below shows the first three rings.
+
+   ![](/home/will/src/euler-manager/config/../data/images/p_128.gif)
+
+  By finding the difference between tile _n_ and each its six neighbours we shall define PD(_n_) to be the number of those differences which are prime.
+
+  For example, working clockwise around tile 8 the differences are 12, 29, 11, 6, 1, and 13. So PD(8) = 3.
+
+  In the same way, the differences around tile 17 are 1, 17, 16, 1, 11, and 10, hence PD(17) = 2.
+
+  It can be shown that the maximum value of PD(_n_) is 3.
+
+  If all of the tiles for which PD(_n_) = 3 are listed in ascending order to form a sequence, the 10th tile would be 271.
+
+  Find the 2000th tile in this sequence.
+

data/data/problems/129.yml

@@ -2,11 +2,12 @@
 :id: 129
 :name: Repunit divisibility
 :url: http://projecteuler.net/problem=129
-:content: "\r\n\n<p>A number consisting entirely of ones is called a repunit. We shall
-  define R(<i>k</i>) to be a repunit of length <i>k</i>; for example, R(6) = 111111.</p>\n<p>Given
-  that <i>n</i> is a positive integer and GCD(<i>n</i>, 10) = 1, it can be shown that
-  there always exists a value, <i>k</i>, for which R(<i>k</i>) is divisible by <i>n</i>,
-  and let A(<i>n</i>) be the least such value of <i>k</i>; for example, A(7) = 6 and
-  A(41) = 5.</p>\n<p>The least value of <i>n</i> for which A(<i>n</i>) first exceeds
-  ten is 17.</p>\n<p>Find the least value of <i>n</i> for which A(<i>n</i>) first
-  exceeds one-million.</p>\n\r\n"
+:content: |+
+  A number consisting entirely of ones is called a repunit. We shall define R(_k_) to be a repunit of length _k_; for example, R(6) = 111111.
+
+  Given that _n_ is a positive integer and GCD(_n_, 10) = 1, it can be shown that there always exists a value, _k_, for which R(_k_) is divisible by _n_, and let A(_n_) be the least such value of _k_; for example, A(7) = 6 and A(41) = 5.
+
+  The least value of _n_ for which A(_n_) first exceeds ten is 17.
+
+  Find the least value of _n_ for which A(_n_) first exceeds one-million.
+

data/data/problems/13.yml

@@ -2,5 +2,55 @@
 :id: 13
 :name: Large sum
 :url: http://projecteuler.net/problem=13
-:content: "\r\n\n<p>Work out the first ten digits of the sum of the following one-hundred
-  50-digit numbers.</p>\n<div style=\"font-family:courier new;font-size:10pt;text-align:center;\">\n37107287533902102798797998220837590246510135740250<br>\n46376937677490009712648124896970078050417018260538<br>\n74324986199524741059474233309513058123726617309629<br>\n91942213363574161572522430563301811072406154908250<br>\n23067588207539346171171980310421047513778063246676<br>\n89261670696623633820136378418383684178734361726757<br>\n28112879812849979408065481931592621691275889832738<br>\n44274228917432520321923589422876796487670272189318<br>\n47451445736001306439091167216856844588711603153276<br>\n70386486105843025439939619828917593665686757934951<br>\n62176457141856560629502157223196586755079324193331<br>\n64906352462741904929101432445813822663347944758178<br>\n92575867718337217661963751590579239728245598838407<br>\n58203565325359399008402633568948830189458628227828<br>\n80181199384826282014278194139940567587151170094390<br>\n35398664372827112653829987240784473053190104293586<br>\n86515506006295864861532075273371959191420517255829<br>\n71693888707715466499115593487603532921714970056938<br>\n54370070576826684624621495650076471787294438377604<br>\n53282654108756828443191190634694037855217779295145<br>\n36123272525000296071075082563815656710885258350721<br>\n45876576172410976447339110607218265236877223636045<br>\n17423706905851860660448207621209813287860733969412<br>\n81142660418086830619328460811191061556940512689692<br>\n51934325451728388641918047049293215058642563049483<br>\n62467221648435076201727918039944693004732956340691<br>\n15732444386908125794514089057706229429197107928209<br>\n55037687525678773091862540744969844508330393682126<br>\n18336384825330154686196124348767681297534375946515<br>\n80386287592878490201521685554828717201219257766954<br>\n78182833757993103614740356856449095527097864797581<br>\n16726320100436897842553539920931837441497806860984<br>\n48403098129077791799088218795327364475675590848030<br>\n87086987551392711854517078544161852424320693150332<br>\n59959406895756536782107074926966537676326235447210<br>\n69793950679652694742597709739166693763042633987085<br>\n41052684708299085211399427365734116182760315001271<br>\n65378607361501080857009149939512557028198746004375<br>\n35829035317434717326932123578154982629742552737307<br>\n94953759765105305946966067683156574377167401875275<br>\n88902802571733229619176668713819931811048770190271<br>\n25267680276078003013678680992525463401061632866526<br>\n36270218540497705585629946580636237993140746255962<br>\n24074486908231174977792365466257246923322810917141<br>\n91430288197103288597806669760892938638285025333403<br>\n34413065578016127815921815005561868836468420090470<br>\n23053081172816430487623791969842487255036638784583<br>\n11487696932154902810424020138335124462181441773470<br>\n63783299490636259666498587618221225225512486764533<br>\n67720186971698544312419572409913959008952310058822<br>\n95548255300263520781532296796249481641953868218774<br>\n76085327132285723110424803456124867697064507995236<br>\n37774242535411291684276865538926205024910326572967<br>\n23701913275725675285653248258265463092207058596522<br>\n29798860272258331913126375147341994889534765745501<br>\n18495701454879288984856827726077713721403798879715<br>\n38298203783031473527721580348144513491373226651381<br>\n34829543829199918180278916522431027392251122869539<br>\n40957953066405232632538044100059654939159879593635<br>\n29746152185502371307642255121183693803580388584903<br>\n41698116222072977186158236678424689157993532961922<br>\n62467957194401269043877107275048102390895523597457<br>\n23189706772547915061505504953922979530901129967519<br>\n86188088225875314529584099251203829009407770775672<br>\n11306739708304724483816533873502340845647058077308<br>\n82959174767140363198008187129011875491310547126581<br>\n97623331044818386269515456334926366572897563400500<br>\n42846280183517070527831839425882145521227251250327<br>\n55121603546981200581762165212827652751691296897789<br>\n32238195734329339946437501907836945765883352399886<br>\n75506164965184775180738168837861091527357929701337<br>\n62177842752192623401942399639168044983993173312731<br>\n32924185707147349566916674687634660915035914677504<br>\n99518671430235219628894890102423325116913619626622<br>\n73267460800591547471830798392868535206946944540724<br>\n76841822524674417161514036427982273348055556214818<br>\n97142617910342598647204516893989422179826088076852<br>\n87783646182799346313767754307809363333018982642090<br>\n10848802521674670883215120185883543223812876952786<br>\n71329612474782464538636993009049310363619763878039<br>\n62184073572399794223406235393808339651327408011116<br>\n66627891981488087797941876876144230030984490851411<br>\n60661826293682836764744779239180335110989069790714<br>\n85786944089552990653640447425576083659976645795096<br>\n66024396409905389607120198219976047599490197230297<br>\n64913982680032973156037120041377903785566085089252<br>\n16730939319872750275468906903707539413042652315011<br>\n94809377245048795150954100921645863754710598436791<br>\n78639167021187492431995700641917969777599028300699<br>\n15368713711936614952811305876380278410754449733078<br>\n40789923115535562561142322423255033685442488917353<br>\n44889911501440648020369068063960672322193204149535<br>\n41503128880339536053299340368006977710650566631954<br>\n81234880673210146739058568557934581403627822703280<br>\n82616570773948327592232845941706525094512325230608<br>\n22918802058777319719839450180888072429661980811197<br>\n77158542502016545090413245809786882778948721859617<br>\n72107838435069186155435662884062257473692284509516<br>\n20849603980134001723930671666823555245252804609722<br>\n53503534226472524250874054075591789781264330331690<br>\n</div>\n\r\n"
+:content: "Work out the first ten digits of the sum of the following one-hundred 50-digit
+  numbers.\n\n37107287533902102798797998220837590246510135740250  \n46376937677490009712648124896970078050417018260538
+  \ \n74324986199524741059474233309513058123726617309629  \n91942213363574161572522430563301811072406154908250
+  \ \n23067588207539346171171980310421047513778063246676  \n89261670696623633820136378418383684178734361726757
+  \ \n28112879812849979408065481931592621691275889832738  \n44274228917432520321923589422876796487670272189318
+  \ \n47451445736001306439091167216856844588711603153276  \n70386486105843025439939619828917593665686757934951
+  \ \n62176457141856560629502157223196586755079324193331  \n64906352462741904929101432445813822663347944758178
+  \ \n92575867718337217661963751590579239728245598838407  \n58203565325359399008402633568948830189458628227828
+  \ \n80181199384826282014278194139940567587151170094390  \n35398664372827112653829987240784473053190104293586
+  \ \n86515506006295864861532075273371959191420517255829  \n71693888707715466499115593487603532921714970056938
+  \ \n54370070576826684624621495650076471787294438377604  \n53282654108756828443191190634694037855217779295145
+  \ \n36123272525000296071075082563815656710885258350721  \n45876576172410976447339110607218265236877223636045
+  \ \n17423706905851860660448207621209813287860733969412  \n81142660418086830619328460811191061556940512689692
+  \ \n51934325451728388641918047049293215058642563049483  \n62467221648435076201727918039944693004732956340691
+  \ \n15732444386908125794514089057706229429197107928209  \n55037687525678773091862540744969844508330393682126
+  \ \n18336384825330154686196124348767681297534375946515  \n80386287592878490201521685554828717201219257766954
+  \ \n78182833757993103614740356856449095527097864797581  \n16726320100436897842553539920931837441497806860984
+  \ \n48403098129077791799088218795327364475675590848030  \n87086987551392711854517078544161852424320693150332
+  \ \n59959406895756536782107074926966537676326235447210  \n69793950679652694742597709739166693763042633987085
+  \ \n41052684708299085211399427365734116182760315001271  \n65378607361501080857009149939512557028198746004375
+  \ \n35829035317434717326932123578154982629742552737307  \n94953759765105305946966067683156574377167401875275
+  \ \n88902802571733229619176668713819931811048770190271  \n25267680276078003013678680992525463401061632866526
+  \ \n36270218540497705585629946580636237993140746255962  \n24074486908231174977792365466257246923322810917141
+  \ \n91430288197103288597806669760892938638285025333403  \n34413065578016127815921815005561868836468420090470
+  \ \n23053081172816430487623791969842487255036638784583  \n11487696932154902810424020138335124462181441773470
+  \ \n63783299490636259666498587618221225225512486764533  \n67720186971698544312419572409913959008952310058822
+  \ \n95548255300263520781532296796249481641953868218774  \n76085327132285723110424803456124867697064507995236
+  \ \n37774242535411291684276865538926205024910326572967  \n23701913275725675285653248258265463092207058596522
+  \ \n29798860272258331913126375147341994889534765745501  \n18495701454879288984856827726077713721403798879715
+  \ \n38298203783031473527721580348144513491373226651381  \n34829543829199918180278916522431027392251122869539
+  \ \n40957953066405232632538044100059654939159879593635  \n29746152185502371307642255121183693803580388584903
+  \ \n41698116222072977186158236678424689157993532961922  \n62467957194401269043877107275048102390895523597457
+  \ \n23189706772547915061505504953922979530901129967519  \n86188088225875314529584099251203829009407770775672
+  \ \n11306739708304724483816533873502340845647058077308  \n82959174767140363198008187129011875491310547126581
+  \ \n97623331044818386269515456334926366572897563400500  \n42846280183517070527831839425882145521227251250327
+  \ \n55121603546981200581762165212827652751691296897789  \n32238195734329339946437501907836945765883352399886
+  \ \n75506164965184775180738168837861091527357929701337  \n62177842752192623401942399639168044983993173312731
+  \ \n32924185707147349566916674687634660915035914677504  \n99518671430235219628894890102423325116913619626622
+  \ \n73267460800591547471830798392868535206946944540724  \n76841822524674417161514036427982273348055556214818
+  \ \n97142617910342598647204516893989422179826088076852  \n87783646182799346313767754307809363333018982642090
+  \ \n10848802521674670883215120185883543223812876952786  \n71329612474782464538636993009049310363619763878039
+  \ \n62184073572399794223406235393808339651327408011116  \n66627891981488087797941876876144230030984490851411
+  \ \n60661826293682836764744779239180335110989069790714  \n85786944089552990653640447425576083659976645795096
+  \ \n66024396409905389607120198219976047599490197230297  \n64913982680032973156037120041377903785566085089252
+  \ \n16730939319872750275468906903707539413042652315011  \n94809377245048795150954100921645863754710598436791
+  \ \n78639167021187492431995700641917969777599028300699  \n15368713711936614952811305876380278410754449733078
+  \ \n40789923115535562561142322423255033685442488917353  \n44889911501440648020369068063960672322193204149535
+  \ \n41503128880339536053299340368006977710650566631954  \n81234880673210146739058568557934581403627822703280
+  \ \n82616570773948327592232845941706525094512325230608  \n22918802058777319719839450180888072429661980811197
+  \ \n77158542502016545090413245809786882778948721859617  \n72107838435069186155435662884062257473692284509516
+  \ \n20849603980134001723930671666823555245252804609722  \n53503534226472524250874054075591789781264330331690
+  \ \n\n"

data/data/problems/130.yml

@@ -2,18 +2,15 @@
 :id: 130
 :name: Composites with prime repunit property
 :url: http://projecteuler.net/problem=130
-:content: "\r\n\n<p>A number consisting entirely of ones is called a repunit. We shall
-  define R(<i>k</i>) to be a repunit of length <i>k</i>; for example, R(6) = 111111.</p>\n<p>Given
-  that <i>n</i> is a positive integer and GCD(<i>n</i>, 10) = 1, it can be shown that
-  there always exists a value, <i>k</i>, for which R(<i>k</i>) is divisible by <i>n</i>,
-  and let A(<i>n</i>) be the least such value of <i>k</i>; for example, A(7) = 6 and
-  A(41) = 5.</p>\n<p>You are given that for all primes, <i>p</i> <img src=\"images/symbol_gt.gif\"
-  width=\"10\" height=\"10\" alt=\"&gt;\" border=\"0\" style=\"vertical-align:middle;\">
-  5, that <i>p</i> <img src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\"
-  border=\"0\" style=\"vertical-align:middle;\"> 1 is divisible by A(<i>p</i>). For
-  example, when <i>p</i> = 41, A(41) = 5, and 40 is divisible by 5.</p>\n<p>However,
-  there are rare composite values for which this is also true; the first five examples
-  being 91, 259, 451, 481, and 703.</p>\n<p>Find the sum of the first twenty-five
-  composite values of <i>n</i> for which<br>GCD(<i>n</i>, 10) = 1 and <i>n</i> <img
-  src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\" border=\"0\"
-  style=\"vertical-align:middle;\"> 1 is divisible by A(<i>n</i>).</p>\n\r\n"
+:content: "A number consisting entirely of ones is called a repunit. We shall define
+  R(_k_) to be a repunit of length _k_; for example, R(6) = 111111.\n\nGiven that
+  _n_ is a positive integer and GCD(_n_, 10) = 1, it can be shown that there always
+  exists a value, _k_, for which R(_k_) is divisible by _n_, and let A(_n_) be the
+  least such value of _k_; for example, A(7) = 6 and A(41) = 5.\n\nYou are given that
+  for all primes, _p_ ![>](/home/will/src/euler-manager/config/../data/images/symbol_gt.gif)
+  5, that _p_ ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)
+  1 is divisible by A(_p_). For example, when _p_ = 41, A(41) = 5, and 40 is divisible
+  by 5.\n\nHowever, there are rare composite values for which this is also true; the
+  first five examples being 91, 259, 451, 481, and 703.\n\nFind the sum of the first
+  twenty-five composite values of _n_ for which  \nGCD(_n_, 10) = 1 and _n_ ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)
+  1 is divisible by A(_n_).\n\n"

data/data/problems/131.yml

@@ -2,11 +2,12 @@
 :id: 131
 :name: Prime cube partnership
 :url: http://projecteuler.net/problem=131
-:content: "\r\n<p>There are some prime values, <i>p</i>, for which there exists a
-  positive integer, <i>n</i>, such that the expression <i>n</i><sup>3</sup> + <i>n</i><sup>2</sup><i>p</i>
-  is a perfect cube.</p>\r\n<p>For example, when <i>p</i> = 19, 8<sup>3</sup> + 8<sup>2</sup><img
-  src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\">19 = 12<sup>3</sup>.</p>\r\n<p>What is perhaps
-  most surprising is that for each prime with this property the value of <i>n</i>
-  is unique, and there are only four such primes below one-hundred.</p>\r\n<p>How
-  many primes below one million have this remarkable property?</p>\r\n\r\n"
+:content: |+
+  There are some prime values, _p_, for which there exists a positive integer, _n_, such that the expression _n_<sup>3</sup> + _n_<sup>2</sup>_p_ is a perfect cube.
+
+  For example, when _p_ = 19, 8<sup>3</sup> + 8<sup>2</sup> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)19 = 12<sup>3</sup>.
+
+  What is perhaps most surprising is that for each prime with this property the value of _n_ is unique, and there are only four such primes below one-hundred.
+
+  How many primes below one million have this remarkable property?
+

data/data/problems/132.yml

@@ -2,11 +2,10 @@
 :id: 132
 :name: Large repunit factors
 :url: http://projecteuler.net/problem=132
-:content: "\r\n<p>A number consisting entirely of ones is called a repunit. We shall
-  define R(<i>k</i>) to be a repunit of length <i>k</i>.</p>\r\n<p>For example, R(10)
-  = 1111111111 = 11<img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\"
-  border=\"0\" style=\"vertical-align:middle;\">41<img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">271<img
-  src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\">9091, and the sum of these prime factors is 9414.</p>\r\n<p>Find
-  the sum of the first forty prime factors of R(10<sup>9</sup>).</p>\r\n\r\n"
+:content: |+
+  A number consisting entirely of ones is called a repunit. We shall define R(_k_) to be a repunit of length _k_.
+
+  For example, R(10) = 1111111111 = 11 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)41 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)271 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)9091, and the sum of these prime factors is 9414.
+
+  Find the sum of the first forty prime factors of R(10<sup>9</sup>).
+

data/data/problems/133.yml

@@ -2,12 +2,12 @@
 :id: 133
 :name: Repunit nonfactors
 :url: http://projecteuler.net/problem=133
-:content: "\r\n<p>A number consisting entirely of ones is called a repunit. We shall
-  define R(<var>k</var>) to be a repunit of length <var>k</var>; for example, R(6)
-  = 111111.</p>\r\n<p>Let us consider repunits of the form R(10<sup><var>n</var></sup>).</p>\r\n<p>Although
-  R(10), R(100), or R(1000) are not divisible by 17, R(10000) is divisible by 17.
-  Yet there is no value of <var>n</var> for which R(10<sup><var>n</var></sup>) will
-  divide by 19. In fact, it is remarkable that 11, 17, 41, and 73 are the only four
-  primes below one-hundred that can <!-- ever--> be a factor of R(10<sup><var>n</var></sup>).</p>\r\n<p>Find
-  the sum of all the primes below one-hundred thousand that will never be a factor
-  of R(10<sup><var>n</var></sup>).</p>\r\n\r\n"
+:content: |+
+  A number consisting entirely of ones is called a repunit. We shall define R(<var>k</var>) to be a repunit of length <var>k</var>; for example, R(6) = 111111.
+
+  Let us consider repunits of the form R(10<sup><var>n</var></sup>).
+
+  Although R(10), R(100), or R(1000) are not divisible by 17, R(10000) is divisible by 17. Yet there is no value of <var>n</var> for which R(10<sup><var>n</var></sup>) will divide by 19. In fact, it is remarkable that 11, 17, 41, and 73 are the only four primes below one-hundred that can <!-- ever--> be a factor of R(10<sup><var>n</var></sup>).
+
+  Find the sum of all the primes below one-hundred thousand that will never be a factor of R(10<sup><var>n</var></sup>).
+

data/data/problems/134.yml

@@ -2,18 +2,10 @@
 :id: 134
 :name: Prime pair connection
 :url: http://projecteuler.net/problem=134
-:content: "\r\n\n<p>Consider the consecutive primes <i>p</i><sub>1</sub> = 19 and
-  <i>p</i><sub>2</sub> = 23. It can be verified that 1219 is the smallest number such
-  that the last digits are formed by <i>p</i><sub>1</sub> whilst also being divisible
-  by <i>p</i><sub>2</sub>.</p>\n<p>In fact, with the exception of <i>p</i><sub>1</sub>
-  = 3 and <i>p</i><sub>2</sub> = 5, for every pair of consecutive primes, <i>p</i><sub>2</sub><img
-  src=\"images/symbol_gt.gif\" width=\"10\" height=\"10\" alt=\"&gt;\" border=\"0\"
-  style=\"vertical-align:middle;\"><i>p</i><sub>1</sub>, there exist values of <i>n</i>
-  for which the last digits are formed by <i>p</i><sub>1</sub> and <i>n</i> is divisible
-  by <i>p</i><sub>2</sub>. Let <i>S</i> be the smallest of these values of <i>n</i>.</p>\n<p>Find
-  <img src=\"images/symbol_sum.gif\" width=\"11\" height=\"14\" alt=\"∑\" border=\"0\"
-  style=\"vertical-align:middle;\"><i>S</i> for every pair of consecutive primes with
-  5 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"><i>p</i><sub>1</sub><img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  1000000.</p>\n\r\n"
+:content: |+
+  Consider the consecutive primes _p_<sub>1</sub> = 19 and _p_<sub>2</sub> = 23. It can be verified that 1219 is the smallest number such that the last digits are formed by _p_<sub>1</sub> whilst also being divisible by _p_<sub>2</sub>.
+
+  In fact, with the exception of _p_<sub>1</sub> = 3 and _p_<sub>2</sub> = 5, for every pair of consecutive primes, _p_<sub>2</sub> ![>](/home/will/src/euler-manager/config/../data/images/symbol_gt.gif) _p_<sub>1</sub>, there exist values of _n_ for which the last digits are formed by _p_<sub>1</sub> and _n_ is divisible by _p_<sub>2</sub>. Let _S_ be the smallest of these values of _n_.
+
+  Find ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif) _S_ for every pair of consecutive primes with 5 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) _p_<sub>1</sub> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 1000000.
+

data/data/problems/135.yml

@@ -2,19 +2,12 @@
 :id: 135
 :name: Same differences
 :url: http://projecteuler.net/problem=135
-:content: "\r\n<p>Given the positive integers, <i>x</i>, <i>y</i>, and <i>z</i>, are
-  consecutive terms of an arithmetic progression, the least value of the positive
-  integer, <i>n</i>, for which the equation, <i>x</i><sup>2</sup><img src=\"images/symbol_minus.gif\"
-  width=\"9\" height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\"><i>y</i><sup>2</sup><img
-  src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\" border=\"0\"
-  style=\"vertical-align:middle;\"><i>z</i><sup>2</sup> = <i>n</i>, has exactly two
-  solutions is <i>n</i> = 27:</p>\r\n<p style=\"text-align:center;\">34<sup>2</sup><img
-  src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\" border=\"0\"
-  style=\"vertical-align:middle;\"> 27<sup>2</sup><img src=\"images/symbol_minus.gif\"
-  width=\"9\" height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">
-  20<sup>2</sup> = 12<sup>2</sup><img src=\"images/symbol_minus.gif\" width=\"9\"
-  height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\"> 9<sup>2</sup><img
-  src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\" border=\"0\"
-  style=\"vertical-align:middle;\"> 6<sup>2</sup> = 27</p>\r\n<p>It turns out that
-  <i>n</i> = 1155 is the least value which has exactly ten solutions.</p>\r\n<p>How
-  many values of <i>n</i> less than one million have exactly ten distinct solutions?</p>\r\n\r\n"
+:content: |+
+  Given the positive integers, _x_, _y_, and _z_, are consecutive terms of an arithmetic progression, the least value of the positive integer, _n_, for which the equation, _x_<sup>2</sup> ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif) _y_<sup>2</sup> ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif) _z_<sup>2</sup> = _n_, has exactly two solutions is _n_ = 27:
+
+  34<sup>2</sup> ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif) 27<sup>2</sup> ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif) 20<sup>2</sup> = 12<sup>2</sup> ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif) 9<sup>2</sup> ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif) 6<sup>2</sup> = 27
+
+  It turns out that _n_ = 1155 is the least value which has exactly ten solutions.
+
+  How many values of _n_ less than one million have exactly ten distinct solutions?
+

data/data/problems/136.yml

@@ -2,16 +2,12 @@
 :id: 136
 :name: Singleton difference
 :url: http://projecteuler.net/problem=136
-:content: "\r\n<p>The positive integers, <i>x</i>, <i>y</i>, and <i>z</i>, are consecutive
-  terms of an arithmetic progression. Given that <i>n</i> is a positive integer, the
-  equation, <i>x</i><sup>2</sup><img src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\"
-  alt=\"−\" border=\"0\" style=\"vertical-align:middle;\"><i>y</i><sup>2</sup><img
-  src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\" border=\"0\"
-  style=\"vertical-align:middle;\"><i>z</i><sup>2</sup> = <i>n</i>, has exactly one
-  solution when <i>n</i> = 20:</p>\r\n<p style=\"text-align:center;\">13<sup>2</sup><img
-  src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\" border=\"0\"
-  style=\"vertical-align:middle;\"> 10<sup>2</sup><img src=\"images/symbol_minus.gif\"
-  width=\"9\" height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">
-  7<sup>2</sup> = 20</p>\r\n<p>In fact there are twenty-five values of <i>n</i> below
-  one hundred for which the equation has a unique solution.</p>\r\n<p>How many values
-  of <i>n</i> less than fifty million have exactly one solution?</p>\r\n\r\n"
+:content: |+
+  The positive integers, _x_, _y_, and _z_, are consecutive terms of an arithmetic progression. Given that _n_ is a positive integer, the equation, _x_<sup>2</sup> ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif) _y_<sup>2</sup> ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif) _z_<sup>2</sup> = _n_, has exactly one solution when _n_ = 20:
+
+  13<sup>2</sup> ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif) 10<sup>2</sup> ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif) 7<sup>2</sup> = 20
+
+  In fact there are twenty-five values of _n_ below one hundred for which the equation has a unique solution.
+
+  How many values of _n_ less than fifty million have exactly one solution?
+

data/data/problems/137.yml

@@ -2,35 +2,25 @@
 :id: 137
 :name: Fibonacci golden nuggets
 :url: http://projecteuler.net/problem=137
-:content: "\r\n\n<p>Consider the infinite polynomial series A<sub>F</sub>(<i>x</i>)
-  = <i>x</i>F<sub>1</sub> + <i>x</i><sup>2</sup>F<sub>2</sub> + <i>x</i><sup>3</sup>F<sub>3</sub>
-  + ..., where F<sub><i>k</i></sub> is the <i>k</i>th term in the Fibonacci sequence:
-  1, 1, 2, 3, 5, 8, ... ; that is, F<sub><i>k</i></sub> = F<sub><i>k</i><img src=\"images/symbol_minus.gif\"
-  width=\"9\" height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">1</sub>
-  + F<sub><i>k</i><img src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\"
-  border=\"0\" style=\"vertical-align:middle;\">2</sub>, F<sub>1</sub> = 1 and F<sub>2</sub>
-  = 1.</p>\n<p>For this problem we shall be interested in values of <i>x</i> for which
-  A<sub>F</sub>(<i>x</i>) is a positive integer.</p>\n<table cellpadding=\"0\" cellspacing=\"0\"
-  border=\"0\">\n<tr>\n<td>Surprisingly A<sub>F</sub>(1/2)</td>\n<td> = </td>\n<td>(1/2).1
-  + (1/2)<sup>2</sup>.1 + (1/2)<sup>3</sup>.2 + (1/2)<sup>4</sup>.3 + (1/2)<sup>5</sup>.5
-  + ...</td>\n</tr>\n<tr>\n<td> </td>\n<td> = </td>\n<td>1/2 + 1/4 + 2/8 + 3/16 +
-  5/32 + ...</td>\n</tr>\n<tr>\n<td> </td>\n<td> = </td>\n<td>2</td>\n</tr>\n</table>\n<p>The
-  corresponding values of <i>x</i> for the first five natural numbers are shown below.</p>\n<div
-  style=\"text-align:center;\">\n<table cellspacing=\"0\" cellpadding=\"2\" border=\"1\"
-  align=\"center\">\n<tr style=\"background-color:#c1daf9;\">\n<td><b><i>x</i></b></td>\n<td
-  width=\"50\"><b>A<sub>F</sub>(<i>x</i>)</b></td>\n</tr>\n<tr>\n<td>\n<img src=\"images/symbol_radic.gif\"
-  width=\"14\" height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">2<img
-  src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\" border=\"0\"
-  style=\"vertical-align:middle;\">1</td>\n<td>1</td>\n</tr>\n<tr>\n<td>1/2</td>\n<td>2</td>\n</tr>\n<tr>\n<td>(<img
-  src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\" border=\"0\"
-  style=\"vertical-align:middle;\">13<img src=\"images/symbol_minus.gif\" width=\"9\"
-  height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">2)/3</td>\n<td>3</td>\n</tr>\n<tr>\n<td>(<img
-  src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\" border=\"0\"
-  style=\"vertical-align:middle;\">89<img src=\"images/symbol_minus.gif\" width=\"9\"
-  height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">5)/8</td>\n<td>4</td>\n</tr>\n<tr>\n<td>(<img
-  src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\" border=\"0\"
-  style=\"vertical-align:middle;\">34<img src=\"images/symbol_minus.gif\" width=\"9\"
-  height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">3)/5</td>\n<td>5</td>\n</tr>\n</table>\n</div>\n<p>We
-  shall call A<sub>F</sub>(<i>x</i>) a golden nugget if <i>x</i> is rational, because
-  they become increasingly rarer; for example, the 10th golden nugget is 74049690.</p>\n<p>Find
-  the 15th golden nugget.</p>\n\r\n"
+:content: |+
+  Consider the infinite polynomial series A<sub>F</sub>(_x_) = _x_F<sub>1</sub> + _x_<sup>2</sup>F<sub>2</sub> + _x_<sup>3</sup>F<sub>3</sub> + ..., where F<sub><i>k</i></sub> is the _k_th term in the Fibonacci sequence: 1, 1, 2, 3, 5, 8, ... ; that is, F<sub><i>k</i></sub> = F<sub><i>k</i><img src="%7B%7B%20images_dir%20%7D%7D/symbol_minus.gif" width="9" height="3" alt="−" border="0" style="vertical-align:middle;">1</sub> + F<sub><i>k</i><img src="%7B%7B%20images_dir%20%7D%7D/symbol_minus.gif" width="9" height="3" alt="−" border="0" style="vertical-align:middle;">2</sub>, F<sub>1</sub> = 1 and F<sub>2</sub> = 1.
+
+  For this problem we shall be interested in values of _x_ for which A<sub>F</sub>(_x_) is a positive integer.
+
+  | Surprisingly A<sub>F</sub>(1/2) |  =  | (1/2).1 + (1/2)<sup>2</sup>.1 + (1/2)<sup>3</sup>.2 + (1/2)<sup>4</sup>.3 + (1/2)<sup>5</sup>.5 + ... |
+  |   |  =  | 1/2 + 1/4 + 2/8 + 3/16 + 5/32 + ... |
+  |   |  =  | 2 |
+
+  The corresponding values of _x_ for the first five natural numbers are shown below.
+
+  | **_x_** | **A<sub>F</sub>(_x_)** |
+  | ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)2 ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)1 | 1 |
+  | 1/2 | 2 |
+  | ( ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)13 ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)2)/3 | 3 |
+  | ( ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)89 ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)5)/8 | 4 |
+  | ( ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)34 ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)3)/5 | 5 |
+
+  We shall call A<sub>F</sub>(_x_) a golden nugget if _x_ is rational, because they become increasingly rarer; for example, the 10th golden nugget is 74049690.
+
+  Find the 15th golden nugget.
+

data/data/problems/138.yml

@@ -2,19 +2,14 @@
 :id: 138
 :name: Special isosceles triangles
 :url: http://projecteuler.net/problem=138
-:content: "\r\n<p>Consider the isosceles triangle with base length, <i>b</i> = 16,
-  and legs, L = 17.</p>\r\n<div style=\"text-align:center;\">\r\n<img src=\"project/images/p_138.gif\"
-  width=\"230\" height=\"228\" alt=\"\">\n</div>\r\n<p>By using the Pythagorean theorem
-  it can be seen that the height of the triangle, <i>h</i> = <img src=\"images/symbol_radic.gif\"
-  width=\"14\" height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">(17<sup>2</sup><img
-  src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\" border=\"0\"
-  style=\"vertical-align:middle;\"> 8<sup>2</sup>) = 15, which is one less than the
-  base length.</p>\r\n<p>With <i>b</i> = 272 and L = 305, we get <i>h</i> = 273, which
-  is one more than the base length, and this is the second smallest isosceles triangle
-  with the property that <i>h</i> = <i>b</i> <img src=\"images/symbol_plusmn.gif\"
-  width=\"11\" height=\"11\" alt=\"±\" border=\"0\" style=\"vertical-align:middle;\">
-  1.</p>\r\n<p>Find <img src=\"images/symbol_sum.gif\" width=\"11\" height=\"14\"
-  alt=\"∑\" border=\"0\" style=\"vertical-align:middle;\"> L for the twelve smallest
-  isosceles triangles for which <i>h</i> = <i>b</i> <img src=\"images/symbol_plusmn.gif\"
-  width=\"11\" height=\"11\" alt=\"±\" border=\"0\" style=\"vertical-align:middle;\">
-  1 and <i>b</i>, L are positive integers.</p>\r\n\r\n"
+:content: |+
+  Consider the isosceles triangle with base length, _b_ = 16, and legs, L = 17.
+
+   ![](/home/will/src/euler-manager/config/../data/images/p_138.gif)
+
+  By using the Pythagorean theorem it can be seen that the height of the triangle, _h_ = ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)(17<sup>2</sup> ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif) 8<sup>2</sup>) = 15, which is one less than the base length.
+
+  With _b_ = 272 and L = 305, we get _h_ = 273, which is one more than the base length, and this is the second smallest isosceles triangle with the property that _h_ = _b_ ![±](/home/will/src/euler-manager/config/../data/images/symbol_plusmn.gif) 1.
+
+  Find ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif) L for the twelve smallest isosceles triangles for which _h_ = _b_ ![±](/home/will/src/euler-manager/config/../data/images/symbol_plusmn.gif) 1 and _b_, L are positive integers.
+

data/data/problems/139.yml

@@ -2,14 +2,14 @@
 :id: 139
 :name: Pythagorean tiles
 :url: http://projecteuler.net/problem=139
-:content: "\r\n<p>Let (<i>a</i>, <i>b</i>, <i>c</i>) represent the three sides of
-  a right angle triangle with integral length sides. It is possible to place four
-  such triangles together to form a square with length <i>c</i>.</p>\r\n<p>For example,
-  (3, 4, 5) triangles can be placed together to form a 5 by 5 square with a 1 by 1
-  hole in the middle and it can be seen that the 5 by 5 square can be tiled with twenty-five
-  1 by 1 squares.</p>\r\n<div style=\"text-align:center;\">\r\n<img src=\"project/images/p_139.gif\"
-  width=\"400\" height=\"180\" alt=\"\">\n</div>\r\n<p>However, if (5, 12, 13) triangles
-  were used then the hole would measure 7 by 7 and these could not be used to tile
-  the 13 by 13 square.</p>\r\n<p>Given that the perimeter of the right triangle is
-  less than one-hundred million, how many Pythagorean triangles would allow such a
-  tiling to take place?</p>\r\n\r\n"
+:content: |+
+  Let (_a_, _b_, _c_) represent the three sides of a right angle triangle with integral length sides. It is possible to place four such triangles together to form a square with length _c_.
+
+  For example, (3, 4, 5) triangles can be placed together to form a 5 by 5 square with a 1 by 1 hole in the middle and it can be seen that the 5 by 5 square can be tiled with twenty-five 1 by 1 squares.
+
+   ![](/home/will/src/euler-manager/config/../data/images/p_139.gif)
+
+  However, if (5, 12, 13) triangles were used then the hole would measure 7 by 7 and these could not be used to tile the 13 by 13 square.
+
+  Given that the perimeter of the right triangle is less than one-hundred million, how many Pythagorean triangles would allow such a tiling to take place?
+

data/data/problems/14.yml

@@ -2,27 +2,17 @@
 :id: 14
 :name: Longest Collatz sequence
 :url: http://projecteuler.net/problem=14
-:content: "\r\n<p>The following iterative sequence is defined for the set of positive
-  integers:</p>\r\n<p style=\"margin-left:50px;\"><var>n</var> <img src=\"images/symbol_maps.gif\"
-  width=\"15\" height=\"7\" alt=\"→\" border=\"0\" style=\"vertical-align:middle;\"><var>n</var>/2
-  (<var>n</var> is even)<br><var>n</var> <img src=\"images/symbol_maps.gif\" width=\"15\"
-  height=\"7\" alt=\"→\" border=\"0\" style=\"vertical-align:middle;\"> 3<var>n</var>
-  + 1 (<var>n</var> is odd)</p>\r\n<p>Using the rule above and starting with 13, we
-  generate the following sequence:</p>\r\n<div style=\"text-align:center;\">13 <img
-  src=\"images/symbol_maps.gif\" width=\"15\" height=\"7\" alt=\"→\" border=\"0\"
-  style=\"vertical-align:middle;\"> 40 <img src=\"images/symbol_maps.gif\" width=\"15\"
-  height=\"7\" alt=\"→\" border=\"0\" style=\"vertical-align:middle;\"> 20 <img src=\"images/symbol_maps.gif\"
-  width=\"15\" height=\"7\" alt=\"→\" border=\"0\" style=\"vertical-align:middle;\">
-  10 <img src=\"images/symbol_maps.gif\" width=\"15\" height=\"7\" alt=\"→\" border=\"0\"
-  style=\"vertical-align:middle;\"> 5 <img src=\"images/symbol_maps.gif\" width=\"15\"
-  height=\"7\" alt=\"→\" border=\"0\" style=\"vertical-align:middle;\"> 16 <img src=\"images/symbol_maps.gif\"
-  width=\"15\" height=\"7\" alt=\"→\" border=\"0\" style=\"vertical-align:middle;\">
-  8 <img src=\"images/symbol_maps.gif\" width=\"15\" height=\"7\" alt=\"→\" border=\"0\"
-  style=\"vertical-align:middle;\"> 4 <img src=\"images/symbol_maps.gif\" width=\"15\"
-  height=\"7\" alt=\"→\" border=\"0\" style=\"vertical-align:middle;\"> 2 <img src=\"images/symbol_maps.gif\"
-  width=\"15\" height=\"7\" alt=\"→\" border=\"0\" style=\"vertical-align:middle;\">
-  1</div>\r\n<p>It can be seen that this sequence (starting at 13 and finishing at
-  1) contains 10 terms. Although it has not been proved yet (Collatz Problem), it
-  is thought that all starting numbers finish at 1.</p>\r\n<p>Which starting number,
-  under one million, produces the longest chain?</p>\r\n<p class=\"note\"><b>NOTE:</b>
-  Once the chain starts the terms are allowed to go above one million.</p>\r\n\r\n"
+:content: "The following iterative sequence is defined for the set of positive integers:\n\n<var>n</var>
+  ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif) <var>n</var>/2
+  (<var>n</var> is even)  \n<var>n</var> ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif)
+  3<var>n</var> + 1 (<var>n</var> is odd)\n\nUsing the rule above and starting with
+  13, we generate the following sequence:\n\n13 ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif)
+  40 ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif) 20 ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif)
+  10 ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif) 5 ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif)
+  16 ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif) 8 ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif)
+  4 ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif) 2 ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif)
+  1\n\nIt can be seen that this sequence (starting at 13 and finishing at 1) contains
+  10 terms. Although it has not been proved yet (Collatz Problem), it is thought that
+  all starting numbers finish at 1.\n\nWhich starting number, under one million, produces
+  the longest chain?\n\n**NOTE:** Once the chain starts the terms are allowed to go
+  above one million.\n\n"

data/data/problems/140.yml

@@ -2,28 +2,21 @@
 :id: 140
 :name: Modified Fibonacci golden nuggets
 :url: http://projecteuler.net/problem=140
-:content: "\r\n<p>Consider the infinite polynomial series A<sub>G</sub>(<i>x</i>)
-  = <i>x</i>G<sub>1</sub> + <i>x</i><sup>2</sup>G<sub>2</sub> + <i>x</i><sup>3</sup>G<sub>3</sub>
-  + ..., where G<sub><i>k</i></sub> is the <i>k</i>th term of the second order recurrence
-  relation G<sub><i>k</i></sub> = G<sub><i>k</i><img src=\"images/symbol_minus.gif\"
-  width=\"9\" height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">1</sub>
-  + G<sub><i>k</i><img src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\"
-  border=\"0\" style=\"vertical-align:middle;\">2</sub>, G<sub>1</sub> = 1 and G<sub>2</sub>
-  = 4; that is, 1, 4, 5, 9, 14, 23, ... .</p>\r\n<p>For this problem we shall be concerned
-  with values of <i>x</i> for which A<sub>G</sub>(<i>x</i>) is a positive integer.</p>\r\n<p>The
-  corresponding values of <i>x</i> for the first five natural numbers are shown below.</p>\r\n<div
-  style=\"text-align:center;\">\r\n<table cellspacing=\"0\" cellpadding=\"2\" border=\"1\"
-  align=\"center\">\n<tr style=\"background-color:#c1daf9;\">\n<td><b><i>x</i></b></td>\n<td
-  width=\"50\"><b>A<sub>G</sub>(<i>x</i>)</b></td>\r\n</tr>\n<tr>\n<td>(<img src=\"images/symbol_radic.gif\"
-  width=\"14\" height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">5<img
-  src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\" border=\"0\"
-  style=\"vertical-align:middle;\">1)/4</td>\n<td>1</td>\r\n</tr>\n<tr>\n<td>2/5</td>\n<td>2</td>\r\n</tr>\n<tr>\n<td>(<img
-  src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\" border=\"0\"
-  style=\"vertical-align:middle;\">22<img src=\"images/symbol_minus.gif\" width=\"9\"
-  height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">2)/6</td>\n<td>3</td>\r\n</tr>\n<tr>\n<td>(<img
-  src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\" border=\"0\"
-  style=\"vertical-align:middle;\">137<img src=\"images/symbol_minus.gif\" width=\"9\"
-  height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">5)/14</td>\n<td>4</td>\r\n</tr>\n<tr>\n<td>1/2</td>\n<td>5</td>\r\n</tr>\n</table>\n</div>\r\n<p>We
-  shall call A<sub>G</sub>(<i>x</i>) a golden nugget if <i>x</i> is rational, because
-  they become increasingly rarer; for example, the 20th golden nugget is 211345365.</p>\r\n<p>Find
-  the sum of the first thirty golden nuggets.</p>\r\n\r\n"
+:content: |+
+  Consider the infinite polynomial series A<sub>G</sub>(_x_) = _x_G<sub>1</sub> + _x_<sup>2</sup>G<sub>2</sub> + _x_<sup>3</sup>G<sub>3</sub> + ..., where G<sub><i>k</i></sub> is the _k_th term of the second order recurrence relation G<sub><i>k</i></sub> = G<sub><i>k</i><img src="%7B%7B%20images_dir%20%7D%7D/symbol_minus.gif" width="9" height="3" alt="−" border="0" style="vertical-align:middle;">1</sub> + G<sub><i>k</i><img src="%7B%7B%20images_dir%20%7D%7D/symbol_minus.gif" width="9" height="3" alt="−" border="0" style="vertical-align:middle;">2</sub>, G<sub>1</sub> = 1 and G<sub>2</sub> = 4; that is, 1, 4, 5, 9, 14, 23, ... .
+
+  For this problem we shall be concerned with values of _x_ for which A<sub>G</sub>(_x_) is a positive integer.
+
+  The corresponding values of _x_ for the first five natural numbers are shown below.
+
+  | **_x_** | **A<sub>G</sub>(_x_)** |
+  | ( ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)5 ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)1)/4 | 1 |
+  | 2/5 | 2 |
+  | ( ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)22 ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)2)/6 | 3 |
+  | ( ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)137 ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)5)/14 | 4 |
+  | 1/2 | 5 |
+
+  We shall call A<sub>G</sub>(_x_) a golden nugget if _x_ is rational, because they become increasingly rarer; for example, the 20th golden nugget is 211345365.
+
+  Find the sum of the first thirty golden nuggets.
+