euler-manager 0.1.1 → 0.2.0

data/data/problems/215.yml

@@ -1,15 +1,15 @@
 ---
 :id: 215
 :name: Crack-free Walls
-:url: http://projecteuler.net/problem=215
+:url: https://projecteuler.net/problem=215
 :content: |+
-  Consider the problem of building a wall out of 2 ![×]({{ images_dir }}/symbol_times.gif)1 and 3 ![×]({{ images_dir }}/symbol_times.gif)1 bricks (horizontal ![×]({{ images_dir }}/symbol_times.gif)vertical dimensions) such that, for extra strength, the gaps between horizontally-adjacent bricks never line up in consecutive layers, i.e. never form a "running crack".
+  Consider the problem of building a wall out of 2×1 and 3×1 bricks (horizontal×vertical dimensions) such that, for extra strength, the gaps between horizontally-adjacent bricks never line up in consecutive layers, i.e. never form a "running crack".
 
-  For example, the following 9 ![×]({{ images_dir }}/symbol_times.gif)3 wall is not acceptable due to the running crack shown in red:
+  For example, the following 9×3 wall is not acceptable due to the running crack shown in red:
 
-   ![]({{ images_dir }}/p_215_crackfree.gif)
+   ![]({{ images_dir }}/p215_crackfree.gif)
 
-  There are eight ways of forming a crack-free 9 ![×]({{ images_dir }}/symbol_times.gif)3 wall, written W(9,3) = 8.
+  There are eight ways of forming a crack-free 9×3 wall, written W(9,3) = 8.
 
   Calculate W(32,10).
 

data/data/problems/216.yml

@@ -1,11 +1,10 @@
 ---
 :id: 216
 :name: Investigating the primality of numbers of the form 2<var>n</var><sup>2</sup>-1
-:url: http://projecteuler.net/problem=216
+:url: https://projecteuler.net/problem=216
 :content: "Consider numbers <var>t</var>(<var>n</var>) of the form <var>t</var>(<var>n</var>)
-  = 2<var>n</var><sup>2</sup>-1 with <var>n</var> ![>]({{ images_dir }}/symbol_gt.gif)
-  1.  \n\rThe first such numbers are 7, 17, 31, 49, 71, 97, 127 and 161.  \n\rIt turns
-  out that only 49 = 7\\*7 and 161 = 7\\*23 are not prime.  \n\rFor <var>n</var> ![≤]({{
-  images_dir }}/symbol_le.gif) 10000 there are 2202 numbers <var>t</var>(<var>n</var>)
+  = 2<var>n</var><sup>2</sup>-1 with <var>n</var> \\> 1.  \nThe first such numbers
+  are 7, 17, 31, 49, 71, 97, 127 and 161.  \nIt turns out that only 49 = 7\\*7 and
+  161 = 7\\*23 are not prime.  \nFor <var>n</var> ≤ 10000 there are 2202 numbers <var>t</var>(<var>n</var>)
   that are prime.\n\nHow many numbers <var>t</var>(<var>n</var>) are prime for <var>n</var>
-  ![≤]({{ images_dir }}/symbol_le.gif) 50,000,000 ?\n\n"
+  ≤ 50,000,000 ?\n\n"

data/data/problems/217.yml

@@ -1,16 +1,11 @@
 ---
 :id: 217
 :name: Balanced Numbers
-:url: http://projecteuler.net/problem=217
+:url: https://projecteuler.net/problem=217
 :content: "A positive integer with <var>k</var> (decimal) digits is called balanced
-  if its first ![⌈]({{ images_dir }}/symbol_lceil.gif)<sup><var>k</var></sup>/<sub>2</sub>
-  ![⌉]({{ images_dir }}/symbol_rceil.gif) digits sum to the same value as its last
-  ![⌈]({{ images_dir }}/symbol_lceil.gif)<sup><var>k</var></sup>/<sub>2</sub> ![⌉]({{
-  images_dir }}/symbol_rceil.gif) digits, where ![⌈]({{ images_dir }}/symbol_lceil.gif)<var>x</var>
-  ![⌉]({{ images_dir }}/symbol_rceil.gif), pronounced ceiling of <var>x</var>, is
-  the smallest integer ![≥]({{ images_dir }}/symbol_ge.gif) <var>x</var>, thus ![⌈]({{
-  images_dir }}/symbol_lceil.gif)π ![⌉]({{ images_dir }}/symbol_rceil.gif) = 4 and
-  ![⌈]({{ images_dir }}/symbol_lceil.gif)5 ![⌉]({{ images_dir }}/symbol_rceil.gif)
-  = 5.\n\nSo, for example, all palindromes are balanced, as is 13722.\n\nLet T(<var>n</var>)
-  be the sum of all balanced numbers less than 10<sup><var>n</var></sup>.   \n\rThus:
-  T(1) = 45, T(2) = 540 and T(5) = 334795890.\n\nFind T(47) mod 3<sup>15</sup>\n\n"
+  if its first ⌈<sup><var>k</var></sup>/<sub>2</sub>⌉ digits sum to the same value
+  as its last ⌈<sup><var>k</var></sup>/<sub>2</sub>⌉ digits, where ⌈<var>x</var>⌉,
+  pronounced ceiling of <var>x</var>, is the smallest integer ≥ <var>x</var>, thus
+  ⌈π⌉ = 4 and ⌈5⌉ = 5.\n\nSo, for example, all palindromes are balanced, as is 13722.\n\nLet
+  T(<var>n</var>) be the sum of all balanced numbers less than 10<sup><var>n</var></sup>.
+  \  \nThus: T(1) = 45, T(2) = 540 and T(5) = 334795890.\n\nFind T(47) mod 3<sup>15</sup>\n\n"

data/data/problems/218.yml

@@ -1,13 +1,12 @@
 ---
 :id: 218
 :name: Perfect right-angled triangles
-:url: http://projecteuler.net/problem=218
-:content: "Consider the right angled triangle with sides a=7, b=24 and c=25.\rThe
-  area of this triangle is 84, which is divisible by the perfect numbers 6 and 28.
-  \ \n\rMoreover it is a primitive right angled triangle as gcd(a,b)=1 and gcd(b,c)=1.
-  \ \n\rAlso c is a perfect square.\n\nWe will call a right angled triangle perfect
-  if  \n\r-it is a primitive right angled triangle  \n\r-its hypotenuse is a perfect
-  square\n\nWe will call a right angled triangle super-perfect if  \n\r-it is a perfect
-  right angled triangle and  \n\r-its area is a multiple of the perfect numbers 6
-  and 28.\n\nHow many perfect right-angled triangles with c ![≤]({{ images_dir }}/symbol_le.gif)10<sup>16</sup>
-  exist that are not super-perfect?\n\n"
+:url: https://projecteuler.net/problem=218
+:content: "Consider the right angled triangle with sides a=7, b=24 and c=25. The area
+  of this triangle is 84, which is divisible by the perfect numbers 6 and 28.  \nMoreover
+  it is a primitive right angled triangle as gcd(a,b)=1 and gcd(b,c)=1.  \nAlso c
+  is a perfect square.\n\nWe will call a right angled triangle perfect if  \n-it is
+  a primitive right angled triangle  \n-its hypotenuse is a perfect square\n\nWe will
+  call a right angled triangle super-perfect if  \n-it is a perfect right angled triangle
+  and  \n-its area is a multiple of the perfect numbers 6 and 28.\n\nHow many perfect
+  right-angled triangles with c≤10<sup>16</sup> exist that are not super-perfect?\n\n"

data/data/problems/219.yml

@@ -1,14 +1,14 @@
 ---
 :id: 219
 :name: Skew-cost coding
-:url: http://projecteuler.net/problem=219
-:content: "Let A and B be bit strings (sequences of 0's and 1's).  \n\rIf A is equal
-  to the leftmost length(A) bits of B, then A is said to be a prefix of B.  \n\rFor
+:url: https://projecteuler.net/problem=219
+:content: "Let A and B be bit strings (sequences of 0's and 1's).  \nIf A is equal
+  to the leftmost length(A) bits of B, then A is said to be a prefix of B.  \nFor
   example, 00110 is a prefix of 001101001, but not of 00111 or 100110.\n\nA prefix-free
   code of size <var>n</var> is a collection of <var>n</var> distinct bit strings such
   that no string is a prefix of any other. For example, this is a prefix-free code
   of size 6:\n\n0000, 0001, 001, 01, 10, 11\n\nNow suppose that it costs one penny
-  to transmit a '0' bit, but four pence to transmit a '1'.  \n\rThen the total cost
+  to transmit a '0' bit, but four pence to transmit a '1'.  \nThen the total cost
   of the prefix-free code shown above is 35 pence, which happens to be the cheapest
-  possible for the skewed pricing scheme in question.  \n\rIn short, we write Cost(6)
+  possible for the skewed pricing scheme in question.  \nIn short, we write Cost(6)
   = 35.\n\nWhat is Cost(10<sup>9</sup>) ?\n\n"

data/data/problems/22.yml

@@ -1,11 +1,11 @@
 ---
 :id: 22
 :name: Names scores
-:url: http://projecteuler.net/problem=22
+:url: https://projecteuler.net/problem=22
 :content: |+
-  Using [names.txt](project/names.txt) (right click and 'Save Link/Target As...'), a 46K text file containing over five-thousand first names, begin by sorting it into alphabetical order. Then working out the alphabetical value for each name, multiply this value by its alphabetical position in the list to obtain a name score.
+  Using [names.txt](project/resources/p022_names.txt) (right click and 'Save Link/Target As...'), a 46K text file containing over five-thousand first names, begin by sorting it into alphabetical order. Then working out the alphabetical value for each name, multiply this value by its alphabetical position in the list to obtain a name score.
 
-  For example, when the list is sorted into alphabetical order, COLIN, which is worth 3 + 15 + 12 + 9 + 14 = 53, is the 938th name in the list. So, COLIN would obtain a score of 938 ![×]({{ images_dir }}/symbol_times.gif) 53 = 49714.
+  For example, when the list is sorted into alphabetical order, COLIN, which is worth 3 + 15 + 12 + 9 + 14 = 53, is the 938th name in the list. So, COLIN would obtain a score of 938 × 53 = 49714.
 
   What is the total of all the name scores in the file?
 

data/data/problems/220.yml

@@ -1,19 +1,18 @@
 ---
 :id: 220
 :name: Heighway Dragon
-:url: http://projecteuler.net/problem=220
-:content: "Let **_D_** <sub>0</sub> be the two-letter string \"Fa\". For n ![≥]({{
-  images_dir }}/symbol_ge.gif)1, derive **_D_** <sub>n</sub> from **_D_** <sub>n-1</sub>
-  by the string-rewriting rules:\n\n\"a\" ![→]({{ images_dir }}/symbol_maps.gif) \"aRbFR\"
-  \ \n\r\"b\" ![→]({{ images_dir }}/symbol_maps.gif) \"LFaLb\"\n\nThus, **_D_** <sub>0</sub>
-  = \"Fa\", **_D_** <sub>1</sub> = \"FaRbFR\", **_D_** <sub>2</sub> = \"FaRbFRRLFaLbFR\",
-  and so on.\n\nThese strings can be interpreted as instructions to a computer graphics
-  program, with \"F\" meaning \"draw forward one unit\", \"L\" meaning \"turn left
-  90 degrees\", \"R\" meaning \"turn right 90 degrees\", and \"a\" and \"b\" being
-  ignored. The initial position of the computer cursor is (0,0), pointing up towards
-  (0,1).\n\nThen **_D_** <sub>n</sub> is an exotic drawing known as the _Heighway
-  Dragon_ of order _n_. For example, **_D_** <sub>10</sub> is shown below; counting
-  each \"F\" as one step, the highlighted spot at (18,16) is the position reached
-  after 500 steps.\n\n ![]({{ images_dir }}/p_220.gif)\n\nWhat is the position of
-  the cursor after 10<sup>12</sup> steps in **_D_** <sub>50</sub> ?  \n\rGive your
-  answer in the form _x_,_y_ with no spaces.\n\n"
+:url: https://projecteuler.net/problem=220
+:content: "Let **_D_** <sub>0</sub> be the two-letter string \"Fa\". For n≥1, derive
+  **_D_** <sub>n</sub> from **_D_** <sub>n-1</sub> by the string-rewriting rules:\n\n\"a\"
+  → \"aRbFR\"  \n\"b\" → \"LFaLb\"\n\nThus, **_D_** <sub>0</sub> = \"Fa\", **_D_**
+  <sub>1</sub> = \"FaRbFR\", **_D_** <sub>2</sub> = \"FaRbFRRLFaLbFR\", and so on.\n\nThese
+  strings can be interpreted as instructions to a computer graphics program, with
+  \"F\" meaning \"draw forward one unit\", \"L\" meaning \"turn left 90 degrees\",
+  \"R\" meaning \"turn right 90 degrees\", and \"a\" and \"b\" being ignored. The
+  initial position of the computer cursor is (0,0), pointing up towards (0,1).\n\nThen
+  **_D_** <sub>n</sub> is an exotic drawing known as the _Heighway Dragon_ of order
+  _n_. For example, **_D_** <sub>10</sub> is shown below; counting each \"F\" as one
+  step, the highlighted spot at (18,16) is the position reached after 500 steps.\n\n
+  ![]({{ images_dir }}/p220.gif)\n\nWhat is the position of the cursor after 10<sup>12</sup>
+  steps in **_D_** <sub>50</sub> ?  \nGive your answer in the form _x_,_y_ with no
+  spaces.\n\n"

data/data/problems/221.yml

@@ -1,13 +1,13 @@
 ---
 :id: 221
 :name: Alexandrian Integers
-:url: http://projecteuler.net/problem=221
+:url: https://projecteuler.net/problem=221
 :content: "We shall call a positive integer <var>A</var> an \"Alexandrian integer\",
   if there exist integers <var>p</var>, <var>q</var>, <var>r</var> such that:\n\n|
-  <var>A</var> = <var>p</var> · <var>q</var> · <var>r</var>    and  \r | \n\n| 1 |\n|
-  <var>A</var> |\n\n | = | \n\n| 1 |\n| <var>p</var> |\n\n | + | \n\n| 1 |\n| <var>q</var>
-  |\n\n | + | \n\n| 1 |\n| <var>r</var> |\n\n |\n\nFor example, 630 is an Alexandrian
-  integer (<var>p</var> = 5, <var>q</var> =  ![−]({{ images_dir }}/symbol_minus.gif)7,
-  <var>r</var> =  ![−]({{ images_dir }}/symbol_minus.gif)18).\rIn fact, 630 is the
-  6<sup>th</sup> Alexandrian integer, the first 6 Alexandrian integers being: 6, 42,
-  120, 156, 420 and 630.\n\nFind the 150000<sup>th</sup> Alexandrian integer.\n\n"
+  <var>A</var> = <var>p</var> · <var>q</var> · <var>r</var> &nbsp;&nbsp;&nbsp;and&nbsp;&nbsp;
+  | \n\n| 1 |\n| <var>A</var> |\n\n | = | \n\n| 1 |\n| <var>p</var> |\n\n | + | \n\n|
+  1 |\n| <var>q</var> |\n\n | + | \n\n| 1 |\n| <var>r</var> |\n\n |\n\nFor example,
+  630 is an Alexandrian integer (<var>p</var>&nbsp;=&nbsp;5, <var>q</var>&nbsp;=&nbsp;−7,
+  <var>r</var>&nbsp;=&nbsp;−18). In fact, 630 is the 6<sup>th</sup> Alexandrian integer,
+  the first 6 Alexandrian integers being: 6, 42, 120, 156, 420 and 630.\n\nFind the
+  150000<sup>th</sup> Alexandrian integer.\n\n"

data/data/problems/222.yml

@@ -1,7 +1,7 @@
 ---
 :id: 222
 :name: Sphere Packing
-:url: http://projecteuler.net/problem=222
+:url: https://projecteuler.net/problem=222
 :content: |+
   What is the length of the shortest pipe, of internal radius 50mm, that can fully contain 21 balls of radii 30mm, 31mm, ..., 50mm?
 

data/data/problems/223.yml

@@ -1,9 +1,8 @@
 ---
 :id: 223
 :name: Almost right-angled triangles I
-:url: http://projecteuler.net/problem=223
-:content: "Let us call an integer sided triangle with sides <var>a</var> ![≤]({{ images_dir
-  }}/symbol_le.gif) <var>b</var> ![≤]({{ images_dir }}/symbol_le.gif) <var>c</var>
-  _barely acute_ if the sides satisfy   \n <var>a</var><sup>2</sup> + <var>b</var><sup>2</sup>
-  = <var>c</var><sup>2</sup> + 1.\n\nHow many barely acute triangles are there with
-  perimeter ![≤]({{ images_dir }}/symbol_le.gif) 25,000,000?\n\n"
+:url: https://projecteuler.net/problem=223
+:content: "Let us call an integer sided triangle with sides <var>a</var> ≤ <var>b</var>
+  ≤ <var>c</var> _barely acute_ if the sides satisfy   \n<var>a</var><sup>2</sup>
+  + <var>b</var><sup>2</sup> = <var>c</var><sup>2</sup> + 1.\n\nHow many barely acute
+  triangles are there with perimeter ≤ 25,000,000?\n\n"

data/data/problems/224.yml

@@ -1,9 +1,8 @@
 ---
 :id: 224
 :name: Almost right-angled triangles II
-:url: http://projecteuler.net/problem=224
-:content: "Let us call an integer sided triangle with sides <var>a</var> ![≤]({{ images_dir
-  }}/symbol_le.gif) <var>b</var> ![≤]({{ images_dir }}/symbol_le.gif) <var>c</var>
-  _barely obtuse_ if the sides satisfy   \n <var>a</var><sup>2</sup> + <var>b</var><sup>2</sup>
-  = <var>c</var><sup>2</sup> - 1.\n\nHow many barely obtuse triangles are there with
-  perimeter ![≤]({{ images_dir }}/symbol_le.gif) 75,000,000?\n\n"
+:url: https://projecteuler.net/problem=224
+:content: "Let us call an integer sided triangle with sides <var>a</var> ≤ <var>b</var>
+  ≤ <var>c</var> _barely obtuse_ if the sides satisfy   \n<var>a</var><sup>2</sup>
+  + <var>b</var><sup>2</sup> = <var>c</var><sup>2</sup> - 1.\n\nHow many barely obtuse
+  triangles are there with perimeter ≤ 75,000,000?\n\n"

data/data/problems/225.yml

@@ -1,9 +1,9 @@
 ---
 :id: 225
 :name: Tribonacci non-divisors
-:url: http://projecteuler.net/problem=225
+:url: https://projecteuler.net/problem=225
 :content: "The sequence 1, 1, 1, 3, 5, 9, 17, 31, 57, 105, 193, 355, 653, 1201 ...
-  \ \n\ris defined by T<sub>1</sub> = T<sub>2</sub> = T<sub>3</sub> = 1 and T<sub><var>n</var></sub>
+  \ \nis defined by T<sub>1</sub> = T<sub>2</sub> = T<sub>3</sub> = 1 and T<sub><var>n</var></sub>
   = T<sub><var>n</var>-1</sub> + T<sub><var>n</var>-2</sub> + T<sub><var>n</var>-3</sub>.\n\nIt
   can be shown that 27 does not divide any terms of this sequence.  \nIn fact, 27
   is the first odd number with this property.\n\nFind the 124<sup>th</sup> odd number

data/data/problems/226.yml

@@ -1,13 +1,12 @@
 ---
 :id: 226
 :name: A Scoop of Blancmange
-:url: http://projecteuler.net/problem=226
+:url: https://projecteuler.net/problem=226
 :content: "The _blancmange curve_ is the set of points (<var>x</var>,<var>y</var>)
-  such that 0  ![≤]({{ images_dir }}/symbol_le.gif) <var>x</var>  ![≤]({{ images_dir
-  }}/symbol_le.gif) 1 and ![]({{ images_dir }}/p_226_formula.gif) ,  \nwhere <var>s</var>(<var>x</var>)
-  = the distance from <var>x</var> to the nearest integer.\n\nThe area under the blancmange
-  curve is equal to ½, shown in pink in the diagram below.\n\n ![blancmange curve]({{
-  images_dir }}/p_226_scoop2.gif)\n\nLet <var>C</var> be the circle with centre (¼,&frac12)
-  and radius ¼, shown in black in the diagram.\n\nWhat area under the blancmange curve
-  is enclosed by <var>C</var>?  \nGive your answer rounded to eight decimal places
-  in the form _0.abcdefgh_\n\n"
+  such that 0 ≤ <var>x</var> ≤ 1 and ![]({{ images_dir }}/p226_formula.gif) ,  \nwhere
+  <var>s</var>(<var>x</var>) = the distance from <var>x</var> to the nearest integer.\n\nThe
+  area under the blancmange curve is equal to ½, shown in pink in the diagram below.\n\n
+  ![blancmange curve]({{ images_dir }}/p226_scoop2.gif)\n\nLet <var>C</var> be the
+  circle with centre (¼,½) and radius ¼, shown in black in the diagram.\n\nWhat area
+  under the blancmange curve is enclosed by <var>C</var>?  \nGive your answer rounded
+  to eight decimal places in the form _0.abcdefgh_\n\n"

data/data/problems/227.yml

@@ -1,13 +1,13 @@
 ---
 :id: 227
 :name: The Chase
-:url: http://projecteuler.net/problem=227
+:url: https://projecteuler.net/problem=227
 :content: "\"_The Chase_\" is a game played with two dice and an even number of players.\n\nThe
   players sit around a table; the game begins with two opposite players having one
-  die each. On each turn, the two players with a die roll it.  \n\rIf a player rolls
+  die each. On each turn, the two players with a die roll it.  \nIf a player rolls
   a 1, he passes the die to his neighbour on the left; if he rolls a 6, he passes
   the die to his neighbour on the right; otherwise, he keeps the die for the next
-  turn.  \n\rThe game ends when one player has both dice after they have been rolled
+  turn.  \nThe game ends when one player has both dice after they have been rolled
   and passed; that player has then lost.\n\nIn a game with 100 players, what is the
   expected number of turns the game lasts?\n\nGive your answer rounded to ten significant
   digits.\n\n"

data/data/problems/228.yml

@@ -1,19 +1,20 @@
 ---
 :id: 228
 :name: Minkowski Sums
-:url: http://projecteuler.net/problem=228
-:content: "Let <var>S</var><sub>n</sub> be the regular <var>n</var>-sided polygon
-  – or _shape_ – whose vertices \r\r<var>v</var><sub><var>k</var></sub> (<var>k</var> = 1,2,…,<var>n</var>)
-  have coordinates:\n\n| | <var>x</var><sub><var>k</var></sub>   =  \r cos( <sup>2<var>k</var>-1</sup>/<sub><var>n</var></sub>
-  ![×]({{ images_dir }}/symbol_times.gif)180° ) |\n| | <var>y</var><sub><var>k</var></sub>   =
-   \r sin( <sup>2<var>k</var>-1</sup>/<sub><var>n</var></sub> ![×]({{ images_dir }}/symbol_times.gif)180° )
-  |\n\nEach <var>S</var><sub><var>n</var></sub> is to be interpreted as a filled shape
-  consisting of all points on the perimeter and in the interior.\n\nThe _Minkowski
-  sum_, <var>S</var>+<var>T</var>, of two shapes <var>S</var> and <var>T</var> is
-  the result of \r\radding every point in <var>S</var> to every point in <var>T</var>,
-  where point addition is performed coordinate-wise: \r\r(<var>u</var>, <var>v</var>)
-  + (<var>x</var>, <var>y</var>) = (<var>u</var>+<var>x</var>, <var>v</var>+<var>y</var>).\n\nFor
-  example, the sum of <var>S</var><sub>3</sub> and <var>S</var><sub>4</sub> is the
-  six-sided shape shown in pink below:\n\n ![picture showing S_3 + S_4]({{ images_dir
-  }}/p_228.png)\n\nHow many sides does <var>S</var><sub>1864</sub> + <var>S</var><sub>1865</sub> + … + <var>S</var><sub>1909</sub>
-  have?\n\n"
+:url: https://projecteuler.net/problem=228
+:content: |+
+  Let <var>S</var><sub>n</sub> be the regular <var>n</var>-sided polygon – or _shape_ – whose vertices <var>v</var><sub><var>k</var></sub> (<var>k</var> = 1,2,…,<var>n</var>) have coordinates:
+
+  | | <var>x</var><sub><var>k</var></sub>&nbsp; &nbsp;=   cos( <sup>2<var>k</var>-1</sup>/<sub><var>n</var></sub> ×180° ) |
+  | | <var>y</var><sub><var>k</var></sub>&nbsp; &nbsp;= &nbsp; sin( <sup>2<var>k</var>-1</sup>/<sub><var>n</var></sub> ×180° ) |
+
+  Each <var>S</var><sub><var>n</var></sub> is to be interpreted as a filled shape consisting of all points on the perimeter and in the interior.
+
+  The _Minkowski sum_, <var>S</var>+<var>T</var>, of two shapes <var>S</var> and <var>T</var> is the result of adding every point in <var>S</var> to every point in <var>T</var>, where point addition is performed coordinate-wise: (<var>u</var>, <var>v</var>) + (<var>x</var>, <var>y</var>) = (<var>u</var>+<var>x</var>, <var>v</var>+<var>y</var>).
+
+  For example, the sum of <var>S</var><sub>3</sub> and <var>S</var><sub>4</sub> is the six-sided shape shown in pink below:
+
+   ![picture showing S_3 + S_4]({{ images_dir }}/p228.png)
+
+  How many sides does <var>S</var><sub>1864</sub> + <var>S</var><sub>1865</sub> + … + <var>S</var><sub>1909</sub> have?
+

data/data/problems/229.yml

@@ -1,22 +1,19 @@
 ---
 :id: 229
 :name: Four Representations using Squares
-:url: http://projecteuler.net/problem=229
-:content: "Consider the number 3600. It is very special, because\n\n\r3600 = 48<sup>2</sup>
-  +     36<sup>2</sup>  \n  \n  \n\r3600 = 20<sup>2</sup> + 2 ![×]({{ images_dir }}/symbol_times.gif)40<sup>2</sup>
-  \ \n  \n  \n\r3600 = 30<sup>2</sup> + 3 ![×]({{ images_dir }}/symbol_times.gif)30<sup>2</sup>
-  \ \n  \n  \n\r3600 = 45<sup>2</sup> + 7 ![×]({{ images_dir }}/symbol_times.gif)15<sup>2</sup>
-  \ \n  \n  \n\nSimilarly, we find that 88201 = 99<sup>2</sup> + 280<sup>2</sup> =
-  287<sup>2</sup> + 2 ![×]({{ images_dir }}/symbol_times.gif)54<sup>2</sup> = 283<sup>2</sup>
-  + 3 ![×]({{ images_dir }}/symbol_times.gif)52<sup>2</sup> = 197<sup>2</sup> + 7
-  ![×]({{ images_dir }}/symbol_times.gif)84<sup>2</sup>.\n\nIn 1747, Euler proved
-  which numbers are representable as a sum of two squares.\rWe are interested in the
-  numbers <var>n</var> which admit representations of all of the following four types:\n\n<var>n</var>
-  = <var>a<sub>1</sub></var><sup>2</sup> +   <var>b<sub>1</sub></var><sup>2</sup>
-  \ \n  \n  \n<var>n</var> = <var>a<sub>2</sub></var><sup>2</sup> + 2 <var>b<sub>2</sub></var><sup>2</sup>
-  \ \n  \n  \n<var>n</var> = <var>a<sub>3</sub></var><sup>2</sup> + 3 <var>b<sub>3</sub></var><sup>2</sup>
-  \ \n  \n  \n<var>n</var> = <var>a<sub>7</sub></var><sup>2</sup> + 7 <var>b<sub>7</sub></var><sup>2</sup>,\r\n\nwhere
-  the <var>a</var><sub><var>k</var></sub> and <var>b</var><sub><var>k</var></sub>
-  are positive integers.\n\nThere are 75373 such numbers that do not exceed 10<sup>7</sup>.
-  \ \n\r\rHow many such numbers are there that do not exceed 2 ![×]({{ images_dir
-  }}/symbol_times.gif)10<sup>9</sup>?\n\n"
+:url: https://projecteuler.net/problem=229
+:content: "Consider the number 3600. It is very special, because\n\n3600 = 48<sup>2</sup>
+  + &nbsp;&nbsp; &nbsp;36<sup>2</sup>  \n  \n3600 = 20<sup>2</sup> + 2×40<sup>2</sup>
+  \ \n  \n3600 = 30<sup>2</sup> + 3×30<sup>2</sup>  \n  \n3600 = 45<sup>2</sup> +
+  7×15<sup>2</sup>  \n  \n\nSimilarly, we find that 88201 = 99<sup>2</sup> + 280<sup>2</sup>
+  = 287<sup>2</sup> + 2×54<sup>2</sup> = 283<sup>2</sup> + 3×52<sup>2</sup> = 197<sup>2</sup>
+  + 7×84<sup>2</sup>.\n\nIn 1747, Euler proved which numbers are representable as
+  a sum of two squares. We are interested in the numbers <var>n</var> which admit
+  representations of all of the following four types:\n\n<var>n</var> = <var>a<sub>1</sub></var><sup>2</sup>
+  + &nbsp; <var>b<sub>1</sub></var><sup>2</sup>  \n  \n<var>n</var> = <var>a<sub>2</sub></var><sup>2</sup>
+  + 2 <var>b<sub>2</sub></var><sup>2</sup>  \n  \n<var>n</var> = <var>a<sub>3</sub></var><sup>2</sup>
+  + 3 <var>b<sub>3</sub></var><sup>2</sup>  \n  \n<var>n</var> = <var>a<sub>7</sub></var><sup>2</sup>
+  + 7 <var>b<sub>7</sub></var><sup>2</sup>,\n\nwhere the <var>a</var><sub><var>k</var></sub>
+  and <var>b</var><sub><var>k</var></sub> are positive integers.\n\nThere are 75373
+  such numbers that do not exceed 10<sup>7</sup>.  \nHow many such numbers are there
+  that do not exceed 2×10<sup>9</sup>?\n\n"

data/data/problems/23.yml

@@ -1,14 +1,12 @@
 ---
 :id: 23
 :name: Non-abundant sums
-:url: http://projecteuler.net/problem=23
+:url: https://projecteuler.net/problem=23
 :content: |+
   A perfect number is a number for which the sum of its proper divisors is exactly equal to the number. For example, the sum of the proper divisors of 28 would be 1 + 2 + 4 + 7 + 14 = 28, which means that 28 is a perfect number.
 
   A number <var>n</var> is called deficient if the sum of its proper divisors is less than <var>n</var> and it is called abundant if this sum exceeds <var>n</var>.
 
-  <!-- <p>A number whose proper divisors are less than the number is called deficient and a number whose proper divisors exceed the number is called abundant.</p> -->
-
   As 12 is the smallest abundant number, 1 + 2 + 3 + 4 + 6 = 16, the smallest number that can be written as the sum of two abundant numbers is 24. By mathematical analysis, it can be shown that all integers greater than 28123 can be written as the sum of two abundant numbers. However, this upper limit cannot be reduced any further by analysis even though it is known that the greatest number that cannot be expressed as the sum of two abundant numbers is less than this limit.
 
   Find the sum of all the positive integers which cannot be written as the sum of two abundant numbers.

data/data/problems/230.yml

@@ -1,19 +1,17 @@
 ---
 :id: 230
 :name: Fibonacci Words
-:url: http://projecteuler.net/problem=230
+:url: https://projecteuler.net/problem=230
 :content: "For any two strings of digits, A and B, we define F<sub>A,B</sub> to be
   the sequence (A,B,AB,BAB,ABBAB,...) in which each term is the concatenation of the
   previous two.\n\nFurther, we define D<sub>A,B</sub>(<var>n</var>) to be the <var>n</var><sup>th</sup>
   digit in the first term of F<sub>A,B</sub> that contains at least <var>n</var> digits.\n\nExample:\n\nLet
   A=1415926535, B=8979323846. We wish to find D<sub>A,B</sub>(35), say.\n\nThe first
-  few terms of F<sub>A,B</sub> are:  \n\r1415926535  \n\r8979323846  \n\r14159265358979323846
-  \ \n\r897932384614159265358979323846  \n\r1415926535897932384689793238461415 **9**
-  265358979323846\n\nThen D<sub>A,B</sub>(35) is the 35<sup>th</sup> digit in the
-  fifth term, which is 9.\n\nNow we use for A the first 100 digits of π behind the
-  decimal point:\n\n14159265358979323846264338327950288419716939937510   \n\r58209749445923078164062862089986280348253421170679\n\nand
-  for B the next hundred digits:\n\n82148086513282306647093844609550582231725359408128
-  \  \n\r48111745028410270193852110555964462294895493038196 .\n\nFind ![∑]({{ images_dir
-  }}/symbol_sum.gif)<sub><var>n</var> = 0,1,...,17</sub>   10<sup><var>n</var></sup>
-  ![×]({{ images_dir }}/symbol_times.gif) D<sub>A,B</sub>((127+19<var>n</var>) ![×]({{
-  images_dir }}/symbol_times.gif)7<sup><var>n</var></sup>) .\n\n"
+  few terms of F<sub>A,B</sub> are:  \n1415926535  \n8979323846  \n14159265358979323846
+  \ \n897932384614159265358979323846  \n1415926535897932384689793238461415 **9** 265358979323846\n\nThen
+  D<sub>A,B</sub>(35) is the 35<sup>th</sup> digit in the fifth term, which is 9.\n\nNow
+  we use for A the first 100 digits of π behind the decimal point:\n\n14159265358979323846264338327950288419716939937510
+  \  \n58209749445923078164062862089986280348253421170679\n\nand for B the next hundred
+  digits:\n\n82148086513282306647093844609550582231725359408128   \n48111745028410270193852110555964462294895493038196
+  .\n\nFind ∑<sub><var>n</var> = 0,1,...,17</sub> &nbsp; 10<sup><var>n</var></sup>×
+  D<sub>A,B</sub>((127+19<var>n</var>)×7<sup><var>n</var></sup>) .\n\n"

data/data/problems/231.yml

@@ -1,11 +1,8 @@
 ---
 :id: 231
 :name: The prime factorisation of binomial coefficients
-:url: http://projecteuler.net/problem=231
-:content: "The binomial coefficient <sup>10</sup>C<sub>3</sub> = 120.  \n\r120 = 2<sup>3</sup>
-  ![×]({{ images_dir }}/symbol_times.gif) 3 ![×]({{ images_dir }}/symbol_times.gif)
-  5 = 2 ![×]({{ images_dir }}/symbol_times.gif) 2 ![×]({{ images_dir }}/symbol_times.gif)
-  2 ![×]({{ images_dir }}/symbol_times.gif) 3 ![×]({{ images_dir }}/symbol_times.gif)
-  5, and 2 + 2 + 2 + 3 + 5 = 14.  \n\rSo the sum of the terms in the prime factorisation
-  of <sup>10</sup>C<sub>3</sub> is 14.\r  \n  \n  \n\rFind the sum of the terms in
-  the prime factorisation of <sup>20000000</sup>C<sub>15000000</sub>.\n\n"
+:url: https://projecteuler.net/problem=231
+:content: "The binomial coefficient <sup>10</sup>C<sub>3</sub> = 120.  \n120 = 2<sup>3</sup>
+  × 3 × 5 = 2 × 2 × 2 × 3 × 5, and 2 + 2 + 2 + 3 + 5 = 14.  \nSo the sum of the terms
+  in the prime factorisation of <sup>10</sup>C<sub>3</sub> is 14.  \n  \nFind the
+  sum of the terms in the prime factorisation of <sup>20000000</sup>C<sub>15000000</sub>.\n\n"

data/data/problems/232.yml

@@ -1,7 +1,7 @@
 ---
 :id: 232
 :name: The Race
-:url: http://projecteuler.net/problem=232
+:url: https://projecteuler.net/problem=232
 :content: |+
   Two players share an unbiased coin and take it in turns to play "The Race". On Player 1's turn, he tosses the coin once: if it comes up Heads, he scores one point; if it comes up Tails, he scores nothing. On Player 2's turn, she chooses a positive integer <var>T</var> and tosses the coin <var>T</var> times: if it comes up all Heads, she scores 2<sup><var>T</var>-1</sup> points; otherwise, she scores nothing. Player 1 goes first. The winner is the first to 100 or more points.
 

data/data/problems/233.yml

@@ -1,11 +1,11 @@
 ---
 :id: 233
 :name: Lattice points on a circle
-:url: http://projecteuler.net/problem=233
+:url: https://projecteuler.net/problem=233
 :content: |+
   Let <var>f</var>(<var>N</var>) be the number of points with integer coordinates that are on a circle passing through (0,0), (<var>N</var>,0),(0,<var>N</var>), and (<var>N</var>,<var>N</var>).
 
   It can be shown that <var>f</var>(10000) = 36.
 
-  What is the sum of all positive integers <var>N</var>  ![≤]({{ images_dir }}/symbol_le.gif) 10<sup>11</sup> such that <var>f</var>(<var>N</var>) = 420 ?
+  What is the sum of all positive integers <var>N</var> ≤ 10<sup>11</sup> such that <var>f</var>(<var>N</var>) = 420 ?