euler-manager 0.1.1 → 0.2.0

data/data/problems/1.yml

@@ -1,7 +1,7 @@
 ---
 :id: 1
 :name: Multiples of 3 and 5
-:url: http://projecteuler.net/problem=1
+:url: https://projecteuler.net/problem=1
 :content: |+
   If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.
 

data/data/problems/10.yml

@@ -1,7 +1,9 @@
 ---
 :id: 10
 :name: Summation of primes
-:url: http://projecteuler.net/problem=10
-:content: "The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.\n\nFind the sum of
-  all the primes below two million.\n\n<!--\r\n<p class=\"note\">Note: This problem
-  has been changed recently, please check that you are using the right parameters.</p>\r\n-->\n"
+:url: https://projecteuler.net/problem=10
+:content: |+
+  The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.
+
+  Find the sum of all the primes below two million.
+

data/data/problems/100.yml

@@ -1,9 +1,9 @@
 ---
 :id: 100
 :name: Arranged probability
-:url: http://projecteuler.net/problem=100
+:url: https://projecteuler.net/problem=100
 :content: |+
-  If a box contains twenty-one coloured discs, composed of fifteen blue discs and six red discs, and two discs were taken at random, it can be seen that the probability of taking two blue discs, P(BB) = (15/21) ![×]({{ images_dir }}/symbol_times.gif)(14/20) = 1/2.
+  If a box contains twenty-one coloured discs, composed of fifteen blue discs and six red discs, and two discs were taken at random, it can be seen that the probability of taking two blue discs, P(BB) = (15/21)×(14/20) = 1/2.
 
   The next such arrangement, for which there is exactly 50% chance of taking two blue discs at random, is a box containing eighty-five blue discs and thirty-five red discs.
 

data/data/problems/101.yml

@@ -1,7 +1,7 @@
 ---
 :id: 101
 :name: Optimum polynomial
-:url: http://projecteuler.net/problem=101
+:url: https://projecteuler.net/problem=101
 :content: "If we are presented with the first <var>k</var> terms of a sequence it
   is impossible to say with certainty the value of the next term, as there are infinitely
   many polynomial functions that can model the sequence.\n\nAs an example, let us
@@ -14,23 +14,19 @@
   should be assumed.\n\nWe shall define OP(<var>k</var>, <var>n</var>) to be the <var>n</var><sup>th</sup>
   term of the optimum polynomial generating function for the first <var>k</var> terms
   of a sequence. It should be clear that OP(<var>k</var>, <var>n</var>) will accurately
-  generate the terms of the sequence for <var>n</var> ![≤]({{ images_dir }}/symbol_le.gif)
-  <var>k</var>, and potentially the _first incorrect term_ (FIT) will be OP(<var>k</var>,
-  <var>k</var>+1); in which case we shall call it a _bad OP_ (BOP).\n\nAs a basis,
-  if we were only given the first term of sequence, it would be most sensible to assume
-  constancy; that is, for <var>n</var> ![≥]({{ images_dir }}/symbol_ge.gif) 2, OP(1,
-  <var>n</var>) = <var>u</var><sub>1</sub>.\n\nHence we obtain the following OPs for
-  the cubic sequence:\n\n| OP(1, <var>n</var>) = 1 | 1, **1** , 1, 1, ... |\n| OP(2,
-  <var>n</var>) = 7<var>n</var> ![−]({{ images_dir }}/symbol_minus.gif)6 | 1, 8, **15**
-  , ... |\n| OP(3, <var>n</var>) = 6<var>n</var><sup>2</sup> ![−]({{ images_dir }}/symbol_minus.gif)11<var>n</var>+6     
+  generate the terms of the sequence for <var>n</var> ≤ <var>k</var>, and potentially
+  the _first incorrect term_ (FIT) will be OP(<var>k</var>, <var>k</var>+1); in which
+  case we shall call it a _bad OP_ (BOP).\n\nAs a basis, if we were only given the
+  first term of sequence, it would be most sensible to assume constancy; that is,
+  for <var>n</var> ≥ 2, OP(1, <var>n</var>) = <var>u</var><sub>1</sub>.\n\nHence we
+  obtain the following OPs for the cubic sequence:\n\n| OP(1, <var>n</var>) = 1 |
+  1, **1** , 1, 1, ... |\n| OP(2, <var>n</var>) = 7<var>n</var>−6 | 1, 8, **15** ,
+  ... |\n| OP(3, <var>n</var>) = 6<var>n</var><sup>2</sup>−11<var>n</var>+6&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;
   | 1, 8, 27, **58** , ... |\n| OP(4, <var>n</var>) = <var>n</var><sup>3</sup> | 1,
-  8, 27, 64, 125, ... |\n\nClearly no BOPs exist for <var>k</var> ![≥]({{ images_dir
-  }}/symbol_ge.gif) 4.\n\nBy considering the sum of FITs generated by the BOPs (indicated
-  in **red** above), we obtain 1 + 15 + 58 = 74.\n\nConsider the following tenth degree
-  polynomial generating function:\n\n<var>u</var><sub><var>n</var></sub> = 1 ![−]({{
-  images_dir }}/symbol_minus.gif) <var>n</var> + <var>n</var><sup>2</sup> ![−]({{
-  images_dir }}/symbol_minus.gif) <var>n</var><sup>3</sup> + <var>n</var><sup>4</sup>
-  ![−]({{ images_dir }}/symbol_minus.gif) <var>n</var><sup>5</sup> + <var>n</var><sup>6</sup>
-  ![−]({{ images_dir }}/symbol_minus.gif) <var>n</var><sup>7</sup> + <var>n</var><sup>8</sup>
-  ![−]({{ images_dir }}/symbol_minus.gif) <var>n</var><sup>9</sup> + <var>n</var><sup>10</sup>\n\nFind
+  8, 27, 64, 125, ... |\n\nClearly no BOPs exist for <var>k</var> ≥ 4.\n\nBy considering
+  the sum of FITs generated by the BOPs (indicated in **red** above), we obtain 1
+  + 15 + 58 = 74.\n\nConsider the following tenth degree polynomial generating function:\n\n<var>u</var><sub><var>n</var></sub>
+  = 1 − <var>n</var> + <var>n</var><sup>2</sup> − <var>n</var><sup>3</sup> + <var>n</var><sup>4</sup>
+  − <var>n</var><sup>5</sup> + <var>n</var><sup>6</sup> − <var>n</var><sup>7</sup>
+  + <var>n</var><sup>8</sup> − <var>n</var><sup>9</sup> + <var>n</var><sup>10</sup>\n\nFind
   the sum of FITs for the BOPs.\n\n"

data/data/problems/102.yml

@@ -1,14 +1,13 @@
 ---
 :id: 102
 :name: Triangle containment
-:url: http://projecteuler.net/problem=102
+:url: https://projecteuler.net/problem=102
 :content: "Three distinct points are plotted at random on a Cartesian plane, for which
-  -1000 ![≤]({{ images_dir }}/symbol_le.gif) _x_, _y_ ![≤]({{ images_dir }}/symbol_le.gif)
-  1000, such that a triangle is formed.\n\nConsider the following two triangles:\n\nA(-340,495),
-  B(-153,-910), C(835,-947)  \n  \n  \nX(-175,41), Y(-421,-714), Z(574,-645)\n\nIt
-  can be verified that triangle ABC contains the origin, whereas triangle XYZ does
-  not.\n\nUsing [triangles.txt](project/triangles.txt) (right click and 'Save Link/Target
-  As...'), a 27K text file containing the co-ordinates of one thousand \"random\"
-  triangles, find the number of triangles for which the interior contains the origin.\n\nNOTE:
-  The first two examples in the file represent the triangles in the example given
-  above.\n\n"
+  -1000 ≤ _x_, _y_ ≤ 1000, such that a triangle is formed.\n\nConsider the following
+  two triangles:\n\nA(-340,495), B(-153,-910), C(835,-947)  \n  \nX(-175,41), Y(-421,-714),
+  Z(574,-645)\n\nIt can be verified that triangle ABC contains the origin, whereas
+  triangle XYZ does not.\n\nUsing [triangles.txt](project/resources/p102_triangles.txt)
+  (right click and 'Save Link/Target As...'), a 27K text file containing the co-ordinates
+  of one thousand \"random\" triangles, find the number of triangles for which the
+  interior contains the origin.\n\nNOTE: The first two examples in the file represent
+  the triangles in the example given above.\n\n"

data/data/problems/103.yml

@@ -1,16 +1,15 @@
 ---
 :id: 103
 :name: 'Special subset sums: optimum'
-:url: http://projecteuler.net/problem=103
+:url: https://projecteuler.net/problem=103
 :content: "Let S(A) represent the sum of elements in set A of size _n_. We shall call
   it a special sum set if for any two non-empty disjoint subsets, B and C, the following
-  properties are true:\n\n1. S(B) ![≠]({{ images_dir }}/symbol_ne.gif) S(C); that
-  is, sums of subsets cannot be equal.\n2. If B contains more elements than C then
-  S(B) ![>]({{ images_dir }}/symbol_gt.gif) S(C).\n\nIf S(A) is minimised for a given
-  _n_, we shall call it an optimum special sum set. The first five optimum special
-  sum sets are given below.\n\n_n_ = 1: {1}  \n_n_ = 2: {1, 2}  \n_n_ = 3: {2, 3,
-  4}  \n_n_ = 4: {3, 5, 6, 7}  \n_n_ = 5: {6, 9, 11, 12, 13}\n\nIt _seems_ that for
-  a given optimum set, A = {_a_<sub>1</sub>, _a_<sub>2</sub>, ... , _a_<sub>n</sub>},
+  properties are true:\n\n1. S(B) ≠ S(C); that is, sums of subsets cannot be equal.\n2.
+  If B contains more elements than C then S(B) \\> S(C).\n\nIf S(A) is minimised for
+  a given _n_, we shall call it an optimum special sum set. The first five optimum
+  special sum sets are given below.\n\n_n_ = 1: {1}  \n_n_ = 2: {1, 2}  \n_n_ = 3:
+  {2, 3, 4}  \n_n_ = 4: {3, 5, 6, 7}  \n_n_ = 5: {6, 9, 11, 12, 13}\n\nIt _seems_
+  that for a given optimum set, A = {_a_<sub>1</sub>, _a_<sub>2</sub>, ... , _a_<sub>n</sub>},
   the next optimum set is of the form B = {_b_, _a_<sub>1</sub>+_b_, _a_<sub>2</sub>+_b_,
   ... ,_a_<sub>n</sub>+_b_}, where _b_ is the \"middle\" element on the previous row.\n\nBy
   applying this \"rule\" we would expect the optimum set for _n_ = 6 to be A = {11,