euler-manager 0.1.1 → 0.2.0

data/data/problems/144.yml

@@ -1,15 +1,15 @@
 ---
 :id: 144
 :name: Investigating multiple reflections of a laser beam
-:url: http://projecteuler.net/problem=144
+:url: https://projecteuler.net/problem=144
 :content: |+
   In laser physics, a "white cell" is a mirror system that acts as a delay line for the laser beam. The beam enters the cell, bounces around on the mirrors, and eventually works its way back out.
 
   The specific white cell we will be considering is an ellipse with the equation 4_x_<sup>2</sup> + _y_<sup>2</sup> = 100
 
-  The section corresponding to ![−]({{ images_dir }}/symbol_minus.gif)0.01 ![≤]({{ images_dir }}/symbol_le.gif) _x_ ![≤]({{ images_dir }}/symbol_le.gif) +0.01 at the top is missing, allowing the light to enter and exit through the hole.
+  The section corresponding to −0.01 ≤ _x_ ≤ +0.01 at the top is missing, allowing the light to enter and exit through the hole.
 
-   ![]({{ images_dir }}/p_144_1.gif) ![]({{ images_dir }}/p_144_2.gif)
+   ![]({{ images_dir }}/p144_1.gif) ![]({{ images_dir }}/p144_2.gif)
 
   The light beam in this problem starts at the point (0.0,10.1) just outside the white cell, and the beam first impacts the mirror at (1.4,-9.6).
 
@@ -17,7 +17,7 @@
 
   In the figure on the left, the red line shows the first two points of contact between the laser beam and the wall of the white cell; the blue line shows the line tangent to the ellipse at the point of incidence of the first bounce.
 
-  The slope _m_ of the tangent line at any point (_x_,_y_) of the given ellipse is: _m_ = ![−]({{ images_dir }}/symbol_minus.gif)4_x_/_y_
+  The slope _m_ of the tangent line at any point (_x_,_y_) of the given ellipse is: _m_ = −4_x_/_y_
 
   The normal line is perpendicular to this tangent line at the point of incidence.
 

data/data/problems/145.yml

@@ -1,7 +1,7 @@
 ---
 :id: 145
 :name: How many reversible numbers are there below one-billion?
-:url: http://projecteuler.net/problem=145
+:url: https://projecteuler.net/problem=145
 :content: |+
   Some positive integers _n_ have the property that the sum [_n_ + reverse(_n_)] consists entirely of odd (decimal) digits. For instance, 36 + 63 = 99 and 409 + 904 = 1313. We will call such numbers _reversible_; so 36, 63, 409, and 904 are reversible. Leading zeroes are not allowed in either _n_ or reverse(_n_).
 

data/data/problems/146.yml

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

data/data/problems/147.yml

@@ -1,13 +1,13 @@
 ---
 :id: 147
 :name: Rectangles in cross-hatched grids
-:url: http://projecteuler.net/problem=147
+:url: https://projecteuler.net/problem=147
 :content: "In a 3x2 cross-hatched grid, a total of 37 different rectangles could be
-  situated within that grid as indicated in the sketch.\n\n ![]({{ images_dir }}/p_147.gif)\n\nThere
+  situated within that grid as indicated in the sketch.\n\n ![]({{ images_dir }}/p147.gif)\n\nThere
   are 5 grids smaller than 3x2, vertical and horizontal dimensions being important,
   i.e. 1x1, 2x1, 3x1, 1x2 and 2x2. If each of them is cross-hatched, the following
   number of different rectangles could be situated within those smaller grids:\n\n1x1:
-  1\r  \n2x1: 4\r  \n3x1: 8\r  \n1x2: 4\r  \n2x2: 18\n\nAdding those to the 37 of
-  the 3x2 grid, a total of 72 different rectangles could be situated within 3x2 and
-  smaller grids.\n\nHow many different rectangles could be situated within 47x43 and
-  smaller grids?\n\n"
+  1  \n2x1: 4  \n3x1: 8  \n1x2: 4  \n2x2: 18\n\nAdding those to the 37 of the 3x2
+  grid, a total of 72 different rectangles could be situated within 3x2 and smaller
+  grids.\n\nHow many different rectangles could be situated within 47x43 and smaller
+  grids?\n\n"

data/data/problems/148.yml

@@ -1,17 +1,17 @@
 ---
 :id: 148
 :name: Exploring Pascal's triangle
-:url: http://projecteuler.net/problem=148
+:url: https://projecteuler.net/problem=148
 :content: |+
   We can easily verify that none of the entries in the first seven rows of Pascal's triangle are divisible by 7:
 
-  |   |   |   |   |   |   |  1 |
-  |   |   |   |   |   |  1 |   |  1 |
-  |   |   |   |   |  1 |   |  2 |   |  1 |
-  |   |   |   |  1 |   |  3 |   |  3 |   |  1 |
-  |   |   |  1 |   |  4 |   |  6 |   |  4 |   |  1 |
-  |   |  1 |   |  5 |   | 10 |   | 10 |   |  5 |   |  1 |
-  | 1 |   |  6 |   | 15 |   | 20 |   | 15 |   |  6 |   |  1 |
+  |   |   |   |   |   |   |  1 |
+  |   |   |   |   |   |  1 |   |  1 |
+  |   |   |   |   |  1 |   |  2 |   |  1 |
+  |   |   |   |  1 |   |  3 |   |  3 |   |  1 |
+  |   |   |  1 |   |  4 |   |  6 |   |  4 |   |  1 |
+  |   |  1 |   |  5 |   | 10 |   | 10 |   |  5 |   |  1 |
+  | 1 |   |  6 |   | 15 |   | 20 |   | 15 |   |  6 |   |  1 |
 
   However, if we check the first one hundred rows, we will find that only 2361 of the 5050 entries are _not_ divisible by 7.
 

data/data/problems/149.yml

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

data/data/problems/15.yml

@@ -1,11 +1,11 @@
 ---
 :id: 15
 :name: Lattice paths
-:url: http://projecteuler.net/problem=15
+:url: https://projecteuler.net/problem=15
 :content: |+
-  Starting in the top left corner of a 2 ![×]({{ images_dir }}/symbol_times.gif)2 grid, and only being able to move to the right and down, there are exactly 6 routes to the bottom right corner.
+  Starting in the top left corner of a 2×2 grid, and only being able to move to the right and down, there are exactly 6 routes to the bottom right corner.
 
-   ![]({{ images_dir }}/p_015.gif)
+   ![]({{ images_dir }}/p015.gif)
 
-  How many such routes are there through a 20 ![×]({{ images_dir }}/symbol_times.gif)20 grid?
+  How many such routes are there through a 20×20 grid?
 

data/data/problems/150.yml

@@ -1,23 +1,22 @@
 ---
 :id: 150
 :name: Searching a triangular array for a sub-triangle having minimum-sum
-:url: http://projecteuler.net/problem=150
+:url: https://projecteuler.net/problem=150
 :content: "In a triangular array of positive and negative integers, we wish to find
   a sub-triangle such that the sum of the numbers it contains is the smallest possible.\n\nIn
   the example below, it can be easily verified that the marked triangle satisfies
-  this condition having a sum of ![−]({{ images_dir }}/symbol_minus.gif)42.\n\n ![]({{
-  images_dir }}/p_150.gif)\n\nWe wish to make such a triangular array with one thousand
-  rows, so we generate 500500 pseudo-random numbers s<sub>k</sub> in the range ![±]({{
-  images_dir }}/symbol_plusmn.gif)2<sup>19</sup>, using a type of random number generator
-  (known as a Linear Congruential Generator) as follows:\n\nt := 0\r  \n\rfor k =
-  1 up to k = 500500:\r  \n\r    t := (615949\\*t + 797807) modulo 2<sup>20</sup>
-  \ \n\r    s<sub>k</sub> := t ![−]({{ images_dir }}/symbol_minus.gif)2<sup>19</sup>\n\nThus:
-  s<sub>1</sub> = 273519, s<sub>2</sub> = ![−]({{ images_dir }}/symbol_minus.gif)153582,
-  s<sub>3</sub> = 450905 etc\n\nOur triangular array is then formed using the pseudo-random
-  numbers thus:\n\n\rs<sub>1</sub>  \n\rs<sub>2</sub>  s<sub>3</sub>  \n\rs<sub>4</sub> 
-  s<sub>5</sub>  s<sub>6</sub>  \r  \n\rs<sub>7</sub>  s<sub>8</sub>  s<sub>9</sub> 
-  s<sub>10</sub>  \n\r...\r\n\nSub-triangles can start at any element of the array
-  and extend down as far as we like (taking-in the two elements directly below it
-  from the next row, the three elements directly below from the row after that, and
-  so on).\r  \n\rThe \"sum of a sub-triangle\" is defined as the sum of all the elements
-  it contains.\r  \n\rFind the smallest possible sub-triangle sum.\n\n"
+  this condition having a sum of −42.\n\n ![]({{ images_dir }}/p150.gif)\n\nWe wish
+  to make such a triangular array with one thousand rows, so we generate 500500 pseudo-random
+  numbers s<sub>k</sub> in the range ±2<sup>19</sup>, using a type of random number
+  generator (known as a Linear Congruential Generator) as follows:\n\nt := 0  \nfor
+  k = 1 up to k = 500500:  \n&nbsp; &nbsp; t := (615949\\*t + 797807) modulo 2<sup>20</sup>
+  \ \n&nbsp; &nbsp; s<sub>k</sub> := t−2<sup>19</sup>\n\nThus: s<sub>1</sub> = 273519,
+  s<sub>2</sub> = −153582, s<sub>3</sub> = 450905 etc\n\nOur triangular array is then
+  formed using the pseudo-random numbers thus:\n\ns<sub>1</sub>  \ns<sub>2</sub>&nbsp;
+  s<sub>3</sub>  \ns<sub>4</sub>&nbsp; s<sub>5</sub>&nbsp; s<sub>6</sub>&nbsp;   \ns<sub>7</sub>&nbsp;
+  s<sub>8</sub>&nbsp; s<sub>9</sub>&nbsp; s<sub>10</sub>  \n...\n\nSub-triangles can
+  start at any element of the array and extend down as far as we like (taking-in the
+  two elements directly below it from the next row, the three elements directly below
+  from the row after that, and so on).  \nThe \"sum of a sub-triangle\" is defined
+  as the sum of all the elements it contains.  \nFind the smallest possible sub-triangle
+  sum.\n\n"

data/data/problems/151.yml

@@ -1,7 +1,7 @@
 ---
 :id: 151
 :name: 'Paper sheets of standard sizes: an expected-value problem'
-:url: http://projecteuler.net/problem=151
+:url: https://projecteuler.net/problem=151
 :content: |+
   A printing shop runs 16 batches (jobs) every week and each batch requires a sheet of special colour-proofing paper of size A5.
 
@@ -11,11 +11,11 @@
 
   All the unused sheets are placed back in the envelope.
 
-   ![]({{ images_dir }}/p_151.gif)
+   ![]({{ images_dir }}/p151.gif)
 
   At the beginning of each subsequent batch, he takes from the envelope one sheet of paper at random. If it is of size A5, he uses it. If it is larger, he repeats the 'cut-in-half' procedure until he has what he needs and any remaining sheets are always placed back in the envelope.
 
   Excluding the first and last batch of the week, find the expected number of times (during each week) that the foreman finds a single sheet of paper in the envelope.
 
-  Give your answer rounded to six decimal places using the format x.xxxxxx .
+  Give your answer rounded to six decimal places using the format x.xxxxxx .
 

data/data/problems/152.yml

@@ -1,13 +1,13 @@
 ---
 :id: 152
 :name: Writing 1/2 as a sum of inverse squares
-:url: http://projecteuler.net/problem=152
+:url: https://projecteuler.net/problem=152
 :content: |+
   There are several ways to write the number 1/2 as a sum of inverse squares using _distinct_ integers.
 
   For instance, the numbers {2,3,4,5,7,12,15,20,28,35} can be used:
 
-  ![]({{ images_dir }}/p_152_sum.gif)
+  ![]({{ images_dir }}/p152_sum.gif)
 
   In fact, only using integers between 2 and 45 inclusive, there are exactly three ways to do it, the remaining two being: {2,3,4,6,7,9,10,20,28,35,36,45} and {2,3,4,6,7,9,12,15,28,30,35,36,45}.
 

data/data/problems/153.yml

@@ -1,40 +1,35 @@
 ---
 :id: 153
 :name: Investigating Gaussian Integers
-:url: http://projecteuler.net/problem=153
+:url: https://projecteuler.net/problem=153
 :content: "As we all know the equation <var>x</var><sup>2</sup>=-1 has no solutions
-  for real <var>x</var>.\r  \n\rIf we however introduce the imaginary number <var>i</var>
-  this equation has two solutions: <var>x=i</var> and <var>x=-i</var>.\r  \n\rIf we
-  go a step further the equation (<var>x</var>-3)<sup>2</sup>=-4 has two complex solutions:
-  <var>x</var>=3+2<var>i</var> and <var>x</var>=3-2<var>i</var>.\r  \n<var>x</var>=3+2<var>i</var>
-  and <var>x</var>=3-2<var>i</var> are called each others' complex conjugate.\r  \n\rNumbers
-  of the form <var>a</var>+<var>bi</var> are called complex numbers.\r  \n\rIn general
-  <var>a</var>+<var>bi</var> and <var>a</var> ![−]({{ images_dir }}/symbol_minus.gif)<var>bi</var>
-  are each other's complex conjugate.\n\nA Gaussian Integer is a complex number <var>a</var>+<var>bi</var>
-  such that both <var>a</var> and <var>b</var> are integers.\r  \n\rThe regular integers
-  are also Gaussian integers (with <var>b</var>=0).\r  \n\rTo distinguish them from
-  Gaussian integers with <var>b</var> ![≠]({{ images_dir }}/symbol_ne.gif) 0 we call
-  such integers \"rational integers.\"\r  \n\rA Gaussian integer is called a divisor
-  of a rational integer <var>n</var> if the result is also a Gaussian integer.\r  \n\rIf
-  for example we divide 5 by 1+2<var>i</var> we can simplify ![]({{ images_dir }}/p_153_formule1.gif)
-  in the following manner:\r  \n\rMultiply numerator and denominator by the complex
-  conjugate of 1+2<var>i</var>: 1 ![−]({{ images_dir }}/symbol_minus.gif)2<var>i</var>.\r
-  \ \n\rThe result is \r ![]({{ images_dir }}/p_153_formule2.gif).\r  \n\rSo 1+2<var>i</var>
-  is a divisor of 5.\r  \n\rNote that 1+<var>i</var> is not a divisor of 5 because
-  ![]({{ images_dir }}/p_153_formule5.gif).\r  \n\rNote also that if the Gaussian
-  Integer (<var>a</var>+<var>bi</var>) is a divisor of a rational integer <var>n</var>,
-  then its complex conjugate (<var>a</var> ![−]({{ images_dir }}/symbol_minus.gif)<var>bi</var>)
+  for real <var>x</var>.  \nIf we however introduce the imaginary number <var>i</var>
+  this equation has two solutions: <var>x=i</var> and <var>x=-i</var>.  \nIf we go
+  a step further the equation (<var>x</var>-3)<sup>2</sup>=-4 has two complex solutions:
+  <var>x</var>=3+2<var>i</var> and <var>x</var>=3-2<var>i</var>.  \n<var>x</var>=3+2<var>i</var>
+  and <var>x</var>=3-2<var>i</var> are called each others' complex conjugate.  \nNumbers
+  of the form <var>a</var>+<var>bi</var> are called complex numbers.  \nIn general
+  <var>a</var>+<var>bi</var> and <var>a</var>−<var>bi</var> are each other's complex
+  conjugate.\n\nA Gaussian Integer is a complex number <var>a</var>+<var>bi</var>
+  such that both <var>a</var> and <var>b</var> are integers.  \nThe regular integers
+  are also Gaussian integers (with <var>b</var>=0).  \nTo distinguish them from Gaussian
+  integers with <var>b</var> ≠ 0 we call such integers \"rational integers.\"  \nA
+  Gaussian integer is called a divisor of a rational integer <var>n</var> if the result
+  is also a Gaussian integer.  \nIf for example we divide 5 by 1+2<var>i</var> we
+  can simplify ![]({{ images_dir }}/p153_formule1.gif) in the following manner:  \nMultiply
+  numerator and denominator by the complex conjugate of 1+2<var>i</var>: 1−2<var>i</var>.
+  \ \nThe result is ![]({{ images_dir }}/p153_formule2.gif).  \nSo 1+2<var>i</var>
+  is a divisor of 5.  \nNote that 1+<var>i</var> is not a divisor of 5 because ![]({{
+  images_dir }}/p153_formule5.gif).  \nNote also that if the Gaussian Integer (<var>a</var>+<var>bi</var>)
+  is a divisor of a rational integer <var>n</var>, then its complex conjugate (<var>a</var>−<var>bi</var>)
   is also a divisor of <var>n</var>.\n\nIn fact, 5 has six divisors such that the
-  real part is positive: {1, 1 + 2<var>i</var>, 1 ![−]({{ images_dir }}/symbol_minus.gif)
-  2<var>i</var>, 2 + <var>i</var>, 2 ![−]({{ images_dir }}/symbol_minus.gif) <var>i</var>,
-  5}.\r  \n\rThe following is a table of all of the divisors for the first five positive
-  rational integers:\n\n| <var>n</var> | Gaussian integer divisors  \n\rwith positive
-  real part | Sum s(<var>n</var>) of   \nthese\r\rdivisors |\n| 1 | 1 | 1 |\n| 2 |
-  1, 1+<var>i</var>, 1-<var>i</var>, 2 | 5 |\n| 3 | 1, 3 | 4 |\n| 4 | 1, 1+<var>i</var>,
-  1-<var>i</var>, 2, 2+2<var>i</var>, 2-2<var>i</var>,4 | 13 |\n| 5 | 1, 1+2<var>i</var>,
-  1-2<var>i</var>, 2+<var>i</var>, 2-<var>i</var>, 5 | 12 |\n\nFor divisors with positive
-  real parts, then, we have: ![]({{ images_dir }}/p_153_formule6.gif).\n\nFor 1 ![≤]({{
-  images_dir }}/symbol_le.gif) <var>n</var> ![≤]({{ images_dir }}/symbol_le.gif) 10<sup>5</sup>,
-  ![∑]({{ images_dir }}/symbol_sum.gif) s(<var>n</var>)=17924657155.\n\nWhat is ![∑]({{
-  images_dir }}/symbol_sum.gif) s(<var>n</var>) for 1 ![≤]({{ images_dir }}/symbol_le.gif)
-  <var>n</var> ![≤]({{ images_dir }}/symbol_le.gif) 10<sup>8</sup>?\n\n"
+  real part is positive: {1, 1 + 2<var>i</var>, 1 − 2<var>i</var>, 2 + <var>i</var>,
+  2 − <var>i</var>, 5}.  \nThe following is a table of all of the divisors for the
+  first five positive rational integers:\n\n| <var>n</var> | Gaussian integer divisors
+  \ \nwith positive real part | Sum s(<var>n</var>) of   \nthese divisors |\n| 1 |
+  1 | 1 |\n| 2 | 1, 1+<var>i</var>, 1-<var>i</var>, 2 | 5 |\n| 3 | 1, 3 | 4 |\n| 4
+  | 1, 1+<var>i</var>, 1-<var>i</var>, 2, 2+2<var>i</var>, 2-2<var>i</var>,4 | 13
+  |\n| 5 | 1, 1+2<var>i</var>, 1-2<var>i</var>, 2+<var>i</var>, 2-<var>i</var>, 5
+  | 12 |\n\nFor divisors with positive real parts, then, we have: ![]({{ images_dir
+  }}/p153_formule6.gif).\n\nFor 1 ≤ <var>n</var> ≤ 10<sup>5</sup>, ∑ s(<var>n</var>)=17924657155.\n\nWhat
+  is ∑ s(<var>n</var>) for 1 ≤ <var>n</var> ≤ 10<sup>8</sup>?\n\n"

data/data/problems/154.yml

@@ -1,15 +1,19 @@
 ---
 :id: 154
 :name: Exploring Pascal's pyramid
-:url: http://projecteuler.net/problem=154
-:content: "A triangular pyramid is constructed using spherical balls so that each
-  ball rests on exactly three balls of the next lower level.\n\n ![]({{ images_dir
-  }}/p_154_pyramid.gif)\n\nThen, we calculate the number of paths leading from the
-  apex to each position:\n\nA path starts at the apex and progresses downwards to
-  any of the three spheres directly below the current position.\n\nConsequently, the
-  number of paths to reach a certain position is the sum of the numbers immediately
-  above it (depending on the position, there are up to three numbers above it).\n\nThe
-  result is _Pascal's pyramid_ and the numbers at each level <var>n</var> are the
-  coefficients of the trinomial expansion \r(<var>x + y + z</var>)<sup><var>n</var></sup>.\n\nHow
-  many coefficients in the expansion of (<var>x + y + z</var>)<sup>200000</sup> are
-  multiples of 10<sup>12</sup>?\n\n"
+:url: https://projecteuler.net/problem=154
+:content: |+
+  A triangular pyramid is constructed using spherical balls so that each ball rests on exactly three balls of the next lower level.
+
+   ![]({{ images_dir }}/p154_pyramid.gif)
+
+  Then, we calculate the number of paths leading from the apex to each position:
+
+  A path starts at the apex and progresses downwards to any of the three spheres directly below the current position.
+
+  Consequently, the number of paths to reach a certain position is the sum of the numbers immediately above it (depending on the position, there are up to three numbers above it).
+
+  The result is _Pascal's pyramid_ and the numbers at each level <var>n</var> are the coefficients of the trinomial expansion (<var>x + y + z</var>)<sup><var>n</var></sup>.
+
+  How many coefficients in the expansion of (<var>x + y + z</var>)<sup>200000</sup> are multiples of 10<sup>12</sup>?
+

data/data/problems/155.yml

@@ -1,19 +1,20 @@
 ---
 :id: 155
 :name: Counting Capacitor Circuits
-:url: http://projecteuler.net/problem=155
+:url: https://projecteuler.net/problem=155
 :content: "An electric circuit uses exclusively identical capacitors of the same value
-  C.\r  \n\rThe capacitors can be connected in series or in parallel to form sub-units,
+  C.  \nThe capacitors can be connected in series or in parallel to form sub-units,
   which can then be connected in series or in parallel with other capacitors or other
   sub-units to form larger sub-units, and so on up to a final circuit.\n\nUsing this
   simple procedure and up to <var>n</var> identical capacitors, we can make circuits
   having a range of different total capacitances. For example, using up to <var>n</var>=3
-  capacitors of 60 ![]({{ images_dir }}/p_155_capsmu.gif)F each, we can obtain the
-  following 7 distinct total capacitance values:\n\n ![]({{ images_dir }}/p_155_capacitors1.gif)\n\nIf
+  capacitors of 60 ![]({{ images_dir }}/p155_capsmu.gif)F each, we can obtain the
+  following 7 distinct total capacitance values:\n\n ![]({{ images_dir }}/p155_capacitors1.gif)\n\nIf
   we denote by <var>D</var>(<var>n</var>) the number of distinct total capacitance
   values we can obtain when using up to <var>n</var> equal-valued capacitors and the
   simple procedure described above, we have: <var>D</var>(1)=1, <var>D</var>(2)=3,
   <var>D</var>(3)=7 ...\n\nFind <var>D</var>(18).\n\n_Reminder :_ When connecting
   capacitors C<sub>1</sub>, C<sub>2</sub> etc in parallel, the total capacitance is
-  C<sub>T</sub> = C<sub>1</sub> + C<sub>2</sub> +...,\r  \n\rwhereas when connecting
-  them in series, the overall capacitance is given by:\r ![]({{ images_dir }}/p_155_capsform.gif)\n\n"
+  C<sub>T</sub>&nbsp;=&nbsp;C<sub>1</sub>&nbsp;+&nbsp;C<sub>2</sub>&nbsp;+...,  \nwhereas
+  when connecting them in series, the overall capacitance is given by: ![]({{ images_dir
+  }}/p155_capsform.gif)\n\n"

data/data/problems/156.yml

@@ -1,24 +1,23 @@
 ---
 :id: 156
 :name: Counting Digits
-:url: http://projecteuler.net/problem=156
+:url: https://projecteuler.net/problem=156
 :content: "Starting from zero the natural numbers are written down in base 10 like
-  this:\r  \n\r0 1 2 3 4 5 6 7 8 9 10 11 12....\n\nConsider the digit <var>d</var>=1.
+  this:  \n0 1 2 3 4 5 6 7 8 9 10 11 12....\n\nConsider the digit <var>d</var>=1.
   After we write down each number <var>n</var>, we will update the number of ones
   that have occurred and call this number <var>f</var>(<var>n</var>,1). The first
   values for <var>f</var>(<var>n</var>,1), then, are as follows:\n\n| <var>n</var>
   | <var>f</var>(<var>n</var>,1) |\n| 0 | 0 |\n| 1 | 1 |\n| 2 | 1 |\n| 3 | 1 |\n|
   4 | 1 |\n| 5 | 1 |\n| 6 | 1 |\n| 7 | 1 |\n| 8 | 1 |\n| 9 | 1 |\n| 10 | 2 |\n| 11
-  | 4 |\n| 12 | 5 |\n\nNote that <var>f</var>(<var>n</var>,1) never equals 3.\r  \n\rSo
+  | 4 |\n| 12 | 5 |\n\nNote that <var>f</var>(<var>n</var>,1) never equals 3.  \nSo
   the first two solutions of the equation <var>f</var>(<var>n</var>,1)=<var>n</var>
   are <var>n</var>=0 and <var>n</var>=1. The next solution is <var>n</var>=199981.\n\nIn
   the same manner the function <var>f</var>(<var>n,d</var>) gives the total number
   of digits <var>d</var> that have been written down after the number <var>n</var>
-  has been written.\r  \n\rIn fact, for every digit <var>d</var> ![≠]({{ images_dir
-  }}/symbol_ne.gif) 0, 0 is the first solution of the equation <var>f</var>(<var>n,d</var>)=<var>n</var>.\n\nLet
-  <var>s</var>(<var>d</var>) be the sum of all the solutions for which <var>f</var>(<var>n,d</var>)=<var>n</var>.\r
-  \ \n\rYou are given that <var>s</var>(1)=22786974071.\n\nFind ![∑]({{ images_dir
-  }}/symbol_sum.gif) <var>s</var>(<var>d</var>) for 1 ![≤]({{ images_dir }}/symbol_le.gif)
-  d ![≤]({{ images_dir }}/symbol_le.gif) 9.\n\nNote: if, for some <var>n</var>, <var>f</var>(<var>n,d</var>)=<var>n</var>\r
+  has been written.  \nIn fact, for every digit <var>d</var> ≠ 0, 0 is the first solution
+  of the equation <var>f</var>(<var>n,d</var>)=<var>n</var>.\n\nLet <var>s</var>(<var>d</var>)
+  be the sum of all the solutions for which <var>f</var>(<var>n,d</var>)=<var>n</var>.
+  \ \nYou are given that <var>s</var>(1)=22786974071.\n\nFind ∑ <var>s</var>(<var>d</var>)
+  for 1 ≤ d ≤ 9.\n\nNote: if, for some <var>n</var>, <var>f</var>(<var>n,d</var>)=<var>n</var>
   for more than one value of <var>d</var> this value of <var>n</var> is counted again
   for every value of <var>d</var> for which <var>f</var>(<var>n,d</var>)=<var>n</var>.\n\n"

data/data/problems/157.yml

@@ -2,12 +2,11 @@
 :id: 157
 :name: Solving the diophantine equation <sup>1</sup>/<sub><var>a</var></sub>+<sup>1</sup>/<sub><var>b</var></sub>=
   <sup><var>p</var></sup>/<sub>10<sup><var>n</var></sup></sub>
-:url: http://projecteuler.net/problem=157
+:url: https://projecteuler.net/problem=157
 :content: "Consider the diophantine equation <sup>1</sup>/<sub><var>a</var></sub>+<sup>1</sup>/<sub><var>b</var></sub>=
   <sup><var>p</var></sup>/<sub>10<sup><var>n</var></sup></sub> with <var>a, b, p,
-  n</var> positive integers and <var>a</var> ![≤]({{ images_dir }}/symbol_le.gif)
-  <var>b</var>.  \n\rFor <var>n</var>=1 this equation has 20 solutions that are listed
-  below:\n\n| <sup>1</sup>/<sub>1</sub>+<sup>1</sup>/<sub>1</sub>=<sup>20</sup>/<sub>10</sub>
+  n</var> positive integers and <var>a</var> ≤ <var>b</var>.  \nFor <var>n</var>=1
+  this equation has 20 solutions that are listed below:\n\n| <sup>1</sup>/<sub>1</sub>+<sup>1</sup>/<sub>1</sub>=<sup>20</sup>/<sub>10</sub>
   | <sup>1</sup>/<sub>1</sub>+<sup>1</sup>/<sub>2</sub>=<sup>15</sup>/<sub>10</sub>
   | <sup>1</sup>/<sub>1</sub>+<sup>1</sup>/<sub>5</sub>=<sup>12</sup>/<sub>10</sub>
   | <sup>1</sup>/<sub>1</sub>+<sup>1</sup>/<sub>10</sub>=<sup>11</sup>/<sub>10</sub>
@@ -27,5 +26,4 @@
   | <sup>1</sup>/<sub>14</sub>+<sup>1</sup>/<sub>35</sub>=<sup>1</sup>/<sub>10</sub>
   | <sup>1</sup>/<sub>15</sub>+<sup>1</sup>/<sub>30</sub>=<sup>1</sup>/<sub>10</sub>
   | <sup>1</sup>/<sub>20</sub>+<sup>1</sup>/<sub>20</sub>=<sup>1</sup>/<sub>10</sub>
-  |\n\nHow many solutions has this equation for 1 ![≤]({{ images_dir }}/symbol_le.gif)
-  <var>n</var> ![≤]({{ images_dir }}/symbol_le.gif) 9?\n\n"
+  |\n\nHow many solutions has this equation for 1 ≤ <var>n</var> ≤ 9?\n\n"

data/data/problems/158.yml

@@ -2,16 +2,16 @@
 :id: 158
 :name: Exploring strings for which only one character comes lexicographically after
   its neighbour to the left
-:url: http://projecteuler.net/problem=158
+:url: https://projecteuler.net/problem=158
 :content: "Taking three different letters from the 26 letters of the alphabet, character
-  strings of length three can be formed.  \n\rExamples are 'abc', 'hat' and 'zyx'.
-  \ \n\rWhen we study these three examples we see that for 'abc' two characters come
-  lexicographically after its neighbour to the left.  \n \rFor 'hat' there is exactly
-  one character that comes lexicographically after its neighbour to the left. For
-  'zyx' there are zero characters that come lexicographically after its neighbour
-  to the left.  \n\rIn all there are 10400 strings of length 3 for which exactly one
-  character comes lexicographically after its neighbour to the left.\n\nWe now consider
-  strings of <var>n</var> ![≤]({{ images_dir }}/symbol_le.gif) 26 different characters
-  from the alphabet.  \n \rFor every <var>n</var>, p(<var>n</var>) is the number of
-  strings of length <var>n</var> for which exactly one character comes lexicographically
-  after its neighbour to the left.\n\nWhat is the maximum value of p(<var>n</var>)?\n\n"
+  strings of length three can be formed.  \nExamples are 'abc', 'hat' and 'zyx'.  \nWhen
+  we study these three examples we see that for 'abc' two characters come lexicographically
+  after its neighbour to the left.  \n For 'hat' there is exactly one character that
+  comes lexicographically after its neighbour to the left. For 'zyx' there are zero
+  characters that come lexicographically after its neighbour to the left.  \nIn all
+  there are 10400 strings of length 3 for which exactly one character comes lexicographically
+  after its neighbour to the left.\n\nWe now consider strings of <var>n</var> ≤ 26
+  different characters from the alphabet.  \n For every <var>n</var>, p(<var>n</var>)
+  is the number of strings of length <var>n</var> for which exactly one character
+  comes lexicographically after its neighbour to the left.\n\nWhat is the maximum
+  value of p(<var>n</var>)?\n\n"