euler-manager 0.1.1 → 0.2.0

data/data/problems/395.yml

@@ -1,18 +1,19 @@
 ---
 :id: 395
 :name: Pythagorean tree
-:url: http://projecteuler.net/problem=395
-:content: "The **Pythagorean tree** is a fractal generated by the following procedure:\n\nStart
-  with a unit square. Then, calling one of the sides its base (in the animation, the
-  bottom side is the base):\n\n1. Attach a right triangle to the side opposite the
-  base, with the hypotenuse coinciding with that side and with the sides in a 3-4-5
-  ratio. Note that the smaller side of the triangle must be on the 'right' side with
-  respect to the base (see animation).\n2. Attach a square to each leg of the right
-  triangle, with one of its sides coinciding with that leg.\n3. Repeat this procedure
-  for both squares, considering as their bases the sides touching the triangle.\n\rThe
-  resulting figure, after an infinite number of iterations, is the Pythagorean tree.\r\r\r\n
-  ![]({{ images_dir }}/p_395_pythagorean.gif)\n\nIt can be shown that there exists
-  at least one rectangle, whose sides are parallel to the largest square of the Pythagorean
-  tree, which encloses the Pythagorean tree completely.\n\nFind the smallest area
-  possible for such a bounding rectangle, and give your answer rounded to 10 decimal
-  places.\n\n"
+:url: https://projecteuler.net/problem=395
+:content: |+
+  The **Pythagorean tree** is a fractal generated by the following procedure:
+
+  Start with a unit square. Then, calling one of the sides its base (in the animation, the bottom side is the base):
+
+  1. Attach a right triangle to the side opposite the base, with the hypotenuse coinciding with that side and with the sides in a 3-4-5 ratio. Note that the smaller side of the triangle must be on the 'right' side with respect to the base (see animation).
+  2. Attach a square to each leg of the right triangle, with one of its sides coinciding with that leg.
+  3. Repeat this procedure for both squares, considering as their bases the sides touching the triangle.
+  The resulting figure, after an infinite number of iterations, is the Pythagorean tree.
+   ![p395_pythagorean.gif]({{ images_dir }}/p395_pythagorean.gif)
+
+  It can be shown that there exists at least one rectangle, whose sides are parallel to the largest square of the Pythagorean tree, which encloses the Pythagorean tree completely.
+
+  Find the smallest area possible for such a bounding rectangle, and give your answer rounded to 10 decimal places.
+

data/data/problems/396.yml

@@ -1,21 +1,18 @@
 ---
 :id: 396
 :name: Weak Goodstein sequence
-:url: http://projecteuler.net/problem=396
+:url: https://projecteuler.net/problem=396
 :content: "For any positive integer n, the **nth weak Goodstein sequence** {g<sub>1</sub>,
   g<sub>2</sub>, g<sub>3</sub>, ...} is defined as:\n\n- g<sub>1</sub> = <var>n</var>\n-
-  for <var>k</var> ![>]({{ images_dir }}/symbol_gt.gif) 1, g<sub><var>k</var></sub>
-  is obtained by writing g<sub><var>k</var>-1</sub> in base <var>k</var>, interpreting
-  it as a base <var>k</var> + 1 number, and subtracting 1.\r\n\rThe sequence terminates
-  when g<sub><var>k</var></sub> becomes 0.\r\r\n\nFor example, the 6th weak Goodstein
-  sequence is {6, 11, 17, 25, ...}:\n\n- g<sub>1</sub> = 6.\r\n- g<sub>2</sub> = 11
-  since 6 = 110<sub>2</sub>, 110<sub>3</sub> = 12, and 12 - 1 = 11.\r\n- g<sub>3</sub>
-  = 17 since 11 = 102<sub>3</sub>, 102<sub>4</sub> = 18, and 18 - 1 = 17.\r\n- g<sub>4</sub>
-  = 25 since 17 = 101<sub>4</sub>, 101<sub>5</sub> = 26, and 26 - 1 = 25.\r\n\rand
-  so on.\r\r\n\nIt can be shown that every weak Goodstein sequence terminates.\n\nLet
-  G(<var>n</var>) be the number of nonzero elements in the <var>n</var>th weak Goodstein
-  sequence.  \n\rIt can be verified that G(2) = 3, G(4) = 21 and G(6) = 381.  \n\rIt
-  can also be verified that ΣG(<var>n</var>) = 2517 for 1 ![≤]({{ images_dir }}/symbol_le.gif)
-  <var>n</var> ![<]({{ images_dir }}/symbol_lt.gif) 8.\n\nFind the last 9 digits of
-  ΣG(<var>n</var>) for 1 ![≤]({{ images_dir }}/symbol_le.gif) <var>n</var> ![<]({{
-  images_dir }}/symbol_lt.gif) 16.\n\n"
+  for <var>k</var> \\> 1, g<sub><var>k</var></sub> is obtained by writing g<sub><var>k</var>-1</sub>
+  in base <var>k</var>, interpreting it as a base <var>k</var> + 1 number, and subtracting
+  1.\nThe sequence terminates when g<sub><var>k</var></sub> becomes 0.\n\nFor example,
+  the 6th weak Goodstein sequence is {6, 11, 17, 25, ...}:\n\n- g<sub>1</sub> = 6.\n-
+  g<sub>2</sub> = 11 since 6 = 110<sub>2</sub>, 110<sub>3</sub> = 12, and 12 - 1 =
+  11.\n- g<sub>3</sub> = 17 since 11 = 102<sub>3</sub>, 102<sub>4</sub> = 18, and
+  18 - 1 = 17.\n- g<sub>4</sub> = 25 since 17 = 101<sub>4</sub>, 101<sub>5</sub> =
+  26, and 26 - 1 = 25.\nand so on.\n\nIt can be shown that every weak Goodstein sequence
+  terminates.\n\nLet G(<var>n</var>) be the number of nonzero elements in the <var>n</var>th
+  weak Goodstein sequence.  \nIt can be verified that G(2) = 3, G(4) = 21 and G(6)
+  = 381.  \nIt can also be verified that ΣG(<var>n</var>) = 2517 for 1 ≤ <var>n</var>
+  \\< 8.\n\nFind the last 9 digits of ΣG(<var>n</var>) for 1 ≤ <var>n</var> \\< 16.\n\n"

data/data/problems/397.yml

@@ -1,14 +1,12 @@
 ---
 :id: 397
 :name: Triangle on parabola
-:url: http://projecteuler.net/problem=397
+:url: https://projecteuler.net/problem=397
 :content: "On the parabola <var>y</var> = <var>x</var><sup>2</sup>/<var>k</var>, three
   points A(<var>a</var>, <var>a</var><sup>2</sup>/<var>k</var>), B(<var>b</var>, <var>b</var><sup>2</sup>/<var>k</var>)
   and C(<var>c</var>, <var>c</var><sup>2</sup>/<var>k</var>) are chosen.\n\nLet F(<var>K</var>,
   <var>X</var>) be the number of the integer quadruplets (<var>k</var>, <var>a</var>,
   <var>b</var>, <var>c</var>) such that at least one angle of the triangle ABC is
-  45-degree, with 1 ![≤]({{ images_dir }}/symbol_le.gif) <var>k</var> ![≤]({{ images_dir
-  }}/symbol_le.gif) <var>K</var> and -<var>X</var> ![≤]({{ images_dir }}/symbol_le.gif)
-  <var>a</var> ![<]({{ images_dir }}/symbol_lt.gif) <var>b</var> ![<]({{ images_dir
-  }}/symbol_lt.gif) <var>c</var> ![≤]({{ images_dir }}/symbol_le.gif) <var>X</var>.\n\nFor
-  example, F(1, 10) = 41 and F(10, 100) = 12492.  \n\rFind F(10<sup>6</sup>, 10<sup>9</sup>).\n\n"
+  45-degree, with 1 ≤ <var>k</var> ≤ <var>K</var> and -<var>X</var> ≤ <var>a</var>
+  \\< <var>b</var> \\< <var>c</var> ≤ <var>X</var>.\n\nFor example, F(1, 10) = 41
+  and F(10, 100) = 12492.  \nFind F(10<sup>6</sup>, 10<sup>9</sup>).\n\n"

data/data/problems/398.yml

@@ -1,12 +1,11 @@
 ---
 :id: 398
 :name: Cutting rope
-:url: http://projecteuler.net/problem=398
-:content: "Inside a rope of length <var>n</var>, <var>n</var>-1 points are placed
-  with distance 1 from each other and from the endpoints. Among these points, we choose
-  <var>m</var>-1 points at random and cut the rope at these points to create <var>m</var>
-  segments.\n\nLet E(<var>n</var>, <var>m</var>) be the expected length of the second-shortest
-  segment.\rFor example, E(3, 2) = 2 and E(8, 3) = 16/7.\rNote that if multiple segments
-  have the same shortest length the length of the second-shortest segment is defined
-  as the same as the shortest length.\n\nFind E(10<sup>7</sup>, 100).\rGive your answer
-  rounded to 5 decimal places behind the decimal point.\n\n"
+:url: https://projecteuler.net/problem=398
+:content: |+
+  Inside a rope of length <var>n</var>, <var>n</var>-1 points are placed with distance 1 from each other and from the endpoints. Among these points, we choose <var>m</var>-1 points at random and cut the rope at these points to create <var>m</var> segments.
+
+  Let E(<var>n</var>, <var>m</var>) be the expected length of the second-shortest segment. For example, E(3, 2) = 2 and E(8, 3) = 16/7. Note that if multiple segments have the same shortest length the length of the second-shortest segment is defined as the same as the shortest length.
+
+  Find E(10<sup>7</sup>, 100). Give your answer rounded to 5 decimal places behind the decimal point.
+

data/data/problems/399.yml

@@ -1,22 +1,21 @@
 ---
 :id: 399
 :name: Squarefree Fibonacci Numbers
-:url: http://projecteuler.net/problem=399
-:content: "The first 15 fibonacci numbers are:  \n\r1,1,2,3,5,8,13,21,34,55,89,144,233,377,610.
-  \ \n\rIt can be seen that 8 and 144 are not squarefree: 8 is divisible by 4 and
-  144 is divisible by 4 and by 9.  \n \rSo the first 13 squarefree fibonacci numbers
-  are:  \n\r1,1,2,3,5,13,21,34,55,89,233,377 and 610.\n\nThe 200th squarefree fibonacci
-  number is:\r971183874599339129547649988289594072811608739584170445.  \n\rThe last
-  sixteen digits of this number are: 1608739584170445 and in scientific notation this
-  number can be written as 9.7e53.\n\nFind the 100 000 000th squarefree fibonacci
-  number.  \n\rGive as your answer its last sixteen digits followed by a comma followed
-  by the number in scientific notation (rounded to one digit after the decimal point).
-  \ \n\rFor the 200th squarefree number the answer would have been: 1608739584170445,9.7e53\n\n<font
-  size=\"-1\">\r\nNote:<br> \r\nFor this problem, assume that for every prime p, the
-  first fibonacci number divisible by p is not divisible by p<sup>2</sup> (this is
-  part of <b>Wall's conjecture</b>). This has been verified for primes <img src=\"%7B%7B%20images_dir%20%7D%7D/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  3·10<sup>15</sup>, but has not been proven in general.<br>\r\n\r\n\r\nIf it happens
-  that the conjecture is false, then the accepted answer to this problem isn't guaranteed
-  to be the 100 000 000th squarefree fibonacci number, rather it represents only a
-  lower bound for that number.\r\n</font>\n\n"
+:url: https://projecteuler.net/problem=399
+:content: "The first 15 fibonacci numbers are:  \n1,1,2,3,5,8,13,21,34,55,89,144,233,377,610.
+  \ \nIt can be seen that 8 and 144 are not squarefree: 8 is divisible by 4 and 144
+  is divisible by 4 and by 9.  \n So the first 13 squarefree fibonacci numbers are:
+  \ \n1,1,2,3,5,13,21,34,55,89,233,377 and 610.\n\nThe 200th squarefree fibonacci
+  number is: 971183874599339129547649988289594072811608739584170445.  \nThe last sixteen
+  digits of this number are: 1608739584170445 and in scientific notation this number
+  can be written as 9.7e53.\n\nFind the 100 000 000th squarefree fibonacci number.
+  \ \nGive as your answer its last sixteen digits followed by a comma followed by
+  the number in scientific notation (rounded to one digit after the decimal point).
+  \ \nFor the 200th squarefree number the answer would have been: 1608739584170445,9.7e53\n\n<font
+  size=\"-1\">\nNote:<br> \nFor this problem, assume that for every prime p, the first
+  fibonacci number divisible by p is not divisible by p<sup>2</sup> (this is part
+  of <b>Wall's conjecture</b>). This has been verified for primes ≤ 3·10<sup>15</sup>,
+  but has not been proven in general.<br>\n\nIf it happens that the conjecture is
+  false, then the accepted answer to this problem isn't guaranteed to be the 100 000
+  000th squarefree fibonacci number, rather it represents only a lower bound for that
+  number.\n</font>\n\n"

data/data/problems/4.yml

@@ -1,9 +1,9 @@
 ---
 :id: 4
 :name: Largest palindrome product
-:url: http://projecteuler.net/problem=4
+:url: https://projecteuler.net/problem=4
 :content: |+
-  A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 ![×]({{ images_dir }}/symbol_times.gif) 99.
+  A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99.
 
   Find the largest palindrome made from the product of two 3-digit numbers.
 

data/data/problems/40.yml

@@ -1,7 +1,7 @@
 ---
 :id: 40
 :name: Champernowne's constant
-:url: http://projecteuler.net/problem=40
+:url: https://projecteuler.net/problem=40
 :content: |+
   An irrational decimal fraction is created by concatenating the positive integers:
 
@@ -11,5 +11,5 @@
 
   If _d_<sub><i>n</i></sub> represents the _n_<sup>th</sup> digit of the fractional part, find the value of the following expression.
 
-  _d_<sub>1</sub> ![×]({{ images_dir }}/symbol_times.gif) _d_<sub>10</sub> ![×]({{ images_dir }}/symbol_times.gif) _d_<sub>100</sub> ![×]({{ images_dir }}/symbol_times.gif) _d_<sub>1000</sub> ![×]({{ images_dir }}/symbol_times.gif) _d_<sub>10000</sub> ![×]({{ images_dir }}/symbol_times.gif) _d_<sub>100000</sub> ![×]({{ images_dir }}/symbol_times.gif) _d_<sub>1000000</sub>
+  _d_<sub>1</sub> × _d_<sub>10</sub> × _d_<sub>100</sub> × _d_<sub>1000</sub> × _d_<sub>10000</sub> × _d_<sub>100000</sub> × _d_<sub>1000000</sub>
 

data/data/problems/400.yml

@@ -1,16 +1,17 @@
 ---
 :id: 400
 :name: Fibonacci tree game
-:url: http://projecteuler.net/problem=400
+:url: https://projecteuler.net/problem=400
 :content: "A **Fibonacci tree** is a binary tree recursively defined as:\n\n- T(0)
-  is the empty tree.\r\n- T(1) is the binary tree with only one node.\r\n- T(<var>k</var>)
-  consists of a root node that has T(<var>k</var>-1) and T(<var>k</var>-2) as children.\r\n\nOn
+  is the empty tree.\n- T(1) is the binary tree with only one node.\n- T(<var>k</var>)
+  consists of a root node that has T(<var>k</var>-1) and T(<var>k</var>-2) as children.\n\nOn
   such a tree two players play a take-away game. On each turn a player selects a node
-  and removes that node along with the subtree rooted at that node.  \n\rThe player
+  and removes that node along with the subtree rooted at that node.  \nThe player
   who is forced to take the root node of the entire tree loses.\n\nHere are the winning
   moves of the first player on the first turn for T(<var>k</var>) from <var>k</var>=1
-  to <var>k</var>=6.\n\n![]({{ images_dir }}/p400_winning.png)\n\n\r\r\r\rLet <var>f</var>(<var>k</var>)
-  be the number of winning moves of the first player (i.e. the moves for which the
-  second player has no winning strategy) on the first turn of the game when this game
-  is played on T(<var>k</var>).\r\r\r\n\nFor example, <var>f</var>(5) = 1 and <var>f</var>(10)
-  = 17.\n\nFind <var>f</var>(10000). Give the last 18 digits of your answer.\n\n"
+  to <var>k</var>=6.\n\n![p400_winning.png]({{ images_dir }}/p400_winning.png)\n\nLet
+  <var>f</var>(<var>k</var>) be the number of winning moves of the first player (i.e.
+  the moves for which the second player has no winning strategy) on the first turn
+  of the game when this game is played on T(<var>k</var>).\n\nFor example, <var>f</var>(5)
+  = 1 and <var>f</var>(10) = 17.\n\nFind <var>f</var>(10000). Give the last 18 digits
+  of your answer.\n\n"

data/data/problems/401.yml

@@ -1,10 +1,9 @@
 ---
 :id: 401
 :name: Sum of squares of divisors
-:url: http://projecteuler.net/problem=401
-:content: "The divisors of 6 are 1,2,3 and 6.  \n\rThe sum of the squares of these
-  numbers is 1+4+9+36=50.\n\nLet sigma2(n) represent the sum of the squares of the
-  divisors of n.\rThus sigma2(6)=50.\n\n\rLet SIGMA2 represent the summatory function
-  of sigma2, that is SIGMA2(n)= ![∑]({{ images_dir }}/symbol_sum.gif)sigma2(i) for
-  i=1 to n.  \n\rThe first 6 values of SIGMA2 are: 1,6,16,37,63 and 113.\r\r\n\nFind
-  SIGMA2(10<sup>15</sup>) modulo 10<sup>9</sup>.\n\n"
+:url: https://projecteuler.net/problem=401
+:content: "The divisors of 6 are 1,2,3 and 6.  \nThe sum of the squares of these numbers
+  is 1+4+9+36=50.\n\nLet sigma2(n) represent the sum of the squares of the divisors
+  of n. Thus sigma2(6)=50.\n\nLet SIGMA2 represent the summatory function of sigma2,
+  that is SIGMA2(n)=∑sigma2(i) for i=1 to n.  \nThe first 6 values of SIGMA2 are:
+  1,6,16,37,63 and 113.\n\nFind SIGMA2(10<sup>15</sup>) modulo 10<sup>9</sup>.\n\n"

data/data/problems/402.yml

@@ -1,7 +1,7 @@
 ---
 :id: 402
 :name: Integer-valued polynomials
-:url: http://projecteuler.net/problem=402
+:url: https://projecteuler.net/problem=402
 :content: "It can be shown that the polynomial <var>n</var><sup>4</sup> + 4<var>n</var><sup>3</sup>
   + 2<var>n</var><sup>2</sup> + 5<var>n</var> is a multiple of 6 for every integer
   <var>n</var>. It can also be shown that 6 is the largest integer satisfying this
@@ -9,11 +9,9 @@
   such that <var>n</var><sup>4</sup> + <var>a</var><var>n</var><sup>3</sup> + <var>b</var><var>n</var><sup>2</sup>
   + <var>c</var><var>n</var> is a multiple of <var>m</var> for all integers <var>n</var>.
   For example, M(4, 2, 5) = 6.\n\nAlso, define S(<var>N</var>) as the sum of M(<var>a</var>,
-  <var>b</var>, <var>c</var>) for all 0 ![<]({{ images_dir }}/symbol_lt.gif) <var>a</var>,
-  <var>b</var>, <var>c</var> ![≤]({{ images_dir }}/symbol_le.gif) <var>N</var>.\n\nWe
-  can verify that S(10) = 1972 and S(10000) = 2024258331114.\n\nLet F<sub><var>k</var></sub>
-  be the Fibonacci sequence:  \n\rF<sub>0</sub> = 0, F<sub>1</sub> = 1 and  \n\rF<sub><var>k</var></sub>
-  = F<sub><var>k</var>-1</sub> + F<sub><var>k</var>-2</sub> for <var>k</var> ![≥]({{
-  images_dir }}/symbol_ge.gif) 2.\n\nFind the last 9 digits of Σ S(F<sub><var>k</var></sub>)
-  for 2 ![≤]({{ images_dir }}/symbol_le.gif) <var>k</var> ![≤]({{ images_dir }}/symbol_le.gif)
-  1234567890123.\n\n"
+  <var>b</var>, <var>c</var>) for all 0 \\< <var>a</var>, <var>b</var>, <var>c</var>
+  ≤ <var>N</var>.\n\nWe can verify that S(10) = 1972 and S(10000) = 2024258331114.\n\nLet
+  F<sub><var>k</var></sub> be the Fibonacci sequence:  \nF<sub>0</sub> = 0, F<sub>1</sub>
+  = 1 and  \nF<sub><var>k</var></sub> = F<sub><var>k</var>-1</sub> + F<sub><var>k</var>-2</sub>
+  for <var>k</var> ≥ 2.\n\nFind the last 9 digits of Σ S(F<sub><var>k</var></sub>)
+  for 2 ≤ <var>k</var> ≤ 1234567890123.\n\n"

data/data/problems/403.yml

@@ -1,16 +1,15 @@
 ---
 :id: 403
 :name: Lattice points enclosed by parabola and line
-:url: http://projecteuler.net/problem=403
+:url: https://projecteuler.net/problem=403
 :content: "For integers <var>a</var> and <var>b</var>, we define <var>D</var>(<var>a</var>,
   <var>b</var>) as the domain enclosed by the parabola <var>y</var> = <var>x</var><sup>2</sup>
   and the line <var>y</var> = <var>a</var>·<var>x</var> + <var>b</var>:  \n<var>D</var>(<var>a</var>,
-  <var>b</var>) = { (<var>x</var>, <var>y</var>) | <var>x</var><sup>2</sup> ![≤]({{
-  images_dir }}/symbol_le.gif) <var>y</var> ![≤]({{ images_dir }}/symbol_le.gif) <var>a</var>·<var>x</var>
-  + <var>b</var> }.\n\nL(<var>a</var>, <var>b</var>) is defined as the number of lattice
-  points contained in <var>D</var>(<var>a</var>, <var>b</var>).  \n\rFor example,
-  L(1, 2) = 8 and L(2, -1) = 1.\n\nWe also define S(<var>N</var>) as the sum of L(<var>a</var>,
-  <var>b</var>) for all the pairs (<var>a</var>, <var>b</var>) such that the area
-  of <var>D</var>(<var>a</var>, <var>b</var>) is a rational number and |<var>a</var>|,|<var>b</var>|
-  ![≤]({{ images_dir }}/symbol_le.gif) <var>N</var>.  \n\rWe can verify that S(5)
-  = 344 and S(100) = 26709528.\n\nFind S(10<sup>12</sup>). Give your answer mod 10<sup>8</sup>.\n\n"
+  <var>b</var>) = { (<var>x</var>, <var>y</var>) | <var>x</var><sup>2</sup> ≤ <var>y</var>
+  ≤ <var>a</var>·<var>x</var> + <var>b</var> }.\n\nL(<var>a</var>, <var>b</var>) is
+  defined as the number of lattice points contained in <var>D</var>(<var>a</var>,
+  <var>b</var>).  \nFor example, L(1, 2) = 8 and L(2, -1) = 1.\n\nWe also define S(<var>N</var>)
+  as the sum of L(<var>a</var>, <var>b</var>) for all the pairs (<var>a</var>, <var>b</var>)
+  such that the area of <var>D</var>(<var>a</var>, <var>b</var>) is a rational number
+  and |<var>a</var>|,|<var>b</var>| ≤ <var>N</var>.  \nWe can verify that S(5) = 344
+  and S(100) = 26709528.\n\nFind S(10<sup>12</sup>). Give your answer mod 10<sup>8</sup>.\n\n"

data/data/problems/404.yml

@@ -1,18 +1,16 @@
 ---
 :id: 404
 :name: Crisscross Ellipses
-:url: http://projecteuler.net/problem=404
+:url: https://projecteuler.net/problem=404
 :content: "E<sub><var>a</var></sub> is an ellipse with an equation of the form x<sup>2</sup>
-  + 4y<sup>2</sup> = 4<var>a</var><sup>2</sup>.  \n\rE<sub><var>a</var></sub>' is
-  the rotated image of E<sub><var>a</var></sub> by θ degrees counterclockwise around
-  the origin O(0, 0) for 0° ![<]({{ images_dir }}/symbol_lt.gif) θ ![<]({{ images_dir
-  }}/symbol_lt.gif) 90°.\n\n ![]({{ images_dir }}/p_404_c_ellipse.gif)\n\n<var>b</var>
+  + 4y<sup>2</sup> = 4<var>a</var><sup>2</sup>.  \nE<sub><var>a</var></sub>' is the
+  rotated image of E<sub><var>a</var></sub> by θ degrees counterclockwise around the
+  origin O(0, 0) for 0° \\< θ \\< 90°.\n\n ![p404_c_ellipse.gif]({{ images_dir }}/p404_c_ellipse.gif)\n\n<var>b</var>
   is the distance to the origin of the two intersection points closest to the origin
-  and <var>c</var> is the distance of the two other intersection points.  \n\rWe call
+  and <var>c</var> is the distance of the two other intersection points.  \nWe call
   an ordered triplet (<var>a</var>, <var>b</var>, <var>c</var>) a _canonical ellipsoidal
-  triplet_ if <var>a</var>, <var>b</var> and <var>c</var> are positive integers.  \n\rFor
+  triplet_ if <var>a</var>, <var>b</var> and <var>c</var> are positive integers.  \nFor
   example, (209, 247, 286) is a canonical ellipsoidal triplet.\n\nLet C(<var>N</var>)
   be the number of distinct canonical ellipsoidal triplets (<var>a</var>, <var>b</var>,
-  <var>c</var>) for <var>a</var> ![≤]({{ images_dir }}/symbol_le.gif) <var>N</var>.
-  \ \n\rIt can be verified that C(10<sup>3</sup>) = 7, C(10<sup>4</sup>) = 106 and
-  C(10<sup>6</sup>) = 11845.\n\nFind C(10<sup>17</sup>).\n\n"
+  <var>c</var>) for <var>a</var> ≤ <var>N</var>.  \nIt can be verified that C(10<sup>3</sup>)
+  = 7, C(10<sup>4</sup>) = 106 and C(10<sup>6</sup>) = 11845.\n\nFind C(10<sup>17</sup>).\n\n"

data/data/problems/405.yml

@@ -1,14 +1,14 @@
 ---
 :id: 405
 :name: A rectangular tiling
-:url: http://projecteuler.net/problem=405
-:content: "We wish to tile a rectangle whose length is twice its width.  \n\rLet <var>T</var>(0)
-  be the tiling consisting of a single rectangle.  \n\rFor <var>n</var> > 0, let <var>T</var>(<var>n</var>)
+:url: https://projecteuler.net/problem=405
+:content: "We wish to tile a rectangle whose length is twice its width.  \nLet <var>T</var>(0)
+  be the tiling consisting of a single rectangle.  \nFor <var>n</var> \\> 0, let <var>T</var>(<var>n</var>)
   be obtained from <var>T</var>(<var>n</var>-1) by replacing all tiles in the following
-  manner:\n\n ![]({{ images_dir }}/p_405_tile1.png)\n\nThe following animation demonstrates
-  the tilings <var>T</var>(<var>n</var>) for <var>n</var> from 0 to 5:\n\n ![]({{
-  images_dir }}/p_405_tile2.gif)\n\nLet <var>f</var>(<var>n</var>) be the number of
-  points where four tiles meet in <var>T</var>(<var>n</var>).  \n\rFor example, <var>f</var>(1)
-  = 0, <var>f</var>(4) = 82 and <var>f</var>(10<sup>9</sup>) mod 17<sup>7</sup> =
-  126897180.\n\nFind <var>f</var>(10<sup><var>k</var></sup>) for <var>k</var> = 10<sup>18</sup>,
-  give your answer modulo 17<sup>7</sup>.\n\n"
+  manner:\n\n ![p405_tile1.png]({{ images_dir }}/p405_tile1.png)\n\nThe following
+  animation demonstrates the tilings <var>T</var>(<var>n</var>) for <var>n</var> from
+  0 to 5:\n\n ![p405_tile2.gif]({{ images_dir }}/p405_tile2.gif)\n\nLet <var>f</var>(<var>n</var>)
+  be the number of points where four tiles meet in <var>T</var>(<var>n</var>).  \nFor
+  example, <var>f</var>(1) = 0, <var>f</var>(4) = 82 and <var>f</var>(10<sup>9</sup>)
+  mod 17<sup>7</sup> = 126897180.\n\nFind <var>f</var>(10<sup><var>k</var></sup>)
+  for <var>k</var> = 10<sup>18</sup>, give your answer modulo 17<sup>7</sup>.\n\n"

data/data/problems/406.yml

@@ -1,38 +1,32 @@
 ---
 :id: 406
 :name: Guessing Game
-:url: http://projecteuler.net/problem=406
+:url: https://projecteuler.net/problem=406
 :content: "We are trying to find a hidden number selected from the set of integers
-  {1, 2, ..., <var>n</var>} by asking questions. \rEach number (question) we ask,
-  we get one of three possible answers:\n\n- \"Your guess is lower than the hidden
-  number\" (and you incur a cost of <var>a</var>), or\n- \"Your guess is higher than
-  the hidden number\" (and you incur a cost of <var>b</var>), or\n- \"Yes, that's
-  it!\" (and the game ends).\n\nGiven the value of <var>n</var>, <var>a</var>, and
-  <var>b</var>, an _optimal strategy_ minimizes the total cost <u>for the worst possible
-  case</u>.\n\nFor example, if <var>n</var> = 5, <var>a</var> = 2, and <var>b</var>
-  = 3, then we may begin by asking \" **2** \" as our first question.\n\nIf we are
-  told that 2 is higher than the hidden number (for a cost of <var>b</var>=3), then
-  we are sure that \" **1** \" is the hidden number (for a total cost of **3** ).
-  \ \n\rIf we are told that 2 is lower than the hidden number (for a cost of <var>a</var>=2),
-  then our next question will be \" **4** \".  \n\rIf we are told that 4 is higher
+  {1, 2, ..., <var>n</var>} by asking questions. Each number (question) we ask, we
+  get one of three possible answers:\n\n- \"Your guess is lower than the hidden number\"
+  (and you incur a cost of <var>a</var>), or\n- \"Your guess is higher than the hidden
+  number\" (and you incur a cost of <var>b</var>), or\n- \"Yes, that's it!\" (and
+  the game ends).\n\nGiven the value of <var>n</var>, <var>a</var>, and <var>b</var>,
+  an _optimal strategy_ minimizes the total cost <u>for the worst possible case</u>.\n\nFor
+  example, if <var>n</var> = 5, <var>a</var> = 2, and <var>b</var> = 3, then we may
+  begin by asking \" **2**\" as our first question.\n\nIf we are told that 2 is higher
   than the hidden number (for a cost of <var>b</var>=3), then we are sure that \"
-  **3** \" is the hidden number (for a total cost of 2+3= **5** ).  \n\rIf we are
-  told that 4 is lower than the hidden number (for a cost of <var>a</var>=2), then
-  we are sure that \" **5** \" is the hidden number (for a total cost of 2+2= **4**
-  ).  \n\rThus, the worst-case cost achieved by this strategy is **5** . It can also
-  be shown that this is the lowest worst-case cost that can be achieved. \rSo, in
-  fact, we have just described an optimal strategy for the given values of <var>n</var>,
-  <var>a</var>, and <var>b</var>.\n\nLet C(<var>n</var>, <var>a</var>, <var>b</var>)
-  be the worst-case cost achieved by an optimal strategy for the given values of <var>n</var>,
-  <var>a</var>, and <var>b</var>.\n\nHere are a few examples:  \n\rC(5, 2, 3) = 5
-  \ \n\rC(500, ![√]({{ images_dir }}/symbol_radic.gif)2, ![√]({{ images_dir }}/symbol_radic.gif)3)
-  = 13.22073197...  \n\rC(20000, 5, 7) = 82  \n\rC(2000000, ![√]({{ images_dir }}/symbol_radic.gif)5,
-  ![√]({{ images_dir }}/symbol_radic.gif)7) = 49.63755955...\n\nLet F<sub><var>k</var></sub>
+  **1**\" is the hidden number (for a total cost of **3** ).  \nIf we are told that
+  2 is lower than the hidden number (for a cost of <var>a</var>=2), then our next
+  question will be \" **4**\".  \nIf we are told that 4 is higher than the hidden
+  number (for a cost of <var>b</var>=3), then we are sure that \" **3**\" is the hidden
+  number (for a total cost of 2+3= **5** ).  \nIf we are told that 4 is lower than
+  the hidden number (for a cost of <var>a</var>=2), then we are sure that \" **5**\"
+  is the hidden number (for a total cost of 2+2= **4** ).  \nThus, the worst-case
+  cost achieved by this strategy is **5**. It can also be shown that this is the lowest
+  worst-case cost that can be achieved. So, in fact, we have just described an optimal
+  strategy for the given values of <var>n</var>, <var>a</var>, and <var>b</var>.\n\nLet
+  C(<var>n</var>, <var>a</var>, <var>b</var>) be the worst-case cost achieved by an
+  optimal strategy for the given values of <var>n</var>, <var>a</var>, and <var>b</var>.\n\nHere
+  are a few examples:  \nC(5, 2, 3) = 5  \nC(500, √2, √3) = 13.22073197...  \nC(20000,
+  5, 7) = 82  \nC(2000000, √5, √7) = 49.63755955...\n\nLet F<sub><var>k</var></sub>
   be the Fibonacci numbers: F<sub><var>k</var></sub> = F<sub><var>k</var>-1</sub>
   + F<sub><var>k</var>-2</sub> with base cases F<sub>1</sub> = F<sub>2</sub> = 1.
-  \ \nFind ![∑]({{ images_dir }}/symbol_sum.gif)<sub>1<img src=\"%7B%7B%20images_dir%20%7D%7D/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>k</var><img
-  src=\"%7B%7B%20images_dir%20%7D%7D/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\"
-  border=\"0\" style=\"vertical-align:middle;\">30</sub> C(10<sup>12</sup>, ![√]({{
-  images_dir }}/symbol_radic.gif)<var>k</var>, ![√]({{ images_dir }}/symbol_radic.gif)F<sub><var>k</var></sub>),
+  \ \nFind ∑<sub>1≤<var>k</var>≤30</sub>&nbsp;C(10<sup>12</sup>, √<var>k</var>, √F<sub><var>k</var></sub>),
   and give your answer rounded to 8 decimal places behind the decimal point.\n\n"

data/data/problems/407.yml

@@ -1,13 +1,9 @@
 ---
 :id: 407
 :name: Idempotents
-:url: http://projecteuler.net/problem=407
-:content: "If we calculate <var>a</var><sup>2</sup> mod 6 for 0 ![≤]({{ images_dir
-  }}/symbol_le.gif) <var>a</var> ![≤]({{ images_dir }}/symbol_le.gif) 5 we get: 0,1,4,3,4,1.\n\nThe
-  largest value of <var>a</var> such that <var>a</var><sup>2</sup> ![≡]({{ images_dir
-  }}/symbol_cong.gif) <var>a</var> mod 6 is 4.  \n\rLet's call M(<var>n</var>) the
-  largest value of <var>a</var> ![<]({{ images_dir }}/symbol_lt.gif) <var>n</var>
-  such that <var>a</var><sup>2</sup> ![≡]({{ images_dir }}/symbol_cong.gif) <var>a</var>
-  (mod <var>n</var>).  \n\rSo M(6) = 4.\n\nFind ![∑]({{ images_dir }}/symbol_sum.gif)M(<var>n</var>)
-  for 1 ![≤]({{ images_dir }}/symbol_le.gif) <var>n</var> ![≤]({{ images_dir }}/symbol_le.gif)
-  10<sup>7</sup>.\n\n"
+:url: https://projecteuler.net/problem=407
+:content: "If we calculate <var>a</var><sup>2</sup> mod 6 for 0 ≤ <var>a</var> ≤ 5
+  we get: 0,1,4,3,4,1.\n\nThe largest value of <var>a</var> such that <var>a</var><sup>2</sup>
+  ≡ <var>a</var> mod 6 is 4.  \nLet's call M(<var>n</var>) the largest value of <var>a</var>
+  \\< <var>n</var> such that <var>a</var><sup>2</sup> ≡ <var>a</var> (mod <var>n</var>).
+  \ \nSo M(6) = 4.\n\nFind ∑M(<var>n</var>) for 1 ≤ <var>n</var> ≤ 10<sup>7</sup>.\n\n"

data/data/problems/408.yml

@@ -1,14 +1,14 @@
 ---
 :id: 408
 :name: Admissible paths through a grid
-:url: http://projecteuler.net/problem=408
+:url: https://projecteuler.net/problem=408
 :content: "Let's call a lattice point (<var>x</var>, <var>y</var>) _inadmissible_
-  if <var>x</var>, <var>y</var> and <var>x</var> + <var>y</var> are all positive perfect
-  squares.  \n\rFor example, (9, 16) is inadmissible, while (0, 4), (3, 1) and (9,
-  4) are not.\n\nConsider a path from point (<var>x</var><sub>1</sub>, <var>y</var><sub>1</sub>)
-  to point (<var>x</var><sub>2</sub>, <var>y</var><sub>2</sub>) using only unit steps
-  north or east.  \n\rLet's call such a path _admissible_ if none of its intermediate
-  points are inadmissible.\n\nLet P(<var>n</var>) be the number of admissible paths
-  from (0, 0) to (<var>n</var>, <var>n</var>).  \n\rIt can be verified that P(5) =
-  252, P(16) = 596994440 and P(1000) mod 1 000 000 007 = 341920854.\n\nFind P(10 000 000)
-  mod 1 000 000 007.\n\n"
+  if <var>x</var>, <var>y</var> and <var>x</var>&nbsp;+&nbsp;<var>y</var> are all
+  positive perfect squares.  \nFor example, (9, 16) is inadmissible, while (0, 4),
+  (3, 1) and (9, 4) are not.\n\nConsider a path from point (<var>x</var><sub>1</sub>,
+  <var>y</var><sub>1</sub>) to point (<var>x</var><sub>2</sub>, <var>y</var><sub>2</sub>)
+  using only unit steps north or east.  \nLet's call such a path _admissible_ if none
+  of its intermediate points are inadmissible.\n\nLet P(<var>n</var>) be the number
+  of admissible paths from (0, 0) to (<var>n</var>, <var>n</var>).  \nIt can be verified
+  that P(5) = 252, P(16) = 596994440 and P(1000) mod 1&nbsp;000&nbsp;000&nbsp;007
+  = 341920854.\n\nFind P(10&nbsp;000&nbsp;000) mod 1&nbsp;000&nbsp;000&nbsp;007.\n\n"