euler-manager 0.1.1 → 0.2.0

data/data/problems/409.yml

@@ -1,10 +1,15 @@
 ---
 :id: 409
 :name: Nim Extreme
-:url: http://projecteuler.net/problem=409
-:content: "Let <var>n</var> be a positive integer. Consider **nim** positions where:\n\n-
-  There are <var>n</var> non-empty piles.\r\n- Each pile has size less than 2<sup><var>n</var></sup>.\r\n-
-  No two piles have the same size.\r\n\nLet W(<var>n</var>) be the number of winning
-  nim positions satisfying the above\rconditions (a position is winning if the first
-  player has a winning strategy). For example, W(1) = 1, W(2) = 6, W(3) = 168, W(5)
-  = 19764360 and W(100) mod 1 000 000 007 = 384777056.\n\nFind W(10 000 000) mod 1 000 000 007.\n\n"
+:url: https://projecteuler.net/problem=409
+:content: |+
+  Let <var>n</var> be a positive integer. Consider **nim** positions where:
+
+  - There are <var>n</var> non-empty piles.
+  - Each pile has size less than 2<sup><var>n</var></sup>.
+  - No two piles have the same size.
+
+  Let W(<var>n</var>) be the number of winning nim positions satisfying the above conditions (a position is winning if the first player has a winning strategy). For example, W(1) = 1, W(2) = 6, W(3) = 168, W(5) = 19764360 and W(100) mod 1&nbsp;000&nbsp;000&nbsp;007 = 384777056.
+
+  Find W(10&nbsp;000&nbsp;000) mod 1&nbsp;000&nbsp;000&nbsp;007.
+

data/data/problems/41.yml

@@ -1,7 +1,7 @@
 ---
 :id: 41
 :name: Pandigital prime
-:url: http://projecteuler.net/problem=41
+:url: https://projecteuler.net/problem=41
 :content: |+
   We shall say that an _n_-digit number is pandigital if it makes use of all the digits 1 to _n_ exactly once. For example, 2143 is a 4-digit pandigital and is also prime.
 

data/data/problems/410.yml

@@ -1,15 +1,14 @@
 ---
 :id: 410
 :name: Circle and tangent line
-:url: http://projecteuler.net/problem=410
+:url: https://projecteuler.net/problem=410
 :content: "Let C be the circle with radius <var>r</var>, <var>x</var><sup>2</sup>
   + <var>y</var><sup>2</sup> = <var>r</var><sup>2</sup>. We choose two points P(<var>a</var>,
   <var>b</var>) and Q(-<var>a</var>, <var>c</var>) so that the line passing through
   P and Q is tangent to C.\n\nFor example, the quadruplet (<var>r</var>, <var>a</var>,
   <var>b</var>, <var>c</var>) = (2, 6, 2, -7) satisfies this property.\n\nLet F(<var>R</var>,
   <var>X</var>) be the number of the integer quadruplets (<var>r</var>, <var>a</var>,
-  <var>b</var>, <var>c</var>) with this property, and with 0 ![<]({{ images_dir }}/symbol_lt.gif)
-  <var>r</var> ![≤]({{ images_dir }}/symbol_le.gif) <var>R</var> and 0 ![<]({{ images_dir
-  }}/symbol_lt.gif) <var>a</var> ![≤]({{ images_dir }}/symbol_le.gif) <var>X</var>.\n\nWe
-  can verify that F(1, 5) = 10, F(2, 10) = 52 and F(10, 100) = 3384.  \n\rFind F(10<sup>8</sup>,
-  10<sup>9</sup>) + F(10<sup>9</sup>, 10<sup>8</sup>).\n\n"
+  <var>b</var>, <var>c</var>) with this property, and with 0 \\< <var>r</var> ≤ <var>R</var>
+  and 0 \\< <var>a</var> ≤ <var>X</var>.\n\nWe can verify that F(1, 5) = 10, F(2,
+  10) = 52 and F(10, 100) = 3384.  \nFind F(10<sup>8</sup>, 10<sup>9</sup>) + F(10<sup>9</sup>,
+  10<sup>8</sup>).\n\n"

data/data/problems/411.yml

@@ -1,18 +1,15 @@
 ---
 :id: 411
 :name: Uphill paths
-:url: http://projecteuler.net/problem=411
+:url: https://projecteuler.net/problem=411
 :content: "Let <var>n</var> be a positive integer. Suppose there are stations at the
   coordinates (<var>x</var>, <var>y</var>) = (2<sup><var>i</var></sup> mod <var>n</var>,
-  3<sup><var>i</var></sup> mod <var>n</var>) for 0 ![≤]({{ images_dir }}/symbol_le.gif)
-  <var>i</var> ![≤]({{ images_dir }}/symbol_le.gif) 2<var>n</var>. We will consider
-  stations with the same coordinates as the same station.\n\nWe wish to form a path
-  from (0, 0) to (<var>n</var>, <var>n</var>) such that the x and y coordinates never
-  decrease.  \n\rLet S(<var>n</var>) be the maximum number of stations such a path
-  can pass through.\n\nFor example, if <var>n</var> = 22, there are 11 distinct stations,
-  and a valid path can pass through at most 5 stations. Therefore, S(22) = 5.\rThe
-  case is illustrated below, with an example of an optimal path:\n\n![]({{ images_dir
-  }}/p411_longpath.png)\n\nIt can also be verified that S(123) = 14 and S(10000) =
-  48.\n\nFind ![∑]({{ images_dir }}/symbol_sum.gif) S(<var>k</var><sup>5</sup>) for
-  1 ![≤]({{ images_dir }}/symbol_le.gif) <var>k</var> ![≤]({{ images_dir }}/symbol_le.gif)
-  30.\n\n"
+  3<sup><var>i</var></sup> mod <var>n</var>) for 0 ≤ <var>i</var> ≤ 2<var>n</var>.
+  We will consider stations with the same coordinates as the same station.\n\nWe wish
+  to form a path from (0, 0) to (<var>n</var>, <var>n</var>) such that the x and y
+  coordinates never decrease.  \nLet S(<var>n</var>) be the maximum number of stations
+  such a path can pass through.\n\nFor example, if <var>n</var> = 22, there are 11
+  distinct stations, and a valid path can pass through at most 5 stations. Therefore,
+  S(22) = 5. The case is illustrated below, with an example of an optimal path:\n\n![p411_longpath.png]({{
+  images_dir }}/p411_longpath.png)\n\nIt can also be verified that S(123) = 14 and
+  S(10000) = 48.\n\nFind ∑ S(<var>k</var><sup>5</sup>) for 1 ≤ <var>k</var> ≤ 30.\n\n"

data/data/problems/412.yml

@@ -1,15 +1,15 @@
 ---
 :id: 412
 :name: Gnomon numbering
-:url: http://projecteuler.net/problem=412
-:content: "For integers <var>m</var>, <var>n</var> (0  ![≤]({{ images_dir }}/symbol_le.gif) <var>n</var> m),
-  let L(<var>m</var>, <var>n</var>) be an <var>m</var> ![×]({{ images_dir }}/symbol_times.gif)<var>m</var>
-  grid with the top-right <var>n</var> ![×]({{ images_dir }}/symbol_times.gif)<var>n</var>
-  grid removed.\n\nFor example, L(5, 3) looks like this:\n\n![]({{ images_dir }}/p412_table53.png)\n\nWe
-  want to number each cell of L(<var>m</var>, <var>n</var>) with consecutive integers
+:url: https://projecteuler.net/problem=412
+:content: "For integers <var>m</var>, <var>n</var> (0&nbsp;≤&nbsp;<var>n</var>&nbsp;\\<&nbsp;<var>m</var>),
+  let L(<var>m</var>,&nbsp;<var>n</var>) be an <var>m</var>×<var>m</var> grid with
+  the top-right <var>n</var>×<var>n</var> grid removed.\n\nFor example, L(5, 3) looks
+  like this:\n\n![p412_table53.png]({{ images_dir }}/p412_table53.png)\n\nWe want
+  to number each cell of L(<var>m</var>,&nbsp;<var>n</var>) with consecutive integers
   1, 2, 3, ... such that the number in every cell is smaller than the number below
-  it and to the left of it.\n\nFor example, here are two valid numberings of L(5, 3):\n\n![]({{
+  it and to the left of it.\n\nFor example, here are two valid numberings of L(5,&nbsp;3):\n\n![p412_tablenums.png]({{
   images_dir }}/p412_tablenums.png)\n\nLet LC(<var>m</var>, <var>n</var>) be the number
-  of valid numberings of L(<var>m</var>, <var>n</var>).  \n\rIt can be verified that
-  LC(3, 0) = 42, LC(5, 3) = 250250, LC(6, 3) = 406029023400 and LC(10, 5) mod 76543217
-  = 61251715.\n\nFind LC(10000, 5000) mod 76543217.\n\n"
+  of valid numberings of L(<var>m</var>, <var>n</var>).  \nIt can be verified that
+  LC(3,&nbsp;0) = 42, LC(5,&nbsp;3) = 250250, LC(6,&nbsp;3) = 406029023400 and LC(10,&nbsp;5)
+  mod 76543217 = 61251715.\n\nFind LC(10000,&nbsp;5000) mod 76543217.\n\n"

data/data/problems/413.yml

@@ -1,13 +1,12 @@
 ---
 :id: 413
 :name: One-child Numbers
-:url: http://projecteuler.net/problem=413
+:url: https://projecteuler.net/problem=413
 :content: "We say that a <var>d</var>-digit positive number (no leading zeros) is
   a one-child number if exactly one of its sub-strings is divisible by <var>d</var>.\n\nFor
   example, 5671 is a 4-digit one-child number. Among all its sub-strings 5, 6, 7,
-  1, 56, 67, 71, 567, 671 and 5671, only 56 is divisible by 4.  \n\rSimilarly, 104
-  is a 3-digit one-child number because only 0 is divisible by 3.  \n\r1132451 is
-  a 7-digit one-child number because only 245 is divisible by 7.\n\nLet F(<var>N</var>)
-  be the number of the one-child numbers less than <var>N</var>.  \n\rWe can verify
-  that F(10) = 9, F(10<sup>3</sup>) = 389 and F(10<sup>7</sup>) = 277674.\n\nFind
-  F(10<sup>19</sup>).\n\n"
+  1, 56, 67, 71, 567, 671 and 5671, only 56 is divisible by 4.  \nSimilarly, 104 is
+  a 3-digit one-child number because only 0 is divisible by 3.  \n1132451 is a 7-digit
+  one-child number because only 245 is divisible by 7.\n\nLet F(<var>N</var>) be the
+  number of the one-child numbers less than <var>N</var>.  \nWe can verify that F(10)
+  = 9, F(10<sup>3</sup>) = 389 and F(10<sup>7</sup>) = 277674.\n\nFind F(10<sup>19</sup>).\n\n"

data/data/problems/414.yml

@@ -1,33 +1,31 @@
 ---
 :id: 414
 :name: Kaprekar constant
-:url: http://projecteuler.net/problem=414
+:url: https://projecteuler.net/problem=414
 :content: "6174 is a remarkable number; if we sort its digits in increasing order
   and subtract that number from the number you get when you sort the digits in decreasing
-  order, we get 7641-1467=6174.  \n\rEven more remarkable is that if we start from
-  any 4 digit number and repeat this process of sorting and subtracting, we'll eventually
-  end up with 6174 or immediately with 0 if all digits are equal.  \n \rThis also
-  works with numbers that have less than 4 digits if we pad the number with leading
-  zeroes until we have 4 digits.  \n\rE.g. let's start with the number 0837:  \n\r8730-0378=8352
-  \ \n\r8532-2358=6174\n\n6174 is called the **Kaprekar constant** . The process of
-  sorting and subtracting and repeating this until either 0 or the Kaprekar constant
-  is reached is called the **Kaprekar routine** .\n\nWe can consider the Kaprekar
-  routine for other bases and number of digits.  \n \rUnfortunately, it is not guaranteed
-  a Kaprekar constant exists in all cases; either the routine can end up in a cycle
-  for some input numbers or the constant the routine arrives at can be different for
-  different input numbers.  \n\rHowever, it can be shown that for 5 digits and a base
-  b = 6t+3 ![≠]({{ images_dir }}/symbol_ne.gif)9, a Kaprekar constant exists.  \n\rE.g.
-  base 15: (10,4,14,9,5)<sub>15</sub>  \n\rbase 21: (14,6,20,13,7)<sub>21</sub>\n\nDefine
-  <var>C<sub>b</sub></var> to be the Kaprekar constant in base <var>b</var> for 5
-  digits.\rDefine the function <var>sb(i)</var> to be\n\n- 0 if i = <var>C<sub>b</sub></var>
-  or if <var>i</var> written in base <var>b</var> consists of 5 identical digits\r\n-
-  the number of iterations it takes the Kaprekar routine in base <var>b</var> to arrive
-  at <var>C<sub>b</sub></var>, otherwise\r\n\rNote that we can define <var>sb(i)</var>
-  for all integers <var>i</var> ![<]({{ images_dir }}/symbol_lt.gif) <var>b</var><sup>5</sup>.
-  If <var>i</var> written in base <var>b</var> takes less than 5 digits, the number
-  is padded with leading zero digits until we have 5 digits before applying the Kaprekar
-  routine.\r\r\n\nDefine <var>S(b)</var> as the sum of <var>sb(i)</var> for 0 ![<]({{
-  images_dir }}/symbol_lt.gif) <var>i</var> ![<]({{ images_dir }}/symbol_lt.gif) <var>b</var><sup>5</sup>.
-  \ \n\rE.g. S(15) = 5274369  \n \rS(111) = 400668930299\n\nFind the sum of S(6k+3)
-  for 2 ![≤]({{ images_dir }}/symbol_le.gif) k ![≤]({{ images_dir }}/symbol_le.gif)
-  300.  \n\rGive the last 18 digits as your answer.\n\n"
+  order, we get 7641-1467=6174.  \nEven more remarkable is that if we start from any
+  4 digit number and repeat this process of sorting and subtracting, we'll eventually
+  end up with 6174 or immediately with 0 if all digits are equal.  \n This also works
+  with numbers that have less than 4 digits if we pad the number with leading zeroes
+  until we have 4 digits.  \nE.g. let's start with the number 0837:  \n8730-0378=8352
+  \ \n8532-2358=6174\n\n6174 is called the **Kaprekar constant**. The process of sorting
+  and subtracting and repeating this until either 0 or the Kaprekar constant is reached
+  is called the **Kaprekar routine**.\n\nWe can consider the Kaprekar routine for
+  other bases and number of digits.  \n Unfortunately, it is not guaranteed a Kaprekar
+  constant exists in all cases; either the routine can end up in a cycle for some
+  input numbers or the constant the routine arrives at can be different for different
+  input numbers.  \nHowever, it can be shown that for 5 digits and a base b = 6t+3≠9,
+  a Kaprekar constant exists.  \nE.g. base 15: (10,4,14,9,5)<sub>15</sub>  \nbase
+  21: (14,6,20,13,7)<sub>21</sub>\n\nDefine <var>C<sub>b</sub></var> to be the Kaprekar
+  constant in base <var>b</var> for 5 digits. Define the function <var>sb(i)</var>
+  to be\n\n- 0 if i = <var>C<sub>b</sub></var> or if <var>i</var> written in base
+  <var>b</var> consists of 5 identical digits\n- the number of iterations it takes
+  the Kaprekar routine in base <var>b</var> to arrive at <var>C<sub>b</sub></var>,
+  otherwise\nNote that we can define <var>sb(i)</var> for all integers <var>i</var>
+  \\< <var>b</var><sup>5</sup>. If <var>i</var> written in base <var>b</var> takes
+  less than 5 digits, the number is padded with leading zero digits until we have
+  5 digits before applying the Kaprekar routine.\n\nDefine <var>S(b)</var> as the
+  sum of <var>sb(i)</var> for 0 \\< <var>i</var> \\< <var>b</var><sup>5</sup>.  \nE.g.
+  S(15) = 5274369  \n S(111) = 400668930299\n\nFind the sum of S(6k+3) for 2 ≤ k ≤
+  300.  \nGive the last 18 digits as your answer.\n\n"

data/data/problems/415.yml

@@ -1,16 +1,15 @@
 ---
 :id: 415
 :name: Titanic sets
-:url: http://projecteuler.net/problem=415
-:content: "A set of lattice points S is called a _titanic set_ if there exists a line
-  passing through exactly two points in S.\n\nAn example of a titanic set is S = {(0,
-  0), (0, 1), (0, 2), (1, 1), (2, 0), (1, 0)}, where the line passing through (0,
-  1) and (2, 0) does not pass through any other point in S.\n\nOn the other hand,
-  the set {(0, 0), (1, 1), (2, 2), (4, 4)} is not a titanic set since the line passing
-  through any two points in the set also passes through the other two.\n\nFor any
-  positive integer <var>N</var>, let <var>T</var>(<var>N</var>) be the number of titanic
-  sets S whose every point (<var>x</var>, <var>y</var>) satisfies 0 ![≤]({{ images_dir
-  }}/symbol_le.gif) <var>x</var>, <var>y</var> ![≤]({{ images_dir }}/symbol_le.gif)
-  <var>N</var>.\rIt can be verified that <var>T</var>(1) = 11, <var>T</var>(2) = 494,
-  <var>T</var>(4) = 33554178, <var>T</var>(111) mod 10<sup>8</sup> = 13500401 and
-  <var>T</var>(10<sup>5</sup>) mod 10<sup>8</sup> = 63259062.\n\nFind <var>T</var>(10<sup>11</sup>) mod 10<sup>8</sup>.\n\n"
+:url: https://projecteuler.net/problem=415
+:content: |+
+  A set of lattice points S is called a _titanic set_ if there exists a line passing through exactly two points in S.
+
+  An example of a titanic set is S = {(0, 0), (0, 1), (0, 2), (1, 1), (2, 0), (1, 0)}, where the line passing through (0, 1) and (2, 0) does not pass through any other point in S.
+
+  On the other hand, the set {(0, 0), (1, 1), (2, 2), (4, 4)} is not a titanic set since the line passing through any two points in the set also passes through the other two.
+
+  For any positive integer <var>N</var>, let <var>T</var>(<var>N</var>) be the number of titanic sets S whose every point (<var>x</var>, <var>y</var>) satisfies 0 ≤ <var>x</var>, <var>y</var> ≤ <var>N</var>. It can be verified that <var>T</var>(1) = 11, <var>T</var>(2) = 494, <var>T</var>(4) = 33554178, <var>T</var>(111) mod 10<sup>8</sup> = 13500401 and <var>T</var>(10<sup>5</sup>)&nbsp;mod&nbsp;10<sup>8</sup> = 63259062.
+
+  Find <var>T</var>(10<sup>11</sup>)&nbsp;mod&nbsp;10<sup>8</sup>.
+

data/data/problems/416.yml

@@ -1,13 +1,13 @@
 ---
 :id: 416
 :name: A frog's trip
-:url: http://projecteuler.net/problem=416
+:url: https://projecteuler.net/problem=416
 :content: "A row of <var>n</var> squares contains a frog in the leftmost square. By
   successive jumps the frog goes to the rightmost square and then back to the leftmost
   square. On the outward trip he jumps one, two or three squares to the right, and
   on the homeward trip he jumps to the left in a similar manner. He cannot jump outside
   the squares. He repeats the round-trip travel <var>m</var> times.\n\nLet F(<var>m</var>,
   <var>n</var>) be the number of the ways the frog can travel so that at most one
-  square remains unvisited.  \n\rFor example, F(1, 3) = 4, F(1, 4) = 15, F(1, 5) =
-  46, F(2, 3) = 16 and F(2, 100) mod 10<sup>9</sup> = 429619151.\n\nFind the last
-  9 digits of F(10, 10<sup>12</sup>).\n\n"
+  square remains unvisited.  \nFor example, F(1, 3) = 4, F(1, 4) = 15, F(1, 5) = 46,
+  F(2, 3) = 16 and F(2, 100) mod 10<sup>9</sup> = 429619151.\n\nFind the last 9 digits
+  of F(10, 10<sup>12</sup>).\n\n"

data/data/problems/417.yml

@@ -1,19 +1,17 @@
 ---
 :id: 417
 :name: Reciprocal cycles II
-:url: http://projecteuler.net/problem=417
+:url: https://projecteuler.net/problem=417
 :content: "A unit fraction contains 1 in the numerator. The decimal representation
   of the unit fractions with denominators 2 to 10 are given:\n\n> | <sup>1</sup>/<sub>2</sub>
-  | =  | 0.5 |\n> | <sup>1</sup>/<sub>3</sub> | =  | 0.(3) |\n> | <sup>1</sup>/<sub>4</sub>
-  | =  | 0.25 |\n> | <sup>1</sup>/<sub>5</sub> | =  | 0.2 |\n> | <sup>1</sup>/<sub>6</sub>
-  | =  | 0.1(6) |\n> | <sup>1</sup>/<sub>7</sub> | =  | 0.(142857) |\n> | <sup>1</sup>/<sub>8</sub>
-  | =  | 0.125 |\n> | <sup>1</sup>/<sub>9</sub> | =  | 0.(1) |\n> | <sup>1</sup>/<sub>10</sub>
-  | =  | 0.1 |\n\nWhere 0.1(6) means 0.166666..., and has a 1-digit recurring cycle.
-  It can be seen that <sup>1</sup>/<sub>7</sub> has a 6-digit recurring cycle.\n\nUnit
-  fractions whose denominator has no other prime factors than 2 and/or 5 are not considered
-  to have a recurring cycle.  \n\rWe define the length of the recurring cycle of those
-  unit fractions as 0.\n\nLet L(n) denote the length of the recurring cycle of 1/n.\rYou
-  are given that ![∑]({{ images_dir }}/symbol_sum.gif)L(n) for 3 ![≤]({{ images_dir
-  }}/symbol_le.gif) n ![≤]({{ images_dir }}/symbol_le.gif) 1 000 000 equals 55535191115.\n\nFind
-  ![∑]({{ images_dir }}/symbol_sum.gif)L(n) for 3 ![≤]({{ images_dir }}/symbol_le.gif)
-  n ![≤]({{ images_dir }}/symbol_le.gif) 100 000 000\n\n"
+  | =&nbsp; | 0.5 |\n> | <sup>1</sup>/<sub>3</sub> | =&nbsp; | 0.(3) |\n> | <sup>1</sup>/<sub>4</sub>
+  | =&nbsp; | 0.25 |\n> | <sup>1</sup>/<sub>5</sub> | =&nbsp; | 0.2 |\n> | <sup>1</sup>/<sub>6</sub>
+  | =&nbsp; | 0.1(6) |\n> | <sup>1</sup>/<sub>7</sub> | =&nbsp; | 0.(142857) |\n>
+  | <sup>1</sup>/<sub>8</sub> | =&nbsp; | 0.125 |\n> | <sup>1</sup>/<sub>9</sub> |
+  =&nbsp; | 0.(1) |\n> | <sup>1</sup>/<sub>10</sub> | =&nbsp; | 0.1 |\n\nWhere 0.1(6)
+  means 0.166666..., and has a 1-digit recurring cycle. It can be seen that <sup>1</sup>/<sub>7</sub>
+  has a 6-digit recurring cycle.\n\nUnit fractions whose denominator has no other
+  prime factors than 2 and/or 5 are not considered to have a recurring cycle.  \nWe
+  define the length of the recurring cycle of those unit fractions as 0.\n\nLet L(n)
+  denote the length of the recurring cycle of 1/n. You are given that ∑L(n) for 3
+  ≤ n ≤ 1 000 000 equals 55535191115.\n\nFind ∑L(n) for 3 ≤ n ≤ 100 000 000\n\n"

data/data/problems/418.yml

@@ -1,13 +1,16 @@
 ---
 :id: 418
 :name: Factorisation triples
-:url: http://projecteuler.net/problem=418
-:content: "Let <var>n</var> be a positive integer. An integer triple (<var>a</var>,
-  <var>b</var>, <var>c</var>) is called a _factorisation triple_ of <var>n</var> if:\n\n-
-  1 ![≤]({{ images_dir }}/symbol_le.gif) <var>a</var> ![≤]({{ images_dir }}/symbol_le.gif)
-  <var>b</var> ![≤]({{ images_dir }}/symbol_le.gif) <var>c</var>\n- <var>a</var>·<var>b</var>·<var>c</var>
-  = <var>n</var>.\r\n\nDefine <var>f</var>(<var>n</var>) to be <var>a</var> + <var>b</var>
-  + <var>c</var> for the factorisation triple (<var>a</var>, <var>b</var>, <var>c</var>)
-  of <var>n</var> which minimises <var>c</var> / <var>a</var>. One can show that this
-  triple is unique.\n\nFor example, <var>f</var>(165) = 19, <var>f</var>(100100) =
-  142 and <var>f</var>(20!) = 4034872.\n\nFind <var>f</var>(43!).\n\n"
+:url: https://projecteuler.net/problem=418
+:content: |+
+  Let <var>n</var> be a positive integer. An integer triple (<var>a</var>, <var>b</var>, <var>c</var>) is called a _factorisation triple_ of <var>n</var> if:
+
+  - 1 ≤ <var>a</var> ≤ <var>b</var> ≤ <var>c</var>
+  - <var>a</var>·<var>b</var>·<var>c</var> = <var>n</var>.
+
+  Define <var>f</var>(<var>n</var>) to be <var>a</var> + <var>b</var> + <var>c</var> for the factorisation triple (<var>a</var>, <var>b</var>, <var>c</var>) of <var>n</var> which minimises <var>c</var> / <var>a</var>. One can show that this triple is unique.
+
+  For example, <var>f</var>(165) = 19, <var>f</var>(100100) = 142 and <var>f</var>(20!) = 4034872.
+
+  Find <var>f</var>(43!).
+

data/data/problems/419.yml

@@ -1,17 +1,15 @@
 ---
 :id: 419
 :name: Look and say sequence
-:url: http://projecteuler.net/problem=419
+:url: https://projecteuler.net/problem=419
 :content: "The **look and say** sequence goes 1, 11, 21, 1211, 111221, 312211, 13112221,
-  1113213211, ...  \n\rThe sequence starts with 1 and all other members are obtained
-  by describing the previous member in terms of consecutive digits.  \n\rIt helps
-  to do this out loud:  \n\r1 is 'one one' ![→]({{ images_dir }}/symbol_maps.gif)
-  11  \n\r11 is 'two ones' ![→]({{ images_dir }}/symbol_maps.gif) 21  \n\r21 is 'one
-  two and one one' ![→]({{ images_dir }}/symbol_maps.gif) 1211   \n\r1211 is 'one
-  one, one two and two ones' ![→]({{ images_dir }}/symbol_maps.gif) 111221  \n\r111221
-  is 'three ones, two twos and one one' ![→]({{ images_dir }}/symbol_maps.gif) 312211
-  \ \n\r...\n\nDefine A(n), B(n) and C(n) as the number of ones, twos and threes in
-  the n'th element of the sequence respectively.  \n\rOne can verify that A(40) =
-  31254, B(40) = 20259 and C(40) = 11625.\n\nFind A(n), B(n) and C(n) for n = 10<sup>12</sup>.
-  \ \n \rGive your answer modulo 2<sup>30</sup> and separate your values for A, B
-  and C by a comma.  \n \rE.g. for n = 40 the answer would be 31254,20259,11625\n\n"
+  1113213211, ...  \nThe sequence starts with 1 and all other members are obtained
+  by describing the previous member in terms of consecutive digits.  \nIt helps to
+  do this out loud:  \n1 is 'one one' → 11  \n11 is 'two ones' → 21  \n21 is 'one
+  two and one one' → 1211   \n1211 is 'one one, one two and two ones' → 111221  \n111221
+  is 'three ones, two twos and one one' → 312211  \n...\n\nDefine A(n), B(n) and C(n)
+  as the number of ones, twos and threes in the n'th element of the sequence respectively.
+  \ \nOne can verify that A(40) = 31254, B(40) = 20259 and C(40) = 11625.\n\nFind
+  A(n), B(n) and C(n) for n = 10<sup>12</sup>.  \n Give your answer modulo 2<sup>30</sup>
+  and separate your values for A, B and C by a comma.  \n E.g. for n = 40 the answer
+  would be 31254,20259,11625\n\n"

data/data/problems/42.yml

@@ -1,7 +1,7 @@
 ---
 :id: 42
 :name: Coded triangle numbers
-:url: http://projecteuler.net/problem=42
+:url: https://projecteuler.net/problem=42
 :content: |+
   The _n_<sup>th</sup> term of the sequence of triangle numbers is given by, _t<sub>n</sub>_ = ½_n_(_n_+1); so the first ten triangle numbers are:
 
@@ -9,5 +9,5 @@
 
   By converting each letter in a word to a number corresponding to its alphabetical position and adding these values we form a word value. For example, the word value for SKY is 19 + 11 + 25 = 55 = _t_<sub>10</sub>. If the word value is a triangle number then we shall call the word a triangle word.
 
-  Using [words.txt](project/words.txt) (right click and 'Save Link/Target As...'), a 16K text file containing nearly two-thousand common English words, how many are triangle words?
+  Using [words.txt](project/resources/p042_words.txt) (right click and 'Save Link/Target As...'), a 16K text file containing nearly two-thousand common English words, how many are triangle words?
 

data/data/problems/420.yml

@@ -1,12 +1,12 @@
 ---
 :id: 420
 :name: 2x2 positive integer matrix
-:url: http://projecteuler.net/problem=420
+:url: https://projecteuler.net/problem=420
 :content: "A _positive integer matrix_ is a matrix whose elements are all positive
-  integers.  \n\rSome positive integer matrices can be expressed as a square of a
-  positive integer matrix in two different ways. Here is an example:\n\n ![]({{ images_dir
-  }}/p_420_matrix.gif)\n\nWe define F(<var>N</var>) as the number of the 2x2 positive
-  integer matrices which have a <dfn title=\"the sum of the elements on the main diagonal\">trace</dfn>
-  less than <var>N</var> and which can be expressed as a square of a positive integer
-  matrix in two different ways.  \n\rWe can verify that F(50) = 7 and F(1000) = 1019.\n\nFind
-  F(10<sup>7</sup>).\n\n"
+  integers.  \nSome positive integer matrices can be expressed as a square of a positive
+  integer matrix in two different ways. Here is an example:\n\n ![p420_matrix.gif]({{
+  images_dir }}/p420_matrix.gif)\n\nWe define F(<var>N</var>) as the number of the
+  2x2 positive integer matrices which have a <dfn title=\"the sum of the elements
+  on the main diagonal\">trace</dfn> less than <var>N</var> and which can be expressed
+  as a square of a positive integer matrix in two different ways.  \nWe can verify
+  that F(50) = 7 and F(1000) = 1019.\n\nFind F(10<sup>7</sup>).\n\n"

data/data/problems/421.yml

@@ -1,17 +1,12 @@
 ---
 :id: 421
 :name: Prime factors of <var>n</var><sup>15</sup>+1
-:url: http://projecteuler.net/problem=421
+:url: https://projecteuler.net/problem=421
 :content: "Numbers of the form <var>n</var><sup>15</sup>+1 are composite for every
-  integer <var>n</var> ![>]({{ images_dir }}/symbol_gt.gif) 1.  \n\rFor positive integers
-  <var>n</var> and <var>m</var> let <var>s</var>(<var>n,m</var>) be defined as the
-  sum of the _distinct_ prime factors of <var>n</var><sup>15</sup>+1 not exceeding
-  <var>m</var>.\n\n\rE.g. 2<sup>15</sup>+1 = 3 ![×]({{ images_dir }}/symbol_times.gif)3
-  ![×]({{ images_dir }}/symbol_times.gif)11 ![×]({{ images_dir }}/symbol_times.gif)331.
-  \ \n\rSo <var>s</var>(2,10) = 3 and <var>s</var>(2,1000) = 3+11+331 = 345.  \n  \n
-  \ \n\r\rAlso 10<sup>15</sup>+1 = 7 ![×]({{ images_dir }}/symbol_times.gif)11 ![×]({{
-  images_dir }}/symbol_times.gif)13 ![×]({{ images_dir }}/symbol_times.gif)211 ![×]({{
-  images_dir }}/symbol_times.gif)241 ![×]({{ images_dir }}/symbol_times.gif)2161 ![×]({{
-  images_dir }}/symbol_times.gif)9091.  \n\rSo <var>s</var>(10,100) = 31 and <var>s</var>(10,1000)
-  = 483.  \n\nFind &Sum; <var>s</var>(<var>n</var>,10<sup>8</sup>) for 1 ![≤]({{ images_dir
-  }}/symbol_le.gif) <var>n</var> ![≤]({{ images_dir }}/symbol_le.gif) 10<sup>11</sup>.\n\n"
+  integer <var>n</var> \\> 1.  \nFor positive integers <var>n</var> and <var>m</var>
+  let <var>s</var>(<var>n,m</var>) be defined as the sum of the _distinct_ prime factors
+  of <var>n</var><sup>15</sup>+1 not exceeding <var>m</var>.\n\nE.g. 2<sup>15</sup>+1
+  = 3×3×11×331.  \nSo <var>s</var>(2,10) = 3 and <var>s</var>(2,1000) = 3+11+331 =
+  345.  \n  \nAlso 10<sup>15</sup>+1 = 7×11×13×211×241×2161×9091.  \nSo <var>s</var>(10,100)
+  = 31 and <var>s</var>(10,1000) = 483.  \n\nFind ∑ <var>s</var>(<var>n</var>,10<sup>8</sup>)
+  for 1 ≤ <var>n</var> ≤ 10<sup>11</sup>.\n\n"

data/data/problems/422.yml

@@ -1,20 +1,20 @@
 ---
 :id: 422
 :name: Sequence of points on a hyperbola
-:url: http://projecteuler.net/problem=422
+:url: https://projecteuler.net/problem=422
 :content: "Let H be the hyperbola defined by the equation 12<var>x</var><sup>2</sup>
   + 7<var>x</var><var>y</var> - 12<var>y</var><sup>2</sup> = 625.\n\nNext, define
   X as the point (7, 1). It can be seen that X is in H.\n\nNow we define a sequence
-  of points in H, {P<sub><var>i</var></sub> : <var>i</var> ![≥]({{ images_dir }}/symbol_ge.gif)
-  1}, as:\n\n- P<sub>1</sub> = (13, 61/4).\r\n- P<sub>2</sub> = (-43/6, -4).\r\n-
-  For <var>i</var> > 2, P<sub><var>i</var></sub> is the unique point in H that is
-  different from P<sub><var>i</var>-1</sub> and such that line P<sub><var>i</var></sub>P<sub><var>i</var>-1</sub>
-  is parallel to line P<sub><var>i</var>-2</sub>X. It can be shown that P<sub><var>i</var></sub>
-  is well-defined, and that its coordinates are always rational.\r\n ![]({{ images_dir
+  of points in H, {P<sub><var>i</var></sub> : <var>i</var> ≥ 1}, as:\n\n- P<sub>1</sub>
+  = (13, 61/4).\n- P<sub>2</sub> = (-43/6, -4).\n- For <var>i</var> \\> 2, P<sub><var>i</var></sub>
+  is the unique point in H that is different from P<sub><var>i</var>-1</sub> and such
+  that line P<sub><var>i</var></sub>P<sub><var>i</var>-1</sub> is parallel to line
+  P<sub><var>i</var>-2</sub>X. It can be shown that P<sub><var>i</var></sub> is well-defined,
+  and that its coordinates are always rational.\n ![p422_hyperbola.gif]({{ images_dir
   }}/p422_hyperbola.gif)\n\nYou are given that P<sub>3</sub> = (-19/2, -229/24), P<sub>4</sub>
   = (1267/144, -37/12) and P<sub>7</sub> = (17194218091/143327232, 274748766781/1719926784).\n\nFind
   P<sub><var>n</var></sub> for <var>n</var> = 11<sup>14</sup> in the following format:
   \ \nIf P<sub><var>n</var></sub> = (<var>a</var>/<var>b</var>, <var>c</var>/<var>d</var>)
   where the fractions are in lowest terms and the denominators are positive, then
-  the answer is (<var>a</var> + <var>b</var> + <var>c</var> + <var>d</var>) mod 1 000 000 007.\n\nFor
+  the answer is (<var>a</var> + <var>b</var> + <var>c</var> + <var>d</var>) mod 1&nbsp;000&nbsp;000&nbsp;007.\n\nFor
   <var>n</var> = 7, the answer would have been: 806236837.\n\n"

data/data/problems/423.yml

@@ -1,18 +1,17 @@
 ---
 :id: 423
 :name: Consecutive die throws
-:url: http://projecteuler.net/problem=423
-:content: "Let <var>n</var> be a positive integer.  \n\rA 6-sided die is thrown <var>n</var>
+:url: https://projecteuler.net/problem=423
+:content: "Let <var>n</var> be a positive integer.  \nA 6-sided die is thrown <var>n</var>
   times. Let <var>c</var> be the number of pairs of consecutive throws that give the
   same value.\n\nFor example, if <var>n</var> = 7 and the values of the die throws
   are (1,1,5,6,6,6,3), then the following pairs of consecutive throws give the same
-  value:  \n\r(<u>1,1</u>,5,6,6,6,3)  \n\r(1,1,5,<u>6,6</u>,6,3)  \n\r(1,1,5,6,<u>6,6</u>,3)
-  \ \n\rTherefore, <var>c</var> = 3 for (1,1,5,6,6,6,3).\n\nDefine C(<var>n</var>)
-  as the number of outcomes of throwing a 6-sided die <var>n</var> times such that
-  <var>c</var> does not exceed π(<var>n</var>).<sup>1</sup>  \n\rFor example, C(3)
-  = 216, C(4) = 1290, C(11) = 361912500 and C(24) = 4727547363281250000.\n\nDefine
-  S(<var>L</var>) as ![∑]({{ images_dir }}/symbol_sum.gif) C(<var>n</var>) for 1 ![≤]({{
-  images_dir }}/symbol_le.gif) <var>n</var> ![≤]({{ images_dir }}/symbol_le.gif) <var>L</var>.
-  \ \n\rFor example, S(50) mod 1 000 000 007 = 832833871.\n\nFind S(50 000 000) mod
-  1 000 000 007.\n\n<sup>1</sup> π denotes the **prime-counting function** , i.e.
-  π(<var>n</var>) is the number of primes ![≤]({{ images_dir }}/symbol_le.gif) <var>n</var>.\n\n"
+  value:  \n(<u>1,1</u>,5,6,6,6,3)  \n(1,1,5,<u>6,6</u>,6,3)  \n(1,1,5,6,<u>6,6</u>,3)
+  \ \nTherefore, <var>c</var> = 3 for (1,1,5,6,6,6,3).\n\nDefine C(<var>n</var>) as
+  the number of outcomes of throwing a 6-sided die <var>n</var> times such that <var>c</var>
+  does not exceed π(<var>n</var>).<sup>1</sup>  \nFor example, C(3) = 216, C(4) =
+  1290, C(11) = 361912500 and C(24) = 4727547363281250000.\n\nDefine S(<var>L</var>)
+  as ∑ C(<var>n</var>) for 1 ≤ <var>n</var> ≤ <var>L</var>.  \nFor example, S(50)
+  mod 1&nbsp;000&nbsp;000&nbsp;007 = 832833871.\n\nFind S(50&nbsp;000&nbsp;000) mod
+  1&nbsp;000&nbsp;000&nbsp;007.\n\n<sup>1</sup> π denotes the **prime-counting function**
+  , i.e. π(<var>n</var>) is the number of primes ≤ <var>n</var>.\n\n"