euler-manager 0.1.1 → 0.2.0

data/data/problems/198.yml

@@ -1,17 +1,11 @@
 ---
 :id: 198
 :name: Ambiguous Numbers
-:url: http://projecteuler.net/problem=198
-:content: "A best approximation to a real number <var>x</var> for the denominator
-  bound <var>d</var> is a rational number <var>r</var>/<var>s</var> (in reduced form)
-  with <var>s</var> ![≤]({{ images_dir }}/symbol_le.gif) <var>d</var>, so that any
-  rational number <var>p</var>/<var>q</var> which is closer to <var>x</var> than <var>r</var>/<var>s</var>
-  has <var>q</var> ![>]({{ images_dir }}/symbol_gt.gif) <var>d</var>.\n\nUsually the
-  best approximation to a real number is uniquely determined for all denominator bounds.
-  However, there are some exceptions, e.g. 9/40 has the two best approximations 1/4
-  and 1/5 for the denominator bound 6.\rWe shall call a real number <var>x</var> _ambiguous_,
-  if there is at least one denominator bound for which <var>x</var> possesses two
-  best approximations. Clearly, an ambiguous number is necessarily rational.\n\nHow
-  many ambiguous numbers <var>x</var> = <var>p</var>/<var>q</var>,\r0 ![<]({{ images_dir
-  }}/symbol_lt.gif) <var>x</var> ![<]({{ images_dir }}/symbol_lt.gif) 1/100, are there
-  whose denominator <var>q</var> does not exceed 10<sup>8</sup>?\n\n"
+:url: https://projecteuler.net/problem=198
+:content: |+
+  A best approximation to a real number <var>x</var> for the denominator bound <var>d</var> is a rational number <var>r</var>/<var>s</var> (in reduced form) with <var>s</var> ≤ <var>d</var>, so that any rational number <var>p</var>/<var>q</var> which is closer to <var>x</var> than <var>r</var>/<var>s</var> has <var>q</var> \> <var>d</var>.
+
+  Usually the best approximation to a real number is uniquely determined for all denominator bounds. However, there are some exceptions, e.g. 9/40 has the two best approximations 1/4 and 1/5 for the denominator bound 6. We shall call a real number <var>x</var> _ambiguous_, if there is at least one denominator bound for which <var>x</var> possesses two best approximations. Clearly, an ambiguous number is necessarily rational.
+
+  How many ambiguous numbers <var>x</var> = <var>p</var>/<var>q</var>, 0 \< <var>x</var> \< 1/100, are there whose denominator <var>q</var> does not exceed 10<sup>8</sup>?
+

data/data/problems/199.yml

@@ -1,14 +1,14 @@
 ---
 :id: 199
 :name: Iterative Circle Packing
-:url: http://projecteuler.net/problem=199
+:url: https://projecteuler.net/problem=199
 :content: "Three circles of equal radius are placed inside a larger circle such that
   each pair of circles is tangent to one another and the inner circles do not overlap.
   There are four uncovered \"gaps\" which are to be filled iteratively with more tangent
-  circles.\n\n ![]({{ images_dir }}/p_199_circles_in_circles.gif)\n\nAt each iteration,
+  circles.\n\n ![]({{ images_dir }}/p199_circles_in_circles.gif)\n\nAt each iteration,
   a maximally sized circle is placed in each gap, which creates more gaps for the
   next iteration. After 3 iterations (pictured), there are 108 gaps and the fraction
   of the area which is not covered by circles is 0.06790342, rounded to eight decimal
   places.\n\nWhat fraction of the area is not covered by circles after 10 iterations?
-  \ \n\rGive your answer rounded to eight decimal places using the format x.xxxxxxxx
+  \ \nGive your answer rounded to eight decimal places using the format x.xxxxxxxx
   .\n\n"

data/data/problems/2.yml

@@ -1,10 +1,11 @@
 ---
 :id: 2
 :name: Even Fibonacci numbers
-:url: http://projecteuler.net/problem=2
-:content: "Each new term in the Fibonacci sequence is generated by adding the previous
-  two terms. By starting with 1 and 2, the first 10 terms will be:\n\n1, 2, 3, 5,
-  8, 13, 21, 34, 55, 89, ...\n\nBy considering the terms in the Fibonacci sequence
-  whose values do not exceed four million, find the sum of the even-valued terms.\n\n<!--\r\nNote:
-  This problem has been changed recently, please check that you are using the right
-  parameters.\r\n-->\n"
+:url: https://projecteuler.net/problem=2
+:content: |+
+  Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:
+
+  1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...
+
+  By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.
+

data/data/problems/20.yml

@@ -1,12 +1,7 @@
 ---
 :id: 20
 :name: Factorial digit sum
-:url: http://projecteuler.net/problem=20
-:content: "_n_! means _n_ ![×]({{ images_dir }}/symbol_times.gif) (_n_ ![−]({{ 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\n\nFor example, 10! = 10 ![×]({{ images_dir }}/symbol_times.gif)
-  9 ![×]({{ images_dir }}/symbol_times.gif) ... ![×]({{ images_dir }}/symbol_times.gif)
-  3 ![×]({{ images_dir }}/symbol_times.gif) 2 ![×]({{ images_dir }}/symbol_times.gif)
-  1 = 3628800,  \nand the sum of the digits in the number 10! is 3 + 6 + 2 + 8 + 8
-  + 0 + 0 = 27.\n\nFind the sum of the digits in the number 100!\n\n"
+:url: https://projecteuler.net/problem=20
+:content: "_n_! means _n_ × (_n_ − 1) × ... × 3 × 2 × 1\n\nFor example, 10! = 10 ×
+  9 × ... × 3 × 2 × 1 = 3628800,  \nand the sum of the digits in the number 10! is
+  3 + 6 + 2 + 8 + 8 + 0 + 0 = 27.\n\nFind the sum of the digits in the number 100!\n\n"

data/data/problems/200.yml

@@ -1,12 +1,11 @@
 ---
 :id: 200
 :name: Find the 200th prime-proof sqube containing the contiguous sub-string "200"
-:url: http://projecteuler.net/problem=200
+:url: https://projecteuler.net/problem=200
 :content: "We shall define a sqube to be a number of the form, <var>p</var><sup>2</sup><var>q</var><sup>3</sup>,
-  where <var>p</var> and <var>q</var> are distinct primes.  \n\rFor example, 200 =
-  5<sup>2</sup>2<sup>3</sup> or 120072949 = 23<sup>2</sup>61<sup>3</sup>.\n\nThe first
-  five squbes are 72, 108, 200, 392, and 500.\n\nInterestingly, 200 is also the first
-  number for which you cannot change any single digit to make a prime; we shall call
-  such numbers, prime-proof. The next prime-proof sqube which contains the contiguous
-  sub-string \"200\" is 1992008.\n\nFind the 200th prime-proof sqube containing the
-  contiguous sub-string \"200\".\n\n"
+  where <var>p</var> and <var>q</var> are distinct primes.  \nFor example, 200 = 5<sup>2</sup>2<sup>3</sup>
+  or 120072949 = 23<sup>2</sup>61<sup>3</sup>.\n\nThe first five squbes are 72, 108,
+  200, 392, and 500.\n\nInterestingly, 200 is also the first number for which you
+  cannot change any single digit to make a prime; we shall call such numbers, prime-proof.
+  The next prime-proof sqube which contains the contiguous sub-string \"200\" is 1992008.\n\nFind
+  the 200th prime-proof sqube containing the contiguous sub-string \"200\".\n\n"

data/data/problems/201.yml

@@ -1,18 +1,18 @@
 ---
 :id: 201
 :name: Subsets with a unique sum
-:url: http://projecteuler.net/problem=201
-:content: "For any set A of numbers, let sum(A) be the sum of the elements of A.  \n\rConsider
+:url: https://projecteuler.net/problem=201
+:content: "For any set A of numbers, let sum(A) be the sum of the elements of A.  \nConsider
   the set B = {1,3,6,8,10,11}.  \n There are 20 subsets of B containing three elements,
-  and their sums are:\n\nsum({1,3,6}) = 10,  \n\rsum({1,3,8}) = 12,  \n\rsum({1,3,10})
-  = 14,  \n\rsum({1,3,11}) = 15,  \n\rsum({1,6,8}) = 15,  \n\rsum({1,6,10}) = 17,
-  \ \n\rsum({1,6,11}) = 18,  \n\rsum({1,8,10}) = 19,  \n\rsum({1,8,11}) = 20,  \n\rsum({1,10,11})
-  = 22,  \n\rsum({3,6,8}) = 17,  \n\rsum({3,6,10}) = 19,  \n\rsum({3,6,11}) = 20,
-  \ \n\rsum({3,8,10}) = 21,  \n\rsum({3,8,11}) = 22,  \n\rsum({3,10,11}) = 24,  \n\rsum({6,8,10})
-  = 24,  \n\rsum({6,8,11}) = 25,  \n\rsum({6,10,11}) = 27,  \n\rsum({8,10,11}) = 29.\n\nSome
-  of these sums occur more than once, others are unique.  \n\rFor a set A, let U(A,k)
-  be the set of unique sums of k-element subsets of A, in our example we find U(B,3)
-  = {10,12,14,18,21,25,27,29} and sum(U(B,3)) = 156.\n\nNow consider the 100-element
-  set S = {1<sup>2</sup>, 2<sup>2</sup>, ... , 100<sup>2</sup>}.  \n\rS has 100891344545564193334812497256
-  50-element subsets.\n\nDetermine the sum of all integers which are the sum of exactly
-  one of the 50-element subsets of S, i.e. find sum(U(S,50)).\n\n"
+  and their sums are:\n\nsum({1,3,6}) = 10,  \nsum({1,3,8}) = 12,  \nsum({1,3,10})
+  = 14,  \nsum({1,3,11}) = 15,  \nsum({1,6,8}) = 15,  \nsum({1,6,10}) = 17,  \nsum({1,6,11})
+  = 18,  \nsum({1,8,10}) = 19,  \nsum({1,8,11}) = 20,  \nsum({1,10,11}) = 22,  \nsum({3,6,8})
+  = 17,  \nsum({3,6,10}) = 19,  \nsum({3,6,11}) = 20,  \nsum({3,8,10}) = 21,  \nsum({3,8,11})
+  = 22,  \nsum({3,10,11}) = 24,  \nsum({6,8,10}) = 24,  \nsum({6,8,11}) = 25,  \nsum({6,10,11})
+  = 27,  \nsum({8,10,11}) = 29.\n\nSome of these sums occur more than once, others
+  are unique.  \nFor a set A, let U(A,k) be the set of unique sums of k-element subsets
+  of A, in our example we find U(B,3) = {10,12,14,18,21,25,27,29} and sum(U(B,3))
+  = 156.\n\nNow consider the 100-element set S = {1<sup>2</sup>, 2<sup>2</sup>, ...
+  , 100<sup>2</sup>}.  \nS has 100891344545564193334812497256 50-element subsets.\n\nDetermine
+  the sum of all integers which are the sum of exactly one of the 50-element subsets
+  of S, i.e. find sum(U(S,50)).\n\n"

data/data/problems/202.yml

@@ -1,13 +1,13 @@
 ---
 :id: 202
 :name: Laserbeam
-:url: http://projecteuler.net/problem=202
+:url: https://projecteuler.net/problem=202
 :content: |+
   Three mirrors are arranged in the shape of an equilateral triangle, with their reflective surfaces pointing inwards. There is an infinitesimal gap at each vertex of the triangle through which a laser beam may pass.
 
   Label the vertices A, B and C. There are 2 ways in which a laser beam may enter vertex C, bounce off 11 surfaces, then exit through the same vertex: one way is shown below; the other is the reverse of that.
 
-   ![]({{ images_dir }}/p_201_laserbeam.gif)
+   ![]({{ images_dir }}/p201_laserbeam.gif)
 
   There are 80840 ways in which a laser beam may enter vertex C, bounce off 1000001 surfaces, then exit through the same vertex.
 

data/data/problems/203.yml

@@ -1,16 +1,24 @@
 ---
 :id: 203
 :name: Squarefree Binomial Coefficients
-:url: http://projecteuler.net/problem=203
-:content: "The binomial coefficients <sup>n</sup>C<sub>k</sub> can be arranged in
-  triangular form, Pascal's triangle, like this:\n\n| | 1 | |\n| | 1 | | 1 | |\n|
-  | 1 | | 2 | | 1 | |\n| | 1 | | 3 | | 3 | | 1 | |\n| | 1 | | 4 | | 6 | | 4 | | 1
-  | |\n| | 1 | | 5 | | 10 | | 10 | | 5 | | 1 | |\n| | 1 | | 6 | | 15 | | 20 | | 15
-  | | 6 | | 1 | |\n| 1 | | 7 | | 21 | | 35 | | 35 | | 21 | | 7 | | 1 |\n\n\r.........\r\n\nIt
-  can be seen that the first eight rows of Pascal's triangle contain twelve distinct
-  numbers: 1, 2, 3, 4, 5, 6, 7, 10, 15, 20, 21 and 35.\n\nA positive integer <var>n</var>
-  is called squarefree if no square of a prime divides <var>n</var>.\rOf the twelve
-  distinct numbers in the first eight rows of Pascal's triangle, all except 4 and
-  20 are squarefree.\rThe sum of the distinct squarefree numbers in the first eight
-  rows is 105.\n\nFind the sum of the distinct squarefree numbers in the first 51
-  rows of Pascal's triangle.\n\n"
+:url: https://projecteuler.net/problem=203
+:content: |+
+  The binomial coefficients <sup>n</sup>C<sub>k</sub> can be arranged in triangular form, Pascal's triangle, like this:
+
+  | | 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 | | 7 | | 21 | | 35 | | 35 | | 21 | | 7 | | 1 |
+
+  .........
+
+  It can be seen that the first eight rows of Pascal's triangle contain twelve distinct numbers: 1,&nbsp;2,&nbsp;3,&nbsp;4,&nbsp;5,&nbsp;6,&nbsp;7,&nbsp;10,&nbsp;15,&nbsp;20,&nbsp;21&nbsp;and&nbsp;35.
+
+  A positive integer <var>n</var> is called squarefree if no square of a prime divides <var>n</var>. Of the twelve distinct numbers in the first eight rows of Pascal's triangle, all except 4 and 20 are squarefree. The sum of the distinct squarefree numbers in the first eight rows is 105.
+
+  Find the sum of the distinct squarefree numbers in the first 51 rows of Pascal's triangle.
+

data/data/problems/204.yml

@@ -1,11 +1,11 @@
 ---
 :id: 204
 :name: Generalised Hamming Numbers
-:url: http://projecteuler.net/problem=204
+:url: https://projecteuler.net/problem=204
 :content: "A Hamming number is a positive number which has no prime factor larger
-  than 5.  \n\rSo the first few Hamming numbers are 1, 2, 3, 4, 5, 6, 8, 9, 10, 12,
-  15.  \n\rThere are 1105 Hamming numbers not exceeding 10<sup>8</sup>.\n\nWe will
-  call a positive number a generalised Hamming number of type <var>n</var>, if it
-  has no prime factor larger than <var>n</var>.  \n\rHence the Hamming numbers are
-  the generalised Hamming numbers of type 5.\n\nHow many generalised Hamming numbers
-  of type 100 are there which don't exceed 10<sup>9</sup>?\n\n"
+  than 5.  \nSo the first few Hamming numbers are 1, 2, 3, 4, 5, 6, 8, 9, 10, 12,
+  15.  \nThere are 1105 Hamming numbers not exceeding 10<sup>8</sup>.\n\nWe will call
+  a positive number a generalised Hamming number of type <var>n</var>, if it has no
+  prime factor larger than <var>n</var>.  \nHence the Hamming numbers are the generalised
+  Hamming numbers of type 5.\n\nHow many generalised Hamming numbers of type 100 are
+  there which don't exceed 10<sup>9</sup>?\n\n"

data/data/problems/205.yml

@@ -1,10 +1,10 @@
 ---
 :id: 205
 :name: Dice Game
-:url: http://projecteuler.net/problem=205
+:url: https://projecteuler.net/problem=205
 :content: "Peter has nine four-sided (pyramidal) dice, each with faces numbered 1,
-  2, 3, 4.  \n\rColin has six six-sided (cubic) dice, each with faces numbered 1,
-  2, 3, 4, 5, 6.\n\nPeter and Colin roll their dice and compare totals: the highest
-  total wins. The result is a draw if the totals are equal.\n\nWhat is the probability
-  that Pyramidal Pete beats Cubic Colin? Give your answer rounded to seven decimal
-  places in the form 0.abcdefg\n\n"
+  2, 3, 4.  \nColin has six six-sided (cubic) dice, each with faces numbered 1, 2,
+  3, 4, 5, 6.\n\nPeter and Colin roll their dice and compare totals: the highest total
+  wins. The result is a draw if the totals are equal.\n\nWhat is the probability that
+  Pyramidal Pete beats Cubic Colin? Give your answer rounded to seven decimal places
+  in the form 0.abcdefg\n\n"

data/data/problems/206.yml

@@ -1,6 +1,6 @@
 ---
 :id: 206
 :name: Concealed Square
-:url: http://projecteuler.net/problem=206
+:url: https://projecteuler.net/problem=206
 :content: "Find the unique positive integer whose square has the form 1\\_2\\_3\\_4\\_5\\_6\\_7\\_8\\_9\\_0,
   \ \n where each “\\_” is a single digit.\n\n"

data/data/problems/207.yml

@@ -1,17 +1,17 @@
 ---
 :id: 207
 :name: Integer partition equations
-:url: http://projecteuler.net/problem=207
+:url: https://projecteuler.net/problem=207
 :content: "For some positive integers <var>k</var>, there exists an integer partition
-  of the form   4<sup>t</sup> = 2<sup>t</sup> + <var>k</var>,  \n\rwhere 4<sup>t</sup>,
+  of the form&nbsp;&nbsp; 4<sup>t</sup> = 2<sup>t</sup> + <var>k</var>,  \nwhere 4<sup>t</sup>,
   2<sup>t</sup>, and <var>k</var> are all positive integers and <var>t</var> is a
   real number.\n\nThe first two such partitions are 4<sup>1</sup> = 2<sup>1</sup>
   + 2 and 4<sup>1.5849625...</sup> = 2<sup>1.5849625...</sup> + 6.\n\nPartitions where
-  <var>t</var> is also an integer are called _perfect_.  \n \rFor any <var>m</var>
-  ![≥]({{ images_dir }}/symbol_ge.gif) 1 let P(<var>m</var>) be the proportion of
-  such partitions that are perfect with <var>k</var> ![≤]({{ images_dir }}/symbol_le.gif)
-  <var>m</var>.  \n\rThus P(6) = 1/2.\n\nIn the following table are listed some values
-  of P(<var>m</var>)\n\n   P(5) = 1/1  \n\r   P(10) = 1/2  \n\r   P(15) = 2/3  \n\r   P(20)
-  = 1/2  \n\r   P(25) = 1/2  \n\r   P(30) = 2/5  \n\r   ...  \n\r   P(180) = 1/4  \n\r   P(185)
-  = 3/13\n\nFind the smallest <var>m</var> for which P(<var>m</var>) ![<]({{ images_dir
-  }}/symbol_lt.gif) 1/12345\n\n"
+  <var>t</var> is also an integer are called _perfect_.  \n For any <var>m</var> ≥
+  1 let P(<var>m</var>) be the proportion of such partitions that are perfect with
+  <var>k</var> ≤ <var>m</var>.  \nThus P(6) = 1/2.\n\nIn the following table are listed
+  some values of P(<var>m</var>)\n\n&nbsp;&nbsp;&nbsp;P(5) = 1/1  \n&nbsp;&nbsp;&nbsp;P(10)
+  = 1/2  \n&nbsp;&nbsp;&nbsp;P(15) = 2/3  \n&nbsp;&nbsp;&nbsp;P(20) = 1/2  \n&nbsp;&nbsp;&nbsp;P(25)
+  = 1/2  \n&nbsp;&nbsp;&nbsp;P(30) = 2/5  \n&nbsp;&nbsp;&nbsp;...  \n&nbsp;&nbsp;&nbsp;P(180)
+  = 1/4  \n&nbsp;&nbsp;&nbsp;P(185) = 3/13\n\nFind the smallest <var>m</var> for which
+  P(<var>m</var>) \\< 1/12345\n\n"

data/data/problems/208.yml

@@ -1,11 +1,10 @@
 ---
 :id: 208
 :name: Robot Walks
-:url: http://projecteuler.net/problem=208
+:url: https://projecteuler.net/problem=208
 :content: "A robot moves in a series of one-fifth circular arcs (72°), with a free
   choice of a clockwise or an anticlockwise arc for each step, but no turning on the
   spot.\n\nOne of 70932 possible closed paths of 25 arcs starting northward is\n\n
-  ![]({{ images_dir }}/p_208_robotwalk.gif)\n\nGiven that the robot starts facing
-  North, how many journeys of 70 arcs in length can it take that return it, after
-  the final arc, to its starting position?  \n<!--(Journeys are allowed to return
-  multiple times to the start.)-->\r(Any arc may be traversed multiple times.)\n\n"
+  ![]({{ images_dir }}/p208_robotwalk.gif)\n\nGiven that the robot starts facing North,
+  how many journeys of 70 arcs in length can it take that return it, after the final
+  arc, to its starting position?  \n(Any arc may be traversed multiple times.)\n\n"

data/data/problems/209.yml

@@ -1,15 +1,15 @@
 ---
 :id: 209
 :name: Circular Logic
-:url: http://projecteuler.net/problem=209
+:url: https://projecteuler.net/problem=209
 :content: "A <var>k</var>-input _binary truth table_ is a map from <var>k</var> input
-  bits\r(binary digits, 0 [false] or 1 [true]) to 1 output bit. For example, the 2-input
+  bits (binary digits, 0 [false] or 1 [true]) to 1 output bit. For example, the 2-input
   binary truth tables for the logical AND and XOR functions are:\n\n| <var>x</var>
   | <var>y</var> | <var>x</var> AND <var>y</var> |\n| 0 | 0 | 0 |\n| 0 | 1 | 0 |\n|
   1 | 0 | 0 |\n| 1 | 1 | 1 |\n\n| <var>x</var> | <var>y</var> | <var>x</var> XOR <var>y</var>
-  |\n| 0 | 0 | 0 |\n| 0 | 1 | 1 |\n| 1 | 0 | 1 |\n| 1 | 1 | 0 |\n\n  \n  \n\nHow many
-  6-input binary truth tables, τ, satisfy the formula\n\n\rτ(<var>a</var>, <var>b</var>,
+  |\n| 0 | 0 | 0 |\n| 0 | 1 | 1 |\n| 1 | 0 | 1 |\n| 1 | 1 | 0 |\n\n  \n\nHow many
+  6-input binary truth tables, τ, satisfy the formula\n\nτ(<var>a</var>, <var>b</var>,
   <var>c</var>, <var>d</var>, <var>e</var>, <var>f</var>) AND τ(<var>b</var>, <var>c</var>,
   <var>d</var>, <var>e</var>, <var>f</var>, <var>a</var> XOR (<var>b</var> AND <var>c</var>))
-  = 0\r\n  \n  \n\nfor all 6-bit inputs (<var>a</var>, <var>b</var>, <var>c</var>,
-  <var>d</var>, <var>e</var>, <var>f</var>)?\n\n"
+  = 0\n  \n\nfor all 6-bit inputs (<var>a</var>, <var>b</var>, <var>c</var>, <var>d</var>,
+  <var>e</var>, <var>f</var>)?\n\n"

data/data/problems/21.yml

@@ -1,11 +1,11 @@
 ---
 :id: 21
 :name: Amicable numbers
-:url: http://projecteuler.net/problem=21
+:url: https://projecteuler.net/problem=21
 :content: "Let d(_n_) be defined as the sum of proper divisors of _n_ (numbers less
-  than _n_ which divide evenly into _n_).  \n\rIf d(_a_) = _b_ and d(_b_) = _a_, where
-  _a_ ![≠]({{ images_dir }}/symbol_ne.gif) _b_, then _a_ and _b_ are an amicable pair
-  and each of _a_ and _b_ are called amicable numbers.\n\nFor example, the proper
-  divisors of 220 are 1, 2, 4, 5, 10, 11, 20, 22, 44, 55 and 110; therefore d(220)
-  = 284. The proper divisors of 284 are 1, 2, 4, 71 and 142; so d(284) = 220.\n\nEvaluate
-  the sum of all the amicable numbers under 10000.\n\n"
+  than _n_ which divide evenly into _n_).  \nIf d(_a_) = _b_ and d(_b_) = _a_, where
+  _a_ ≠ _b_, then _a_ and _b_ are an amicable pair and each of _a_ and _b_ are called
+  amicable numbers.\n\nFor example, the proper divisors of 220 are 1, 2, 4, 5, 10,
+  11, 20, 22, 44, 55 and 110; therefore d(220) = 284. The proper divisors of 284 are
+  1, 2, 4, 71 and 142; so d(284) = 220.\n\nEvaluate the sum of all the amicable numbers
+  under 10000.\n\n"

data/data/problems/210.yml

@@ -1,9 +1,9 @@
 ---
 :id: 210
 :name: Obtuse Angled Triangles
-:url: http://projecteuler.net/problem=210
-:content: "\rConsider the set S(r) of points (x,y) with integer coordinates satisfying
-  |x| + |y| ![≤]({{ images_dir }}/symbol_le.gif) r.   \n\rLet O be the point (0,0)
-  and C the point (r/4,r/4).   \n\rLet N(r) be the number of points B in S(r), so
-  that the triangle OBC has an obtuse angle, i.e. the largest angle α satisfies 90°\rSo,
-  for example, N(4)=24 and N(8)=100.\r\n\nWhat is N(1,000,000,000)?\n\n"
+:url: https://projecteuler.net/problem=210
+:content: "\r Consider the set S(r) of points (x,y) with integer coordinates satisfying
+  |x| + |y| ≤ r.   \nLet O be the point (0,0) and C the point (r/4,r/4).   \nLet N(r)
+  be the number of points B in S(r), so that the triangle OBC has an obtuse angle,
+  i.e. the largest angle α satisfies 90°\\<α\\<180°.  \nSo, for example, N(4)=24 and
+  N(8)=100.\n\nWhat is N(1,000,000,000)?\n\n"

data/data/problems/211.yml

@@ -1,11 +1,11 @@
 ---
 :id: 211
 :name: Divisor Square Sum
-:url: http://projecteuler.net/problem=211
+:url: https://projecteuler.net/problem=211
 :content: |+
   For a positive integer <var>n</var>, let σ<sub>2</sub>(<var>n</var>) be the sum of the squares of its divisors. For example,
 
   σ<sub>2</sub>(10) = 1 + 4 + 25 + 100 = 130.
 
-  Find the sum of all <var>n</var>, 0 ![<]({{ images_dir }}/symbol_lt.gif) <var>n</var> ![<]({{ images_dir }}/symbol_lt.gif) 64,000,000 such that σ<sub>2</sub>(<var>n</var>) is a perfect square.
+  Find the sum of all <var>n</var>, 0 \< <var>n</var> \< 64,000,000 such that σ<sub>2</sub>(<var>n</var>) is a perfect square.
 

data/data/problems/212.yml

@@ -1,27 +1,23 @@
 ---
 :id: 212
 :name: Combined Volume of Cuboids
-:url: http://projecteuler.net/problem=212
+:url: https://projecteuler.net/problem=212
 :content: "An axis-aligned cuboid, specified by parameters { (x<sub>0</sub>,y<sub>0</sub>,z<sub>0</sub>),
-  (dx,dy,dz) }, consists of all points (X,Y,Z) such that x<sub>0</sub> ![≤]({{ images_dir
-  }}/symbol_le.gif) X ![≤]({{ images_dir }}/symbol_le.gif) x<sub>0</sub>+dx, y<sub>0</sub>
-  ![≤]({{ images_dir }}/symbol_le.gif) Y ![≤]({{ images_dir }}/symbol_le.gif) y<sub>0</sub>+dy
-  and z<sub>0</sub> ![≤]({{ images_dir }}/symbol_le.gif) Z ![≤]({{ images_dir }}/symbol_le.gif)
-  z<sub>0</sub>+dz. The volume of the cuboid is the product, dx ![×]({{ images_dir
-  }}/symbol_times.gif) dy ![×]({{ images_dir }}/symbol_times.gif) dz. The combined
-  volume of a collection of cuboids is the volume of their union and will be less
-  than the sum of the individual volumes if any cuboids overlap.\n\nLet C<sub>1</sub>,...,C<sub>50000</sub>
-  be a collection of 50000 axis-aligned cuboids such that C<sub><var>n</var></sub>
-  has parameters\n\nx<sub>0</sub> = S<sub>6<var>n</var>-5</sub> modulo 10000  \ny<sub>0</sub>
+  (dx,dy,dz) }, consists of all points (X,Y,Z) such that x<sub>0</sub> ≤ X ≤ x<sub>0</sub>+dx,
+  y<sub>0</sub> ≤ Y ≤ y<sub>0</sub>+dy and z<sub>0</sub> ≤ Z ≤ z<sub>0</sub>+dz. The
+  volume of the cuboid is the product, dx × dy × dz. The combined volume of a collection
+  of cuboids is the volume of their union and will be less than the sum of the individual
+  volumes if any cuboids overlap.\n\nLet C<sub>1</sub>,...,C<sub>50000</sub> be a
+  collection of 50000 axis-aligned cuboids such that C<sub><var>n</var></sub> has
+  parameters\n\nx<sub>0</sub> = S<sub>6<var>n</var>-5</sub> modulo 10000  \ny<sub>0</sub>
   = S<sub>6<var>n</var>-4</sub> modulo 10000  \nz<sub>0</sub> = S<sub>6<var>n</var>-3</sub>
   modulo 10000  \ndx = 1 + (S<sub>6<var>n</var>-2</sub> modulo 399)  \ndy = 1 + (S<sub>6<var>n</var>-1</sub>
   modulo 399)  \ndz = 1 + (S<sub>6<var>n</var></sub> modulo 399)\n\nwhere S<sub>1</sub>,...,S<sub>300000</sub>
-  come from the \"Lagged Fibonacci Generator\":\n\nFor 1 ![≤]({{ images_dir }}/symbol_le.gif)
-  <var>k</var> ![≤]({{ images_dir }}/symbol_le.gif) 55, S<sub><var>k</var></sub> =
-  [100003 - 200003<var>k</var> + 300007<var>k</var><sup>3</sup>]   (modulo 1000000)
-  \ \nFor 56 ![≤]({{ images_dir }}/symbol_le.gif) <var>k</var>, S<sub><var>k</var></sub>
-  = [S<sub><var>k</var>-24</sub> + S<sub><var>k</var>-55</sub>]   (modulo 1000000)\n\nThus,
-  C<sub>1</sub> has parameters {(7,53,183),(94,369,56)}, C<sub>2</sub> has parameters
-  {(2383,3563,5079),(42,212,344)}, and so on.\n\nThe combined volume of the first
-  100 cuboids, C<sub>1</sub>,...,C<sub>100</sub>, is 723581599.\n\nWhat is the combined
-  volume of all 50000 cuboids, C<sub>1</sub>,...,C<sub>50000</sub> ?\n\n"
+  come from the \"Lagged Fibonacci Generator\":\n\nFor 1 ≤ <var>k</var> ≤ 55, S<sub><var>k</var></sub>
+  = [100003 - 200003<var>k</var> + 300007<var>k</var><sup>3</sup>] &nbsp; (modulo
+  1000000)  \nFor 56 ≤ <var>k</var>, S<sub><var>k</var></sub> = [S<sub><var>k</var>-24</sub>
+  + S<sub><var>k</var>-55</sub>] &nbsp; (modulo 1000000)\n\nThus, C<sub>1</sub> has
+  parameters {(7,53,183),(94,369,56)}, C<sub>2</sub> has parameters {(2383,3563,5079),(42,212,344)},
+  and so on.\n\nThe combined volume of the first 100 cuboids, C<sub>1</sub>,...,C<sub>100</sub>,
+  is 723581599.\n\nWhat is the combined volume of all 50000 cuboids, C<sub>1</sub>,...,C<sub>50000</sub>
+  ?\n\n"

data/data/problems/213.yml

@@ -1,9 +1,9 @@
 ---
 :id: 213
 :name: Flea Circus
-:url: http://projecteuler.net/problem=213
-:content: "A 30 ![×]({{ images_dir }}/symbol_times.gif)30 grid of squares contains
-  900 fleas, initially one flea per square.  \n\rWhen a bell is rung, each flea jumps
-  to an adjacent square at random (usually 4 possibilities, except for fleas on the
-  edge of the grid or at the corners).\n\nWhat is the expected number of unoccupied
-  squares after 50 rings of the bell? Give your answer rounded to six decimal places.\n\n"
+:url: https://projecteuler.net/problem=213
+:content: "A 30×30 grid of squares contains 900 fleas, initially one flea per square.
+  \ \nWhen a bell is rung, each flea jumps to an adjacent square at random (usually
+  4 possibilities, except for fleas on the edge of the grid or at the corners).\n\nWhat
+  is the expected number of unoccupied squares after 50 rings of the bell? Give your
+  answer rounded to six decimal places.\n\n"

data/data/problems/214.yml

@@ -1,13 +1,12 @@
 ---
 :id: 214
 :name: Totient Chains
-:url: http://projecteuler.net/problem=214
-:content: "Let φ be Euler's totient function, i.e. for a natural number <var>n</var>,\rφ(<var>n</var>)
-  is the number of <var>k</var>, 1 ![≤]({{ images_dir }}/symbol_le.gif) <var>k</var>
-  ![≤]({{ images_dir }}/symbol_le.gif) <var>n</var>, for which gcd(<var>k</var>,<var>n</var>)
-  = 1.\n\nBy iterating φ, each positive integer generates a decreasing chain of numbers
-  ending in 1.  \n\rE.g. if we start with 5 the sequence 5,4,2,1 is generated.  \n\rHere
-  is a listing of all chains with length 4:\n\n\r5,4,2,1  \n\r7,6,2,1  \n\r8,4,2,1
-  \ \n\r9,6,2,1  \n\r10,4,2,1  \n\r12,4,2,1  \n\r14,6,2,1  \n\r18,6,2,1\n\nOnly two
-  of these chains start with a prime, their sum is 12.\n\nWhat is the sum of all primes
-  less than 40000000 which generate a chain of length 25?\n\n"
+:url: https://projecteuler.net/problem=214
+:content: "Let φ be Euler's totient function, i.e. for a natural number <var>n</var>,
+  φ(<var>n</var>) is the number of <var>k</var>, 1 ≤ <var>k</var> ≤ <var>n</var>,
+  for which gcd(<var>k</var>,<var>n</var>) = 1.\n\nBy iterating φ, each positive integer
+  generates a decreasing chain of numbers ending in 1.  \nE.g. if we start with 5
+  the sequence 5,4,2,1 is generated.  \nHere is a listing of all chains with length
+  4:\n\n5,4,2,1  \n7,6,2,1  \n8,4,2,1  \n9,6,2,1  \n10,4,2,1  \n12,4,2,1  \n14,6,2,1
+  \ \n18,6,2,1\n\nOnly two of these chains start with a prime, their sum is 12.\n\nWhat
+  is the sum of all primes less than 40000000 which generate a chain of length 25?\n\n"