euler-manager 0.1.1 → 0.2.0

data/data/problems/124.yml

@@ -1,23 +1,21 @@
 ---
 :id: 124
 :name: Ordered radicals
-:url: http://projecteuler.net/problem=124
+:url: https://projecteuler.net/problem=124
 :content: "The radical of _n_, rad(_n_), is the product of the distinct prime factors
-  of _n_. For example, 504 = 2<sup>3</sup> ![×]({{ images_dir }}/symbol_times.gif)
-  3<sup>2</sup> ![×]({{ images_dir }}/symbol_times.gif) 7, so rad(504) = 2 ![×]({{
-  images_dir }}/symbol_times.gif) 3 ![×]({{ images_dir }}/symbol_times.gif) 7 = 42.\n\nIf
-  we calculate rad(_n_) for _1_ ![≤]({{ images_dir }}/symbol_le.gif) _n_ ![≤]({{ images_dir
-  }}/symbol_le.gif) 10, then sort them on rad(_n_), and sorting on _n_ if the radical
-  values are equal, we get:\n\n| \n**Unsorted**\n |   | \n**Sorted**\n |\n| \n ![]({{
-  images_dir }}/spacer.gif)  \n**_n_**\n | \n ![]({{ images_dir }}/spacer.gif)  \n**rad(_n_)**\n
-  | ![]({{ images_dir }}/spacer.gif)  \n | \n ![]({{ images_dir }}/spacer.gif)  \n**_n_**\n
-  | \n ![]({{ images_dir }}/spacer.gif)  \n**rad(_n_)**\n | \n ![]({{ images_dir }}/spacer.gif)
-  \ \n**k**\n |\n| \n1\n | \n1\n |   | \n1\n | \n1\n | \n1\n |\n| \n2\n | \n2\n |
-    | \n2\n | \n2\n | \n2\n |\n| \n3\n | \n3\n |   | \n4\n | \n2\n | \n3\n |\n| \n4\n
-  | \n2\n |   | \n8\n | \n2\n | \n4\n |\n| \n5\n | \n5\n |   | \n3\n | \n3\n | \n5\n
-  |\n| \n6\n | \n6\n |   | \n9\n | \n3\n | \n6\n |\n| \n7\n | \n7\n |   | \n5\n |
-  \n5\n | \n7\n |\n| \n8\n | \n2\n |   | \n6\n | \n6\n | \n8\n |\n| \n9\n | \n3\n
-  |   | \n7\n | \n7\n | \n9\n |\n| \n10\n | \n10\n |   | \n10\n | \n10\n | \n10\n
-  |\n\nLet E(_k_) be the _k_th element in the sorted _n_ column; for example, E(4)
-  = 8 and E(6) = 9.\n\nIf rad(_n_) is sorted for 1 ![≤]({{ images_dir }}/symbol_le.gif)
-  _n_ ![≤]({{ images_dir }}/symbol_le.gif) 100000, find E(10000).\n\n"
+  of _n_. For example, 504 = 2<sup>3</sup> × 3<sup>2</sup> × 7, so rad(504) = 2 ×
+  3 × 7 = 42.\n\nIf we calculate rad(_n_) for _1_ ≤ _n_ ≤ 10, then sort them on rad(_n_),
+  and sorting on _n_ if the radical values are equal, we get:\n\n| \n**Unsorted**\n
+  | &nbsp; | \n**Sorted**\n |\n| \n ![]({{ images_dir }}/spacer.gif)  \n**_n_**\n
+  | \n ![]({{ images_dir }}/spacer.gif)  \n**rad(_n_)**\n | ![]({{ images_dir }}/spacer.gif)
+  \ \n | \n ![]({{ images_dir }}/spacer.gif)  \n**_n_**\n | \n ![]({{ images_dir }}/spacer.gif)
+  \ \n**rad(_n_)**\n | \n ![]({{ images_dir }}/spacer.gif)  \n**k**\n |\n| \n1\n |
+  \n1\n | &nbsp; | \n1\n | \n1\n | \n1\n |\n| \n2\n | \n2\n | &nbsp; | \n2\n | \n2\n
+  | \n2\n |\n| \n3\n | \n3\n | &nbsp; | \n4\n | \n2\n | \n3\n |\n| \n4\n | \n2\n |
+  &nbsp; | \n8\n | \n2\n | \n4\n |\n| \n5\n | \n5\n | &nbsp; | \n3\n | \n3\n | \n5\n
+  |\n| \n6\n | \n6\n | &nbsp; | \n9\n | \n3\n | \n6\n |\n| \n7\n | \n7\n | &nbsp;
+  | \n5\n | \n5\n | \n7\n |\n| \n8\n | \n2\n | &nbsp; | \n6\n | \n6\n | \n8\n |\n|
+  \n9\n | \n3\n | &nbsp; | \n7\n | \n7\n | \n9\n |\n| \n10\n | \n10\n | &nbsp; | \n10\n
+  | \n10\n | \n10\n |\n\nLet E(_k_) be the _k_th element in the sorted _n_ column;
+  for example, E(4) = 8 and E(6) = 9.\n\nIf rad(_n_) is sorted for 1 ≤ _n_ ≤ 100000,
+  find E(10000).\n\n"

data/data/problems/125.yml

@@ -1,7 +1,7 @@
 ---
 :id: 125
 :name: Palindromic sums
-:url: http://projecteuler.net/problem=125
+:url: https://projecteuler.net/problem=125
 :content: |+
   The palindromic number 595 is interesting because it can be written as the sum of consecutive squares: 6<sup>2</sup> + 7<sup>2</sup> + 8<sup>2</sup> + 9<sup>2</sup> + 10<sup>2</sup> + 11<sup>2</sup> + 12<sup>2</sup>.
 

data/data/problems/126.yml

@@ -1,15 +1,16 @@
 ---
 :id: 126
 :name: Cuboid layers
-:url: http://projecteuler.net/problem=126
+:url: https://projecteuler.net/problem=126
 :content: "The minimum number of cubes to cover every visible face on a cuboid measuring
-  3 x 2 x 1 is twenty-two.\n\n ![]({{ images_dir }}/p_126.gif)  \n\nIf we then add
-  a second layer to this solid it would require forty-six cubes to cover every visible
-  face, the third layer would require seventy-eight cubes, and the fourth layer would
-  require one-hundred and eighteen cubes to cover every visible face.\n\nHowever,
-  the first layer on a cuboid measuring 5 x 1 x 1 also requires twenty-two cubes;
-  similarly the first layer on cuboids measuring 5 x 3 x 1, 7 x 2 x 1, and 11 x 1 x 1
-  all contain forty-six cubes.\n\nWe shall define C(_n_) to represent the number of
-  cuboids that contain _n_ cubes in one of its layers. So C(22) = 2, C(46) = 4, C(78)
-  = 5, and C(118) = 8.\n\nIt turns out that 154 is the least value of _n_ for which
-  C(_n_) = 10.\n\nFind the least value of _n_ for which C(_n_) = 1000.\n\n"
+  3 x 2 x 1 is twenty-two.\n\n ![]({{ images_dir }}/p126.gif)
+  \ \n\nIf we then add a second layer to this solid it would require forty-six cubes
+  to cover every visible face, the third layer would require seventy-eight cubes,
+  and the fourth layer would require one-hundred and eighteen cubes to cover every
+  visible face.\n\nHowever, the first layer on a cuboid measuring 5 x 1 x 1
+  also requires twenty-two cubes; similarly the first layer on cuboids measuring 5 x 3 x 1,
+  7 x 2 x 1, and 11 x 1 x 1 all contain forty-six
+  cubes.\n\nWe shall define C(_n_) to represent the number of cuboids that contain
+  _n_ cubes in one of its layers. So C(22) = 2, C(46) = 4, C(78) = 5, and C(118) =
+  8.\n\nIt turns out that 154 is the least value of _n_ for which C(_n_) = 10.\n\nFind
+  the least value of _n_ for which C(_n_) = 1000.\n\n"

data/data/problems/127.yml

@@ -1,25 +1,25 @@
 ---
 :id: 127
 :name: abc-hits
-:url: http://projecteuler.net/problem=127
+:url: https://projecteuler.net/problem=127
 :content: |+
-  The radical of _n_, rad(_n_), is the product of distinct prime factors of _n_. For example, 504 = 2<sup>3</sup> ![×]({{ images_dir }}/symbol_times.gif) 3<sup>2</sup> ![×]({{ images_dir }}/symbol_times.gif) 7, so rad(504) = 2 ![×]({{ images_dir }}/symbol_times.gif) 3 ![×]({{ images_dir }}/symbol_times.gif) 7 = 42.
+  The radical of _n_, rad(_n_), is the product of distinct prime factors of _n_. For example, 504 = 2<sup>3</sup> × 3<sup>2</sup> × 7, so rad(504) = 2 × 3 × 7 = 42.
 
   We shall define the triplet of positive integers (_a_, _b_, _c_) to be an abc-hit if:
 
   1. GCD(_a,_ _b_) = GCD(_a_, _c_) = GCD(_b_, _c_) = 1
-  2. _a_ ![<]({{ images_dir }}/symbol_lt.gif) _b_
+  2. _a_ \< _b_
   3. _a_ + _b_ = _c_
-  4. rad(_abc_) ![<]({{ images_dir }}/symbol_lt.gif) _c_
+  4. rad(_abc_) \< _c_
 
   For example, (5, 27, 32) is an abc-hit, because:
 
   1. GCD(5, 27) = GCD(5, 32) = GCD(27, 32) = 1
-  2. 5 ![<]({{ images_dir }}/symbol_lt.gif) 27
+  2. 5 \< 27
   3. 5 + 27 = 32
-  4. rad(4320) = 30 ![<]({{ images_dir }}/symbol_lt.gif) 32
+  4. rad(4320) = 30 \< 32
 
-  It turns out that abc-hits are quite rare and there are only thirty-one abc-hits for _c_ ![<]({{ images_dir }}/symbol_lt.gif) 1000, with ![∑]({{ images_dir }}/symbol_sum.gif)_c_ = 12523.
+  It turns out that abc-hits are quite rare and there are only thirty-one abc-hits for _c_ \< 1000, with ∑_c_ = 12523.
 
-  Find ![∑]({{ images_dir }}/symbol_sum.gif)_c_ for _c_ ![<]({{ images_dir }}/symbol_lt.gif) 120000.
+  Find ∑_c_ for _c_ \< 120000.
 

data/data/problems/128.yml

@@ -1,15 +1,15 @@
 ---
 :id: 128
 :name: Hexagonal tile differences
-:url: http://projecteuler.net/problem=128
+:url: https://projecteuler.net/problem=128
 :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.
 
-   ![]({{ images_dir }}/p_128.gif)
+   ![]({{ images_dir }}/p128.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.
+  By finding the difference between tile _n_ and each of 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.
 

data/data/problems/129.yml

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

data/data/problems/13.yml

@@ -1,7 +1,7 @@
 ---
 :id: 13
 :name: Large sum
-:url: http://projecteuler.net/problem=13
+:url: https://projecteuler.net/problem=13
 :content: "Work out the first ten digits of the sum of the following one-hundred 50-digit
   numbers.\n\n37107287533902102798797998220837590246510135740250  \n46376937677490009712648124896970078050417018260538
   \ \n74324986199524741059474233309513058123726617309629  \n91942213363574161572522430563301811072406154908250

data/data/problems/130.yml

@@ -1,15 +1,14 @@
 ---
 :id: 130
 :name: Composites with prime repunit property
-:url: http://projecteuler.net/problem=130
+:url: https://projecteuler.net/problem=130
 :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_ ![>]({{ images_dir }}/symbol_gt.gif) 5, that _p_ ![−]({{ images_dir
-  }}/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_ ![−]({{ images_dir }}/symbol_minus.gif) 1 is divisible by A(_n_).\n\n"
+  for all primes, _p_ \\> 5, that _p_ − 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_ − 1 is divisible by A(_n_).\n\n"

data/data/problems/131.yml

@@ -1,11 +1,11 @@
 ---
 :id: 131
 :name: Prime cube partnership
-:url: http://projecteuler.net/problem=131
+:url: https://projecteuler.net/problem=131
 :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> ![×]({{ images_dir }}/symbol_times.gif)19 = 12<sup>3</sup>.
+  For example, when _p_ = 19, 8<sup>3</sup> + 8<sup>2</sup>×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.
 

data/data/problems/132.yml

@@ -1,11 +1,11 @@
 ---
 :id: 132
 :name: Large repunit factors
-:url: http://projecteuler.net/problem=132
+:url: https://projecteuler.net/problem=132
 :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 ![×]({{ images_dir }}/symbol_times.gif)41 ![×]({{ images_dir }}/symbol_times.gif)271 ![×]({{ images_dir }}/symbol_times.gif)9091, and the sum of these prime factors is 9414.
+  For example, R(10) = 1111111111 = 11×41×271×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

@@ -1,13 +1,13 @@
 ---
 :id: 133
 :name: Repunit nonfactors
-:url: http://projecteuler.net/problem=133
+:url: https://projecteuler.net/problem=133
 :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>).
+  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 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

@@ -1,11 +1,11 @@
 ---
 :id: 134
 :name: Prime pair connection
-:url: http://projecteuler.net/problem=134
+:url: https://projecteuler.net/problem=134
 :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> ![>]({{ images_dir }}/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_.
+  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> \> _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 ![∑]({{ images_dir }}/symbol_sum.gif) _S_ for every pair of consecutive primes with 5 ![≤]({{ images_dir }}/symbol_le.gif) _p_<sub>1</sub> ![≤]({{ images_dir }}/symbol_le.gif) 1000000.
+  Find ∑ _S_ for every pair of consecutive primes with 5 ≤ _p_<sub>1</sub> ≤ 1000000.
 

data/data/problems/135.yml

@@ -1,11 +1,11 @@
 ---
 :id: 135
 :name: Same differences
-:url: http://projecteuler.net/problem=135
+:url: https://projecteuler.net/problem=135
 :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> ![−]({{ images_dir }}/symbol_minus.gif) _y_<sup>2</sup> ![−]({{ images_dir }}/symbol_minus.gif) _z_<sup>2</sup> = _n_, has exactly two solutions is _n_ = 27:
+  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> − _y_<sup>2</sup> − _z_<sup>2</sup> = _n_, has exactly two solutions is _n_ = 27:
 
-  34<sup>2</sup> ![−]({{ images_dir }}/symbol_minus.gif) 27<sup>2</sup> ![−]({{ images_dir }}/symbol_minus.gif) 20<sup>2</sup> = 12<sup>2</sup> ![−]({{ images_dir }}/symbol_minus.gif) 9<sup>2</sup> ![−]({{ images_dir }}/symbol_minus.gif) 6<sup>2</sup> = 27
+  34<sup>2</sup> − 27<sup>2</sup> − 20<sup>2</sup> = 12<sup>2</sup> − 9<sup>2</sup> − 6<sup>2</sup> = 27
 
   It turns out that _n_ = 1155 is the least value which has exactly ten solutions.
 

data/data/problems/136.yml

@@ -1,11 +1,11 @@
 ---
 :id: 136
 :name: Singleton difference
-:url: http://projecteuler.net/problem=136
+:url: https://projecteuler.net/problem=136
 :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> ![−]({{ images_dir }}/symbol_minus.gif) _y_<sup>2</sup> ![−]({{ images_dir }}/symbol_minus.gif) _z_<sup>2</sup> = _n_, has exactly one solution when _n_ = 20:
+  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> − _y_<sup>2</sup> − _z_<sup>2</sup> = _n_, has exactly one solution when _n_ = 20:
 
-  13<sup>2</sup> ![−]({{ images_dir }}/symbol_minus.gif) 10<sup>2</sup> ![−]({{ images_dir }}/symbol_minus.gif) 7<sup>2</sup> = 20
+  13<sup>2</sup> − 10<sup>2</sup> − 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.
 

data/data/problems/137.yml

@@ -1,24 +1,24 @@
 ---
 :id: 137
 :name: Fibonacci golden nuggets
-:url: http://projecteuler.net/problem=137
+:url: https://projecteuler.net/problem=137
 :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.
+  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>−1</sub> + F<sub><i>k</i>−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 |
+  | Surprisingly A<sub>F</sub>(1/2) | &nbsp;=&nbsp; | (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 + ... |
+  | &nbsp; | &nbsp;=&nbsp; | 1/2 + 1/4 + 2/8 + 3/16 + 5/32 + ... |
+  | &nbsp; | &nbsp;=&nbsp; | 2 |
 
   The corresponding values of _x_ for the first five natural numbers are shown below.
 
   | **_x_** | **A<sub>F</sub>(_x_)** |
-  | ![√]({{ images_dir }}/symbol_radic.gif)2 ![−]({{ images_dir }}/symbol_minus.gif)1 | 1 |
+  | √2−1 | 1 |
   | 1/2 | 2 |
-  | ( ![√]({{ images_dir }}/symbol_radic.gif)13 ![−]({{ images_dir }}/symbol_minus.gif)2)/3 | 3 |
-  | ( ![√]({{ images_dir }}/symbol_radic.gif)89 ![−]({{ images_dir }}/symbol_minus.gif)5)/8 | 4 |
-  | ( ![√]({{ images_dir }}/symbol_radic.gif)34 ![−]({{ images_dir }}/symbol_minus.gif)3)/5 | 5 |
+  | (√13−2)/3 | 3 |
+  | (√89−5)/8 | 4 |
+  | (√34−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.
 

data/data/problems/138.yml

@@ -1,15 +1,15 @@
 ---
 :id: 138
 :name: Special isosceles triangles
-:url: http://projecteuler.net/problem=138
+:url: https://projecteuler.net/problem=138
 :content: |+
   Consider the isosceles triangle with base length, _b_ = 16, and legs, L = 17.
 
-   ![]({{ images_dir }}/p_138.gif)
+   ![]({{ images_dir }}/p138.gif)
 
-  By using the Pythagorean theorem it can be seen that the height of the triangle, _h_ = ![√]({{ images_dir }}/symbol_radic.gif)(17<sup>2</sup> ![−]({{ images_dir }}/symbol_minus.gif) 8<sup>2</sup>) = 15, which is one less than the base length.
+  By using the Pythagorean theorem it can be seen that the height of the triangle, _h_ = √(17<sup>2</sup> − 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_ ![±]({{ images_dir }}/symbol_plusmn.gif) 1.
+  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_ ± 1.
 
-  Find ![∑]({{ images_dir }}/symbol_sum.gif) L for the twelve smallest isosceles triangles for which _h_ = _b_ ![±]({{ images_dir }}/symbol_plusmn.gif) 1 and _b_, L are positive integers.
+  Find ∑ L for the twelve smallest isosceles triangles for which _h_ = _b_ ± 1 and _b_, L are positive integers.
 

data/data/problems/139.yml

@@ -1,13 +1,13 @@
 ---
 :id: 139
 :name: Pythagorean tiles
-:url: http://projecteuler.net/problem=139
+:url: https://projecteuler.net/problem=139
 :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.
 
-   ![]({{ images_dir }}/p_139.gif)
+   ![]({{ images_dir }}/p139.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.
 

data/data/problems/14.yml

@@ -1,17 +1,12 @@
 ---
 :id: 14
 :name: Longest Collatz sequence
-:url: http://projecteuler.net/problem=14
+:url: https://projecteuler.net/problem=14
 :content: "The following iterative sequence is defined for the set of positive integers:\n\n<var>n</var>
-  ![→]({{ images_dir }}/symbol_maps.gif) <var>n</var>/2 (<var>n</var> is even)  \n<var>n</var>
-  ![→]({{ images_dir }}/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 ![→]({{
-  images_dir }}/symbol_maps.gif) 40 ![→]({{ images_dir }}/symbol_maps.gif) 20 ![→]({{
-  images_dir }}/symbol_maps.gif) 10 ![→]({{ images_dir }}/symbol_maps.gif) 5 ![→]({{
-  images_dir }}/symbol_maps.gif) 16 ![→]({{ images_dir }}/symbol_maps.gif) 8 ![→]({{
-  images_dir }}/symbol_maps.gif) 4 ![→]({{ images_dir }}/symbol_maps.gif) 2 ![→]({{
-  images_dir }}/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"
+  → <var>n</var>/2 (<var>n</var> is even)  \n<var>n</var> → 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 → 40 → 20 → 10 → 5 → 16 → 8 → 4 → 2 → 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

@@ -1,19 +1,19 @@
 ---
 :id: 140
 :name: Modified Fibonacci golden nuggets
-:url: http://projecteuler.net/problem=140
+:url: https://projecteuler.net/problem=140
 :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, ... .
+  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>−1</sub> + G<sub><i>k</i>−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_)** |
-  | ( ![√]({{ images_dir }}/symbol_radic.gif)5 ![−]({{ images_dir }}/symbol_minus.gif)1)/4 | 1 |
+  | (√5−1)/4 | 1 |
   | 2/5 | 2 |
-  | ( ![√]({{ images_dir }}/symbol_radic.gif)22 ![−]({{ images_dir }}/symbol_minus.gif)2)/6 | 3 |
-  | ( ![√]({{ images_dir }}/symbol_radic.gif)137 ![−]({{ images_dir }}/symbol_minus.gif)5)/14 | 4 |
+  | (√22−2)/6 | 3 |
+  | (√137−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.

data/data/problems/141.yml

@@ -1,12 +1,12 @@
 ---
 :id: 141
 :name: Investigating progressive numbers, _n_, which are also square
-:url: http://projecteuler.net/problem=141
+:url: https://projecteuler.net/problem=141
 :content: "A positive integer, _n_, is divided by _d_ and the quotient and remainder
   are _q_ and _r_ respectively. In addition _d_, _q_, and _r_ are consecutive positive
   integer terms in a geometric sequence, but not necessarily in that order.\n\nFor
   example, 58 divided by 6 has quotient 9 and remainder 4. It can also be seen that
-  4, 6, 9 are consecutive terms in a geometric sequence (common ratio 3/2).  \n\rWe
+  4, 6, 9 are consecutive terms in a geometric sequence (common ratio 3/2).  \nWe
   will call such numbers, _n_, progressive.\n\nSome progressive numbers, such as 9
   and 10404 = 102<sup>2</sup>, happen to also be perfect squares.  \n The sum of all
   progressive perfect squares below one hundred thousand is 124657.\n\nFind the sum

data/data/problems/142.yml

@@ -1,7 +1,6 @@
 ---
 :id: 142
 :name: Perfect Square Collection
-:url: http://projecteuler.net/problem=142
-:content: |+
-  Find the smallest x + y + z with integers x ![>]({{ images_dir }}/symbol_gt.gif) y ![>]({{ images_dir }}/symbol_gt.gif) z ![>]({{ images_dir }}/symbol_gt.gif) 0 such that x + y, x ![−]({{ images_dir }}/symbol_minus.gif) y, x + z, x ![−]({{ images_dir }}/symbol_minus.gif) z, y + z, y ![−]({{ images_dir }}/symbol_minus.gif) z are all perfect squares.
-
+:url: https://projecteuler.net/problem=142
+:content: "Find the smallest x + y + z with integers x \\> y \\> z \\> 0 such that
+  x + y, x − y, x + z, x − z, y + z, y − z are all perfect squares.\n\n"

data/data/problems/143.yml

@@ -1,7 +1,7 @@
 ---
 :id: 143
 :name: Investigating the Torricelli point of a triangle
-:url: http://projecteuler.net/problem=143
+:url: https://projecteuler.net/problem=143
 :content: |+
   Let ABC be a triangle with all interior angles being less than 120 degrees. Let X be any point inside the triangle and let XA = p, XC = q, and XB = r.
 
@@ -9,9 +9,9 @@
 
   Torricelli was able to prove that if equilateral triangles AOB, BNC and AMC are constructed on each side of triangle ABC, the circumscribed circles of AOB, BNC, and AMC will intersect at a single point, T, inside the triangle. Moreover he proved that T, called the Torricelli/Fermat point, minimises p + q + r. Even more remarkable, it can be shown that when the sum is minimised, AN = BM = CO = p + q + r and that AN, BM and CO also intersect at T.
 
-   ![]({{ images_dir }}/p_143_torricelli.gif)
+   ![]({{ images_dir }}/p143_torricelli.gif)
 
   If the sum is minimised and a, b, c, p, q and r are all positive integers we shall call triangle ABC a Torricelli triangle. For example, a = 399, b = 455, c = 511 is an example of a Torricelli triangle, with p + q + r = 784.
 
-  Find the sum of all distinct values of p + q + r ![≤]({{ images_dir }}/symbol_le.gif) 120000 for Torricelli triangles.
+  Find the sum of all distinct values of p + q + r ≤ 120000 for Torricelli triangles.