euler-manager 0.1.1 → 0.2.0

data/data/problems/424.yml

@@ -1,23 +1,23 @@
 ---
 :id: 424
 :name: Kakuro
-:url: http://projecteuler.net/problem=424
-:content: "![]({{ images_dir }}/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
-  [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))
+:url: https://projecteuler.net/problem=424
+:content: " ![p424_kakuro1.gif]({{ images_dir }}/p424_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 [krazydad.com](http://krazydad.com/) whose author has provided the puzzle
+  data for this challenge.)\n\nThe downloadable text file ([kakuro200.txt](project/resources/p424_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.\n\nThe
   content of each cell is then described and followed by a comma, going left to right
-  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
+  and starting with the top line.  \nX = Gray cell, not required to be filled by a
+  digit.  \nO (upper case letter)= White empty cell to be filled by a digit.  \nA
   = Or any one of the upper case letters from A to J to be replaced by its equivalent
-  digit in the solved puzzle.  \n\r( ) = Location of the encrypted sums. Horizontal
+  digit in the solved puzzle.  \n( ) = 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

data/data/problems/425.yml

@@ -1,14 +1,14 @@
 ---
 :id: 425
 :name: Prime connection
-:url: http://projecteuler.net/problem=425
+:url: https://projecteuler.net/problem=425
 :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
+  ↔ B\") if one of these conditions holds:  \n(1) A and B have the same length and
+  differ in exactly one digit; for example, 123 ↔ 173.  \n(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
-  ![≤]({{ images_dir }}/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"
+  One of the possible chains is shown below:  \n2 ↔ 3 ↔ 13 ↔ 113 ↔ 103 ↔ 107 ↔ 127
+  \ \nHowever, 11 and 103 are not 2's relatives.\n\nLet F(N) be the sum of the primes
+  ≤ N which are not 2's relatives.  \nWe 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

@@ -1,7 +1,7 @@
 ---
 :id: 426
 :name: Box-ball system
-:url: http://projecteuler.net/problem=426
+:url: https://projecteuler.net/problem=426
 :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
@@ -10,19 +10,19 @@
   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 ![]({{ images_dir }}/p_426_baxball1.gif)\n\nA
+  starting at the first occupied box.\n\n ![p426_baxball1.gif]({{ images_dir }}/p426_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 **occupied boxes** evolves to [1, 2, 3]; we shall call
-  this the final state.\n\n ![]({{ images_dir }}/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>,
+  this the final state.\n\n ![p426_baxball2.gif]({{ images_dir }}/p426_baxball2.gif)\n\nWe
+  define the sequence {<var>t</var><sub><var>i</var></sub>}:\n\n- <var>s</var><sub>0</sub>
+  = 290797\n- <var>s</var><sub><var>k</var>+1</sub> = <var>s</var><sub><var>k</var></sub><sup>2</sup>
+  mod 50515093\n- <var>t</var><sub><var>k</var></sub> = (<var>s</var><sub><var>k</var></sub>
+  mod 64) + 1\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].  \n\rStarting from the initial configuration (<var>t</var><sub>0</sub>,
+  [1, 3, 10, 24, 51, 75].  \nStarting 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.  \n\rGive as your answer the sum of the squares of the elements of the final
+  state.  \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.\n\n"

data/data/problems/427.yml

@@ -1,16 +1,15 @@
 ---
 :id: 427
 :name: n-sequences
-:url: http://projecteuler.net/problem=427
-: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 ![≤]({{ images_dir }}/symbol_le.gif) s<sub><var>i</var></sub> ![≤]({{ images_dir
-  }}/symbol_le.gif) <var>n</var>. Thus there are <var>n</var><sup><var>n</var></sup>
-  distinct <var>n</var>-sequences 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>) = ![∑]({{ images_dir }}/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"
+:url: https://projecteuler.net/problem=427
+: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 ≤ s<sub><var>i</var></sub> ≤ <var>n</var>. Thus there are <var>n</var><sup><var>n</var></sup> distinct <var>n</var>-sequences in total. For example, the sequence S = {1, 5, 5, 10, 7, 7, 7, 2, 3, 7} is a 10-sequence.
+
+  For any sequence S, let L(S) be the length of the longest contiguous subsequence of S with the same value. For example, for the given sequence S above, L(S) = 3, because of the three consecutive 7's.
+
+  Let <var>f</var>(<var>n</var>) = ∑ L(S) for all <var>n</var>-sequences S.
+
+  For example, <var>f</var>(3) = 45, <var>f</var>(7) = 1403689 and <var>f</var>(11) = 481496895121.
+
+  Find <var>f</var>(7&nbsp;500&nbsp;000) mod 1&nbsp;000&nbsp;000&nbsp;009.
+

data/data/problems/428.yml

@@ -1,25 +1,22 @@
 ---
 :id: 428
 :name: Necklace of circles
-:url: http://projecteuler.net/problem=428
-:content: "Let <var>a</var>, <var>b</var> and <var>c</var> be positive numbers.  \n\rLet
+:url: https://projecteuler.net/problem=428
+:content: "Let <var>a</var>, <var>b</var> and <var>c</var> be positive numbers.  \nLet
   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>.  \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> ![≥]({{ images_dir
-  }}/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 ![≤]({{ images_dir }}/symbol_le.gif) <var>i</var>,
-  <var>j</var> ![≤]({{ images_dir }}/symbol_le.gif) <var>k</var> and <var>i</var>
-  ![≠]({{ images_dir }}/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 ![≤]({{ images_dir }}/symbol_le.gif)
-  <var>i</var> ![≤]({{ images_dir }}/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 ![≤]({{ images_dir }}/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
+  |YZ| = <var>c</var> and |WZ| = <var>a</var> + <var>b</var> + <var>c</var>.  \nLet
+  C<sub>in</sub> be the circle having the diameter XY.  \nLet 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> ≥ 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 ≤ <var>i</var>,
+  <var>j</var> ≤ <var>k</var> and <var>i</var> ≠ <var>j</var>,\n- C<sub><var>i</var></sub>
+  is tangent to both C<sub>in</sub> and C<sub>out</sub> for 1 ≤ <var>i</var> ≤ <var>k</var>,\n-
+  C<sub><var>i</var></sub> is tangent to C<sub><var>i</var>+1</sub> for 1 ≤ <var>i</var>
+  \\< <var>k</var>, and\n- C<sub><var>k</var></sub> is tangent to C<sub>1</sub>.\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![]({{ images_dir }}/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>
-  ![≤]({{ images_dir }}/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"
+  (2, 2, 5) is not.\n\n![p428_necklace.png]({{ images_dir }}/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> ≤ <var>n</var>. For example, T(1)&nbsp;=&nbsp;9, T(20)&nbsp;=&nbsp;732
+  and T(3000)&nbsp;=&nbsp;438106.\n\nFind T(1&nbsp;000&nbsp;000&nbsp;000).\n\n"

data/data/problems/429.yml

@@ -1,10 +1,10 @@
 ---
 :id: 429
 :name: Sum of squares of unitary divisors
-:url: http://projecteuler.net/problem=429
+:url: https://projecteuler.net/problem=429
 :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
+  <var>n</var> that has the property gcd(<var>d, n/d</var>) = 1.  \nThe unitary divisors
+  of 4! = 24 are 1, 3, 8 and 24.  \nThe 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

@@ -1,7 +1,7 @@
 ---
 :id: 43
 :name: Sub-string divisibility
-:url: http://projecteuler.net/problem=43
+:url: https://projecteuler.net/problem=43
 :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.
 

data/data/problems/430.yml

@@ -1,17 +1,16 @@
 ---
 :id: 430
 :name: Range flips
-:url: http://projecteuler.net/problem=430
+:url: https://projecteuler.net/problem=430
 :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
+  left to right.  \nEach 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>
+  uniformly at random.  \nAll 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![]({{ images_dir }}/p_430_flips.gif)\n\nLet
+  <var>A</var> = 4 and <var>B</var> = 6.\n\n![p430_flips.gif]({{ images_dir }}/p430_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) ![≈]({{ images_dir }}/symbol_asymp.gif) 5.157 and E(100, 10) ![≈]({{
-  images_dir }}/symbol_asymp.gif) 51.893.\n\nFind E(10<sup>10</sup>, 4000).  \n\rGive
+  side after <var>M</var> turns.  \nWe can verify that E(3, 1) = 10/9, E(3, 2) = 5/3,
+  E(10, 4) ≈ 5.157 and E(100, 10) ≈ 51.893.\n\nFind E(10<sup>10</sup>, 4000).  \nGive
   your answer rounded to 2 decimal places behind the decimal point.\n\n"

data/data/problems/44.yml

@@ -1,13 +1,13 @@
 ---
 :id: 44
 :name: Pentagon numbers
-:url: http://projecteuler.net/problem=44
+:url: https://projecteuler.net/problem=44
 :content: |+
-  Pentagonal numbers are generated by the formula, P<sub><var>n</var></sub>=<var>n</var>(3<var>n</var> ![−]({{ images_dir }}/symbol_minus.gif)1)/2. The first ten pentagonal numbers are:
+  Pentagonal numbers are generated by the formula, P<sub><var>n</var></sub>=<var>n</var>(3<var>n</var>−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 ![−]({{ images_dir }}/symbol_minus.gif) 22 = 48, is not pentagonal.
+  It can be seen that P<sub>4</sub> + P<sub>7</sub> = 22 + 70 = 92 = P<sub>8</sub>. However, their difference, 70 − 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> ![−]({{ images_dir }}/symbol_minus.gif) P<sub><var>j</var></sub>| is minimised; what is the value of D?
+  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> − P<sub><var>j</var></sub>| is minimised; what is the value of D?
 

data/data/problems/45.yml

@@ -1,13 +1,13 @@
 ---
 :id: 45
 :name: Triangular, pentagonal, and hexagonal
-:url: http://projecteuler.net/problem=45
+:url: https://projecteuler.net/problem=45
 :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_ ![−]({{ images_dir }}/symbol_minus.gif)1)/2 |   | 1, 5, 12, 22, 35, ... |
-  | Hexagonal |   | H<sub><i>n</i></sub>=_n_(2_n_ ![−]({{ images_dir }}/symbol_minus.gif)1) |   | 1, 6, 15, 28, 45, ... |
+  | Triangle | &nbsp; | T<sub><i>n</i></sub>=_n_(_n_+1)/2 | &nbsp; | 1, 3, 6, 10, 15, ... |
+  | Pentagonal | &nbsp; | P<sub><i>n</i></sub>=_n_(3_n_−1)/2 | &nbsp; | 1, 5, 12, 22, 35, ... |
+  | Hexagonal | &nbsp; | H<sub><i>n</i></sub>=_n_(2_n_−1) | &nbsp; | 1, 6, 15, 28, 45, ... |
 
   It can be verified that T<sub>285</sub> = P<sub>165</sub> = H<sub>143</sub> = 40755.
 

data/data/problems/46.yml

@@ -1,13 +1,10 @@
 ---
 :id: 46
 :name: Goldbach's other conjecture
-:url: http://projecteuler.net/problem=46
+:url: https://projecteuler.net/problem=46
 :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 ![×]({{ images_dir
-  }}/symbol_times.gif)1<sup>2</sup>  \n\r15 = 7 + 2 ![×]({{ images_dir }}/symbol_times.gif)2<sup>2</sup>
-  \ \n\r21 = 3 + 2 ![×]({{ images_dir }}/symbol_times.gif)3<sup>2</sup>  \n\r25 =
-  7 + 2 ![×]({{ images_dir }}/symbol_times.gif)3<sup>2</sup>  \n\r27 = 19 + 2 ![×]({{
-  images_dir }}/symbol_times.gif)2<sup>2</sup>  \n\r33 = 31 + 2 ![×]({{ images_dir
-  }}/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"
+  be written as the sum of a prime and twice a square.\n\n9 = 7 + 2×1<sup>2</sup>
+  \ \n15 = 7 + 2×2<sup>2</sup>  \n21 = 3 + 2×3<sup>2</sup>  \n25 = 7 + 2×3<sup>2</sup>
+  \ \n27 = 19 + 2×2<sup>2</sup>  \n33 = 31 + 2×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"

data/data/problems/47.yml

@@ -1,12 +1,9 @@
 ---
 :id: 47
 :name: Distinct primes factors
-:url: http://projecteuler.net/problem=47
+:url: https://projecteuler.net/problem=47
 :content: "The first two consecutive numbers to have two distinct prime factors are:\n\n14
-  = 2 ![×]({{ images_dir }}/symbol_times.gif) 7  \n15 = 3 ![×]({{ images_dir }}/symbol_times.gif)
-  5\n\nThe first three consecutive numbers to have three distinct prime factors are:\n\n644
-  = 2² ![×]({{ images_dir }}/symbol_times.gif) 7 ![×]({{ images_dir }}/symbol_times.gif)
-  23  \n645 = 3 ![×]({{ images_dir }}/symbol_times.gif) 5 ![×]({{ images_dir }}/symbol_times.gif)
-  43  \n646 = 2 ![×]({{ images_dir }}/symbol_times.gif) 17 ![×]({{ images_dir }}/symbol_times.gif)
-  19.\n\nFind the first four consecutive integers to have four distinct prime factors.
-  What is the first of these numbers?\n\n"
+  = 2 × 7  \n15 = 3 × 5\n\nThe first three consecutive numbers to have three distinct
+  prime factors are:\n\n644 = 2² × 7 × 23  \n645 = 3 × 5 × 43  \n646 = 2 × 17 × 19.\n\nFind
+  the first four consecutive integers to have four distinct prime factors. What is
+  the first of these numbers?\n\n"

data/data/problems/48.yml

@@ -1,7 +1,7 @@
 ---
 :id: 48
 :name: Self powers
-:url: http://projecteuler.net/problem=48
+:url: https://projecteuler.net/problem=48
 :content: |+
   The series, 1<sup>1</sup> + 2<sup>2</sup> + 3<sup>3</sup> + ... + 10<sup>10</sup> = 10405071317.
 

data/data/problems/49.yml

@@ -1,7 +1,7 @@
 ---
 :id: 49
 :name: Prime permutations
-:url: http://projecteuler.net/problem=49
+:url: https://projecteuler.net/problem=49
 :content: |+
   The arithmetic sequence, 1487, 4817, 8147, in which each of the terms increases by 3330, is unusual in two ways: (i) each of the three terms are prime, and, (ii) each of the 4-digit numbers are permutations of one another.
 

data/data/problems/5.yml

@@ -1,7 +1,7 @@
 ---
 :id: 5
 :name: Smallest multiple
-:url: http://projecteuler.net/problem=5
+:url: https://projecteuler.net/problem=5
 :content: |+
   2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.
 

data/data/problems/50.yml

@@ -1,7 +1,7 @@
 ---
 :id: 50
 :name: Consecutive prime sum
-:url: http://projecteuler.net/problem=50
+:url: https://projecteuler.net/problem=50
 :content: |+
   The prime 41, can be written as the sum of six consecutive primes:
 

data/data/problems/51.yml

@@ -1,10 +1,8 @@
 ---
 :id: 51
 :name: Prime digit replacements
-:url: http://projecteuler.net/problem=51
+:url: https://projecteuler.net/problem=51
 :content: |+
-  <!--<p>By replacing the 1<sup>st</sup> digit of *57, it turns out that six of the possible values: 157, 257, 457, 557, 757, and 857, are all prime.</p> -->
-
   By replacing the 1<sup>st</sup> digit of the 2-digit number \*3, it turns out that six of the nine possible values: 13, 23, 43, 53, 73, and 83, are all prime.
 
   By replacing the 3<sup>rd</sup> and 4<sup>th</sup> digits of 56\*\*3 with the same digit, this 5-digit number is the first example having seven primes among the ten generated numbers, yielding the family: 56003, 56113, 56333, 56443, 56663, 56773, and 56993. Consequently 56003, being the first member of this family, is the smallest prime with this property.

data/data/problems/52.yml

@@ -1,7 +1,7 @@
 ---
 :id: 52
 :name: Permuted multiples
-:url: http://projecteuler.net/problem=52
+:url: https://projecteuler.net/problem=52
 :content: |+
   It can be seen that the number, 125874, and its double, 251748, contain exactly the same digits, but in a different order.
 

data/data/problems/53.yml

@@ -1,18 +1,12 @@
 ---
 :id: 53
 :name: Combinatoric selections
-:url: http://projecteuler.net/problem=53
+:url: https://projecteuler.net/problem=53
 :content: "There are exactly ten ways of selecting three from five, 12345:\n\n123,
   124, 125, 134, 135, 145, 234, 235, 245, and 345\n\nIn combinatorics, we use the
   notation, <sup>5</sup>C<sub>3</sub> = 10.\n\nIn general,\n\n| <sup><var>n</var></sup>C<sub><var>r</var></sub>
-  = | \n<var>n</var>!  \n<var>r</var>!(<var>n<img src=\"%7B%7B%20images_dir%20%7D%7D/symbol_minus.gif\"
-  width=\"9\" height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">r</var>)!\n
-  | ,where <var>r</var> ![≤]({{ images_dir }}/symbol_le.gif) <var>n</var>, <var>n</var>!
-  = <var>n</var> ![×]({{ images_dir }}/symbol_times.gif)(<var>n</var> ![−]({{ images_dir
-  }}/symbol_minus.gif)1) ![×]({{ images_dir }}/symbol_times.gif)... ![×]({{ images_dir
-  }}/symbol_times.gif)3 ![×]({{ images_dir }}/symbol_times.gif)2 ![×]({{ images_dir
-  }}/symbol_times.gif)1, and 0! = 1. |\n\nIt is not until <var>n</var> = 23, that
-  a value exceeds one-million: <sup>23</sup>C<sub>10</sub> = 1144066.\n\nHow many,
-  not necessarily distinct, values of  <sup><var>n</var></sup>C<sub><var>r</var></sub>,
-  for 1 ![≤]({{ images_dir }}/symbol_le.gif) <var>n</var> ![≤]({{ images_dir }}/symbol_le.gif)
-  100, are greater than one-million?\n\n"
+  = | \n<var>n</var>!  \n<var>r</var>!(<var>n−r</var>)!\n | ,where <var>r</var> ≤
+  <var>n</var>, <var>n</var>! = <var>n</var>×(<var>n</var>−1)×...×3×2×1, and 0! =
+  1. |\n\nIt is not until <var>n</var> = 23, that a value exceeds one-million: <sup>23</sup>C<sub>10</sub>
+  = 1144066.\n\nHow many, not necessarily distinct, values of &nbsp;<sup><var>n</var></sup>C<sub><var>r</var></sub>,
+  for 1 ≤ <var>n</var> ≤ 100, are greater than one-million?\n\n"

data/data/problems/54.yml

@@ -1,7 +1,7 @@
 ---
 :id: 54
 :name: Poker hands
-:url: http://projecteuler.net/problem=54
+:url: https://projecteuler.net/problem=54
 :content: "In the card game poker, a hand consists of five cards and are ranked, from
   lowest to highest, in the following way:\n\n- **High Card** : Highest value card.\n-
   **One Pair** : Two cards of the same value.\n- **Two Pairs** : Two different pairs.\n-
@@ -16,18 +16,19 @@
   for example, both players have a pair of queens, then highest cards in each hand
   are compared (see example 4 below); if the highest cards tie then the next highest
   cards are compared, and so on.\n\nConsider the following five hands dealt to two
-  players:\n\n| **Hand** |   | **Player 1** |   | **Player 2** |   | **Winner** |\n|
-  **1** |   | 5H 5C 6S 7S KD  \n\nPair of Fives\n |   | 2C 3S 8S 8D TD  \n\nPair of
-  Eights\n |   | Player 2 |\n| **2** |   | 5D 8C 9S JS AC  \n\nHighest card Ace\n
-  |   | 2C 5C 7D 8S QH  \n\nHighest card Queen\n |   | Player 1 |\n| **3** |   | 2D
-  9C AS AH AC  \n\nThree Aces\n |   | 3D 6D 7D TD QD  \n\nFlush with Diamonds\n |
-    | Player 2 |\n| **4** |   | 4D 6S 9H QH QC  \n\nPair of Queens  \nHighest card
-  Nine\n |   | 3D 6D 7H QD QS  \n\nPair of Queens  \nHighest card Seven\n |   | Player
-  1 |\n| **5** |   | 2H 2D 4C 4D 4S  \n\nFull House  \nWith Three Fours\n |   | 3C
-  3D 3S 9S 9D  \n\nFull House  \nwith Three Threes\n |   | Player 1 |\n\nThe file,
-  [poker.txt](project/poker.txt), contains one-thousand random hands dealt to two
-  players. Each line of the file contains ten cards (separated by a single space):
-  the first five are Player 1's cards and the last five are Player 2's cards. You
-  can assume that all hands are valid (no invalid characters or repeated cards), each
-  player's hand is in no specific order, and in each hand there is a clear winner.\n\nHow
-  many hands does Player 1 win?\n\n"
+  players:\n\n| **Hand** |   | **Player 1** |   | **Player 2** |  
+  | **Winner** |\n| **1** |   | 5H 5C 6S 7S KD  \n\nPair of Fives\n |  
+  | 2C 3S 8S 8D TD  \n\nPair of Eights\n |   | Player 2 |\n| **2** |   |
+  5D 8C 9S JS AC  \n\nHighest card Ace\n |   | 2C 5C 7D 8S QH  \n\nHighest card
+  Queen\n |   | Player 1 |\n| **3** |   | 2D 9C AS AH AC  \n\nThree Aces\n
+  |   | 3D 6D 7D TD QD  \n\nFlush with Diamonds\n |   | Player 2 |\n| **4**
+  |   | 4D 6S 9H QH QC  \n\nPair of Queens  \nHighest card Nine\n |   |
+  3D 6D 7H QD QS  \n\nPair of Queens  \nHighest card Seven\n |   | Player 1 |\n|
+  **5** |   | 2H 2D 4C 4D 4S  \n\nFull House  \nWith Three Fours\n |   |
+  3C 3D 3S 9S 9D  \n\nFull House  \nwith Three Threes\n |   | Player 1 |\n\nThe
+  file, [poker.txt](project/resources/p054_poker.txt), contains one-thousand random
+  hands dealt to two players. Each line of the file contains ten cards (separated
+  by a single space): the first five are Player 1's cards and the last five are Player
+  2's cards. You can assume that all hands are valid (no invalid characters or repeated
+  cards), each player's hand is in no specific order, and in each hand there is a
+  clear winner.\n\nHow many hands does Player 1 win?\n\n"

data/data/problems/55.yml

@@ -1,10 +1,10 @@
 ---
 :id: 55
 :name: Lychrel numbers
-:url: http://projecteuler.net/problem=55
+:url: https://projecteuler.net/problem=55
 :content: "If we take 47, reverse and add, 47 + 74 = 121, which is palindromic.\n\nNot
-  all numbers produce palindromes so quickly. For example,\n\n349 + 943 = 1292,  \n\r1292
-  + 2921 = 4213  \n\r4213 + 3124 = 7337\n\nThat is, 349 took three iterations to arrive
+  all numbers produce palindromes so quickly. For example,\n\n349 + 943 = 1292,  \n1292
+  + 2921 = 4213  \n4213 + 3124 = 7337\n\nThat is, 349 took three iterations to arrive
   at a palindrome.\n\nAlthough no one has proved it yet, it is thought that some numbers,
   like 196, never produce a palindrome. A number that never forms a palindrome through
   the reverse and add process is called a Lychrel number. Due to the theoretical nature