euler-manager 0.1.1 → 0.2.0

data/data/problems/234.yml

@@ -1,17 +1,15 @@
 ---
 :id: 234
 :name: Semidivisible numbers
-:url: http://projecteuler.net/problem=234
-:content: "For an integer <var>n</var> ![≥]({{ images_dir }}/symbol_ge.gif) 4, we
-  define the _lower prime square root_ of <var>n</var>, denoted by lps(<var>n</var>),
-  as the largest prime ![≤]({{ images_dir }}/symbol_le.gif) ![√]({{ images_dir }}/symbol_radic.gif)<var>n</var>
+:url: https://projecteuler.net/problem=234
+:content: "For an integer <var>n</var> ≥ 4, we define the _lower prime square root_
+  of <var>n</var>, denoted by lps(<var>n</var>), as the largest prime ≤ √<var>n</var>
   and the _upper prime square root_ of <var>n</var>, ups(<var>n</var>), as the smallest
-  prime ![≥]({{ images_dir }}/symbol_ge.gif) ![√]({{ images_dir }}/symbol_radic.gif)<var>n</var>.\n\nSo,
-  for example, lps(4) = 2 = ups(4), lps(1000) = 31, ups(1000) = 37.  \n\rLet us call
-  an integer <var>n</var> ![≥]({{ images_dir }}/symbol_ge.gif) 4 _semidivisible_,
-  if one of lps(<var>n</var>) and ups(<var>n</var>) divides <var>n</var>, but not
-  both.\n\nThe sum of the semidivisible numbers not exceeding 15 is 30, the numbers
-  are 8, 10 and 12.  \n 15 is not semidivisible because it is a multiple of both lps(15)
-  = 3 and ups(15) = 5.  \n\rAs a further example, the sum of the 92 semidivisible
-  numbers up to 1000 is 34825.\n\nWhat is the sum of all semidivisible numbers not
-  exceeding 999966663333 ?\n\n"
+  prime ≥ √<var>n</var>.\n\nSo, for example, lps(4) = 2 = ups(4), lps(1000) = 31,
+  ups(1000) = 37.  \nLet us call an integer <var>n</var> ≥ 4 _semidivisible_, if one
+  of lps(<var>n</var>) and ups(<var>n</var>) divides <var>n</var>, but not both.\n\nThe
+  sum of the semidivisible numbers not exceeding 15 is 30, the numbers are 8, 10 and
+  12.  \n 15 is not semidivisible because it is a multiple of both lps(15) = 3 and
+  ups(15) = 5.  \nAs a further example, the sum of the 92 semidivisible numbers up
+  to 1000 is 34825.\n\nWhat is the sum of all semidivisible numbers not exceeding
+  999966663333 ?\n\n"

data/data/problems/235.yml

@@ -1,8 +1,8 @@
 ---
 :id: 235
 :name: An Arithmetic Geometric sequence
-:url: http://projecteuler.net/problem=235
+:url: https://projecteuler.net/problem=235
 :content: "Given is the arithmetic-geometric sequence u(<var>k</var>) = (900-3<var>k</var>)<var>r</var><sup><var>k</var>-1</sup>.
-  \ \n\rLet s(<var>n</var>) = Σ<sub><var>k</var>=1...<var>n</var></sub>u(<var>k</var>).\n\nFind
+  \ \nLet s(<var>n</var>) = Σ<sub><var>k</var>=1...<var>n</var></sub>u(<var>k</var>).\n\nFind
   the value of <var>r</var> for which s(5000) = -600,000,000,000.\n\nGive your answer
   rounded to 12 places behind the decimal point.\n\n"

data/data/problems/236.yml

@@ -1,19 +1,13 @@
 ---
 :id: 236
 :name: Luxury Hampers
-:url: http://projecteuler.net/problem=236
-:content: "<style type=\"text/css\"><![CDATA[\r\ntable.p236, table.p236 th, table.p236
-  td {\r\n  border-width: 1px 1px 1px 1px;\r\n  border-style: solid solid solid solid;\r\n
-  \ border-color: black black black black;\r\n  text-align:right;\r\n  -moz-border-radius:
-  0px 0px 0px 0px;\r\n}\r\ntable.p236 {\r\n  border-spacing: 1px;\r\n  border-collapse:
-  separate;\r\n  background-color: rgb(224,237,252);\r\n}\r\ntable.p236 th, table.p236
-  td {\r\n  padding: 1px 6px 1px 6px;\r\n}\r\ntable.p236 th { background-color: rgb(193,218,249);
-  }\r\ntable.p236 td { background-color: rgb(255,255,255); }\r\n]]></style>\n\nSuppliers
-  'A' and 'B' provided the following numbers of products for the luxury hamper market:\n\n<center><table
-  class=\"p236\">\r\n<tr>\n<th>Product</th>\n<th style=\"text-align:center\">'A'</th>\n<th
-  style=\"text-align:center\">'B'</th>\n</tr>\r\n<tr>\n<td>Beluga Caviar</td>\n<td>5248</td>\n<td>640</td>\n</tr>\r\n<tr>\n<td>Christmas
-  Cake</td>\n<td>1312</td>\n<td>1888</td>\n</tr>\r\n<tr>\n<td>Gammon Joint</td>\n<td>2624</td>\n<td>3776</td>\n</tr>\r\n<tr>\n<td>Vintage
-  Port</td>\n<td>5760</td>\n<td>3776</td>\n</tr>\r\n<tr>\n<td>Champagne Truffles</td>\n<td>3936</td>\n<td>5664</td>\n</tr>\r\n</table></center>\n\nAlthough
+:url: https://projecteuler.net/problem=236
+:content: "Suppliers 'A' and 'B' provided the following numbers of products for the
+  luxury hamper market:\n\n<center><table class=\"p236\">\n<tr>\n<th>Product</th>\n<th
+  style=\"text-align:center;\">'A'</th>\n<th style=\"text-align:center;\">'B'</th>\n</tr>\n<tr>\n<td>Beluga
+  Caviar</td>\n<td>5248</td>\n<td>640</td>\n</tr>\n<tr>\n<td>Christmas Cake</td>\n<td>1312</td>\n<td>1888</td>\n</tr>\n<tr>\n<td>Gammon
+  Joint</td>\n<td>2624</td>\n<td>3776</td>\n</tr>\n<tr>\n<td>Vintage Port</td>\n<td>5760</td>\n<td>3776</td>\n</tr>\n<tr>\n<td>Champagne
+  Truffles</td>\n<td>3936</td>\n<td>5664</td>\n</tr>\n</table></center>\n\nAlthough
   the suppliers try very hard to ship their goods in perfect condition, there is inevitably
   some spoilage - _i.e._ products gone bad.\n\nThe suppliers compare their performance
   using two types of statistic:\n\n- The five _per-product spoilage rates_ for each
@@ -22,9 +16,9 @@
   for each supplier is equal to the total number of products gone bad divided by the
   total number of products provided by that supplier.\n\nTo their surprise, the suppliers
   found that each of the five per-product spoilage rates was worse (higher) for 'B'
-  than for 'A' by the same factor (ratio of spoilage rates), <var>m</var>>1; and yet,
-  paradoxically, the overall spoilage rate was worse for 'A' than for 'B', also by
-  a factor of <var>m</var>.\n\nThere are thirty-five <var>m</var> ![>]({{ images_dir
-  }}/symbol_gt.gif)1 for which this surprising result could have occurred, the smallest
-  of which is 1476/1475.\n\nWhat's the largest possible value of <var>m</var>?  \n\rGive
-  your answer as a fraction reduced to its lowest terms, in the form <var>u</var>/<var>v</var>.\n\n"
+  than for 'A' by the same factor (ratio of spoilage rates), <var>m</var>\\>1; and
+  yet, paradoxically, the overall spoilage rate was worse for 'A' than for 'B', also
+  by a factor of <var>m</var>.\n\nThere are thirty-five <var>m</var>\\>1 for which
+  this surprising result could have occurred, the smallest of which is 1476/1475.\n\nWhat's
+  the largest possible value of <var>m</var>?  \nGive your answer as a fraction reduced
+  to its lowest terms, in the form <var>u</var>/<var>v</var>.\n\n"

data/data/problems/237.yml

@@ -1,18 +1,18 @@
 ---
 :id: 237
 :name: Tours on a 4 x n playing board
-:url: http://projecteuler.net/problem=237
+:url: https://projecteuler.net/problem=237
 :content: |+
-  Let T(_n_) be the number of tours over a 4 ![×]({{ images_dir }}/symbol_times.gif) _n_ playing board such that:
+  Let T(_n_) be the number of tours over a 4 × _n_ playing board such that:
 
   - The tour starts in the top left corner.
   - The tour consists of moves that are up, down, left, or right one square.
   - The tour visits each square exactly once.
   - The tour ends in the bottom left corner.
 
-  The diagram shows one tour over a 4 ![×]({{ images_dir }}/symbol_times.gif) 10 board:
+  The diagram shows one tour over a 4 × 10 board:
 
-   ![]({{ images_dir }}/p_237.gif)
+   ![]({{ images_dir }}/p237.gif)
 
   T(10) is 2329. What is T(10<sup>12</sup>) modulo 10<sup>8</sup>?
 

data/data/problems/238.yml

@@ -1,29 +1,26 @@
 ---
 :id: 238
 :name: Infinite string tour
-:url: http://projecteuler.net/problem=238
-:content: "<style type=\"text/css\"><![CDATA[\r\ntable.p238 td { padding: 0px 3px
-  0px 3px; }\r\n]]></style>\n\nCreate a sequence of numbers using the \"Blum Blum
-  Shub\" pseudo-random number generator:\n\n<center><table class=\"p238\">\r\n  <tr>\r\n
-  \   <td style=\"text-align:right\">\n<var>s</var><sub>0</sub>\n</td>\r\n    <td>=</td>\r\n
-  \   <td>14025256</td>\r\n  </tr>\n<tr>\r\n    <td>\n<var>s</var><sub><var>n</var>+1</sub>\n</td>\r\n
-  \   <td>=</td>\r\n    <td>\n<var>s</var><sub><var>n</var></sub><sup>2</sup> mod
-  20300713</td>\r\n  </tr>\r\n</table></center>\n\nConcatenate these numbers  <var>s</var><sub>0</sub><var>s</var><sub>1</sub><var>s</var><sub>2</sub>…
-  to create a string <var>w</var> of infinite length.  \n\rThen, <var>w</var> = 14025256741014958470038053646…\n\nFor
+:url: https://projecteuler.net/problem=238
+:content: "Create a sequence of numbers using the \"Blum Blum Shub\" pseudo-random
+  number generator:\n\n<center><table class=\"p238\">\n<tr>\n<td style=\"text-align:right;\">\n<var>s</var><sub>0</sub>\n</td>\n
+  \   <td>=</td>\n    <td>14025256</td>\n  </tr>\n<tr>\n<td>\n<var>s</var><sub><var>n</var>+1</sub>\n</td>\n
+  \   <td>=</td>\n    <td>\n<var>s</var><sub><var>n</var></sub><sup>2</sup> mod 20300713</td>\n
+  \ </tr>\n</table></center>\n\nConcatenate these numbers  <var>s</var><sub>0</sub><var>s</var><sub>1</sub><var>s</var><sub>2</sub>…
+  to create a string <var>w</var> of infinite length.  \nThen, <var>w</var> = 14025256741014958470038053646…\n\nFor
   a positive integer <var>k</var>, if no substring of <var>w</var> exists with a sum
   of digits equal to <var>k</var>, <var>p</var>(<var>k</var>) is defined to be zero.
   If at least one substring of <var>w</var> exists with a sum of digits equal to <var>k</var>,
   we define <var>p</var>(<var>k</var>) = <var>z</var>, where <var>z</var> is the starting
   position of the earliest such substring.\n\nFor instance:\n\nThe substrings 1, 14,
-  1402, …   \n\rwith respective sums of digits equal to 1, 5, 7, …  \n\rstart at position
-  **1** , hence <var>p</var>(1) = <var>p</var>(5) = <var>p</var>(7) = … =  **1** .\n\nThe
-  substrings 4, 402, 4025, …  \n\rwith respective sums of digits equal to 4, 6, 11,
-  …  \n\rstart at position **2** , hence <var>p</var>(4) = <var>p</var>(6) = <var>p</var>(11) = … = 
-  **2** .\n\nThe substrings 02, 0252, …  \n\rwith respective sums of digits equal
-  to 2, 9, …  \n\rstart at position **3** , hence <var>p</var>(2) = <var>p</var>(9) = … = 
-  **3** .\n\nNote that substring 025 starting at position **3** , has a sum of digits
+  1402, …   \nwith respective sums of digits equal to 1, 5, 7, …  \nstart at position
+  **1** , hence <var>p</var>(1) = <var>p</var>(5) = <var>p</var>(7) = … =  **1**.\n\nThe
+  substrings 4, 402, 4025, …  \nwith respective sums of digits equal to 4, 6, 11,
+  …  \nstart at position **2** , hence <var>p</var>(4) = <var>p</var>(6) = <var>p</var>(11) = … = 
+  **2**.\n\nThe substrings 02, 0252, …  \nwith respective sums of digits equal to
+  2, 9, …  \nstart at position **3** , hence <var>p</var>(2) = <var>p</var>(9) = … = 
+  **3**.\n\nNote that substring 025 starting at position **3** , has a sum of digits
   equal to 7, but there was an earlier substring (starting at position **1** ) with
   a sum of digits equal to 7, so <var>p</var>(7) = 1, _not_ 3.\n\nWe can verify that,
-  for 0 k  ![≤]({{ images_dir }}/symbol_le.gif) 10<sup>3</sup>, ![∑]({{ images_dir
-  }}/symbol_sum.gif) <var>p</var>(<var>k</var>) = 4742.\n\nFind ![∑]({{ images_dir
-  }}/symbol_sum.gif) <var>p</var>(<var>k</var>), for 0 k  ![≤]({{ images_dir }}/symbol_le.gif) 2·10<sup>15</sup>.\n\n"
+  for 0 \\< <var>k</var> ≤ 10<sup>3</sup>, ∑ <var>p</var>(<var>k</var>) = 4742.\n\nFind
+  ∑ <var>p</var>(<var>k</var>), for 0 \\< <var>k</var> ≤ 2·10<sup>15</sup>.\n\n"

data/data/problems/239.yml

@@ -1,9 +1,9 @@
 ---
 :id: 239
 :name: Twenty-two Foolish Primes
-:url: http://projecteuler.net/problem=239
+:url: https://projecteuler.net/problem=239
 :content: "A set of disks numbered 1 through 100 are placed in a line in random order.\n\nWhat
   is the probability that we have a partial derangement such that exactly 22 prime
-  number discs are found away from their natural positions?  \n\r(Any number of non-prime
+  number discs are found away from their natural positions?  \n(Any number of non-prime
   disks may also be found in or out of their natural positions.)\n\nGive your answer
   rounded to 12 places behind the decimal point in the form 0.abcdefghijkl.\n\n"

data/data/problems/24.yml

@@ -1,11 +1,11 @@
 ---
 :id: 24
 :name: Lexicographic permutations
-:url: http://projecteuler.net/problem=24
+:url: https://projecteuler.net/problem=24
 :content: |+
   A permutation is an ordered arrangement of objects. For example, 3124 is one possible permutation of the digits 1, 2, 3 and 4. If all of the permutations are listed numerically or alphabetically, we call it lexicographic order. The lexicographic permutations of 0, 1 and 2 are:
 
-  012   021   102   120   201   210
+  012   021   102   120   201   210
 
   What is the millionth lexicographic permutation of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9?
 

data/data/problems/240.yml

@@ -1,11 +1,11 @@
 ---
 :id: 240
 :name: Top Dice
-:url: http://projecteuler.net/problem=240
+:url: https://projecteuler.net/problem=240
 :content: "There are 1111 ways in which five 6-sided dice (sides numbered 1 to 6)
-  can be rolled so that the top three sum to 15. Some examples are:\r\r  \n  \n  \n\rD<sub>1</sub>,D<sub>2</sub>,D<sub>3</sub>,D<sub>4</sub>,D<sub>5</sub>
-  = 4,3,6,3,5\r  \n\rD<sub>1</sub>,D<sub>2</sub>,D<sub>3</sub>,D<sub>4</sub>,D<sub>5</sub>
-  = 4,3,3,5,6\r  \n\rD<sub>1</sub>,D<sub>2</sub>,D<sub>3</sub>,D<sub>4</sub>,D<sub>5</sub>
-  = 3,3,3,6,6\r  \n\rD<sub>1</sub>,D<sub>2</sub>,D<sub>3</sub>,D<sub>4</sub>,D<sub>5</sub>
-  = 6,6,3,3,3\r  \n  \n  \n\rIn how many ways can twenty 12-sided dice (sides numbered
-  1 to 12) be rolled so that the top ten sum to 70?\n\n"
+  can be rolled so that the top three sum to 15. Some examples are:  \n  \nD<sub>1</sub>,D<sub>2</sub>,D<sub>3</sub>,D<sub>4</sub>,D<sub>5</sub>
+  = 4,3,6,3,5  \nD<sub>1</sub>,D<sub>2</sub>,D<sub>3</sub>,D<sub>4</sub>,D<sub>5</sub>
+  = 4,3,3,5,6  \nD<sub>1</sub>,D<sub>2</sub>,D<sub>3</sub>,D<sub>4</sub>,D<sub>5</sub>
+  = 3,3,3,6,6  \nD<sub>1</sub>,D<sub>2</sub>,D<sub>3</sub>,D<sub>4</sub>,D<sub>5</sub>
+  = 6,6,3,3,3  \n  \nIn how many ways can twenty 12-sided dice (sides numbered 1 to
+  12) be rolled so that the top ten sum to 70?\n\n"

data/data/problems/241.yml

@@ -1,14 +1,11 @@
 ---
 :id: 241
 :name: Perfection Quotients
-:url: http://projecteuler.net/problem=241
+:url: https://projecteuler.net/problem=241
 :content: "For a positive integer <var>n</var>, let σ(<var>n</var>) be the sum of
   all divisors of <var>n</var>, so e.g. σ(6) = 1 + 2 + 3 + 6 = 12.\n\nA perfect number,
   as you probably know, is a number with σ(<var>n</var>) = 2<var>n</var>.\n\n| Let
   us define the **perfection quotient** of a positive integer as | <var>p</var>(<var>n</var>)
-  | =  | \nσ(<var>n</var>)  \n ![]({{ images_dir }}/blackdot.gif)  \n<var>n</var>\n
-  | . |\n\n<!--\r\n<p>Let us define the <b>perfection quotient</b> of a positive integer
-  as <var>p</var>(<var>n</var>) = <font \"size=4\"> <sup>&sigma;(<var>n</var>)</sup>&frasl;<sub><var>n</var></sub></font>.</p>\r\n-->\n\nFind
-  the sum of all positive integers <var>n</var> ![≤]({{ images_dir }}/symbol_le.gif)
-  10<sup>18</sup> for which <var>p</var>(<var>n</var>) has the form <var>k</var> +
-  <sup>1</sup>⁄<sub>2</sub>, where <var>k</var> is an integer.\n\n"
+  | =&nbsp; | \nσ(<var>n</var>)  \n<var>n</var>\n | . |\n\nFind the sum of all positive
+  integers <var>n</var> ≤ 10<sup>18</sup> for which <var>p</var>(<var>n</var>) has
+  the form <var>k</var> + <sup>1</sup>⁄<sub>2</sub>, where <var>k</var> is an integer.\n\n"

data/data/problems/242.yml

@@ -1,14 +1,13 @@
 ---
 :id: 242
 :name: Odd Triplets
-:url: http://projecteuler.net/problem=242
+:url: https://projecteuler.net/problem=242
 :content: "Given the set {1,2,...,<var>n</var>}, we define <var>f</var>(<var>n</var>,<var>k</var>)
   as the number of its <var>k</var>-element subsets with an odd sum of elements. For
   example, <var>f</var>(5,3) = 4, since the set {1,2,3,4,5} has four 3-element subsets
   having an odd sum of elements, i.e.: {1,2,4}, {1,3,5}, {2,3,4} and {2,4,5}.\n\nWhen
   all three values <var>n</var>, <var>k</var> and <var>f</var>(<var>n</var>,<var>k</var>)
-  are odd, we say that they make   \n\ran _odd-triplet_ [<var>n</var>,<var>k</var>,<var>f</var>(<var>n</var>,<var>k</var>)].\n\nThere
-  are exactly five odd-triplets with <var>n</var>  ![≤]({{ images_dir }}/symbol_le.gif) 10,
-  namely:  \n\r[1,1,<var>f</var>(1,1) = 1], [5,1,<var>f</var>(5,1) = 3], [5,5,<var>f</var>(5,5) = 1],
-  [9,1,<var>f</var>(9,1) = 5] and [9,9,<var>f</var>(9,9) = 1].\n\nHow many odd-triplets
-  are there with <var>n</var>  ![≤]({{ images_dir }}/symbol_le.gif) 10<sup>12</sup> ?\n\n"
+  are odd, we say that they make   \nan _odd-triplet_ [<var>n</var>,<var>k</var>,<var>f</var>(<var>n</var>,<var>k</var>)].\n\nThere
+  are exactly five odd-triplets with <var>n</var> ≤ 10, namely:  \n[1,1,<var>f</var>(1,1) = 1],
+  [5,1,<var>f</var>(5,1) = 3], [5,5,<var>f</var>(5,5) = 1], [9,1,<var>f</var>(9,1) = 5]
+  and [9,9,<var>f</var>(9,9) = 1].\n\nHow many odd-triplets are there with <var>n</var> ≤ 10<sup>12</sup> ?\n\n"

data/data/problems/243.yml

@@ -1,18 +1,18 @@
 ---
 :id: 243
 :name: Resilience
-:url: http://projecteuler.net/problem=243
+:url: https://projecteuler.net/problem=243
 :content: "A positive fraction whose numerator is less than its denominator is called
-  a proper fraction.  \n\rFor any denominator, <var>d</var>, there will be <var>d</var>
-  ![−]({{ images_dir }}/symbol_minus.gif)1 proper fractions; for example, with <var>d</var> = 12:
-  \ \n<sup>1</sup>/<sub>12</sub> , <sup>2</sup>/<sub>12</sub> , <sup>3</sup>/<sub>12</sub>
-  , <sup>4</sup>/<sub>12</sub> , <sup>5</sup>/<sub>12</sub> , <sup>6</sup>/<sub>12</sub>
-  , <sup>7</sup>/<sub>12</sub> , <sup>8</sup>/<sub>12</sub> , <sup>9</sup>/<sub>12</sub>
-  , <sup>10</sup>/<sub>12</sub> , <sup>11</sup>/<sub>12</sub> .\n\nWe shall call a
-  fraction that cannot be cancelled down a _resilient fraction_.  \n\rFurthermore
-  we shall define the _resilience_ of a denominator, <var>R</var>(<var>d</var>), to
-  be the ratio of its proper fractions that are resilient; for example, <var>R</var>(12)
-  = <sup>4</sup>/<sub>11</sub> .  \n\rIn fact, <var>d</var> = 12 is the smallest denominator
-  having a resilience <var>R</var>(<var>d</var>) 4/<sub>10</sub> .\n\nFind the smallest
-  denominator <var>d</var>, having a resilience <var>R</var>(<var>d</var>) 15499/<sub>94744</sub>
+  a proper fraction.  \nFor any denominator, <var>d</var>, there will be <var>d</var>−1
+  proper fractions; for example, with <var>d</var> = 12:  \n<sup>1</sup>/<sub>12</sub>
+  , <sup>2</sup>/<sub>12</sub> , <sup>3</sup>/<sub>12</sub> , <sup>4</sup>/<sub>12</sub>
+  , <sup>5</sup>/<sub>12</sub> , <sup>6</sup>/<sub>12</sub> , <sup>7</sup>/<sub>12</sub>
+  , <sup>8</sup>/<sub>12</sub> , <sup>9</sup>/<sub>12</sub> , <sup>10</sup>/<sub>12</sub>
+  , <sup>11</sup>/<sub>12</sub> .\n\nWe shall call a fraction that cannot be cancelled
+  down a _resilient fraction_.  \nFurthermore we shall define the _resilience_ of
+  a denominator, <var>R</var>(<var>d</var>), to be the ratio of its proper fractions
+  that are resilient; for example, <var>R</var>(12) = <sup>4</sup>/<sub>11</sub> .
+  \ \nIn fact, <var>d</var> = 12 is the smallest denominator having a resilience <var>R</var>(<var>d</var>)
+  \\< <sup>4</sup>/<sub>10</sub> .\n\nFind the smallest denominator <var>d</var>,
+  having a resilience <var>R</var>(<var>d</var>) \\< <sup>15499</sup>/<sub>94744</sub>
   .\n\n"

data/data/problems/244.yml

@@ -1,22 +1,22 @@
 ---
 :id: 244
 :name: Sliders
-:url: http://projecteuler.net/problem=244
+:url: https://projecteuler.net/problem=244
 :content: "You probably know the game _Fifteen Puzzle_. Here, instead of numbered
   tiles, we have seven red tiles and eight blue tiles.\n\nA move is denoted by the
   uppercase initial of the direction (Left, Right, Up, Down) in which the tile is
   slid, e.g. starting from configuration ( **S** ), by the sequence **LULUR** we reach
-  the configuration ( **E** ):\n\n| ( **S** ) | ![]({{ images_dir }}/p_244_start.gif)
-  | , ( **E** ) | ![]({{ images_dir }}/p_244_example.gif) |\n\nFor each path, its
-  checksum is calculated by (pseudocode):\n\n\rchecksum = 0  \n\rchecksum = (checksum
-  ![×]({{ images_dir }}/symbol_times.gif) 243 + <var>m</var><sub>1</sub>) mod 100 000 007
-  \ \n\rchecksum = (checksum ![×]({{ images_dir }}/symbol_times.gif) 243 + <var>m</var><sub>2</sub>)
-  mod 100 000 007  \n\r   …  \n\rchecksum = (checksum ![×]({{ images_dir }}/symbol_times.gif)
-  243 + <var>m</var><sub><var>n</var></sub>) mod 100 000 007  \n\n\rwhere <var>m</var><sub><var>k</var></sub>
-  is the ASCII value of the <var>k</var><sup><var>th</var></sup> letter in the move
-  sequence and the ASCII values for the moves are:\r\r\n\n| **L** | 76 |\n| **R**
-  | 82 |\n| **U** | 85 |\n| **D** | 68 |\n\nFor the sequence **LULUR** given above,
-  the checksum would be 19761398.\n\nNow, starting from configuration ( **S** ),\rfind
-  all shortest ways to reach configuration ( **T** ).\n\n| ( **S** ) | ![]({{ images_dir
-  }}/p_244_start.gif) | , ( **T** ) | ![]({{ images_dir }}/p_244_target.gif) |\n\nWhat
-  is the sum of all checksums for the paths having the minimal length?\n\n"
+  the configuration ( **E** ):\n\n| ( **S** ) | ![p244_start.gif]({{ images_dir }}/p244_start.gif)
+  | ,&nbsp;( **E** ) | ![p244_example.gif]({{ images_dir }}/p244_example.gif) |\n\nFor
+  each path, its checksum is calculated by (pseudocode):\n\nchecksum = 0  \nchecksum
+  = (checksum × 243 + <var>m</var><sub>1</sub>) mod 100 000 007  \nchecksum = (checksum
+  × 243 + <var>m</var><sub>2</sub>) mod 100 000 007  \n&nbsp;&nbsp;&nbsp;…  \nchecksum
+  = (checksum × 243 + <var>m</var><sub><var>n</var></sub>) mod 100 000 007  \n\nwhere
+  <var>m</var><sub><var>k</var></sub> is the ASCII value of the <var>k</var><sup><var>th</var></sup>
+  letter in the move sequence and the ASCII values for the moves are:\n\n| **L** |
+  76 |\n| **R** | 82 |\n| **U** | 85 |\n| **D** | 68 |\n\nFor the sequence **LULUR**
+  given above, the checksum would be 19761398.\n\nNow, starting from configuration
+  ( **S** ), find all shortest ways to reach configuration ( **T** ).\n\n| ( **S**
+  ) | ![p244_start.gif]({{ images_dir }}/p244_start.gif) | ,&nbsp;( **T** ) | ![p244_target.gif]({{
+  images_dir }}/p244_target.gif) |\n\nWhat is the sum of all checksums for the paths
+  having the minimal length?\n\n"

data/data/problems/245.yml

@@ -1,27 +1,15 @@
 ---
 :id: 245
 :name: Coresilience
-:url: http://projecteuler.net/problem=245
+:url: https://projecteuler.net/problem=245
 :content: "We shall call a fraction that cannot be cancelled down a resilient fraction.
   \ \n Furthermore we shall define the resilience of a denominator, <var>R</var>(<var>d</var>),
   to be the ratio of its proper fractions that are resilient; for example, <var>R</var>(12)
-  = <sup>4</sup>⁄<sub>11</sub>.\n\n| The resilience of a number <var>d</var> ![>]({{
-  images_dir }}/symbol_gt.gif) 1 is then | \nφ(<var>d</var>)  \n ![]({{ images_dir
-  }}/blackdot.gif)  \n<var>d</var> - 1\n | , where φ is Euler's totient function.
-  |\n\n| We further define the **coresilience** of a number <var>n</var> ![>]({{ images_dir
-  }}/symbol_gt.gif) 1 as <var>C</var>(<var>n</var>) | =  | \n<var>n</var> - φ(<var>n</var>)
-  \ \n ![]({{ images_dir }}/blackdot.gif)  \n<var>n</var> - 1\n | . |\n\n| The coresilience
-  of a prime <var>p</var> is <var>C</var>(<var>p</var>) | =  | \n1  \n ![]({{ images_dir
-  }}/blackdot.gif)  \n<var>p</var> - 1\n | . |\n\n<!--\r\n<p>The resilience of a number
-  <var>d</var> <img src='images/symbol_gt.gif' width='10' height='10' alt='&gt;' border='0'
-  style='vertical-align:middle;' /> 1 is then <font \"size=4\"><sup>&phi;(<var>d</var>)</sup>&frasl;<sub>(<var>d</var>-1)</sub></font>,
-  where &phi; is Euler's totient function.</p>\r\n\r\n\r\n<p>We further define the
-  <b>coresilience</b> of a number <var>n</var> <img src='images/symbol_gt.gif' width='10'
-  height='10' alt='&gt;' border='0' style='vertical-align:middle;' /> 1 as <var>C</var>(<var>n</var>)
-  = <font \"size=4\"><sup>(<var>n</var> - &phi;(<var>n</var>))</sup>&frasl;<sub>(<var>n</var>
-  - 1)</sub></font>.\r\n</p>\r\n\r\n\r\n<p>The coresilience of a prime <var>p</var>
-  is <var>C</var>(<var>p</var>) = <font \"size=4\"><sup>1</sup>&frasl;<sub>(<var>p</var>
-  - 1)</sub></font>.</p>\r\n-->\n\nFind the sum of all **composite** integers 1 ![<]({{
-  images_dir }}/symbol_lt.gif) <var>n</var> ![≤]({{ images_dir }}/symbol_le.gif) 2
-  ![×]({{ images_dir }}/symbol_times.gif)10<sup>11</sup>, for which <var>C</var>(<var>n</var>)
+  = <sup>4</sup>⁄<sub>11</sub>.\n\n| The resilience of a number <var>d</var> \\> 1
+  is then | \nφ(<var>d</var>)  \n<var>d</var> − 1\n | , where φ is Euler's totient
+  function. |\n\n| We further define the **coresilience** of a number <var>n</var>
+  \\> 1 as <var>C</var>(<var>n</var>) | =&nbsp; | \n<var>n</var> − φ(<var>n</var>)
+  \ \n<var>n</var> − 1\n | . |\n\n| The coresilience of a prime <var>p</var> is <var>C</var>(<var>p</var>)
+  | =&nbsp; | \n1  \n<var>p</var> − 1\n | . |\n\nFind the sum of all **composite**
+  integers 1 \\< <var>n</var> ≤ 2×10<sup>11</sup>, for which <var>C</var>(<var>n</var>)
   is a <dfn title=\"A fraction with numerator 1\">unit fraction</dfn>.\n\n"

data/data/problems/246.yml

@@ -1,15 +1,14 @@
 ---
 :id: 246
 :name: Tangents to an ellipse
-:url: http://projecteuler.net/problem=246
-:content: "A definition for an ellipse is:  \n\rGiven a circle c with centre M and
-  radius r and a point G such that d(G,M) ![<]({{ images_dir }}/symbol_lt.gif)r, the
-  locus of the points that are equidistant from c and G form an ellipse.\n\n\rThe
-  construction of the points of the ellipse is shown below.\r\r\n ![]({{ images_dir
-  }}/p_246_anim.gif)\n\nGiven are the points M(-2000,1500) and G(8000,1500).  \n \rGiven
-  is also the circle c with centre M and radius 15000.  \n\rThe locus of the points
-  that are equidistant from G and c form an ellipse e.  \n\rFrom a point P outside
-  e the two tangents t<sub>1</sub> and t<sub>2</sub> to the ellipse are drawn.  \n\rLet
-  the points where t<sub>1</sub> and t<sub>2</sub> touch the ellipse be R and S.\n\n
-  ![]({{ images_dir }}/p_246_ellipse.gif)\n\nFor how many lattice points P is angle
-  RPS greater than 45 degrees?\n\n"
+:url: https://projecteuler.net/problem=246
+:content: "A definition for an ellipse is:  \nGiven a circle c with centre M and radius
+  r and a point G such that d(G,M)\\<r, the locus of the points that are equidistant
+  from c and G form an ellipse.\n\nThe construction of the points of the ellipse is
+  shown below.\n ![]({{ images_dir }}/p246_anim.gif)\n\nGiven are the points M(-2000,1500)
+  and G(8000,1500).  \n Given is also the circle c with centre M and radius 15000.
+  \ \nThe locus of the points that are equidistant from G and c form an ellipse e.
+  \ \nFrom a point P outside e the two tangents t<sub>1</sub> and t<sub>2</sub> to
+  the ellipse are drawn.  \nLet the points where t<sub>1</sub> and t<sub>2</sub> touch
+  the ellipse be R and S.\n\n ![]({{ images_dir }}/p246_ellipse.gif)\n\nFor how many
+  lattice points P is angle RPS greater than 45 degrees?\n\n"

data/data/problems/247.yml

@@ -1,17 +1,16 @@
 ---
 :id: 247
 :name: Squares under a hyperbola
-:url: http://projecteuler.net/problem=247
-:content: "Consider the region constrained by 1 ![≤]({{ images_dir }}/symbol_le.gif)
-  <var>x</var> and 0 ![≤]({{ images_dir }}/symbol_le.gif) <var>y</var> ![≤]({{ images_dir
-  }}/symbol_le.gif) <sup>1</sup>/<sub><var>x</var></sub>.\n\nLet S<sub>1</sub> be
-  the largest square that can fit under the curve.  \n\rLet S<sub>2</sub> be the largest
-  square that fits in the remaining area, and so on.   \n\rLet the _index_ of S<sub><var>n</var></sub>
+:url: https://projecteuler.net/problem=247
+:content: "Consider the region constrained by 1 ≤ <var>x</var> and 0 ≤ <var>y</var>
+  ≤ <sup>1</sup>/<sub><var>x</var></sub>.\n\nLet S<sub>1</sub> be the largest square
+  that can fit under the curve.  \nLet S<sub>2</sub> be the largest square that fits
+  in the remaining area, and so on.   \nLet the _index_ of S<sub><var>n</var></sub>
   be the pair (left, below) indicating the number of squares to the left of S<sub><var>n</var></sub>
   and the number of squares below S<sub><var>n</var></sub>.\n\n ![]({{ images_dir
-  }}/p_247_hypersquares.gif)\n\nThe diagram shows some such squares labelled by number.
-  \  \n\rS<sub>2</sub> has one square to its left and none below, so the index of
-  S<sub>2</sub> is (1,0).  \n\rIt can be seen that the index of S<sub>32</sub> is
-  (1,1) as is the index of S<sub>50</sub>.   \n\r50 is the largest <var>n</var> for
-  which the index of S<sub><var>n</var></sub> is (1,1).\n\nWhat is the largest <var>n</var>
-  for which the index of S<sub><var>n</var></sub> is (3,3)?\n\n"
+  }}/p247_hypersquares.gif)\n\nThe diagram shows some such squares labelled by number.
+  \  \nS<sub>2</sub> has one square to its left and none below, so the index of S<sub>2</sub>
+  is (1,0).  \nIt can be seen that the index of S<sub>32</sub> is (1,1) as is the
+  index of S<sub>50</sub>.   \n50 is the largest <var>n</var> for which the index
+  of S<sub><var>n</var></sub> is (1,1).\n\nWhat is the largest <var>n</var> for which
+  the index of S<sub><var>n</var></sub> is (3,3)?\n\n"

data/data/problems/248.yml

@@ -1,7 +1,7 @@
 ---
 :id: 248
 :name: Numbers for which Euler’s totient function equals 13!
-:url: http://projecteuler.net/problem=248
+:url: https://projecteuler.net/problem=248
 :content: |+
   The first number n for which φ(n)=13! is 6227180929.
 

data/data/problems/249.yml

@@ -1,7 +1,7 @@
 ---
 :id: 249
 :name: Prime Subset Sums
-:url: http://projecteuler.net/problem=249
+:url: https://projecteuler.net/problem=249
 :content: "Let <var>S</var> = {2, 3, 5, ..., 4999} be the set of prime numbers less
   than 5000.\n\nFind the number of subsets of <var>S</var>, the sum of whose elements
-  is a prime number.  \n\rEnter the rightmost 16 digits as your answer.\n\n"
+  is a prime number.  \nEnter the rightmost 16 digits as your answer.\n\n"

data/data/problems/25.yml

@@ -1,16 +1,12 @@
 ---
 :id: 25
 :name: 1000-digit Fibonacci number
-:url: http://projecteuler.net/problem=25
+:url: https://projecteuler.net/problem=25
 :content: "The Fibonacci sequence is defined by the recurrence relation:\n\n> F<sub><i>n</i></sub>
-  = F<sub><i>n</i><img src=\"%7B%7B%20images_dir%20%7D%7D/symbol_minus.gif\" width=\"9\"
-  height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">1</sub> + F<sub><i>n</i><img
-  src=\"%7B%7B%20images_dir%20%7D%7D/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\"
-  border=\"0\" style=\"vertical-align:middle;\">2</sub>, where F<sub>1</sub> = 1 and
-  F<sub>2</sub> = 1.\n\nHence the first 12 terms will be:\n\n> F<sub>1</sub> = 1  \n>
-  \rF<sub>2</sub> = 1  \n> \rF<sub>3</sub> = 2  \n> \rF<sub>4</sub> = 3  \n> \rF<sub>5</sub>
-  = 5  \n> \rF<sub>6</sub> = 8  \n> \rF<sub>7</sub> = 13  \n> \rF<sub>8</sub> = 21
-  \ \n> \rF<sub>9</sub> = 34  \n> \rF<sub>10</sub> = 55  \n> \rF<sub>11</sub> = 89
-  \ \n> \rF<sub>12</sub> = 144\n\nThe 12th term, F<sub>12</sub>, is the first term
-  to contain three digits.\n\nWhat is the first term in the Fibonacci sequence to
-  contain 1000 digits?\n\n"
+  = F<sub><i>n</i>−1</sub> + F<sub><i>n</i>−2</sub>, where F<sub>1</sub> = 1 and F<sub>2</sub>
+  = 1.\n\nHence the first 12 terms will be:\n\n> F<sub>1</sub> = 1  \n> F<sub>2</sub>
+  = 1  \n> F<sub>3</sub> = 2  \n> F<sub>4</sub> = 3  \n> F<sub>5</sub> = 5  \n> F<sub>6</sub>
+  = 8  \n> F<sub>7</sub> = 13  \n> F<sub>8</sub> = 21  \n> F<sub>9</sub> = 34  \n>
+  F<sub>10</sub> = 55  \n> F<sub>11</sub> = 89  \n> F<sub>12</sub> = 144\n\nThe 12th
+  term, F<sub>12</sub>, is the first term to contain three digits.\n\nWhat is the
+  index of the first term in the Fibonacci sequence to contain 1000 digits?\n\n"