euler-manager 0.1.1 → 0.2.0

data/data/problems/316.yml

@@ -1,23 +1,24 @@
 ---
 :id: 316
 :name: Numbers in decimal expansions
-:url: http://projecteuler.net/problem=316
+:url: https://projecteuler.net/problem=316
 :content: "Let <var>p</var> = <var>p<sub><font size=\"-2\">1</font></sub> p<sub><font
   size=\"-2\">2</font></sub> p<sub><font size=\"-2\">3</font></sub></var> ... be an
   infinite sequence of random digits, selected from {0,1,2,3,4,5,6,7,8,9} with equal
-  probability.  \n\rIt can be seen that <var>p</var> corresponds to the real number
+  probability.  \nIt can be seen that <var>p</var> corresponds to the real number
   0.<var>p<sub><font size=\"-2\">1</font></sub> p<sub><font size=\"-2\">2</font></sub>
-  p<sub><font size=\"-2\">3</font></sub></var> ....   \n\rIt can also be seen that
-  choosing a random real number from the interval [0,1) is equivalent to choosing
-  an infinite sequence of random digits selected from {0,1,2,3,4,5,6,7,8,9} with equal
-  probability.\n\nFor any positive integer <var>n</var> with <var>d</var> decimal
-  digits, let <var>k</var> be the smallest index such that   \n <var>p<sub><small>k</small>,
-  </sub></var><var>p<sub><small>k+1</small></sub></var>, ...<var>p<sub><small>k+d-1</small></sub></var>
-  are the decimal digits of <var>n</var>, in the same order.  \n\rAlso, let <var>g</var>(<var>n</var>)
-  be the expected value of <var>k</var>; it can be proven that <var>g</var>(<var>n</var>)
-  is always finite and, interestingly, always an integer number.\n\nFor example, if
-  <var>n</var> = 535, then  \n\rfor <var>p</var> = 31415926 **535** 897...., we get
-  <var>k</var> = 9  \n\rfor <var>p</var> = 35528714365004956000049084876408468 **535**
-  4..., we get <var>k</var> = 36  \n\retc and we find that <var>g</var>(535) = 1008.\n\nGiven
-  that ![]({{ images_dir }}/p_316_decexp1.gif), find ![]({{ images_dir }}/p_316_decexp2.gif)\n\n<u><i>Note</i></u>:
-  ![]({{ images_dir }}/p_316_decexp3.gif) represents the floor function.\r\n"
+  p<sub><font size=\"-2\">3</font></sub></var> ....   \nIt can also be seen that choosing
+  a random real number from the interval [0,1) is equivalent to choosing an infinite
+  sequence of random digits selected from {0,1,2,3,4,5,6,7,8,9} with equal probability.\n\nFor
+  any positive integer <var>n</var> with <var>d</var> decimal digits, let <var>k</var>
+  be the smallest index such that   \n<var>p<sub><small>k</small>, </sub></var><var>p<sub><small>k+1</small></sub></var>,
+  ...<var>p<sub><small>k+d-1</small></sub></var> are the decimal digits of <var>n</var>,
+  in the same order.  \nAlso, let <var>g</var>(<var>n</var>) be the expected value
+  of <var>k</var>; it can be proven that <var>g</var>(<var>n</var>) is always finite
+  and, interestingly, always an integer number.\n\nFor example, if <var>n</var> =
+  535, then  \nfor <var>p</var> = 31415926 **535** 897...., we get <var>k</var> =
+  9  \nfor <var>p</var> = 35528714365004956000049084876408468 **535** 4..., we get
+  <var>k</var> = 36  \netc and we find that <var>g</var>(535) = 1008.\n\nGiven that
+  ![p316_decexp1.gif]({{ images_dir }}/p316_decexp1.gif), find ![p316_decexp2.gif]({{
+  images_dir }}/p316_decexp2.gif)\n\n<u><i>Note</i></u>: ![p316_decexp3.gif]({{ images_dir
+  }}/p316_decexp3.gif) represents the floor function.\n"

data/data/problems/317.yml

@@ -1,10 +1,11 @@
 ---
 :id: 317
 :name: Firecracker
-:url: http://projecteuler.net/problem=317
-:content: "A firecracker explodes at a height of 100 m above level ground. It breaks
-  into a large number of very small fragments, which move in every direction; all
-  of them have the same initial velocity of 20 m/s.\n\nWe assume that the fragments
-  move without air resistance, in a uniform gravitational field with g=9.81 m/s<sup>2</sup>.\n\nFind
-  the volume (in m<sup>3</sup>) of the region through which the fragments move before
-  reaching the ground. \rGive your answer rounded to four decimal places.\n\n"
+:url: https://projecteuler.net/problem=317
+:content: |+
+  A firecracker explodes at a height of 100 m above level ground. It breaks into a large number of very small fragments, which move in every direction; all of them have the same initial velocity of 20 m/s.
+
+  We assume that the fragments move without air resistance, in a uniform gravitational field with g=9.81 m/s<sup>2</sup>.
+
+  Find the volume (in m<sup>3</sup>) of the region through which the fragments move before reaching the ground. Give your answer rounded to four decimal places.
+

data/data/problems/318.yml

@@ -1,32 +1,17 @@
 ---
 :id: 318
 :name: 2011 nines
-:url: http://projecteuler.net/problem=318
-:content: "Consider the real number ![√]({{ images_dir }}/symbol_radic.gif)2+ ![√]({{
-  images_dir }}/symbol_radic.gif)3.  \n\rWhen we calculate the even powers of ![√]({{
-  images_dir }}/symbol_radic.gif)2+ ![√]({{ images_dir }}/symbol_radic.gif)3\rwe get:
-  \ \n\r( ![√]({{ images_dir }}/symbol_radic.gif)2+ ![√]({{ images_dir }}/symbol_radic.gif)3)<sup>2</sup>
-  = 9.898979485566356...  \n\r( ![√]({{ images_dir }}/symbol_radic.gif)2+ ![√]({{
-  images_dir }}/symbol_radic.gif)3)<sup>4</sup> = 97.98979485566356...  \n\r( ![√]({{
-  images_dir }}/symbol_radic.gif)2+ ![√]({{ images_dir }}/symbol_radic.gif)3)<sup>6</sup>
-  = 969.998969071069263...  \n\r( ![√]({{ images_dir }}/symbol_radic.gif)2+ ![√]({{
-  images_dir }}/symbol_radic.gif)3)<sup>8</sup> = 9601.99989585502907...  \n\r( ![√]({{
-  images_dir }}/symbol_radic.gif)2+ ![√]({{ images_dir }}/symbol_radic.gif)3)<sup>10</sup>
-  = 95049.999989479221...  \n\r( ![√]({{ images_dir }}/symbol_radic.gif)2+ ![√]({{
-  images_dir }}/symbol_radic.gif)3)<sup>12</sup> = 940897.9999989371855...  \n\r(
-  ![√]({{ images_dir }}/symbol_radic.gif)2+ ![√]({{ images_dir }}/symbol_radic.gif)3)<sup>14</sup>
-  = 9313929.99999989263...  \n\r( ![√]({{ images_dir }}/symbol_radic.gif)2+ ![√]({{
-  images_dir }}/symbol_radic.gif)3)<sup>16</sup> = 92198401.99999998915...\n\nIt looks
-  like that the number of consecutive nines at the beginning of the fractional part
-  of these powers is non-decreasing.  \n\rIn fact it can be proven that the fractional
-  part of ( ![√]({{ images_dir }}/symbol_radic.gif)2+ ![√]({{ images_dir }}/symbol_radic.gif)3)<sup>2n</sup>
-  approaches 1 for large n.\n\nConsider all real numbers of the form ![√]({{ images_dir
-  }}/symbol_radic.gif)p+ ![√]({{ images_dir }}/symbol_radic.gif)q with p and q positive
-  integers and p ![<]({{ images_dir }}/symbol_lt.gif)q, such that the fractional part
-  \rof ( ![√]({{ images_dir }}/symbol_radic.gif)p+ ![√]({{ images_dir }}/symbol_radic.gif)q)<sup>2n</sup>
-  approaches 1 for large n.\n\nLet C(p,q,n) be the number of consecutive nines at
-  the beginning of the fractional part of   \n ( ![√]({{ images_dir }}/symbol_radic.gif)p+
-  ![√]({{ images_dir }}/symbol_radic.gif)q)<sup>2n</sup>.\n\nLet N(p,q) be the minimal
-  value of n such that C(p,q,n) ![≥]({{ images_dir }}/symbol_ge.gif) 2011.\n\nFind
-  ![∑]({{ images_dir }}/symbol_sum.gif)N(p,q) for p+q ![≤]({{ images_dir }}/symbol_le.gif)
-  2011.\n\n"
+:url: https://projecteuler.net/problem=318
+:content: "Consider the real number √2+√3.  \nWhen we calculate the even powers of
+  √2+√3 we get:  \n(√2+√3)<sup>2</sup> = 9.898979485566356...  \n(√2+√3)<sup>4</sup>
+  = 97.98979485566356...  \n(√2+√3)<sup>6</sup> = 969.998969071069263...  \n(√2+√3)<sup>8</sup>
+  = 9601.99989585502907...  \n(√2+√3)<sup>10</sup> = 95049.999989479221...  \n(√2+√3)<sup>12</sup>
+  = 940897.9999989371855...  \n(√2+√3)<sup>14</sup> = 9313929.99999989263...  \n(√2+√3)<sup>16</sup>
+  = 92198401.99999998915...\n\nIt looks like that the number of consecutive nines
+  at the beginning of the fractional part of these powers is non-decreasing.  \nIn
+  fact it can be proven that the fractional part of (√2+√3)<sup>2n</sup> approaches
+  1 for large n.\n\nConsider all real numbers of the form √p+√q with p and q positive
+  integers and p\\<q, such that the fractional part of (√p+√q)<sup>2n</sup> approaches
+  1 for large n.\n\nLet C(p,q,n) be the number of consecutive nines at the beginning
+  of the fractional part of   \n (√p+√q)<sup>2n</sup>.\n\nLet N(p,q) be the minimal
+  value of n such that C(p,q,n) ≥ 2011.\n\nFind ∑N(p,q) for p+q ≤ 2011.\n\n"

data/data/problems/319.yml

@@ -1,18 +1,16 @@
 ---
 :id: 319
 :name: Bounded Sequences
-:url: http://projecteuler.net/problem=319
+:url: https://projecteuler.net/problem=319
 :content: "Let <var>x</var><sub>1</sub>, <var>x</var><sub>2</sub>,..., <var>x<sub>n</sub></var>
   be a sequence of length <var>n</var> such that:\n\n- <var>x</var><sub>1</sub> =
-  2\n- for all 1 ![<]({{ images_dir }}/symbol_lt.gif) <var>i</var> ![≤]({{ images_dir
-  }}/symbol_le.gif) <var>n</var> : <var>x</var><sub><var>i</var>-<i>1</i></sub> ![<]({{
-  images_dir }}/symbol_lt.gif) <var>x<sub>i</sub></var>\n- for all <var>i</var> and
-  <var>j</var> with 1 ![≤]({{ images_dir }}/symbol_le.gif) <var>i</var>, <var>j</var>
-  ![≤]({{ images_dir }}/symbol_le.gif) <var>n</var> : (<var>x<sub>i</sub></var>)<var><sup>
-  j</sup></var> ![<]({{ images_dir }}/symbol_lt.gif) (<var>x<sub>j</sub></var> + 1)<var><sup>i</sup></var>\n\nThere
-  are only five such sequences of length 2, namely:\r{2,4}, {2,5}, {2,6}, {2,7} and
-  {2,8}.  \n\rThere are 293 such sequences of length 5; three examples are given below:
-  \ \n\r{2,5,11,25,55}, {2,6,14,36,88}, {2,8,22,64,181}.\n\nLet <var>t</var>(<var>n</var>)
-  denote the number of such sequences of length <var>n</var>.  \n\rYou are given that
-  <var>t</var>(10) = 86195 and <var>t</var>(20) = 5227991891.\n\nFind <var>t</var>(10<sup>10</sup>)
+  2\n- for all 1 \\< <var>i</var> ≤ <var>n</var> : <var>x</var><sub><var>i</var>-<i>1</i></sub>
+  \\< <var>x<sub>i</sub></var>\n- for all <var>i</var> and <var>j</var> with 1 ≤ <var>i</var>,
+  <var>j</var> ≤ <var>n</var> : (<var>x<sub>i</sub></var>)<var><sup> j</sup></var>
+  \\< (<var>x<sub>j</sub></var> + 1)<var><sup>i</sup></var>\n\nThere are only five
+  such sequences of length 2, namely: {2,4}, {2,5}, {2,6}, {2,7} and {2,8}.  \nThere
+  are 293 such sequences of length 5; three examples are given below:  \n{2,5,11,25,55},
+  {2,6,14,36,88}, {2,8,22,64,181}.\n\nLet <var>t</var>(<var>n</var>) denote the number
+  of such sequences of length <var>n</var>.  \nYou are given that <var>t</var>(10)
+  = 86195 and <var>t</var>(20) = 5227991891.\n\nFind <var>t</var>(10<sup>10</sup>)
   and give your answer modulo 10<sup>9</sup>.\n\n"

data/data/problems/32.yml

@@ -1,11 +1,11 @@
 ---
 :id: 32
 :name: Pandigital products
-:url: http://projecteuler.net/problem=32
+:url: https://projecteuler.net/problem=32
 :content: |+
   We shall say that an <var>n</var>-digit number is pandigital if it makes use of all the digits 1 to <var>n</var> exactly once; for example, the 5-digit number, 15234, is 1 through 5 pandigital.
 
-  The product 7254 is unusual, as the identity, 39 ![×]({{ images_dir }}/symbol_times.gif) 186 = 7254, containing multiplicand, multiplier, and product is 1 through 9 pandigital.
+  The product 7254 is unusual, as the identity, 39 × 186 = 7254, containing multiplicand, multiplier, and product is 1 through 9 pandigital.
 
   Find the sum of all products whose multiplicand/multiplier/product identity can be written as a 1 through 9 pandigital.
 

data/data/problems/320.yml

@@ -1,11 +1,11 @@
 ---
 :id: 320
 :name: Factorials divisible by a huge integer
-:url: http://projecteuler.net/problem=320
+:url: https://projecteuler.net/problem=320
 :content: |+
   Let N(<var>i</var>) be the smallest integer <var>n</var> such that <var>n</var>! is divisible by (<var>i</var>!)<sup>1234567890</sup>
 
-  Let S(<var>u</var>)= ![∑]({{ images_dir }}/symbol_sum.gif)N(<var>i</var>) for 10 ![≤]({{ images_dir }}/symbol_le.gif) <var>i</var> ![≤]({{ images_dir }}/symbol_le.gif) <var>u</var>.
+  Let S(<var>u</var>)=∑N(<var>i</var>) for 10 ≤ <var>i</var> ≤ <var>u</var>.
 
   S(1000)=614538266565663.
 

data/data/problems/321.yml

@@ -1,17 +1,18 @@
 ---
 :id: 321
 :name: Swapping Counters
-:url: http://projecteuler.net/problem=321
+:url: https://projecteuler.net/problem=321
 :content: "A horizontal row comprising of 2<var>n</var> + 1 squares has <var>n</var>
   red counters placed at one end and <var>n</var> blue counters at the other end,
   being separated by a single empty square in the centre. For example, when <var>n</var>
-  = 3.\n\n ![]({{ images_dir }}/p_321_swapping_counters_1.gif)\n\nA counter can move
-  from one square to the next (slide) or can jump over another counter (hop) as long
-  as the square next to that counter is unoccupied.\n\n ![]({{ images_dir }}/p_321_swapping_counters_2.gif)\n\nLet
-  M(<var>n</var>) represent the minimum number of moves/actions to completely reverse
-  the positions of the coloured counters; that is, move all the red counters to the
-  right and all the blue counters to the left.\n\nIt can be verified M(3) = 15, which
-  also happens to be a triangle number.\n\nIf we create a sequence based on the values
-  of <var>n</var> for which M(<var>n</var>) is a triangle number then the first five
-  terms would be:\r  \n1, 3, 10, 22, and 63, and their sum would be 99.\n\nFind the
-  sum of the first forty terms of this sequence.\n\n"
+  = 3.\n\n ![p321_swapping_counters_1.gif]({{ images_dir }}/p321_swapping_counters_1.gif)\n\nA
+  counter can move from one square to the next (slide) or can jump over another counter
+  (hop) as long as the square next to that counter is unoccupied.\n\n ![p321_swapping_counters_2.gif]({{
+  images_dir }}/p321_swapping_counters_2.gif)\n\nLet M(<var>n</var>) represent the
+  minimum number of moves/actions to completely reverse the positions of the coloured
+  counters; that is, move all the red counters to the right and all the blue counters
+  to the left.\n\nIt can be verified M(3) = 15, which also happens to be a triangle
+  number.\n\nIf we create a sequence based on the values of <var>n</var> for which
+  M(<var>n</var>) is a triangle number then the first five terms would be:  \n1, 3,
+  10, 22, and 63, and their sum would be 99.\n\nFind the sum of the first forty terms
+  of this sequence.\n\n"

data/data/problems/322.yml

@@ -1,10 +1,9 @@
 ---
 :id: 322
 :name: Binomial coefficients divisible by 10
-:url: http://projecteuler.net/problem=322
+:url: https://projecteuler.net/problem=322
 :content: "Let T(<var>m</var>, <var>n</var>) be the number of the binomial coefficients
   <sup><var>i</var></sup>C<sub><var>n</var></sub> that are divisible by 10 for <var>n</var>
-  ![≤]({{ images_dir }}/symbol_le.gif) <var>i</var> ![<]({{ images_dir }}/symbol_lt.gif)
-  <var>m</var>(<var>i</var>, <var>m</var> and <var>n</var> are positive integers).
-  \ \n\rYou are given that T(10<sup>9</sup>, 10<sup>7</sup>-10) = 989697000.\n\nFind
-  T(10<sup>18</sup>, 10<sup>12</sup>-10).\n\n"
+  ≤ <var>i</var> \\< <var>m</var>(<var>i</var>, <var>m</var> and <var>n</var> are
+  positive integers).  \nYou are given that T(10<sup>9</sup>, 10<sup>7</sup>-10) =
+  989697000.\n\nFind T(10<sup>18</sup>, 10<sup>12</sup>-10).\n\n"

data/data/problems/323.yml

@@ -1,15 +1,13 @@
 ---
 :id: 323
 :name: Bitwise-OR operations on random integers
-:url: http://projecteuler.net/problem=323
+:url: https://projecteuler.net/problem=323
 :content: "Let <var>y</var><sub>0</sub>, <var>y</var><sub>1</sub>, <var>y</var><sub>2</sub>,...
-  be a sequence of random unsigned 32 bit integers  \n\r(i.e. 0 ![≤]({{ images_dir
-  }}/symbol_le.gif) <var>y<sub>i</sub></var> ![<]({{ images_dir }}/symbol_lt.gif)
-  2<sup>32</sup>, every value equally likely).\n\nFor the sequence <var>x<sub>i</sub></var>
+  be a sequence of random unsigned 32 bit integers  \n(i.e. 0 ≤ <var>y<sub>i</sub></var>
+  \\< 2<sup>32</sup>, every value equally likely).\n\nFor the sequence <var>x<sub>i</sub></var>
   the following recursion is given:\n\n- <var>x</var><sub>0</sub> = 0 and\n- <var>x<sub>i</sub></var>
   = <var>x</var><sub><var>i</var>-<i>1</i></sub> **|** <var>y</var><sub><var>i</var>-<i>1</i></sub>,
-  for <var>i</var> ![>]({{ images_dir }}/symbol_gt.gif) 0. ( **|** is the bitwise-OR
-  operator)\n\nIt can be seen that eventually there will be an index N such that <var>x<sub>i</sub></var>
-  = 2<sup>32</sup> -1 (a bit-pattern of all ones) for all <var>i</var> ![≥]({{ images_dir
-  }}/symbol_ge.gif) N.\n\nFind the expected value of N.   \n\rGive your answer rounded
-  to 10 digits after the decimal point.\n\n"
+  for <var>i</var> \\> 0. ( **|** is the bitwise-OR operator)\n\nIt can be seen that
+  eventually there will be an index N such that <var>x<sub>i</sub></var> = 2<sup>32</sup>
+  -1 (a bit-pattern of all ones) for all <var>i</var> ≥ N.\n\nFind the expected value
+  of N.   \nGive your answer rounded to 10 digits after the decimal point.\n\n"

data/data/problems/324.yml

@@ -1,13 +1,11 @@
 ---
 :id: 324
 :name: Building a tower
-:url: http://projecteuler.net/problem=324
+:url: https://projecteuler.net/problem=324
 :content: "Let <var>f</var>(<var>n</var>) represent the number of ways one can fill
-  a 3 ![×]({{ images_dir }}/symbol_times.gif)3 ![×]({{ images_dir }}/symbol_times.gif)<var>n</var>
-  tower with blocks of 2 ![×]({{ images_dir }}/symbol_times.gif)1 ![×]({{ images_dir
-  }}/symbol_times.gif)1.   \nYou're allowed to rotate the blocks in any way you like;
-  however, rotations, reflections etc of the tower itself are counted as distinct.\n\nFor
-  example (with <var>q</var> = 100000007) :  \n<var>f</var>(2) = 229,  \n<var>f</var>(4)
-  = 117805,  \n<var>f</var>(10) mod <var>q</var> = 96149360,  \n<var>f</var>(10<sup>3</sup>)
-  mod <var>q</var> = 24806056,  \n<var>f</var>(10<sup>6</sup>) mod <var>q</var> =
-  30808124.\n\nFind <var>f</var>(10<sup>10000</sup>) mod 100000007.\n\n"
+  a 3×3×<var>n</var> tower with blocks of 2×1×1.   \nYou're allowed to rotate the
+  blocks in any way you like; however, rotations, reflections etc of the tower itself
+  are counted as distinct.\n\nFor example (with <var>q</var> = 100000007) :  \n<var>f</var>(2)
+  = 229,  \n<var>f</var>(4) = 117805,  \n<var>f</var>(10) mod <var>q</var> = 96149360,
+  \ \n<var>f</var>(10<sup>3</sup>) mod <var>q</var> = 24806056,  \n<var>f</var>(10<sup>6</sup>)
+  mod <var>q</var> = 30808124.\n\nFind <var>f</var>(10<sup>10000</sup>) mod 100000007.\n\n"

data/data/problems/325.yml

@@ -1,7 +1,7 @@
 ---
 :id: 325
 :name: Stone Game II
-:url: http://projecteuler.net/problem=325
+:url: https://projecteuler.net/problem=325
 :content: |+
   A game is played with two piles of stones and two players. At her turn, a player removes a number of stones from the larger pile. The number of stones she removes must be a positive multiple of the number of stones in the smaller pile.
 
@@ -13,7 +13,7 @@
 
   A _losing configuration_ is one where the second player can force a win, no matter what the first player does. For example, (2,3) and (3,4) are losing configurations: any legal move leaves a winning configuration for the second player.
 
-  Define S(<var>N</var>) as the sum of (<var>x</var><sub><var>i</var></sub>+<var>y</var><sub><var>i</var></sub>) for all losing configurations (<var>x</var><sub><var>i</var></sub>,<var>y</var><sub><var>i</var></sub>), 0 ![<]({{ images_dir }}/symbol_lt.gif) <var>x</var><sub><var>i</var></sub> ![<]({{ images_dir }}/symbol_lt.gif) <var>y</var><sub><var>i</var></sub> ![≤]({{ images_dir }}/symbol_le.gif) <var>N</var>. We can verify that S(10) = 211 and S(10<sup>4</sup>) = 230312207313.
+  Define S(<var>N</var>) as the sum of (<var>x</var><sub><var>i</var></sub>+<var>y</var><sub><var>i</var></sub>) for all losing configurations (<var>x</var><sub><var>i</var></sub>,<var>y</var><sub><var>i</var></sub>), 0 \< <var>x</var><sub><var>i</var></sub> \< <var>y</var><sub><var>i</var></sub> ≤ <var>N</var>. We can verify that S(10) = 211 and S(10<sup>4</sup>) = 230312207313.
 
   Find S(10<sup>16</sup>) mod 7<sup>10</sup>.
 

data/data/problems/326.yml

@@ -1,15 +1,15 @@
 ---
 :id: 326
 :name: Modulo Summations
-:url: http://projecteuler.net/problem=326
+:url: https://projecteuler.net/problem=326
 :content: |+
-  Let <var>a<sub>n</sub></var> be a sequence recursively defined by: ![]({{ images_dir }}/p_326_formula1.gif).
+  Let <var>a<sub>n</sub></var> be a sequence recursively defined by: ![p326_formula1.gif]({{ images_dir }}/p326_formula1.gif).
 
   So the first 10 elements of <var>a<sub>n</sub></var> are: 1,1,0,3,0,3,5,4,1,9.
 
   Let <var>f</var>(<var>N,M</var>) represent the number of pairs (<var>p,q</var>) such that:
 
-   ![]({{ images_dir }}/p_326_formula2.gif)
+   ![p326_formula2.gif]({{ images_dir }}/p326_formula2.gif)
 
   It can be seen that <var>f</var>(10,10)=4 with the pairs (3,3), (5,5), (7,9) and (9,10).
 

data/data/problems/327.yml

@@ -1,23 +1,23 @@
 ---
 :id: 327
 :name: Rooms of Doom
-:url: http://projecteuler.net/problem=327
+:url: https://projecteuler.net/problem=327
 :content: "A series of three rooms are connected to each other by automatic doors.\n\n
-  ![]({{ images_dir }}/p_327_rooms_of_doom.gif)\n\nEach door is operated by a security
-  card. Once you enter a room the door automatically closes and that security card
-  cannot be used again. A machine at the start will dispense an unlimited number of
-  cards, but each room (including the starting room) contains scanners and if they
-  detect that you are holding more than three security cards or if they detect an
-  unattended security card on the floor, then all the doors will become permanently
-  locked. However, each room contains a box where you may safely store any number
-  of security cards for use at a later stage.\n\nIf you simply tried to travel through
-  the rooms one at a time then as you entered room 3 you would have used all three
-  cards and would be trapped in that room forever!\n\nHowever, if you make use of
-  the storage boxes, then escape is possible. For example, you could enter room 1
-  using your first card, place one card in the storage box, and use your third card
-  to exit the room back to the start. Then after collecting three more cards from
-  the dispensing machine you could use one to enter room 1 and collect the card you
-  placed in the box a moment ago. You now have three cards again and will be able
+  ![p327_rooms_of_doom.gif]({{ images_dir }}/p327_rooms_of_doom.gif)\n\nEach door
+  is operated by a security card. Once you enter a room the door automatically closes
+  and that security card cannot be used again. A machine at the start will dispense
+  an unlimited number of cards, but each room (including the starting room) contains
+  scanners and if they detect that you are holding more than three security cards
+  or if they detect an unattended security card on the floor, then all the doors will
+  become permanently locked. However, each room contains a box where you may safely
+  store any number of security cards for use at a later stage.\n\nIf you simply tried
+  to travel through the rooms one at a time then as you entered room 3 you would have
+  used all three cards and would be trapped in that room forever!\n\nHowever, if you
+  make use of the storage boxes, then escape is possible. For example, you could enter
+  room 1 using your first card, place one card in the storage box, and use your third
+  card to exit the room back to the start. Then after collecting three more cards
+  from the dispensing machine you could use one to enter room 1 and collect the card
+  you placed in the box a moment ago. You now have three cards again and will be able
   to travel through the remaining three doors. This method allows you to travel through
   all three rooms using six security cards in total.\n\nIt is possible to travel through
   six rooms using a total of 123 security cards while carrying a maximum of 3 cards.\n\nLet
@@ -25,9 +25,6 @@
   <var>R</var> be the number of rooms to travel through.\n\nLet M(<var>C</var>,<var>R</var>)
   be the minimum number of cards required from the dispensing machine to travel through
   <var>R</var> rooms carrying up to a maximum of <var>C</var> cards at any time.\n\nFor
-  example, M(3,6)=123 and M(4,6)=23.  \nAnd, ΣM(<var>C</var>,6)=146 for 3 ![≤]({{
-  images_dir }}/symbol_le.gif) <var>C</var> ![≤]({{ images_dir }}/symbol_le.gif) 4.\n\nYou
-  are given that ΣM(<var>C</var>,10)=10382 for 3 ![≤]({{ images_dir }}/symbol_le.gif)
-  <var>C</var> ![≤]({{ images_dir }}/symbol_le.gif) 10.\n\nFind ΣM(<var>C</var>,30)
-  for 3 ![≤]({{ images_dir }}/symbol_le.gif) <var>C</var> ![≤]({{ images_dir }}/symbol_le.gif)
-  40.\n\n"
+  example, M(3,6)=123 and M(4,6)=23.  \nAnd, ΣM(<var>C</var>,6)=146 for 3 ≤ <var>C</var>
+  ≤ 4.\n\nYou are given that ΣM(<var>C</var>,10)=10382 for 3 ≤ <var>C</var> ≤ 10.\n\nFind
+  ΣM(<var>C</var>,30) for 3 ≤ <var>C</var> ≤ 40.\n\n"

data/data/problems/328.yml

@@ -1,33 +1,33 @@
 ---
 :id: 328
 :name: Lowest-cost Search
-:url: http://projecteuler.net/problem=328
+:url: https://projecteuler.net/problem=328
 :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,
-  has a <u>cost equal to the number asked</u> and we get one of three possible answers:\n\n-
+  {1, 2, ..., <var>n</var>} by asking questions. Each number (question) we ask, has
+  a <u>cost equal to the number asked</u> and we get one of three possible answers:\n\n-
   \"Your guess is lower than the hidden number\", or\n- \"Yes, that's it!\", or\n-
   \"Your guess is higher than the hidden number\".\n\nGiven the value of <var>n</var>,
   an _optimal strategy_ minimizes the total cost (i.e. the sum of all the questions
   asked) <u>for the worst possible case</u>. E.g.\n\nIf <var>n</var>=3, the best we
-  can do is obviously to ask the number \" **2** \". The answer will immediately lead
+  can do is obviously to ask the number \" **2**\". The answer will immediately lead
   us to find the hidden number (at a total cost = 2).\n\nIf <var>n</var>=8, we might
   decide to use a \"binary search\" type of strategy: Our first question would be
-  \" **4** \" and if the hidden number is higher than 4 we will need one or two additional
-  questions.  \n\rLet our second question be \" **6** \". If the hidden number is
-  still higher than 6, we will need a third question in order to discriminate between
-  7 and 8.  \n\rThus, our third question will be \" **7** \" and the total cost for
-  this worst-case scenario will be 4+6+7= **17** .\n\nWe can improve considerably
-  the worst-case cost for <var>n</var>=8, by asking \" **5** \" as our first question.
-  \ \n\rIf we are told that the hidden number is higher than 5, our second question
-  will be \" **7** \", then we'll know for certain what the hidden number is (for
-  a total cost of 5+7= **12** ).  \n\rIf we are told that the hidden number is lower
-  than 5, our second question will be \" **3** \" and if the hidden number is lower
-  than 3 our third question will be \" **1** \", giving a total cost of 5+3+1= **9**
-  .  \n\rSince **12** > **9** , the worst-case cost for this strategy is **12** .
-  That's better than what we achieved previously with the \"binary search\" strategy;
-  it is also better than or equal to any other strategy.  \n\rSo, in fact, we have
-  just described an optimal strategy for <var>n</var>=8.\n\nLet C(<var>n</var>) be
-  the worst-case cost achieved by an optimal strategy for <var>n</var>, as described
-  above.  \n\rThus C(1) = 0, C(2) = 1, C(3) = 2 and C(8) = 12.  \n\rSimilarly, C(100)
-  = 400 and ![]({{ images_dir }}/p_328_sum1.gif)C(<var>n</var>) = 17575.\n\nFind ![]({{
-  images_dir }}/p_328_sum2.gif)C(<var>n</var>).\n\n"
+  \" **4**\" and if the hidden number is higher than 4 we will need one or two additional
+  questions.  \nLet our second question be \" **6**\". If the hidden number is still
+  higher than 6, we will need a third question in order to discriminate between 7
+  and 8.  \nThus, our third question will be \" **7**\" and the total cost for this
+  worst-case scenario will be 4+6+7= **17**.\n\nWe can improve considerably the worst-case
+  cost for <var>n</var>=8, by asking \" **5**\" as our first question.  \nIf we are
+  told that the hidden number is higher than 5, our second question will be \" **7**\",
+  then we'll know for certain what the hidden number is (for a total cost of 5+7=
+  **12** ).  \nIf we are told that the hidden number is lower than 5, our second question
+  will be \" **3**\" and if the hidden number is lower than 3 our third question will
+  be \" **1**\", giving a total cost of 5+3+1= **9**.  \nSince **12** \\> **9** ,
+  the worst-case cost for this strategy is **12**. That's better than what we achieved
+  previously with the \"binary search\" strategy; it is also better than or equal
+  to any other strategy.  \nSo, in fact, we have just described an optimal strategy
+  for <var>n</var>=8.\n\nLet C(<var>n</var>) be the worst-case cost achieved by an
+  optimal strategy for <var>n</var>, as described above.  \nThus C(1) = 0, C(2) =
+  1, C(3) = 2 and C(8) = 12.  \nSimilarly, C(100) = 400 and ![p328_sum1.gif]({{ images_dir
+  }}/p328_sum1.gif)C(<var>n</var>) = 17575.\n\nFind ![p328_sum2.gif]({{ images_dir
+  }}/p328_sum2.gif)C(<var>n</var>).\n\n"

data/data/problems/329.yml

@@ -1,16 +1,16 @@
 ---
 :id: 329
 :name: Prime Frog
-:url: http://projecteuler.net/problem=329
-:content: "Susan has a prime frog.  \n\rHer frog is jumping around over 500 squares
-  numbered 1 to 500.\rHe can only jump one square to the left or to the right, with
+:url: https://projecteuler.net/problem=329
+:content: "Susan has a prime frog.  \nHer frog is jumping around over 500 squares
+  numbered 1 to 500. He can only jump one square to the left or to the right, with
   equal probability, and he cannot jump outside the range [1;500].  \n(if it lands
   at either end, it automatically jumps to the only available square on the next move.)\n\nWhen
   he is on a square with a prime number on it, he croaks 'P' (PRIME) with probability
   2/3 or 'N' (NOT PRIME) with probability 1/3 just before jumping to the next square.
-  \ \n\rWhen he is on a square with a number on it that is not a prime he croaks 'P'
+  \ \nWhen he is on a square with a number on it that is not a prime he croaks 'P'
   with probability 1/3 or 'N' with probability 2/3 just before jumping to the next
   square.\n\nGiven that the frog's starting position is random with the same probability
   for every square, and given that she listens to his first 15 croaks, what is the
-  probability that she hears the sequence PPPPNNPPPNPPNPN?\n\n\rGive your answer as
-  a fraction p/q in reduced form.\r\r\n"
+  probability that she hears the sequence PPPPNNPPPNPPNPN?\n\nGive your answer as
+  a fraction p/q in reduced form.\n"

data/data/problems/33.yml

@@ -1,7 +1,7 @@
 ---
 :id: 33
-:name: Digit canceling fractions
-:url: http://projecteuler.net/problem=33
+:name: Digit cancelling fractions
+:url: https://projecteuler.net/problem=33
 :content: |+
   The fraction <sup>49</sup>/<sub>98</sub> is a curious fraction, as an inexperienced mathematician in attempting to simplify it may incorrectly believe that <sup>49</sup>/<sub>98</sub> = <sup>4</sup>/<sub>8</sub>, which is correct, is obtained by cancelling the 9s.