euler-manager 0.1.1 → 0.2.0

data/data/problems/56.yml

@@ -1,9 +1,9 @@
 ---
 :id: 56
 :name: Powerful digit sum
-:url: http://projecteuler.net/problem=56
+:url: https://projecteuler.net/problem=56
 :content: |+
   A googol (10<sup>100</sup>) is a massive number: one followed by one-hundred zeros; 100<sup>100</sup> is almost unimaginably large: one followed by two-hundred zeros. Despite their size, the sum of the digits in each number is only 1.
 
-  Considering natural numbers of the form, _a<sup>b</sup>_, where _a, b_ ![<]({{ images_dir }}/symbol_lt.gif) 100, what is the maximum digital sum?
+  Considering natural numbers of the form, _a<sup>b</sup>_, where _a, b_ \< 100, what is the maximum digital sum?
 

data/data/problems/57.yml

@@ -1,14 +1,13 @@
 ---
 :id: 57
 :name: Square root convergents
-:url: http://projecteuler.net/problem=57
+:url: https://projecteuler.net/problem=57
 :content: "It is possible to show that the square root of two can be expressed as
-  an infinite continued fraction.\n\n![√]({{ images_dir }}/symbol_radic.gif) 2 = 1
-  + 1/(2 + 1/(2 + 1/(2 + ... ))) = 1.414213...\n\nBy expanding this for the first
-  four iterations, we get:\n\n1 + 1/2 = 3/2 = 1.5  \n\r1 + 1/(2 + 1/2) = 7/5 = 1.4
-  \ \n\r1 + 1/(2 + 1/(2 + 1/2)) = 17/12 = 1.41666...  \n\r1 + 1/(2 + 1/(2 + 1/(2 +
-  1/2))) = 41/29 = 1.41379...\n\nThe next three expansions are 99/70, 239/169, and
-  577/408, but the eighth expansion, 1393/985, is the first example where the number
-  of digits in the numerator exceeds the number of digits in the denominator.\n\nIn
-  the first one-thousand expansions, how many fractions contain a numerator with more
-  digits than denominator?\n\n"
+  an infinite continued fraction.\n\n√ 2 = 1 + 1/(2 + 1/(2 + 1/(2 + ... ))) = 1.414213...\n\nBy
+  expanding this for the first four iterations, we get:\n\n1 + 1/2 = 3/2 = 1.5  \n1
+  + 1/(2 + 1/2) = 7/5 = 1.4  \n1 + 1/(2 + 1/(2 + 1/2)) = 17/12 = 1.41666...  \n1 +
+  1/(2 + 1/(2 + 1/(2 + 1/2))) = 41/29 = 1.41379...\n\nThe next three expansions are
+  99/70, 239/169, and 577/408, but the eighth expansion, 1393/985, is the first example
+  where the number of digits in the numerator exceeds the number of digits in the
+  denominator.\n\nIn the first one-thousand expansions, how many fractions contain
+  a numerator with more digits than denominator?\n\n"

data/data/problems/58.yml

@@ -1,15 +1,15 @@
 ---
 :id: 58
 :name: Spiral primes
-:url: http://projecteuler.net/problem=58
+:url: https://projecteuler.net/problem=58
 :content: "Starting with 1 and spiralling anticlockwise in the following way, a square
-  spiral with side length 7 is formed.\n\n**37** 36 35 34 33 32 **31**  \n\r38 **17**
-  16 15 14 **13** 30  \n\r39 18   **5**  4   **3** 12 29  \n\r40 19  6  1  2 11 28
-  \ \n\r41 20   **7**  8  9 10 27  \n\r42 21 22 23 24 25 26  \n**43** 44 45 46 47
-  48 49\n\nIt is interesting to note that the odd squares lie along the bottom right
-  diagonal, but what is more interesting is that 8 out of the 13 numbers lying along
-  both diagonals are prime; that is, a ratio of 8/13 ![≈]({{ images_dir }}/symbol_asymp.gif)
-  62%.\n\nIf one complete new layer is wrapped around the spiral above, a square spiral
-  with side length 9 will be formed. If this process is continued, what is the side
-  length of the square spiral for which the ratio of primes along both diagonals first
-  falls below 10%?\n\n"
+  spiral with side length 7 is formed.\n\n**37** 36 35 34 33 32 **31**  \n38 **17**
+  16 15 14 **13** 30  \n39 18   **5**  4   **3** 12 29  \n40 19  6
+   1  2 11 28  \n41 20   **7**  8  9 10 27  \n42 21 22 23
+  24 25 26  \n**43** 44 45 46 47 48 49\n\nIt is interesting to note that the odd squares
+  lie along the bottom right diagonal, but what is more interesting is that 8 out
+  of the 13 numbers lying along both diagonals are prime; that is, a ratio of 8/13
+  ≈ 62%.\n\nIf one complete new layer is wrapped around the spiral above, a square
+  spiral with side length 9 will be formed. If this process is continued, what is
+  the side length of the square spiral for which the ratio of primes along both diagonals
+  first falls below 10%?\n\n"

data/data/problems/59.yml

@@ -1,7 +1,7 @@
 ---
 :id: 59
 :name: XOR decryption
-:url: http://projecteuler.net/problem=59
+:url: https://projecteuler.net/problem=59
 :content: |+
   Each character on a computer is assigned a unique code and the preferred standard is ASCII (American Standard Code for Information Interchange). For example, uppercase A = 65, asterisk (\*) = 42, and lowercase k = 107.
 
@@ -11,5 +11,5 @@
 
   Unfortunately, this method is impractical for most users, so the modified method is to use a password as a key. If the password is shorter than the message, which is likely, the key is repeated cyclically throughout the message. The balance for this method is using a sufficiently long password key for security, but short enough to be memorable.
 
-  Your task has been made easy, as the encryption key consists of three lower case characters. Using [cipher1.txt](project/cipher1.txt) (right click and 'Save Link/Target As...'), a file containing the encrypted ASCII codes, and the knowledge that the plain text must contain common English words, decrypt the message and find the sum of the ASCII values in the original text.
+  Your task has been made easy, as the encryption key consists of three lower case characters. Using [cipher.txt](project/resources/p059_cipher.txt) (right click and 'Save Link/Target As...'), a file containing the encrypted ASCII codes, and the knowledge that the plain text must contain common English words, decrypt the message and find the sum of the ASCII values in the original text.
 

data/data/problems/6.yml

@@ -1,7 +1,7 @@
 ---
 :id: 6
 :name: Sum square difference
-:url: http://projecteuler.net/problem=6
+:url: https://projecteuler.net/problem=6
 :content: |+
   The sum of the squares of the first ten natural numbers is,
 
@@ -11,7 +11,7 @@
 
   (1 + 2 + ... + 10)<sup>2</sup> = 55<sup>2</sup> = 3025
 
-  Hence the difference between the sum of the squares of the first ten natural numbers and the square of the sum is 3025 ![−]({{ images_dir }}/symbol_minus.gif) 385 = 2640.
+  Hence the difference between the sum of the squares of the first ten natural numbers and the square of the sum is 3025 − 385 = 2640.
 
   Find the difference between the sum of the squares of the first one hundred natural numbers and the square of the sum.
 

data/data/problems/60.yml

@@ -1,7 +1,7 @@
 ---
 :id: 60
 :name: Prime pair sets
-:url: http://projecteuler.net/problem=60
+:url: https://projecteuler.net/problem=60
 :content: |+
   The primes 3, 7, 109, and 673, are quite remarkable. By taking any two primes and concatenating them in any order the result will always be prime. For example, taking 7 and 109, both 7109 and 1097 are prime. The sum of these four primes, 792, represents the lowest sum for a set of four primes with this property.
 

data/data/problems/61.yml

@@ -1,16 +1,16 @@
 ---
 :id: 61
 :name: Cyclical figurate numbers
-:url: http://projecteuler.net/problem=61
+:url: https://projecteuler.net/problem=61
 :content: |+
   Triangle, square, pentagonal, hexagonal, heptagonal, and octagonal numbers are all figurate (polygonal) numbers and are generated by the following formulae:
 
-  | Triangle |   | P<sub>3,<i>n</i></sub>=_n_(_n_+1)/2 |   | 1, 3, 6, 10, 15, ... |
-  | Square |   | P<sub>4,<i>n</i></sub>=_n_<sup>2</sup> |   | 1, 4, 9, 16, 25, ... |
-  | Pentagonal |   | P<sub>5,<i>n</i></sub>=_n_(3_n_ ![−]({{ images_dir }}/symbol_minus.gif)1)/2 |   | 1, 5, 12, 22, 35, ... |
-  | Hexagonal |   | P<sub>6,<i>n</i></sub>=_n_(2_n_ ![−]({{ images_dir }}/symbol_minus.gif)1) |   | 1, 6, 15, 28, 45, ... |
-  | Heptagonal |   | P<sub>7,<i>n</i></sub>=_n_(5_n_ ![−]({{ images_dir }}/symbol_minus.gif)3)/2 |   | 1, 7, 18, 34, 55, ... |
-  | Octagonal |   | P<sub>8,<i>n</i></sub>=_n_(3_n_ ![−]({{ images_dir }}/symbol_minus.gif)2) |   | 1, 8, 21, 40, 65, ... |
+  | Triangle | &nbsp; | P<sub>3,<i>n</i></sub>=_n_(_n_+1)/2 | &nbsp; | 1, 3, 6, 10, 15, ... |
+  | Square | &nbsp; | P<sub>4,<i>n</i></sub>=_n_<sup>2</sup> | &nbsp; | 1, 4, 9, 16, 25, ... |
+  | Pentagonal | &nbsp; | P<sub>5,<i>n</i></sub>=_n_(3_n_−1)/2 | &nbsp; | 1, 5, 12, 22, 35, ... |
+  | Hexagonal | &nbsp; | P<sub>6,<i>n</i></sub>=_n_(2_n_−1) | &nbsp; | 1, 6, 15, 28, 45, ... |
+  | Heptagonal | &nbsp; | P<sub>7,<i>n</i></sub>=_n_(5_n_−3)/2 | &nbsp; | 1, 7, 18, 34, 55, ... |
+  | Octagonal | &nbsp; | P<sub>8,<i>n</i></sub>=_n_(3_n_−2) | &nbsp; | 1, 8, 21, 40, 65, ... |
 
   The ordered set of three 4-digit numbers: 8128, 2882, 8281, has three interesting properties.
 

data/data/problems/62.yml

@@ -1,7 +1,7 @@
 ---
 :id: 62
 :name: Cubic permutations
-:url: http://projecteuler.net/problem=62
+:url: https://projecteuler.net/problem=62
 :content: |+
   The cube, 41063625 (345<sup>3</sup>), can be permuted to produce two other cubes: 56623104 (384<sup>3</sup>) and 66430125 (405<sup>3</sup>). In fact, 41063625 is the smallest cube which has exactly three permutations of its digits which are also cube.
 

data/data/problems/63.yml

@@ -1,7 +1,7 @@
 ---
 :id: 63
 :name: Powerful digit counts
-:url: http://projecteuler.net/problem=63
+:url: https://projecteuler.net/problem=63
 :content: |+
   The 5-digit number, 16807=7<sup>5</sup>, is also a fifth power. Similarly, the 9-digit number, 134217728=8<sup>9</sup>, is a ninth power.
 

data/data/problems/64.yml

@@ -1,49 +1,35 @@
 ---
 :id: 64
 :name: Odd period square roots
-:url: http://projecteuler.net/problem=64
+:url: https://projecteuler.net/problem=64
 :content: "All square roots are periodic when written as continued fractions and can
-  be written in the form:\n\n| ![√]({{ images_dir }}/symbol_radic.gif)<var>N</var>
-  = <var>a</var><sub>0</sub> + | \n1\n |\n|   | <var>a</var><sub>1</sub> + | \n1\n
-  |\n|   |   | <var>a</var><sub>2</sub> + | \n1\n |\n|   |   |   | <var>a</var><sub>3</sub>
-  + ... |\n\nFor example, let us consider ![√]({{ images_dir }}/symbol_radic.gif)23:\n\n|
-  ![√]({{ images_dir }}/symbol_radic.gif)23 = 4 + ![√]({{ images_dir }}/symbol_radic.gif)23
-  — 4 = 4 +  | \n1\n |  = 4 +  | \n1\n |\n|   | \n1  \n ![√]({{ images_dir }}/symbol_radic.gif)23—4\n
-  |   | 1 +  | \n ![√]({{ images_dir }}/symbol_radic.gif)23 – 3  \n7\n |\n\nIf we
-  continue we would get the following expansion:\n\n| ![√]({{ images_dir }}/symbol_radic.gif)23
-  = 4 + | \n1\n |\n|   | 1 + | \n1\n |\n|   |   | 3 + | \n1\n |\n|   |   |   | 1 +
-  | \n1\n |\n|   |   |   |   | 8 + ... |\n\nThe process can be summarised as follows:\n\n|
-  <var>a</var><sub>0</sub> = 4, |   | \n1  \n ![√]({{ images_dir }}/symbol_radic.gif)23—4\n
-  |  =  | \n ![√]({{ images_dir }}/symbol_radic.gif)23+4  \n7\n |  = 1 +  | \n ![√]({{
-  images_dir }}/symbol_radic.gif)23—3  \n7\n |\n| <var>a</var><sub>1</sub> = 1, |
-    | \n7  \n ![√]({{ images_dir }}/symbol_radic.gif)23—3\n |  =  | \n7( ![√]({{ images_dir
-  }}/symbol_radic.gif)23+3)  \n14\n |  = 3 +  | \n ![√]({{ images_dir }}/symbol_radic.gif)23—3
-  \ \n2\n |\n| <var>a</var><sub>2</sub> = 3, |   | \n2  \n ![√]({{ images_dir }}/symbol_radic.gif)23—3\n
-  |  =  | \n2( ![√]({{ images_dir }}/symbol_radic.gif)23+3)  \n14\n |  = 1 +  | \n
-  ![√]({{ images_dir }}/symbol_radic.gif)23—4  \n7\n |\n| <var>a</var><sub>3</sub>
-  = 1, |   | \n7  \n ![√]({{ images_dir }}/symbol_radic.gif)23—4\n |  =  | \n7( ![√]({{
-  images_dir }}/symbol_radic.gif)23+4)  \n7\n |  = 8 +  | ![√]({{ images_dir }}/symbol_radic.gif)23—4
-  |\n| <var>a</var><sub>4</sub> = 8, |   | \n1  \n ![√]({{ images_dir }}/symbol_radic.gif)23—4\n
-  |  =  | \n ![√]({{ images_dir }}/symbol_radic.gif)23+4  \n7\n |  = 1 +  | \n ![√]({{
-  images_dir }}/symbol_radic.gif)23—3  \n7\n |\n| <var>a</var><sub>5</sub> = 1, |
-    | \n7  \n ![√]({{ images_dir }}/symbol_radic.gif)23—3\n |  =  | \n7( ![√]({{ images_dir
-  }}/symbol_radic.gif)23+3)  \n14\n |  = 3 +  | \n ![√]({{ images_dir }}/symbol_radic.gif)23—3
-  \ \n2\n |\n| <var>a</var><sub>6</sub> = 3, |   | \n2  \n ![√]({{ images_dir }}/symbol_radic.gif)23—3\n
-  |  =  | \n2( ![√]({{ images_dir }}/symbol_radic.gif)23+3)  \n14\n |  = 1 +  | \n
-  ![√]({{ images_dir }}/symbol_radic.gif)23—4  \n7\n |\n| <var>a</var><sub>7</sub>
-  = 1, |   | \n7  \n ![√]({{ images_dir }}/symbol_radic.gif)23—4\n |  =  | \n7( ![√]({{
-  images_dir }}/symbol_radic.gif)23+4)  \n7\n |  = 8 +  | ![√]({{ images_dir }}/symbol_radic.gif)23—4
-  |\n\nIt can be seen that the sequence is repeating. For conciseness, we use the
-  notation ![√]({{ images_dir }}/symbol_radic.gif)23 = [4;(1,3,1,8)], to indicate
+  be written in the form:\n\n| √<var>N</var> = <var>a</var><sub>0</sub> + | \n1\n
+  |\n| &nbsp; | <var>a</var><sub>1</sub> + | \n1\n |\n| &nbsp; | &nbsp; | <var>a</var><sub>2</sub>
+  + | \n1\n |\n| &nbsp; | &nbsp; | &nbsp; | <var>a</var><sub>3</sub> + ... |\n\nFor
+  example, let us consider √23:\n\n| √23 = 4 + √23 — 4 = 4 +&nbsp; | \n1\n | &nbsp;=
+  4 +&nbsp; | \n1\n |\n| &nbsp; | \n1  \n√23—4\n | &nbsp; | 1 +&nbsp; | \n√23 – 3
+  \ \n7\n |\n\nIf we continue we would get the following expansion:\n\n| √23 = 4 +
+  | \n1\n |\n| &nbsp; | 1 + | \n1\n |\n| &nbsp; | &nbsp; | 3 + | \n1\n |\n| &nbsp;
+  | &nbsp; | &nbsp; | 1 + | \n1\n |\n| &nbsp; | &nbsp; | &nbsp; | &nbsp; | 8 + ...
+  |\n\nThe process can be summarised as follows:\n\n| <var>a</var><sub>0</sub> = 4,
+  | &nbsp; | \n1  \n√23—4\n | &nbsp;=&nbsp; | \n√23+4  \n7\n | &nbsp;=&nbsp;1 +&nbsp;
+  | \n√23—3  \n7\n |\n| <var>a</var><sub>1</sub> = 1, | &nbsp; | \n7  \n√23—3\n |
+  &nbsp;=&nbsp; | \n7(√23+3)  \n14\n | &nbsp;=&nbsp;3 +&nbsp; | \n√23—3  \n2\n |\n|
+  <var>a</var><sub>2</sub> = 3, | &nbsp; | \n2  \n√23—3\n | &nbsp;=&nbsp; | \n2(√23+3)
+  \ \n14\n | &nbsp;=&nbsp;1 +&nbsp; | \n√23—4  \n7\n |\n| <var>a</var><sub>3</sub>
+  = 1, | &nbsp; | \n7  \n√23—4\n | &nbsp;=&nbsp; | \n7(√23+4)  \n7\n | &nbsp;=&nbsp;8
+  +&nbsp; | √23—4 |\n| <var>a</var><sub>4</sub> = 8, | &nbsp; | \n1  \n√23—4\n | &nbsp;=&nbsp;
+  | \n√23+4  \n7\n | &nbsp;=&nbsp;1 +&nbsp; | \n√23—3  \n7\n |\n| <var>a</var><sub>5</sub>
+  = 1, | &nbsp; | \n7  \n√23—3\n | &nbsp;=&nbsp; | \n7(√23+3)  \n14\n | &nbsp;=&nbsp;3
+  +&nbsp; | \n√23—3  \n2\n |\n| <var>a</var><sub>6</sub> = 3, | &nbsp; | \n2  \n√23—3\n
+  | &nbsp;=&nbsp; | \n2(√23+3)  \n14\n | &nbsp;=&nbsp;1 +&nbsp; | \n√23—4  \n7\n |\n|
+  <var>a</var><sub>7</sub> = 1, | &nbsp; | \n7  \n√23—4\n | &nbsp;=&nbsp; | \n7(√23+4)
+  \ \n7\n | &nbsp;=&nbsp;8 +&nbsp; | √23—4 |\n\nIt can be seen that the sequence is
+  repeating. For conciseness, we use the notation √23 = [4;(1,3,1,8)], to indicate
   that the block (1,3,1,8) repeats indefinitely.\n\nThe first ten continued fraction
-  representations of (irrational) square roots are:\n\n![√]({{ images_dir }}/symbol_radic.gif)2=[1;(2)],
-  period=1  \n ![√]({{ images_dir }}/symbol_radic.gif)3=[1;(1,2)], period=2  \n ![√]({{
-  images_dir }}/symbol_radic.gif)5=[2;(4)], period=1  \n ![√]({{ images_dir }}/symbol_radic.gif)6=[2;(2,4)],
-  period=2  \n ![√]({{ images_dir }}/symbol_radic.gif)7=[2;(1,1,1,4)], period=4  \n
-  ![√]({{ images_dir }}/symbol_radic.gif)8=[2;(1,4)], period=2  \n ![√]({{ images_dir
-  }}/symbol_radic.gif)10=[3;(6)], period=1  \n ![√]({{ images_dir }}/symbol_radic.gif)11=[3;(3,6)],
-  period=2  \n ![√]({{ images_dir }}/symbol_radic.gif)12= [3;(2,6)], period=2  \n
-  ![√]({{ images_dir }}/symbol_radic.gif)13=[3;(1,1,1,1,6)], period=5\n\nExactly four
-  continued fractions, for <var>N</var> ![≤]({{ images_dir }}/symbol_le.gif) 13, have
-  an odd period.\n\nHow many continued fractions for <var>N</var> ![≤]({{ images_dir
-  }}/symbol_le.gif) 10000 have an odd period?\n\n"
+  representations of (irrational) square roots are:\n\n√2=[1;(2)], period=1  \n√3=[1;(1,2)],
+  period=2  \n√5=[2;(4)], period=1  \n√6=[2;(2,4)], period=2  \n√7=[2;(1,1,1,4)],
+  period=4  \n√8=[2;(1,4)], period=2  \n√10=[3;(6)], period=1  \n√11=[3;(3,6)], period=2
+  \ \n√12= [3;(2,6)], period=2  \n√13=[3;(1,1,1,1,6)], period=5\n\nExactly four continued
+  fractions, for <var>N</var> ≤ 13, have an odd period.\n\nHow many continued fractions
+  for <var>N</var> ≤ 10000 have an odd period?\n\n"

data/data/problems/65.yml

@@ -1,25 +1,25 @@
 ---
 :id: 65
 :name: Convergents of e
-:url: http://projecteuler.net/problem=65
+:url: https://projecteuler.net/problem=65
 :content: "The square root of 2 can be written as an infinite continued fraction.\n\n|
-  ![√]({{ images_dir }}/symbol_radic.gif)2 = 1 + | \n1\n |\n|   | 2 + | \n1\n |\n|
-    |   | 2 + | \n1\n |\n|   |   |   | 2 + | \n1\n |\n|   |   |   |   | 2 + ... |\n\nThe
-  infinite continued fraction can be written, ![√]({{ images_dir }}/symbol_radic.gif)2
-  = [1;(2)], (2) indicates that 2 repeats _ad infinitum_. In a similar way, ![√]({{
-  images_dir }}/symbol_radic.gif)23 = [4;(1,3,1,8)].\n\nIt turns out that the sequence
-  of partial values of continued fractions for square roots provide the best rational
-  approximations. Let us consider the convergents for ![√]({{ images_dir }}/symbol_radic.gif)2.\n\n|
-  1 + | \n1\n | = 3/2 |\n|   | \n2\n |   |\n\n| 1 + | \n1\n | = 7/5 |\n|   | 2 + |
-  \n1\n |\n|   |   | \n2\n |   |\n\n| 1 + | \n1\n | = 17/12 |\n|   | 2 + | \n1\n |
-    |\n|   |   | 2 + | \n1\n |   |\n|   |   |   | \n2\n |   |\n\n| 1 + | \n1\n | =
-  41/29 |\n|   | 2 + | \n1\n |\n|   |   | 2 + | \n1\n |   |\n|   |   |   | 2 + | \n1\n
-  |   |\n|   |   |   |   | \n2\n |   |\n\nHence the sequence of the first ten convergents
-  for ![√]({{ images_dir }}/symbol_radic.gif)2 are:\n\n1, 3/2, 7/5, 17/12, 41/29,
-  99/70, 239/169, 577/408, 1393/985, 3363/2378, ...\n\nWhat is most surprising is
-  that the important mathematical constant,  \n_e_ = [2; 1,2,1, 1,4,1, 1,6,1 , ...
-  , 1,2_k_,1, ...].\n\nThe first ten terms in the sequence of convergents for _e_
-  are:\n\n2, 3, 8/3, 11/4, 19/7, 87/32, 106/39, 193/71, 1264/465, 1457/536, ...\n\nThe
-  sum of digits in the numerator of the 10<sup>th</sup> convergent is 1+4+5+7=17.\n\nFind
+  √2 = 1 + | \n1\n |\n| &nbsp; | 2 + | \n1\n |\n| &nbsp; | &nbsp; | 2 + | \n1\n |\n|
+  &nbsp; | &nbsp; | &nbsp; | 2 + | \n1\n |\n| &nbsp; | &nbsp; | &nbsp; | &nbsp; |
+  2 + ... |\n\nThe infinite continued fraction can be written, √2 = [1;(2)], (2) indicates
+  that 2 repeats _ad infinitum_. In a similar way, √23 = [4;(1,3,1,8)].\n\nIt turns
+  out that the sequence of partial values of continued fractions for square roots
+  provide the best rational approximations. Let us consider the convergents for √2.\n\n|
+  1 + | \n1\n | = 3/2 |\n| &nbsp; | \n2\n | &nbsp; |\n\n| 1 + | \n1\n | = 7/5 |\n|
+  &nbsp; | 2 + | \n1\n |\n| &nbsp; | &nbsp; | \n2\n | &nbsp; |\n\n| 1 + | \n1\n |
+  = 17/12 |\n| &nbsp; | 2 + | \n1\n | &nbsp; |\n| &nbsp; | &nbsp; | 2 + | \n1\n |
+  &nbsp; |\n| &nbsp; | &nbsp; | &nbsp; | \n2\n | &nbsp; |\n\n| 1 + | \n1\n | = 41/29
+  |\n| &nbsp; | 2 + | \n1\n |\n| &nbsp; | &nbsp; | 2 + | \n1\n | &nbsp; |\n| &nbsp;
+  | &nbsp; | &nbsp; | 2 + | \n1\n | &nbsp; |\n| &nbsp; | &nbsp; | &nbsp; | &nbsp;
+  | \n2\n | &nbsp; |\n\nHence the sequence of the first ten convergents for √2 are:\n\n1,
+  3/2, 7/5, 17/12, 41/29, 99/70, 239/169, 577/408, 1393/985, 3363/2378, ...\n\nWhat
+  is most surprising is that the important mathematical constant,  \n_e_ = [2; 1,2,1,
+  1,4,1, 1,6,1 , ... , 1,2_k_,1, ...].\n\nThe first ten terms in the sequence of convergents
+  for _e_ are:\n\n2, 3, 8/3, 11/4, 19/7, 87/32, 106/39, 193/71, 1264/465, 1457/536,
+  ...\n\nThe sum of digits in the numerator of the 10<sup>th</sup> convergent is 1+4+5+7=17.\n\nFind
   the sum of digits in the numerator of the 100<sup>th</sup> convergent of the continued
   fraction for _e_.\n\n"

data/data/problems/66.yml

@@ -1,17 +1,14 @@
 ---
 :id: 66
 :name: Diophantine equation
-:url: http://projecteuler.net/problem=66
+:url: https://projecteuler.net/problem=66
 :content: "Consider quadratic Diophantine equations of the form:\n\n_x_<sup>2</sup>
   – D_y_<sup>2</sup> = 1\n\nFor example, when D=13, the minimal solution in _x_ is
-  649<sup>2</sup> – 13 ![×]({{ images_dir }}/symbol_times.gif)180<sup>2</sup> = 1.\n\nIt
-  can be assumed that there are no solutions in positive integers when D is square.\n\nBy
-  finding minimal solutions in _x_ for D = {2, 3, 5, 6, 7}, we obtain the following:\n\n3<sup>2</sup>
-  – 2 ![×]({{ images_dir }}/symbol_times.gif)2<sup>2</sup> = 1  \n\r2<sup>2</sup>
-  – 3 ![×]({{ images_dir }}/symbol_times.gif)1<sup>2</sup> = 1  \n9<sup>2</sup> –
-  5 ![×]({{ images_dir }}/symbol_times.gif)4<sup>2</sup> = 1  \n\r5<sup>2</sup> –
-  6 ![×]({{ images_dir }}/symbol_times.gif)2<sup>2</sup> = 1  \n\r8<sup>2</sup> –
-  7 ![×]({{ images_dir }}/symbol_times.gif)3<sup>2</sup> = 1\n\nHence, by considering
-  minimal solutions in _x_ for D ![≤]({{ images_dir }}/symbol_le.gif) 7, the largest
-  _x_ is obtained when D=5.\n\nFind the value of D ![≤]({{ images_dir }}/symbol_le.gif)
-  1000 in minimal solutions of _x_ for which the largest value of _x_ is obtained.\n\n"
+  649<sup>2</sup> – 13×180<sup>2</sup> = 1.\n\nIt can be assumed that there are no
+  solutions in positive integers when D is square.\n\nBy finding minimal solutions
+  in _x_ for D = {2, 3, 5, 6, 7}, we obtain the following:\n\n3<sup>2</sup> – 2×2<sup>2</sup>
+  = 1  \n2<sup>2</sup> – 3×1<sup>2</sup> = 1  \n9<sup>2</sup> – 5×4<sup>2</sup> =
+  1  \n5<sup>2</sup> – 6×2<sup>2</sup> = 1  \n8<sup>2</sup> – 7×3<sup>2</sup> = 1\n\nHence,
+  by considering minimal solutions in _x_ for D ≤ 7, the largest _x_ is obtained when
+  D=5.\n\nFind the value of D ≤ 1000 in minimal solutions of _x_ for which the largest
+  value of _x_ is obtained.\n\n"

data/data/problems/67.yml

@@ -1,14 +1,14 @@
 ---
 :id: 67
 :name: Maximum path sum II
-:url: http://projecteuler.net/problem=67
+:url: https://projecteuler.net/problem=67
 :content: "By starting at the top of the triangle below and moving to adjacent numbers
   on the row below, the maximum total from top to bottom is 23.\n\n**3**  \n**7**
-  4  \n\r2 **4** 6  \n\r8 5 **9** 3\n\nThat is, 3 + 7 + 4 + 9 = 23.\n\nFind the maximum
-  total from top to bottom in [triangle.txt](project/triangle.txt) (right click and
-  'Save Link/Target As...'), a 15K text file containing a triangle with one-hundred
-  rows.\n\n**NOTE:** This is a much more difficult version of [Problem 18](problem=18).
-  It is not possible to try every route to solve this problem, as there are 2<sup>99</sup>
-  altogether! If you could check one trillion (10<sup>12</sup>) routes every second
-  it would take over twenty billion years to check them all. There is an efficient
-  algorithm to solve it. ;o)\n\n"
+  4  \n2 **4** 6  \n8 5 **9** 3\n\nThat is, 3 + 7 + 4 + 9 = 23.\n\nFind the maximum
+  total from top to bottom in [triangle.txt](project/resources/p067_triangle.txt)
+  (right click and 'Save Link/Target As...'), a 15K text file containing a triangle
+  with one-hundred rows.\n\n**NOTE:** This is a much more difficult version of [Problem
+  18](problem=18). It is not possible to try every route to solve this problem, as
+  there are 2<sup>99</sup> altogether! If you could check one trillion (10<sup>12</sup>)
+  routes every second it would take over twenty billion years to check them all. There
+  is an efficient algorithm to solve it. ;o)\n\n"

data/data/problems/68.yml

@@ -1,9 +1,9 @@
 ---
 :id: 68
 :name: Magic 5-gon ring
-:url: http://projecteuler.net/problem=68
+:url: https://projecteuler.net/problem=68
 :content: "Consider the following \"magic\" 3-gon ring, filled with the numbers 1
-  to 6, and each line adding to nine.\n\n ![]({{ images_dir }}/p_068_1.gif)  \n\nWorking
+  to 6, and each line adding to nine.\n\n ![]({{ images_dir }}/p068_1.gif)  \n\nWorking
   **clockwise** , and starting from the group of three with the numerically lowest
   external node (4,3,2 in this example), each solution can be described uniquely.
   For example, the above solution can be described by the set: 4,3,2; 6,2,1; 5,1,3.\n\nIt
@@ -15,4 +15,4 @@
   each group it is possible to form 9-digit strings; the maximum string for a 3-gon
   ring is 432621513.\n\nUsing the numbers 1 to 10, and depending on arrangements,
   it is possible to form 16- and 17-digit strings. What is the maximum **16-digit**
-  string for a \"magic\" 5-gon ring?\n\n ![]({{ images_dir }}/p_068_2.gif)  \n\n"
+  string for a \"magic\" 5-gon ring?\n\n ![]({{ images_dir }}/p068_2.gif)  \n\n"

data/data/problems/69.yml

@@ -1,7 +1,7 @@
 ---
 :id: 69
 :name: Totient maximum
-:url: http://projecteuler.net/problem=69
+:url: https://projecteuler.net/problem=69
 :content: |+
   Euler's Totient function, φ(_n_) [sometimes called the phi function], is used to determine the number of numbers less than _n_ which are relatively prime to _n_. For example, as 1, 2, 4, 5, 7, and 8, are all less than nine and relatively prime to nine, φ(9)=6.
 
@@ -16,7 +16,7 @@
   | 9 | 1,2,4,5,7,8 | 6 | 1.5 |
   | 10 | 1,3,7,9 | 4 | 2.5 |
 
-  It can be seen that _n_=6 produces a maximum _n_/φ(_n_) for _n_ ![≤]({{ images_dir }}/symbol_le.gif) 10.
+  It can be seen that _n_=6 produces a maximum _n_/φ(_n_) for _n_ ≤ 10.
 
-  Find the value of _n_ ![≤]({{ images_dir }}/symbol_le.gif) 1,000,000 for which _n_/φ(_n_) is a maximum.
+  Find the value of _n_ ≤ 1,000,000 for which _n_/φ(_n_) is a maximum.
 

data/data/problems/7.yml

@@ -1,7 +1,7 @@
 ---
 :id: 7
 :name: 10001st prime
-:url: http://projecteuler.net/problem=7
+:url: https://projecteuler.net/problem=7
 :content: |+
   By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.
 

data/data/problems/70.yml

@@ -1,13 +1,13 @@
 ---
 :id: 70
 :name: Totient permutation
-:url: http://projecteuler.net/problem=70
+:url: https://projecteuler.net/problem=70
 :content: "Euler's Totient function, φ(<var>n</var>) [sometimes called the phi function],
   is used to determine the number of positive numbers less than or equal to <var>n</var>
   which are relatively prime to <var>n</var>. For example, as 1, 2, 4, 5, 7, and 8,
   are all less than nine and relatively prime to nine, φ(9)=6.  \nThe number 1 is
   considered to be relatively prime to every positive number, so φ(1)=1.\n\nInterestingly,
   φ(87109)=79180, and it can be seen that 87109 is a permutation of 79180.\n\nFind
-  the value of <var>n</var>, 1 ![<]({{ images_dir }}/symbol_lt.gif) <var>n</var> ![<]({{
-  images_dir }}/symbol_lt.gif) 10<sup>7</sup>, for which φ(<var>n</var>) is a permutation
-  of <var>n</var> and the ratio <var>n</var>/φ(<var>n</var>) produces a minimum.\n\n"
+  the value of <var>n</var>, 1 \\< <var>n</var> \\< 10<sup>7</sup>, for which φ(<var>n</var>)
+  is a permutation of <var>n</var> and the ratio <var>n</var>/φ(<var>n</var>) produces
+  a minimum.\n\n"

data/data/problems/71.yml

@@ -1,15 +1,15 @@
 ---
 :id: 71
 :name: Ordered fractions
-:url: http://projecteuler.net/problem=71
+:url: https://projecteuler.net/problem=71
 :content: |+
-  Consider the fraction, _n/d_, where _n_ and _d_ are positive integers. If _n_ ![<]({{ images_dir }}/symbol_lt.gif)_d_ and HCF(_n,d_)=1, it is called a reduced proper fraction.
+  Consider the fraction, _n/d_, where _n_ and _d_ are positive integers. If _n_\<_d_ and HCF(_n,d_)=1, it is called a reduced proper fraction.
 
-  If we list the set of reduced proper fractions for _d_ ![≤]({{ images_dir }}/symbol_le.gif) 8 in ascending order of size, we get:
+  If we list the set of reduced proper fractions for _d_ ≤ 8 in ascending order of size, we get:
 
   1/8, 1/7, 1/6, 1/5, 1/4, 2/7, 1/3, 3/8, **2/5** , 3/7, 1/2, 4/7, 3/5, 5/8, 2/3, 5/7, 3/4, 4/5, 5/6, 6/7, 7/8
 
   It can be seen that 2/5 is the fraction immediately to the left of 3/7.
 
-  By listing the set of reduced proper fractions for _d_ ![≤]({{ images_dir }}/symbol_le.gif) 1,000,000 in ascending order of size, find the numerator of the fraction immediately to the left of 3/7.
+  By listing the set of reduced proper fractions for _d_ ≤ 1,000,000 in ascending order of size, find the numerator of the fraction immediately to the left of 3/7.
 

data/data/problems/72.yml

@@ -1,15 +1,15 @@
 ---
 :id: 72
 :name: Counting fractions
-:url: http://projecteuler.net/problem=72
+:url: https://projecteuler.net/problem=72
 :content: |+
-  Consider the fraction, _n/d_, where _n_ and _d_ are positive integers. If _n_ ![<]({{ images_dir }}/symbol_lt.gif)_d_ and HCF(_n,d_)=1, it is called a reduced proper fraction.
+  Consider the fraction, _n/d_, where _n_ and _d_ are positive integers. If _n_\<_d_ and HCF(_n,d_)=1, it is called a reduced proper fraction.
 
-  If we list the set of reduced proper fractions for _d_ ![≤]({{ images_dir }}/symbol_le.gif) 8 in ascending order of size, we get:
+  If we list the set of reduced proper fractions for _d_ ≤ 8 in ascending order of size, we get:
 
   1/8, 1/7, 1/6, 1/5, 1/4, 2/7, 1/3, 3/8, 2/5, 3/7, 1/2, 4/7, 3/5, 5/8, 2/3, 5/7, 3/4, 4/5, 5/6, 6/7, 7/8
 
   It can be seen that there are 21 elements in this set.
 
-  How many elements would be contained in the set of reduced proper fractions for _d_ ![≤]({{ images_dir }}/symbol_le.gif) 1,000,000?
+  How many elements would be contained in the set of reduced proper fractions for _d_ ≤ 1,000,000?
 

data/data/problems/73.yml

@@ -1,15 +1,15 @@
 ---
 :id: 73
 :name: Counting fractions in a range
-:url: http://projecteuler.net/problem=73
+:url: https://projecteuler.net/problem=73
 :content: |+
-  Consider the fraction, _n/d_, where _n_ and _d_ are positive integers. If _n_ ![<]({{ images_dir }}/symbol_lt.gif)_d_ and HCF(_n,d_)=1, it is called a reduced proper fraction.
+  Consider the fraction, _n/d_, where _n_ and _d_ are positive integers. If _n_\<_d_ and HCF(_n,d_)=1, it is called a reduced proper fraction.
 
-  If we list the set of reduced proper fractions for _d_ ![≤]({{ images_dir }}/symbol_le.gif) 8 in ascending order of size, we get:
+  If we list the set of reduced proper fractions for _d_ ≤ 8 in ascending order of size, we get:
 
   1/8, 1/7, 1/6, 1/5, 1/4, 2/7, 1/3, **3/8, 2/5, 3/7** , 1/2, 4/7, 3/5, 5/8, 2/3, 5/7, 3/4, 4/5, 5/6, 6/7, 7/8
 
   It can be seen that there are 3 fractions between 1/3 and 1/2.
 
-  How many fractions lie between 1/3 and 1/2 in the sorted set of reduced proper fractions for _d_ ![≤]({{ images_dir }}/symbol_le.gif) 12,000?
+  How many fractions lie between 1/3 and 1/2 in the sorted set of reduced proper fractions for _d_ ≤ 12,000?