euler-manager 0.1.1 → 0.2.0

data/data/problems/330.yml

@@ -1,20 +1,16 @@
 ---
 :id: 330
 :name: Euler's Number
-:url: http://projecteuler.net/problem=330
-:content: "\rAn infinite sequence of real numbers <var>a</var>(<var>n</var>) is defined
-  for all integers <var>n</var> as follows:\r\n ![]({{ images_dir }}/p_330_formula.gif)\n\nFor
+:url: https://projecteuler.net/problem=330
+:content: "\r An infinite sequence of real numbers <var>a</var>(<var>n</var>) is defined
+  for all integers <var>n</var> as follows:\n ![p330_formula.gif]({{ images_dir }}/p330_formula.gif)\n\nFor
   example,\n\n| <var>a</var>(0) = | \n\n| 1 |\n| 1! |\n\n | + | \n\n| 1 |\n| 2! |\n\n
-  | + | \n\n| 1 |\n| 3! |\n\n | + ... = e ![−]({{ images_dir }}/symbol_minus.gif)
-  1 |\n\n| <var>a</var>(1) = | \n\n| e ![−]({{ images_dir }}/symbol_minus.gif) 1 |\n|
-  1! |\n\n | + | \n\n| 1 |\n| 2! |\n\n | + | \n\n| 1 |\n| 3! |\n\n | + ... = 2e ![−]({{
-  images_dir }}/symbol_minus.gif) 3 |\n\n| <var>a</var>(2) = | \n\n| 2e ![−]({{ images_dir
-  }}/symbol_minus.gif) 3 |\n| 1! |\n\n | + | \n\n| e ![−]({{ images_dir }}/symbol_minus.gif)
-  1 |\n| 2! |\n\n | + | \n\n| 1 |\n| 3! |\n\n | + ... = | \n\n| 7 |\n| 2 |\n\n | e
-  ![−]({{ images_dir }}/symbol_minus.gif) 6 |\n\n\rwith e = 2.7182818... being Euler's
-  constant.\r\r\n\n| It can be shown that <var>a</var>(<var>n</var>) is of the form
-  \r | \n\n| A(<var>n</var>) e + B(<var>n</var>) |\n| <var>n</var>! |\n\n | for integers
-  A(<var>n</var>) and B(<var>n</var>). \r |\n\n| For example <var>a</var>(10) = \r
-  | \n\n| 328161643 e ![−]({{ images_dir }}/symbol_minus.gif) 652694486 |\n| 10! |\n\n
-  | . |\n\nFind A(10<sup>9</sup>) + B(10<sup>9</sup>) and give your answer mod 77
-  777 777.\n\n"
+  | + | \n\n| 1 |\n| 3! |\n\n | + ... = e − 1 |\n\n| <var>a</var>(1) = | \n\n| e −
+  1 |\n| 1! |\n\n | + | \n\n| 1 |\n| 2! |\n\n | + | \n\n| 1 |\n| 3! |\n\n | + ...
+  = 2e − 3 |\n\n| <var>a</var>(2) = | \n\n| 2e − 3 |\n| 1! |\n\n | + | \n\n| e − 1
+  |\n| 2! |\n\n | + | \n\n| 1 |\n| 3! |\n\n | + ... = | \n\n| 7 |\n| 2 |\n\n | e −
+  6 |\n\nwith e = 2.7182818... being Euler's constant.\n\n| It can be shown that <var>a</var>(<var>n</var>)
+  is of the form | \n\n| A(<var>n</var>) e + B(<var>n</var>) |\n| <var>n</var>! |\n\n
+  | for integers A(<var>n</var>) and B(<var>n</var>). |\n\n| For example <var>a</var>(10)
+  = | \n\n| 328161643 e − 652694486 |\n| 10! |\n\n | . |\n\nFind A(10<sup>9</sup>)
+  + B(10<sup>9</sup>) and give your answer mod 77 777 777.\n\n"

data/data/problems/331.yml

@@ -1,22 +1,20 @@
 ---
 :id: 331
 :name: Cross flips
-:url: http://projecteuler.net/problem=331
-:content: "<var>N</var> ![×]({{ images_dir }}/symbol_times.gif)<var>N</var> disks
-  are placed on a square game board. Each disk has a black side and white side.\n\nAt
-  each turn, you may choose a disk and flip all the disks in the same row and the
-  same column as this disk: thus 2 ![×]({{ images_dir }}/symbol_times.gif)<var>N</var>-1
+:url: https://projecteuler.net/problem=331
+:content: "<var>N</var>×<var>N</var> disks are placed on a square game board. Each
+  disk has a black side and white side.\n\nAt each turn, you may choose a disk and
+  flip all the disks in the same row and the same column as this disk: thus 2×<var>N</var>-1
   disks are flipped. The game ends when all disks show their white side. The following
-  example shows a game on a 5 ![×]({{ images_dir }}/symbol_times.gif)5 board.\n\n
-  ![]({{ images_dir }}/p_331_crossflips3.gif)\n\nIt can be proven that 3 is the minimal
-  number of turns to finish this game.\n\nThe bottom left disk on the <var>N</var>
-  ![×]({{ images_dir }}/symbol_times.gif)<var>N</var> board has coordinates (0,0);
-  \ \n\rthe bottom right disk has coordinates (<var>N</var>-1,0) and the top left
-  disk has coordinates (0,<var>N</var>-1).\n\nLet C<sub><var>N</var></sub> be the
-  following configuration of a board with <var>N</var> ![×]({{ images_dir }}/symbol_times.gif)<var>N</var>
-  disks:  \n\rA disk at (<var>x</var>,<var>y</var>) satisfying ![]({{ images_dir }}/p_331_crossflips1.gif),
-  shows its black side; otherwise, it shows its white side. C<sub>5</sub> is shown
-  above.\n\nLet T(<var>N</var>) be the minimal number of turns to finish a game starting
-  from configuration C<sub><var>N</var></sub> or 0 if configuration C<sub><var>N</var></sub>
-  is unsolvable.  \n\rWe have shown that T(5)=3. You are also given that T(10)=29
-  and T(1 000)=395253.\n\nFind ![]({{ images_dir }}/p_331_crossflips2.gif).\n\n"
+  example shows a game on a 5×5 board.\n\n ![p331_crossflips3.gif]({{ images_dir }}/p331_crossflips3.gif)\n\nIt
+  can be proven that 3 is the minimal number of turns to finish this game.\n\nThe
+  bottom left disk on the <var>N</var>×<var>N</var> board has coordinates (0,0);  \nthe
+  bottom right disk has coordinates (<var>N</var>-1,0) and the top left disk has coordinates
+  (0,<var>N</var>-1).\n\nLet C<sub><var>N</var></sub> be the following configuration
+  of a board with <var>N</var>×<var>N</var> disks:  \nA disk at (<var>x</var>,<var>y</var>)
+  satisfying ![p331_crossflips1.gif]({{ images_dir }}/p331_crossflips1.gif), shows
+  its black side; otherwise, it shows its white side. C<sub>5</sub> is shown above.\n\nLet
+  T(<var>N</var>) be the minimal number of turns to finish a game starting from configuration
+  C<sub><var>N</var></sub> or 0 if configuration C<sub><var>N</var></sub> is unsolvable.
+  \ \nWe have shown that T(5)=3. You are also given that T(10)=29 and T(1 000)=395253.\n\nFind
+  ![p331_crossflips2.gif]({{ images_dir }}/p331_crossflips2.gif).\n\n"

data/data/problems/332.yml

@@ -1,15 +1,15 @@
 ---
 :id: 332
 :name: Spherical triangles
-:url: http://projecteuler.net/problem=332
+:url: https://projecteuler.net/problem=332
 :content: "A **spherical triangle** is a figure formed on the surface of a sphere
-  by three **great circular arcs** intersecting pairwise in three vertices.\n\n ![]({{
-  images_dir }}/p_332_spherical.jpg)\n\nLet C(<var>r</var>) be the sphere with the
-  centre (0,0,0) and radius <var>r</var>.  \n\rLet Z(<var>r</var>) be the set of points
-  on the surface of C(<var>r</var>) with integer coordinates.  \n\rLet T(<var>r</var>)
-  be the set of spherical triangles with vertices in Z(<var>r</var>).\rDegenerate
-  spherical triangles, formed by three points on the same great arc, are <u>not</u>
-  included in T(<var>r</var>).  \n\rLet A(<var>r</var>) be the area of the smallest
-  spherical triangle in T(<var>r</var>).\n\nFor example A(14) is 3.294040 rounded
-  to six decimal places.\n\nFind ![]({{ images_dir }}/p_332_sum.gif) A(<var>r</var>).
+  by three **great circular arcs** intersecting pairwise in three vertices.\n\n ![p332_spherical.jpg]({{
+  images_dir }}/p332_spherical.jpg)\n\nLet C(<var>r</var>) be the sphere with the
+  centre (0,0,0) and radius <var>r</var>.  \nLet Z(<var>r</var>) be the set of points
+  on the surface of C(<var>r</var>) with integer coordinates.  \nLet T(<var>r</var>)
+  be the set of spherical triangles with vertices in Z(<var>r</var>). Degenerate spherical
+  triangles, formed by three points on the same great arc, are <u>not</u> included
+  in T(<var>r</var>).  \nLet A(<var>r</var>) be the area of the smallest spherical
+  triangle in T(<var>r</var>).\n\nFor example A(14) is 3.294040 rounded to six decimal
+  places.\n\nFind ![p332_sum.gif]({{ images_dir }}/p332_sum.gif) A(<var>r</var>).
   Give your answer rounded to six decimal places.\n\n"

data/data/problems/333.yml

@@ -1,21 +1,20 @@
 ---
 :id: 333
 :name: Special partitions
-:url: http://projecteuler.net/problem=333
+:url: https://projecteuler.net/problem=333
 :content: "All positive integers can be partitioned in such a way that each and every
   term of the partition can be expressed as 2<sup>i</sup>x3<sup>j</sup>, where i,j
-  ![≥]({{ images_dir }}/symbol_ge.gif) 0.\n\nLet's consider only those such partitions
-  where none of the terms can divide any of the other terms.\r  \nFor example, the
-  partition of 17 = 2 + 6 + 9 = (2<sup>1</sup>x3<sup>0</sup> + 2<sup>1</sup>x3<sup>1</sup>
-  + 2<sup>0</sup>x3<sup>2</sup>) would not be valid since 2 can divide 6. Neither
-  would the partition 17 = 16 + 1 = (2<sup>4</sup>x3<sup>0</sup> + 2<sup>0</sup>x3<sup>0</sup>)
-  since 1 can divide 16. The only valid partition of 17 would be 8 + 9 = (2<sup>3</sup>x3<sup>0</sup>
-  + 2<sup>0</sup>x3<sup>2</sup>).\n\nMany integers have more than one valid partition,
-  the first being 11 having the following two partitions.\r  \n11 = 2 + 9 = (2<sup>1</sup>x3<sup>0</sup>
-  + 2<sup>0</sup>x3<sup>2</sup>)\r  \n11 = 8 + 3 = (2<sup>3</sup>x3<sup>0</sup> +
-  2<sup>0</sup>x3<sup>1</sup>)\n\nLet's define P(<var>n</var>) as the number of valid
-  partitions of <var>n</var>. For example, P(11) = 2.\n\nLet's consider only the prime
-  integers <var>q</var> which would have a single valid partition such as P(17).\n\nThe
-  sum of the primes <var>q</var> ![<]({{ images_dir }}/symbol_lt.gif)100 such that
-  P(<var>q</var>)=1 equals 233.\n\nFind the sum of the primes <var>q</var> ![<]({{
-  images_dir }}/symbol_lt.gif)1000000 such that P(<var>q</var>)=1.\n\n"
+  ≥ 0.\n\nLet's consider only those such partitions where none of the terms can divide
+  any of the other terms.  \nFor example, the partition of 17 = 2 + 6 + 9 = (2<sup>1</sup>x3<sup>0</sup>
+  + 2<sup>1</sup>x3<sup>1</sup> + 2<sup>0</sup>x3<sup>2</sup>) would not be valid
+  since 2 can divide 6. Neither would the partition 17 = 16 + 1 = (2<sup>4</sup>x3<sup>0</sup>
+  + 2<sup>0</sup>x3<sup>0</sup>) since 1 can divide 16. The only valid partition of
+  17 would be 8 + 9 = (2<sup>3</sup>x3<sup>0</sup> + 2<sup>0</sup>x3<sup>2</sup>).\n\nMany
+  integers have more than one valid partition, the first being 11 having the following
+  two partitions.  \n11 = 2 + 9 = (2<sup>1</sup>x3<sup>0</sup> + 2<sup>0</sup>x3<sup>2</sup>)
+  \ \n11 = 8 + 3 = (2<sup>3</sup>x3<sup>0</sup> + 2<sup>0</sup>x3<sup>1</sup>)\n\nLet's
+  define P(<var>n</var>) as the number of valid partitions of <var>n</var>. For example,
+  P(11) = 2.\n\nLet's consider only the prime integers <var>q</var> which would have
+  a single valid partition such as P(17).\n\nThe sum of the primes <var>q</var> \\<100
+  such that P(<var>q</var>)=1 equals 233.\n\nFind the sum of the primes <var>q</var>
+  \\<1000000 such that P(<var>q</var>)=1.\n\n"

data/data/problems/334.yml

@@ -1,27 +1,25 @@
 ---
 :id: 334
 :name: Spilling the beans
-:url: http://projecteuler.net/problem=334
+:url: https://projecteuler.net/problem=334
 :content: "In Plato's heaven, there exist an infinite number of bowls in a straight
-  line.  \n\rEach bowl either contains some or none of a finite number of beans.  \n\rA
+  line.  \nEach bowl either contains some or none of a finite number of beans.  \nA
   child plays a game, which allows only one kind of move: removing two beans from
   any bowl, and putting one in each of the two adjacent bowls.  \n The game ends when
   each bowl contains either one or no beans.\n\nFor example, consider two adjacent
   bowls containing 2 and 3 beans respectively, all other bowls being empty. The following
-  eight moves will finish the game:\n\n ![]({{ images_dir }}/p_334_beans.gif)\n\nYou
-  are given the following sequences:\n\n| <var>t</var><sub><i>0</i></sub> = 123456.\r
-  |\n\n| <var>t</var><sub><i>i</i></sub> = \r | ![]({{ images_dir }}/p_334_cases.gif)
-  | \n\n| | \n\n| <var>t</var><sub><i>i-1</i></sub> |\n| 2 |\n\n | \r ,\r | | \r if
-  <var>t</var><sub><i>i-1</i></sub> is even\r |\n| ![]({{ images_dir }}/p_334_lfloor.gif)
-  | \n\n| <var>t</var><sub><i>i-1</i></sub> |\n| 2 |\n\n | ![]({{ images_dir }}/p_334_rfloor.gif)
-  | \r 926252, \r | \r if <var>t</var><sub><i>i-1</i></sub> is odd\r |\n\n | |\n|
-  | | \r where ![⌊]({{ images_dir }}/symbol_lfloor.gif)<var>x</var> ![⌋]({{ images_dir
-  }}/symbol_rfloor.gif) is the floor function\r |\n| | | \r and ![]({{ images_dir
-  }}/p_334_oplus.gif) is the bitwise XOR operator.\r |\n\n| <var>b</var><sub><i>i</i></sub>
-  = ( <var>t</var><sub><i>i</i></sub> mod 2<sup>11</sup>) + 1.\r |\n\nThe first two
-  terms of the last sequence are <var>b</var><sub><i>1</i></sub> = 289 and <var>b</var><sub><i>2</i></sub>
-  = 145.  \n\rIf we start with <var>b</var><sub><i>1</i></sub> and <var>b</var><sub><i>2</i></sub>
-  beans in two adjacent bowls, 3419100 moves would be required to finish the game.\n\nConsider
-  now 1500 adjacent bowls containing <var>b</var><sub><i>1</i></sub>, <var>b</var><sub><i>2</i></sub>,...,
-  <var>b</var><sub><i>1500</i></sub> beans respectively, all other bowls being empty.
-  Find how many moves it takes before the game ends.\n\n"
+  eight moves will finish the game:\n\n ![p334_beans.gif]({{ images_dir }}/p334_beans.gif)\n\nYou
+  are given the following sequences:\n\n| <var>t</var><sub><i>0</i></sub> = 123456.
+  |\n\n| <var>t</var><sub><i>i</i></sub> = | ![p334_cases.gif]({{ images_dir }}/p334_cases.gif)
+  | \n\n| | \n\n| <var>t</var><sub><i>i-1</i></sub> |\n| 2 |\n\n | , | | if <var>t</var><sub><i>i-1</i></sub>
+  is even |\n| ![p334_lfloor.gif]({{ images_dir }}/p334_lfloor.gif) | \n\n| <var>t</var><sub><i>i-1</i></sub>
+  |\n| 2 |\n\n | ![p334_rfloor.gif]({{ images_dir }}/p334_rfloor.gif) | 926252, |
+  if <var>t</var><sub><i>i-1</i></sub> is odd |\n\n | |\n| | | where ⌊<var>x</var>⌋
+  is the floor function |\n| | | and ![p334_oplus.gif]({{ images_dir }}/p334_oplus.gif)
+  is the bitwise XOR operator. |\n\n| <var>b</var><sub><i>i</i></sub> = ( <var>t</var><sub><i>i</i></sub>
+  mod 2<sup>11</sup>) + 1. |\n\nThe first two terms of the last sequence are <var>b</var><sub><i>1</i></sub>
+  = 289 and <var>b</var><sub><i>2</i></sub> = 145.  \nIf we start with <var>b</var><sub><i>1</i></sub>
+  and <var>b</var><sub><i>2</i></sub> beans in two adjacent bowls, 3419100 moves would
+  be required to finish the game.\n\nConsider now 1500 adjacent bowls containing <var>b</var><sub><i>1</i></sub>,
+  <var>b</var><sub><i>2</i></sub>,..., <var>b</var><sub><i>1500</i></sub> beans respectively,
+  all other bowls being empty. Find how many moves it takes before the game ends.\n\n"

data/data/problems/335.yml

@@ -1,15 +1,15 @@
 ---
 :id: 335
 :name: Gathering the beans
-:url: http://projecteuler.net/problem=335
+:url: https://projecteuler.net/problem=335
 :content: |+
   Whenever Peter feels bored, he places some bowls, containing one bean each, in a circle. After this, he takes all the beans out of a certain bowl and drops them one by one in the bowls going clockwise. He repeats this, starting from the bowl he dropped the last bean in, until the initial situation appears again. For example with 5 bowls he acts as follows:
 
-   ![]({{ images_dir }}/p_335_mancala.gif)
+   ![p335_mancala.gif]({{ images_dir }}/p335_mancala.gif)
 
   So with 5 bowls it takes Peter 15 moves to return to the initial situation.
 
   Let <var>M</var>(<var>x</var>) represent the number of moves required to return to the initial situation, starting with <var>x</var> bowls. Thus, <var>M</var>(5) = 15. It can also be verified that <var>M</var>(100) = 10920.
 
-  Find ![]({{ images_dir }}/p_335_sum.gif)<var>M</var>(2<sup><var>k</var></sup>+1). Give your answer modulo 7<sup>9</sup>.
+  Find ![p335_sum.gif]({{ images_dir }}/p335_sum.gif)<var>M</var>(2<sup><var>k</var></sup>+1). Give your answer modulo 7<sup>9</sup>.
 

data/data/problems/336.yml

@@ -1,23 +1,23 @@
 ---
 :id: 336
 :name: Maximix Arrangements
-:url: http://projecteuler.net/problem=336
+:url: https://projecteuler.net/problem=336
 :content: "A train is used to transport four carriages in the order: ABCD. However,
   sometimes when the train arrives to collect the carriages they are not in the correct
-  order.   \n\rTo rearrange the carriages they are all shunted on to a large rotating
+  order.   \nTo rearrange the carriages they are all shunted on to a large rotating
   turntable. After the carriages are uncoupled at a specific point the train moves
   off the turntable pulling the carriages still attached with it. The remaining carriages
   are rotated 180 degrees. All of the carriages are then rejoined and this process
   is repeated as often as necessary in order to obtain the least number of uses of
-  the turntable.  \n\rSome arrangements, such as ADCB, can be solved easily: the carriages
+  the turntable.  \nSome arrangements, such as ADCB, can be solved easily: the carriages
   are separated between A and D, and after DCB are rotated the correct order has been
   achieved.\n\nHowever, Simple Simon, the train driver, is not known for his efficiency,
   so he always solves the problem by initially getting carriage A in the correct place,
   then carriage B, and so on.\n\nUsing four carriages, the worst possible arrangements
   for Simon, which we shall call _maximix arrangements_, are DACB and DBAC; each requiring
   him five rotations (although, using the most efficient approach, they could be solved
-  using just three rotations). The process he uses for DACB is shown below.\n\n ![]({{
-  images_dir }}/p_336_maximix.gif)\n\nIt can be verified that there are 24 maximix
+  using just three rotations). The process he uses for DACB is shown below.\n\n ![p336_maximix.gif]({{
+  images_dir }}/p336_maximix.gif)\n\nIt can be verified that there are 24 maximix
   arrangements for six carriages, of which the tenth lexicographic maximix arrangement
   is DFAECB.\n\nFind the 2011<sup>th</sup> lexicographic maximix arrangement for eleven
   carriages.\n\n"

data/data/problems/337.yml

@@ -1,13 +1,12 @@
 ---
 :id: 337
 :name: Totient Stairstep Sequences
-:url: http://projecteuler.net/problem=337
+:url: https://projecteuler.net/problem=337
 :content: "Let {a<sub>1</sub>, a<sub>2</sub>,..., a<sub><var>n</var></sub>} be an
   integer sequence of length <var>n</var> such that:\n\n- a<sub>1</sub> = 6\n- for
-  all 1 ![≤]({{ images_dir }}/symbol_le.gif) <var>i</var> n : φ(a<sub><var>i</var></sub>)
-  <var>i</var>+1) <var>i</var> <var>i</var>+1 <sup>1</sup>\n\nLet S(<var>N</var>)
-  be the number of such sequences with a<sub><var>n</var></sub> ![≤]({{ images_dir
-  }}/symbol_le.gif) <var>N</var>.  \n\rFor example, S(10) = 4: {6}, {6, 8}, {6, 8,
-  9} and {6, 10}.  \n\rWe can verify that S(100) = 482073668 and S(10 000) mod 10<sup>8</sup>
-  = 73808307.\n\nFind S(20 000 000) mod 10<sup>8</sup>.\n\n<sup>1</sup> φ denotes
-  **Euler's totient function** .\n\n"
+  all 1 ≤ <var>i</var> \\< <var>n</var> : φ(a<sub><var>i</var></sub>) \\< φ(a<sub><var>i</var>+1</sub>)
+  \\< a<sub><var>i</var></sub> \\< a<sub><var>i</var>+1</sub><sup>1</sup>\n\nLet S(<var>N</var>)
+  be the number of such sequences with a<sub><var>n</var></sub> ≤ <var>N</var>.  \nFor
+  example, S(10) = 4: {6}, {6, 8}, {6, 8, 9} and {6, 10}.  \nWe can verify that S(100)
+  = 482073668 and S(10 000) mod 10<sup>8</sup> = 73808307.\n\nFind S(20 000 000) mod
+  10<sup>8</sup>.\n\n<sup>1</sup> φ denotes **Euler's totient function**.\n\n"

data/data/problems/338.yml

@@ -1,28 +1,22 @@
 ---
 :id: 338
 :name: Cutting Rectangular Grid Paper
-:url: http://projecteuler.net/problem=338
+:url: https://projecteuler.net/problem=338
 :content: "A rectangular sheet of grid paper with integer dimensions <var>w</var>
-  ![×]({{ images_dir }}/symbol_times.gif) <var>h</var> is given. Its grid spacing
-  is 1.  \n\rWhen we cut the sheet along the grid lines into two pieces and rearrange
-  those pieces without overlap, we can make new rectangles with different dimensions.\n\nFor
-  example, from a sheet with dimensions 9 ![×]({{ images_dir }}/symbol_times.gif)
-  4 , we can make rectangles with dimensions 18 ![×]({{ images_dir }}/symbol_times.gif)
-  2, 12 ![×]({{ images_dir }}/symbol_times.gif) 3 and 6 ![×]({{ images_dir }}/symbol_times.gif)
-  6 by cutting and rearranging as below:\n\n ![]({{ images_dir }}/p_338_gridpaper.gif)
-  \ \n\nSimilarly, from a sheet with dimensions 9 ![×]({{ images_dir }}/symbol_times.gif)
-  8 , we can make rectangles with dimensions 18 ![×]({{ images_dir }}/symbol_times.gif)
-  4 and 12 ![×]({{ images_dir }}/symbol_times.gif) 6 .\n\nFor a pair <var>w</var>
-  and <var>h</var>, let F(<var>w</var>,<var>h</var>) be the number of distinct rectangles
-  that can be made from a sheet with dimensions <var>w</var> ![×]({{ images_dir }}/symbol_times.gif)
-  <var>h</var> .  \n\rFor example, F(2,1) = 0, F(2,2) = 1, F(9,4) = 3 and F(9,8) =
-  2.   \n\rNote that rectangles congruent to the initial one are not counted in F(<var>w</var>,<var>h</var>).
-  \ \n\rNote also that rectangles with dimensions <var>w</var> ![×]({{ images_dir
-  }}/symbol_times.gif) <var>h</var> and dimensions <var>h</var> ![×]({{ images_dir
-  }}/symbol_times.gif) <var>w</var> are not considered distinct.\n\nFor an integer
-  <var>N</var>, let G(<var>N</var>) be the sum of F(<var>w</var>,<var>h</var>) for
-  all pairs <var>w</var> and <var>h</var> which satisfy 0 ![<]({{ images_dir }}/symbol_lt.gif)
-  <var>h</var> ![≤]({{ images_dir }}/symbol_le.gif) <var>w</var> ![≤]({{ images_dir
-  }}/symbol_le.gif) <var>N</var>.  \n\rWe can verify that G(10) = 55, G(10<sup>3</sup>)
-  = 971745 and G(10<sup>5</sup>) = 9992617687.\n\nFind G(10<sup>12</sup>). Give your
-  answer modulo 10<sup>8</sup>.\n\n"
+  × <var>h</var> is given. Its grid spacing is 1.  \nWhen we cut the sheet along the
+  grid lines into two pieces and rearrange those pieces without overlap, we can make
+  new rectangles with different dimensions.\n\nFor example, from a sheet with dimensions
+  9 × 4 , we can make rectangles with dimensions 18 × 2, 12 × 3 and 6 × 6 by cutting
+  and rearranging as below:\n\n ![p338_gridpaper.gif]({{ images_dir }}/p338_gridpaper.gif)
+  \ \n\nSimilarly, from a sheet with dimensions 9 × 8 , we can make rectangles with
+  dimensions 18 × 4 and 12 × 6 .\n\nFor a pair <var>w</var> and <var>h</var>, let
+  F(<var>w</var>,<var>h</var>) be the number of distinct rectangles that can be made
+  from a sheet with dimensions <var>w</var> × <var>h</var> .  \nFor example, F(2,1)
+  = 0, F(2,2) = 1, F(9,4) = 3 and F(9,8) = 2.   \nNote that rectangles congruent to
+  the initial one are not counted in F(<var>w</var>,<var>h</var>).  \nNote also that
+  rectangles with dimensions <var>w</var> × <var>h</var> and dimensions <var>h</var>
+  × <var>w</var> are not considered distinct.\n\nFor an integer <var>N</var>, let
+  G(<var>N</var>) be the sum of F(<var>w</var>,<var>h</var>) for all pairs <var>w</var>
+  and <var>h</var> which satisfy 0 \\< <var>h</var> ≤ <var>w</var> ≤ <var>N</var>.
+  \ \nWe can verify that G(10) = 55, G(10<sup>3</sup>) = 971745 and G(10<sup>5</sup>)
+  = 9992617687.\n\nFind G(10<sup>12</sup>). Give your answer modulo 10<sup>8</sup>.\n\n"

data/data/problems/339.yml

@@ -1,17 +1,17 @@
 ---
 :id: 339
 :name: Peredur fab Efrawg
-:url: http://projecteuler.net/problem=339
+:url: https://projecteuler.net/problem=339
 :content: "_\"And he came towards a valley, through which ran a river; and the borders
   of the valley were wooded, and on each side of the river were level meadows. And
   on one side of the river he saw a flock of white sheep, and on the other a flock
   of black sheep. And whenever one of the white sheep bleated, one of the black sheep
   would cross over and become white; and when one of the black sheep bleated, one
-  of the white sheep would cross over and become black.\"_  \n [en.wikisource.org](http://en.wikisource.org/wiki/The_Mabinogion/Peredur_the_Son_of_Evrawc)\n\nInitially
+  of the white sheep would cross over and become black.\"_  \n[en.wikisource.org](http://en.wikisource.org/wiki/The_Mabinogion/Peredur_the_Son_of_Evrawc)\n\nInitially
   each flock consists of <var>n</var> sheep. Each sheep (regardless of colour) is
   equally likely to be the next sheep to bleat. After a sheep has bleated and a sheep
   from the other flock has crossed over, Peredur may remove a number of white sheep
   in order to maximize the expected final number of black sheep. Let E(<var>n</var>)
   be the expected final number of black sheep if Peredur uses an optimal strategy.\n\nYou
-  are given that E(5) = 6.871346 rounded to 6 places behind the decimal point.  \n\rFind
+  are given that E(5) = 6.871346 rounded to 6 places behind the decimal point.  \nFind
   E(10 000) and give your answer rounded to 6 places behind the decimal point.\n\n"

data/data/problems/34.yml

@@ -1,7 +1,7 @@
 ---
 :id: 34
 :name: Digit factorials
-:url: http://projecteuler.net/problem=34
+:url: https://projecteuler.net/problem=34
 :content: |+
   145 is a curious number, as 1! + 4! + 5! = 1 + 24 + 120 = 145.
 

data/data/problems/340.yml

@@ -1,11 +1,11 @@
 ---
 :id: 340
 :name: Crazy Function
-:url: http://projecteuler.net/problem=340
+:url: https://projecteuler.net/problem=340
 :content: "For fixed integers a, b, c, define the _crazy function_ F(<var>n</var>)
-  as follows:  \n\rF(<var>n</var>) = <var>n</var> - c for all <var>n</var> ![>]({{
-  images_dir }}/symbol_gt.gif) b   \n\rF(<var>n</var>) = F(a + F(a + F(a + F(a + <var>n</var>))))
-  for all <var>n</var> ![≤]({{ images_dir }}/symbol_le.gif) b.\n\nAlso, define S(a,
-  b, c) = ![]({{ images_dir }}/p_340_formula.gif).\n\nFor example, if a = 50, b =
-  2000 and c = 40, then F(0) = 3240 and F(2000) = 2040.  \n\rAlso, S(50, 2000, 40)
-  = 5204240.\n\nFind the last 9 digits of S(21<sup>7</sup>, 7<sup>21</sup>, 12<sup>7</sup>).\n\n"
+  as follows:  \nF(<var>n</var>) = <var>n</var> - c for all <var>n</var> \\> b   \nF(<var>n</var>)
+  = F(a + F(a + F(a + F(a + <var>n</var>)))) for all <var>n</var> ≤ b.\n\nAlso, define
+  S(a, b, c) = ![p340_formula.gif]({{ images_dir }}/p340_formula.gif).\n\nFor example,
+  if a = 50, b = 2000 and c = 40, then F(0) = 3240 and F(2000) = 2040.  \nAlso, S(50,
+  2000, 40) = 5204240.\n\nFind the last 9 digits of S(21<sup>7</sup>, 7<sup>21</sup>,
+  12<sup>7</sup>).\n\n"

data/data/problems/341.yml

@@ -1,14 +1,13 @@
 ---
 :id: 341
 :name: Golomb's self-describing sequence
-:url: http://projecteuler.net/problem=341
+:url: https://projecteuler.net/problem=341
 :content: "The **Golomb's self-describing sequence** {G(<var>n</var>)} is the only
   nondecreasing sequence of natural numbers such that <var>n</var> appears exactly
   G(<var>n</var>) times in the sequence. The values of G(<var>n</var>) for the first
   few <var>n</var> are\n\n| <var>n</var> | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10
   | 11 | 12 | 13 | 14 | 15 | … |\n| G(<var>n</var>) | 1 | 2 | 2 | 3 | 3 | 4 | 4 |
   4 | 5 | 5 | 5 | 6 | 6 | 6 | 6 | … |\n\nYou are given that G(10<sup>3</sup>) = 86,
-  G(10<sup>6</sup>) = 6137.  \n\rYou are also given that ΣG(<var>n</var><sup>3</sup>)
-  = 153506976 for 1 ![≤]({{ images_dir }}/symbol_le.gif) <var>n</var> ![<]({{ images_dir
-  }}/symbol_lt.gif) 10<sup>3</sup>.\n\nFind ΣG(<var>n</var><sup>3</sup>) for 1 ![≤]({{
-  images_dir }}/symbol_le.gif) <var>n</var> ![<]({{ images_dir }}/symbol_lt.gif) 10<sup>6</sup>.\n\n"
+  G(10<sup>6</sup>) = 6137.  \nYou are also given that ΣG(<var>n</var><sup>3</sup>)
+  = 153506976 for 1 ≤ <var>n</var> \\< 10<sup>3</sup>.\n\nFind ΣG(<var>n</var><sup>3</sup>)
+  for 1 ≤ <var>n</var> \\< 10<sup>6</sup>.\n\n"

data/data/problems/342.yml

@@ -1,12 +1,9 @@
 ---
 :id: 342
 :name: The totient of a square is a cube
-:url: http://projecteuler.net/problem=342
-:content: "Consider the number 50.  \n\r50<sup>2</sup> = 2500 = 2<sup>2</sup> ![×]({{
-  images_dir }}/symbol_times.gif) 5<sup>4</sup>, so φ(2500) = 2 ![×]({{ images_dir
-  }}/symbol_times.gif) 4 ![×]({{ images_dir }}/symbol_times.gif) 5<sup>3</sup> = 8
-  ![×]({{ images_dir }}/symbol_times.gif) 5<sup>3</sup> = 2<sup>3</sup> ![×]({{ images_dir
-  }}/symbol_times.gif) 5<sup>3</sup>. <sup>1</sup>  \n\rSo 2500 is a square and φ(2500)
-  is a cube.\n\nFind the sum of all numbers n, 1 &lt n ![<]({{ images_dir }}/symbol_lt.gif)
-  10<sup>10</sup> such that φ(n<sup>2</sup>) is a cube.\n\n<sup>1</sup> φ denotes
-  **Euler's totient function** .\n\n"
+:url: https://projecteuler.net/problem=342
+:content: "Consider the number 50.  \n50<sup>2</sup> = 2500 = 2<sup>2</sup> × 5<sup>4</sup>,
+  so φ(2500) = 2 × 4 × 5<sup>3</sup> = 8 × 5<sup>3</sup> = 2<sup>3</sup> × 5<sup>3</sup>.
+  <sup>1</sup>  \nSo 2500 is a square and φ(2500) is a cube.\n\nFind the sum of all
+  numbers n, 1 &lt n \\< 10<sup>10</sup> such that φ(n<sup>2</sup>) is a cube.\n\n<sup>1</sup>
+  φ denotes **Euler's totient function**.\n\n"

data/data/problems/343.yml

@@ -1,18 +1,13 @@
 ---
 :id: 343
 :name: Fractional Sequences
-:url: http://projecteuler.net/problem=343
+:url: https://projecteuler.net/problem=343
 :content: "For any positive integer <var>k</var>, a finite sequence a<sub><var>i</var></sub>
-  of fractions x<sub><var>i</var></sub>/y<sub><var>i</var></sub> is defined by:  \n\ra<sub>1</sub>
-  = 1/<var>k</var> and  \n\ra<sub><var>i</var></sub> = (x<sub><var>i</var>-1</sub>+1)/(y<sub><var>i</var>-1</sub>-1)
-  reduced to lowest terms for <var>i</var>>1.  \n\rWhen a<sub><var>i</var></sub> reaches
+  of fractions x<sub><var>i</var></sub>/y<sub><var>i</var></sub> is defined by:  \na<sub>1</sub>
+  = 1/<var>k</var> and  \na<sub><var>i</var></sub> = (x<sub><var>i</var>-1</sub>+1)/(y<sub><var>i</var>-1</sub>-1)
+  reduced to lowest terms for <var>i</var>\\>1.  \nWhen a<sub><var>i</var></sub> reaches
   some integer <var>n</var>, the sequence stops. (That is, when y<sub><var>i</var></sub>=1.)
-  \ \n\rDefine f(<var>k</var>) = <var>n</var>.   \n\rFor example, for <var>k</var>
-  = 20:\n\n1/20 ![→]({{ images_dir }}/symbol_maps.gif) 2/19 ![→]({{ images_dir }}/symbol_maps.gif)
-  3/18 = 1/6 ![→]({{ images_dir }}/symbol_maps.gif) 2/5 ![→]({{ images_dir }}/symbol_maps.gif)
-  3/4 ![→]({{ images_dir }}/symbol_maps.gif) 4/3 ![→]({{ images_dir }}/symbol_maps.gif)
-  5/2 ![→]({{ images_dir }}/symbol_maps.gif) 6/1 = 6\n\nSo f(20) = 6.\n\nAlso f(1)
-  = 1, f(2) = 2, f(3) = 1 and Σf(<var>k</var><sup>3</sup>) = 118937 for 1 ![≤]({{
-  images_dir }}/symbol_le.gif) <var>k</var> ![≤]({{ images_dir }}/symbol_le.gif) 100.\n\nFind
-  Σf(<var>k</var><sup>3</sup>) for 1 ![≤]({{ images_dir }}/symbol_le.gif) <var>k</var>
-  ![≤]({{ images_dir }}/symbol_le.gif) 2 ![×]({{ images_dir }}/symbol_times.gif)10<sup>6</sup>.\n\n"
+  \ \nDefine f(<var>k</var>) = <var>n</var>.   \nFor example, for <var>k</var> = 20:\n\n1/20
+  → 2/19 → 3/18 = 1/6 → 2/5 → 3/4 → 4/3 → 5/2 → 6/1 = 6\n\nSo f(20) = 6.\n\nAlso f(1)
+  = 1, f(2) = 2, f(3) = 1 and Σf(<var>k</var><sup>3</sup>) = 118937 for 1 ≤ <var>k</var>
+  ≤ 100.\n\nFind Σf(<var>k</var><sup>3</sup>) for 1 ≤ <var>k</var> ≤ 2×10<sup>6</sup>.\n\n"

data/data/problems/344.yml

@@ -1,7 +1,7 @@
 ---
 :id: 344
 :name: Silver dollar game
-:url: http://projecteuler.net/problem=344
+:url: https://projecteuler.net/problem=344
 :content: "One variant of N.G. de Bruijn's **silver dollar** game can be described
   as follows:\n\nOn a strip of squares a number of coins are placed, at most one coin
   per square. Only one coin, called the **silver dollar** , has any value. Two players
@@ -11,10 +11,10 @@
   or over another coin.\n\nAlternatively, the player can choose to make the _special_
   move of pocketing the leftmost coin rather than making a regular move. If no regular
   moves are possible, the player is forced to pocket the leftmost coin.\n\nThe winner
-  is the player who pockets the silver dollar.\n\n ![]({{ images_dir }}/p_344_silverdollar.gif)
-  \ \n\nA _winning configuration_ is an arrangement of coins on the strip where the
-  first player can force a win no matter what the second player does.\n\nLet W(<var>n</var>,<var>c</var>)
-  be the number of winning configurations for a strip of <var>n</var> squares, <var>c</var>
-  worthless coins and one silver dollar.\n\nYou are given that W(10,2) = 324 and W(100,10)
-  = 1514704946113500.\n\nFind W(1 000 000, 100) modulo the semiprime 1000 036 000
-  099 (= 1 000 003 · 1 000 033).\n\n"
+  is the player who pockets the silver dollar.\n\n ![p344_silverdollar.gif]({{ images_dir
+  }}/p344_silverdollar.gif)  \n\nA _winning configuration_ is an arrangement of coins
+  on the strip where the first player can force a win no matter what the second player
+  does.\n\nLet W(<var>n</var>,<var>c</var>) be the number of winning configurations
+  for a strip of <var>n</var> squares, <var>c</var> worthless coins and one silver
+  dollar.\n\nYou are given that W(10,2) = 324 and W(100,10) = 1514704946113500.\n\nFind
+  W(1 000 000, 100) modulo the semiprime 1000 036 000 099 (= 1 000 003 · 1 000 033).\n\n"