euler-manager 0.0.5 → 0.0.6

data/data/problems/438.yml

@@ -1,29 +0,0 @@
----
-:id: 438
-:name: Integer part of polynomial equation's solutions
-:url: http://projecteuler.net/problem=438
-:content: "\r\n<p>\r\nFor an <var>n</var>-tuple of integers <var>t</var> = (<var>a</var><sub>1</sub>,
-  ..., <var>a</var><sub><var>n</var></sub>), let (<var>x</var><sub>1</sub>, ..., <var>x</var><sub><var>n</var></sub>)
-  be the solutions of the polynomial equation <var>x</var><sup><var>n</var></sup>
-  + <var>a</var><sub>1</sub><var>x</var><sup><var>n</var>-1</sup> + <var>a</var><sub>2</sub><var>x</var><sup><var>n</var>-2</sup>
-  + ... + <var>a</var><sub><var>n</var>-1</sub><var>x</var> + <var>a</var><sub><var>n</var></sub>
-  = 0.\r\n</p>\r\n<p>\r\nConsider the following two conditions:\r\n</p>\n<ul>\n<li>\n<var>x</var><sub>1</sub>,
-  ..., <var>x</var><sub><var>n</var></sub> are all real.\r\n</li>\n<li>If <var>x</var><sub>1</sub>,
-  ..., <var>x</var><sub><var>n</var></sub> are sorted, <img src=\"images/symbol_lfloor.gif\"
-  width=\"6\" height=\"16\" alt=\"⌊\" border=\"0\" style=\"vertical-align:middle;\"><var>x</var><sub><var>i</var></sub><img
-  src=\"images/symbol_rfloor.gif\" width=\"6\" height=\"16\" alt=\"⌋\" border=\"0\"
-  style=\"vertical-align:middle;\"> = <var>i</var> for 1 <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>i</var>
-  <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>n</var>. (<img src=\"images/symbol_lfloor.gif\"
-  width=\"6\" height=\"16\" alt=\"⌊\" border=\"0\" style=\"vertical-align:middle;\">·<img
-  src=\"images/symbol_rfloor.gif\" width=\"6\" height=\"16\" alt=\"⌋\" border=\"0\"
-  style=\"vertical-align:middle;\">: floor function.)\r\n</li>\n</ul>\n<p>\r\nIn the
-  case of <var>n</var> = 4, there are 12 <var>n</var>-tuples of integers which satisfy
-  both conditions.<br>\r\nWe define S(<var>t</var>) as the sum of the absolute values
-  of the integers in <var>t</var>.<br>\r\nFor <var>n</var> = 4 we can verify that
-  <img src=\"images/symbol_sum.gif\" width=\"11\" height=\"14\" alt=\"∑\" border=\"0\"
-  style=\"vertical-align:middle;\">S(<var>t</var>) = 2087 for all <var>n</var>-tuples
-  <var>t</var> which satisfy both conditions.\r\n</p>\r\n<p>\r\nFind <img src=\"images/symbol_sum.gif\"
-  width=\"11\" height=\"14\" alt=\"∑\" border=\"0\" style=\"vertical-align:middle;\">S(<var>t</var>)
-  for <var>n</var> = 7.\r\n</p>\r\n"

data/data/problems/439.yml

@@ -1,17 +0,0 @@
----
-:id: 439
-:name: Sum of sum of divisors
-:url: http://projecteuler.net/problem=439
-:content: "\r\n<p>Let <var>d</var>(<var>k</var>) be the sum of all divisors of <var>k</var>.<br>\r\nWe
-  define the function S(<var>N</var>) = <img src=\"images/symbol_sum.gif\" width=\"11\"
-  height=\"14\" alt=\"∑\" border=\"0\" style=\"vertical-align:middle;\"><sub>1<img
-  src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>i</var><img
-  src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>N</var></sub><img
-  src=\"images/symbol_sum.gif\" width=\"11\" height=\"14\" alt=\"∑\" border=\"0\"
-  style=\"vertical-align:middle;\"><sub>1<img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>j</var><img
-  src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>N</var></sub><var>d</var>(<var>i</var>·<var>j</var>).<br>\r\nFor
-  example, S(3) = <var>d</var>(1) + <var>d</var>(2) + <var>d</var>(3) + <var>d</var>(2)
-  + <var>d</var>(4) + <var>d</var>(6) + <var>d</var>(3) + <var>d</var>(6) + <var>d</var>(9)
-  = 59.</p>\r\n\r\n<p>You are given that S(10<sup>3</sup>) = 563576517282 and S(10<sup>5</sup>)
-  mod 10<sup>9</sup> = 215766508.<br>\r\nFind S(10<sup>11</sup>) mod 10<sup>9</sup>.</p>\r\n\r\n"

data/data/problems/440.yml

@@ -1,21 +0,0 @@
----
-:id: 440
-:name: GCD and Tiling
-:url: http://projecteuler.net/problem=440
-:content: "\r\n<p>We want to tile a board of length <var>n</var> and height 1 completely,
-  with either 1 <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\"
-  border=\"0\" style=\"vertical-align:middle;\"> 2 blocks or 1 <img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">
-  1 blocks with a single decimal digit on top:</p>\r\n\r\n<img src=\"project/images/p440_tiles.png\"><p>For
-  example, here are some of the ways to tile a board of length <var>n</var> = 8:</p>\r\n\r\n<img
-  src=\"project/images/p440_some8.png\"><p>Let T(<var>n</var>) be the number of ways
-  to tile a board of length <var>n</var> as described above.</p>\r\n\r\n<p>For example,
-  T(1) = 10 and T(2) = 101.</p>\r\n\r\n<p>Let S(<var>L</var>) be the triple sum <img
-  src=\"images/symbol_sum.gif\" width=\"11\" height=\"14\" alt=\"∑\" border=\"0\"
-  style=\"vertical-align:middle;\"><sub><var>a</var>,<var>b</var>,<var>c</var></sub>
-  gcd(T(<var>c</var><sup><var>a</var></sup>), T(<var>c</var><sup><var>b</var></sup>))
-  for 1 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>a</var>, <var>b</var>, <var>c</var> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>L</var>.<br>\r\nFor
-  example:<br>\r\nS(2) = 10444<br>\r\nS(3) = 1292115238446807016106539989<br>\r\nS(4)
-  mod 987 898 789 = 670616280.</p>\r\n\r\n<p>Find S(2000) mod 987 898 789.</p>\r\n"

data/data/problems/441.yml

@@ -1,23 +0,0 @@
----
-:id: 441
-:name: The inverse summation of coprime couples
-:url: http://projecteuler.net/problem=441
-:content: "\r\n<p>\r\nFor an integer <var>M</var>, we define R(<var>M</var>) as the
-  sum of 1/(<var>p</var>·<var>q</var>) for all the integer pairs <var>p</var> and
-  <var>q</var> which satisfy all of these conditions:\r\n</p>\r\n<ul>\n<li> 1 <img
-  src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>p</var>
-  <img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>q</var> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>M</var>\n</li>\r\n<li>
-  <var>p</var> + <var>q</var> <img src=\"images/symbol_ge.gif\" width=\"10\" height=\"12\"
-  alt=\"≥\" border=\"0\" style=\"vertical-align:middle;\"><var>M</var>\n</li>\r\n<li>
-  <var>p</var> and <var>q</var> are coprime.</li>\r\n</ul>\n<p>\r\nWe also define
-  S(<var>N</var>) as the sum of R(<var>i</var>) for 2 <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>i</var>
-  <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>N</var>.<br>\r\nWe can verify that S(2) =
-  R(2) = 1/2, S(10) <img src=\"images/symbol_asymp.gif\" width=\"11\" height=\"9\"
-  alt=\"≈\" border=\"0\" style=\"vertical-align:middle;\"> 6.9147 and S(100) <img
-  src=\"images/symbol_asymp.gif\" width=\"11\" height=\"9\" alt=\"≈\" border=\"0\"
-  style=\"vertical-align:middle;\"> 58.2962.\r\n</p>\r\n<p>\r\nFind S(10<sup>7</sup>).
-  Give your answer rounded to four decimal places.\r\n</p>\r\n"

data/data/problems/442.yml

@@ -1,9 +0,0 @@
----
-:id: 442
-:name: Eleven-free integers
-:url: http://projecteuler.net/problem=442
-:content: "\r\n<p>An integer is called <i>eleven-free</i> if its decimal expansion
-  does not contain any substring representing a power of 11 except 1.</p>\r\n\r\n<p>For
-  example, 2404 and 13431 are eleven-free, while 911 and 4121331 are not.</p>\r\n\r\n<p>Let
-  E(<i>n</i>) be the <i>n</i>th positive eleven-free integer. For example, E(3) =
-  3, E(200) = 213 and E(500 000) = 531563.</p>\r\n\r\n<p>Find E(10<sup>18</sup>).</p>\r\n\r\n"

data/data/problems/443.yml

@@ -1,13 +0,0 @@
----
-:id: 443
-:name: GCD sequence
-:url: http://projecteuler.net/problem=443
-:content: "\r\n<p>Let g(<var>n</var>) be a sequence defined as follows:<br>\r\ng(4)
-  = 13,<br>\r\ng(<var>n</var>) = g(<var>n</var>-1) + gcd(<var>n</var>, g(<var>n</var>-1))
-  for <var>n</var> <img src=\"images/symbol_gt.gif\" width=\"10\" height=\"10\" alt=\"&gt;\"
-  border=\"0\" style=\"vertical-align:middle;\"> 4.</p>\r\n\r\n<p>The first few values
-  are:</p>\r\n<div align=\"center\">\r\n    <table cellspacing=\"1\" cellpadding=\"5\"
-  border=\"0\" align=\"center\">\n<tr>\n<td><var>n</var></td>\n<td>4</td>\n<td>5</td>\n<td>6</td>\n<td>7</td>\n<td>8</td>\n<td>9</td>\n<td>10</td>\n<td>11</td>\n<td>12</td>\n<td>13</td>\n<td>14</td>\n<td>15</td>\n<td>16</td>\n<td>17</td>\n<td>18</td>\n<td>19</td>\n<td>20</td>\n<td>...</td>\r\n
-  \   </tr>\n<tr>\n<td>g(<var>n</var>)</td>\n<td>13</td>\n<td>14</td>\n<td>16</td>\n<td>17</td>\n<td>18</td>\n<td>27</td>\n<td>28</td>\n<td>29</td>\n<td>30</td>\n<td>31</td>\n<td>32</td>\n<td>33</td>\n<td>34</td>\n<td>51</td>\n<td>54</td>\n<td>55</td>\n<td>60</td>\n<td>...</td>\r\n
-  \   </tr>\n</table>\n</div>\r\n\r\n<p>You are given that g(1 000) = 2524 and g(1 000 000)
-  = 2624152.</p>\r\n\r\n<p>Find g(10<sup>15</sup>).</p>\r\n"

data/data/problems/444.yml

@@ -1,28 +0,0 @@
----
-:id: 444
-:name: The Roundtable Lottery
-:url: http://projecteuler.net/problem=444
-:content: "\r\n<p>A group of <var>p</var> people decide to sit down at a round table
-  and play a lottery-ticket trading game. Each person starts off with a randomly-assigned,
-  unscratched lottery ticket. Each ticket, when scratched, reveals a whole-pound prize
-  ranging anywhere from £1 to £<var>p</var>, with no two tickets alike. The goal of
-  the game is for each person to maximize his ticket winnings upon leaving the game.</p>\r\n\r\n<p>An
-  arbitrary person is chosen to be the first player. Going around the table, each
-  player has only one of two options:</p>\r\n\r\n<p>1. The player can scratch his
-  ticket and reveal its worth to everyone at the table.<br>\r\n2. The player can trade
-  his unscratched ticket for a previous player's scratched ticket, and then leave
-  the game with that ticket. The previous player then scratches his newly-acquired
-  ticket and reveals its worth to everyone at the table.</p>\r\n\r\n<p>The game ends
-  once all tickets have been scratched. All players still remaining at the table must
-  leave with their currently-held tickets.</p>\r\n\r\n<p>Assume that each player uses
-  the optimal strategy for maximizing the expected value of his ticket winnings. </p>\r\n\r\n<p>Let
-  E(<var>p</var>) represent the expected number of players left at the table when
-  the game ends in a game consisting of <var>p</var> players (e.g. E(111) = 5.2912
-  when rounded to 5 significant digits).</p>\r\n\r\n<p>Let S<sub>1</sub>(<var>N</var>)
-  = <img style=\"vertical-align:middle\" src=\"project/images/p444_sum.png\"> E(<var>p</var>)<br>\r\nLet
-  S<sub><var>k</var></sub>(<var>N</var>) = <img style=\"vertical-align:middle\" src=\"project/images/p444_sum.png\">
-  S<sub><var>k</var>-1</sub>(<var>p</var>) for <var>k</var> <img src=\"images/symbol_gt.gif\"
-  width=\"10\" height=\"10\" alt=\"&gt;\" border=\"0\" style=\"vertical-align:middle;\">
-  1</p>\r\n\r\n<p>Find S<sub>20</sub>(10<sup>14</sup>) and write the answer in scientific
-  notation rounded to 10 significant digits. Use a lowercase e to separate mantissa
-  and exponent (e.g. S<sub>3</sub>(100) = 5.983679014e5).</p>\r\n\r\n"

data/data/problems/445.yml

@@ -1,37 +0,0 @@
----
-:id: 445
-:name: Retractions A
-:url: http://projecteuler.net/problem=445
-:content: "\r\n<p>\r\nFor every integer n<img src=\"images/symbol_gt.gif\" width=\"10\"
-  height=\"10\" alt=\"&gt;\" border=\"0\" style=\"vertical-align:middle;\">1, the
-  family of functions f<sub>n,a,b</sub>  is defined \r\nby f<sub>n,a,b</sub>(<var>x</var>)<img
-  src=\"images/symbol_cong.gif\" width=\"9\" height=\"11\" alt=\"≡\" border=\"0\"
-  style=\"vertical-align:middle;\">a<var>x</var>+b mod n for a,b,<var>x</var> integer
-  and  0<img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\"
-  border=\"0\" style=\"vertical-align:middle;\">a<img src=\"images/symbol_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\">n,
-  0<img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\">b<img src=\"images/symbol_lt.gif\" width=\"10\"
-  height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\">n, 0<img
-  src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>x</var><img
-  src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\"
-  style=\"vertical-align:middle;\">n.<br>\r\nWe will call f<sub>n,a,b</sub> a <i>retraction</i>
-  if f<sub>n,a,b</sub>(f<sub>n,a,b</sub>(<var>x</var>))<img src=\"images/symbol_cong.gif\"
-  width=\"9\" height=\"11\" alt=\"≡\" border=\"0\" style=\"vertical-align:middle;\">f<sub>n,a,b</sub>(<var>x</var>)
-  mod n for every 0<img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\"
-  border=\"0\" style=\"vertical-align:middle;\"><var>x</var><img src=\"images/symbol_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\">n.<br>\r\nLet
-  R(n) be the number of retractions for n.\r\n</p>\r\n<p>\r\nYou are given that<br><img
-  src=\"images/symbol_sum.gif\" width=\"11\" height=\"14\" alt=\"∑\" border=\"0\"
-  style=\"vertical-align:middle;\"> R(c) for c=C(100 000,k), and 1 <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  k <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\">99 999 <img src=\"images/symbol_cong.gif\" width=\"9\"
-  height=\"11\" alt=\"≡\" border=\"0\" style=\"vertical-align:middle;\">628701600
-  (mod 1 000 000 007).<br>\r\n(C(n,k) is the binomial coefficient).<br></p>\r\n<p>
-  \r\nFind <img src=\"images/symbol_sum.gif\" width=\"11\" height=\"14\" alt=\"∑\"
-  border=\"0\" style=\"vertical-align:middle;\"> R(c) for c=C(10 000 000,k), and 1
-  <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\">k<img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> 9 999 999.<br>\r\nGive
-  your answer modulo 1 000 000 007.\r\n</p>\r\n\r\n"

data/data/problems/446.yml

@@ -1,29 +0,0 @@
----
-:id: 446
-:name: Retractions B
-:url: http://projecteuler.net/problem=446
-:content: "\r\n<p>\r\nFor every integer n<img src=\"images/symbol_gt.gif\" width=\"10\"
-  height=\"10\" alt=\"&gt;\" border=\"0\" style=\"vertical-align:middle;\">1, the
-  family of functions f<sub>n,a,b</sub>  is defined \r\nby f<sub>n,a,b</sub>(<var>x</var>)<img
-  src=\"images/symbol_cong.gif\" width=\"9\" height=\"11\" alt=\"≡\" border=\"0\"
-  style=\"vertical-align:middle;\">a<var>x</var>+b mod n for a,b,<var>x</var> integer
-  and  0<img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\"
-  border=\"0\" style=\"vertical-align:middle;\">a<img src=\"images/symbol_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\">n,
-  0<img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\">b<img src=\"images/symbol_lt.gif\" width=\"10\"
-  height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\">n, 0<img
-  src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>x</var><img
-  src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\"
-  style=\"vertical-align:middle;\">n.<br>\r\nWe will call f<sub>n,a,b</sub> a <i>retraction</i>
-  if f<sub>n,a,b</sub>(f<sub>n,a,b</sub>(<var>x</var>))<img src=\"images/symbol_cong.gif\"
-  width=\"9\" height=\"11\" alt=\"≡\" border=\"0\" style=\"vertical-align:middle;\">f<sub>n,a,b</sub>(<var>x</var>)
-  mod n for every 0<img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\"
-  border=\"0\" style=\"vertical-align:middle;\"><var>x</var><img src=\"images/symbol_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\">n.<br>\r\nLet
-  R(n) be the number of retractions for n.\r\n</p>\r\n<p>\r\nF(N)=<img src=\"images/symbol_sum.gif\"
-  width=\"11\" height=\"14\" alt=\"∑\" border=\"0\" style=\"vertical-align:middle;\">R(n<sup>4</sup>+4)
-  for 1<img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\">n<img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">N. <br> \r\nF(1024)=77532377300600.<br></p>\r\n<p>\r\nFind
-  F(10<sup>7</sup>) (mod 1 000 000 007)\r\n\r\n</p>"

data/data/problems/447.yml

@@ -1,31 +0,0 @@
----
-:id: 447
-:name: Retractions C
-:url: http://projecteuler.net/problem=447
-:content: "\r\n<p>\r\nFor every integer n<img src=\"images/symbol_gt.gif\" width=\"10\"
-  height=\"10\" alt=\"&gt;\" border=\"0\" style=\"vertical-align:middle;\">1, the
-  family of functions f<sub>n,a,b</sub>  is defined \r\nby f<sub>n,a,b</sub>(<var>x</var>)<img
-  src=\"images/symbol_cong.gif\" width=\"9\" height=\"11\" alt=\"≡\" border=\"0\"
-  style=\"vertical-align:middle;\">a<var>x</var>+b mod n for a,b,<var>x</var> integer
-  and  0<img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\"
-  border=\"0\" style=\"vertical-align:middle;\">a<img src=\"images/symbol_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\">n,
-  0<img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\">b<img src=\"images/symbol_lt.gif\" width=\"10\"
-  height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\">n, 0<img
-  src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>x</var><img
-  src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\"
-  style=\"vertical-align:middle;\">n.<br>\r\nWe will call f<sub>n,a,b</sub> a <i>retraction</i>
-  if f<sub>n,a,b</sub>(f<sub>n,a,b</sub>(<var>x</var>))<img src=\"images/symbol_cong.gif\"
-  width=\"9\" height=\"11\" alt=\"≡\" border=\"0\" style=\"vertical-align:middle;\">f<sub>n,a,b</sub>(<var>x</var>)
-  mod n for every 0<img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\"
-  border=\"0\" style=\"vertical-align:middle;\"><var>x</var><img src=\"images/symbol_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\">n.<br>\r\nLet
-  R(n) be the number of retractions for n.\r\n</p>\r\n<p>\r\nF(N)=<img src=\"images/symbol_sum.gif\"
-  width=\"11\" height=\"14\" alt=\"∑\" border=\"0\" style=\"vertical-align:middle;\">R(n)
-  for 2<img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\">n<img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">N.<br>\r\nF(10<sup>7</sup>)<img
-  src=\"images/symbol_cong.gif\" width=\"9\" height=\"11\" alt=\"≡\" border=\"0\"
-  style=\"vertical-align:middle;\">638042271 (mod 1 000 000 007).\r\n</p>\r\n<p> \r\nFind
-  F(10<sup>14</sup>) (mod 1 000 000 007).\r\n</p>\r\n\r\n\r\n"

data/data/problems/448.yml

@@ -1,14 +0,0 @@
----
-:id: 448
-:name: Average least common multiple
-:url: http://projecteuler.net/problem=448
-:content: "\r\n<p>\r\nThe function <b>lcm</b>(a,b) denotes the least common multiple
-  of a and b.<br>\r\nLet A(n) be the average of the values of lcm(n,i) for 1<img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">i<img
-  src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">n.<br>\r\nE.g:
-  A(2)=(2+2)/2=2 and A(10)=(10+10+30+20+10+30+70+40+90+10)/10=32. \r\n</p>\r\nLet
-  S(n)=<img src=\"images/symbol_sum.gif\" width=\"11\" height=\"14\" alt=\"∑\" border=\"0\"
-  style=\"vertical-align:middle;\">A(k) for 1<img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">k<img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">n.<br>\r\nS(100)=122726.\r\n\r\n<p>\r\nFind
-  S(99999999019) mod 999999017.\r\n</p>\r\n"

data/data/problems/449.yml

@@ -1,17 +0,0 @@
----
-:id: 449
-:name: Chocolate covered candy
-:url: http://projecteuler.net/problem=449
-:content: "\r\n<p>Phil the confectioner is making a new batch of chocolate covered
-  candy. Each candy centre is shaped like an ellipsoid of revolution defined by the
-  equation: b<sup>2</sup><var>x</var><sup>2</sup> + b<sup>2</sup><var>y</var><sup>2</sup>
-  + a<sup>2</sup><var>z</var><sup>2</sup> = a<sup>2</sup>b<sup>2</sup>.\r\n</p>\r\n<p>\r\nPhil
-  wants to know how much chocolate is needed to cover one candy centre with a uniform
-  coat of chocolate one millimeter thick.\r\n</p>\n<table class=\"formula\"><tr>\n<td>If
-  a=1 mm and b=1 mm, the amount of chocolate required is \r\n    </td>\r\n    <td><table
-  class=\"frac\">\n<tr><td>28</td></tr>\n<tr><td class=\"overline\">3</td></tr>\n</table></td>\r\n
-  \   <td>π mm<sup>3</sup>\n</td>\r\n</tr></table>\r\nIf a=2 mm and b=1 mm, the amount
-  of chocolate required is approximately 60.35475635 mm<sup>3</sup>.\r\n\r\n<p>\r\nFind
-  the amount of chocolate in mm<sup>3</sup> required if a=3 mm and b=1 mm. Give your
-  answer as the number rounded to 8 decimal places behind the decimal point.</p>\r\n
-  \r\n"

data/data/problems/450.yml

@@ -1,26 +0,0 @@
----
-:id: 450
-:name: Hypocycloid and Lattice points
-:url: http://projecteuler.net/problem=450
-:content: "\r\n<p>\r\nA hypocycloid is the curve drawn by a point on a small circle
-  rolling inside a larger circle. The parametric equations of a hypocycloid centered
-  at the origin, and starting at the right most point is given by:</p>\n<p style=\"text-align:center\">\r\n$x(t)
-  = (R - r) \\cos(t) + r \\cos(\\frac {R - r} r t)$<br>\r\n$y(t) = (R - r) \\sin(t)
-  - r \\sin(\\frac {R - r} r t)$</p>\n<p>\r\nWhere <var>R</var> is the radius of the
-  large circle and <var>r</var> the radius of the small circle.\r\n</p>\r\n<p>\r\nLet
-  $C(R, r)$ be the set of distinct points with integer coordinates on the hypocycloid
-  with radius <var>R</var> and <var>r</var> and for which there is a corresponding
-  value of <var>t</var> such that $\\sin(t)$ and $\\cos(t)$ are rational numbers.</p>\r\n<p>\r\nLet
-  $S(R, r) = \\sum_{(x,y) \\in C(R, r)} |x| + |y|$ be the sum of the absolute values
-  of the <var>x</var> and <var>y</var> coordinates of the points in $C(R, r)$.</p>\r\n<p>\r\n\r\nLet
-  $T(N) = \\sum_{R = 3}^N \\sum_{r=1}^{\\lfloor \\frac {R - 1} 2 \\rfloor} S(R, r)$
-  be the sum of $S(R, r)$ for <var>R</var> and <var>r</var> positive integers, $R\\leq
-  N$  and $2r \r\n</p>\n<p>\r\n\r\nYou are given:<br><var>C</var>(3, 1) = {(3, 0),
-  (-1, 2), (-1,0), (-1,-2)}<br><br><var>C</var>(2500, 1000) =<br></p>\n<ul>\r\n {(2500,
-  0), (772, 2376), (772, -2376), (516, 1792),\r\n (516, -1792), (500, 0), (68, 504),
-  (68, -504),<br>(-1356, 1088), (-1356, -1088), (-1500, 1000), (-1500, -1000)}</ul>\n<i>Note:
-  (-625, 0) is not an element of C(2500, 1000) because $\\sin(t)$ is not a rational
-  number for the corresponding values of <var>t</var>.</i>\r\n\r\n<p>\r\n<var>S</var>(3,
-  1) = (|3| + |0|) + (|-1| + |2|) + (|-1| + |0|) + (|-1| + |-2|) = 10</p>\r\n<p>\r\n<var>T</var>(3)
-  = 10; <var>T</var>(10) = 524 ;<var>T</var>(100) = 580442; <var>T</var>(10<sup>3</sup>)
-  = 583108600.\r\n</p>\r\n<p>\r\nFind <var>T</var>(10<sup>6</sup>).\r\n</p>\r\n\r\n\r\n"

data/data/problems/451.yml

@@ -1,15 +0,0 @@
----
-:id: 451
-:name: Modular inverses
-:url: http://projecteuler.net/problem=451
-:content: "\r\n<p>\r\nConsider the number 15.<br>\r\nThere are eight positive numbers
-  less than 15 which are coprime to 15: 1, 2, 4, 7, 8, 11, 13, 14.<br>\r\nThe modular
-  inverses of these numbers modulo 15 are: 1, 8, 4, 13, 2, 11, 7, 14<br>  \r\nbecause<br>\r\n1*1
-  mod 15=1<br>\r\n2*8=16 mod 15=1<br>\r\n4*4=16 mod 15=1<br>\r\n7*13=91 mod 15=1<br>\r\n11*11=121
-  mod 15=1<br>\r\n14*14=196 mod 15=1<br></p>\r\n<p>\r\nLet I(n) be the largest positive
-  number m smaller than n-1 such that the modular inverse of m modulo n equals m itself.<br>\r\nSo
-  I(15)=11.<br>\r\nAlso I(100)=51 and I(7)=1.<br></p>\r\n<p>\r\nFind <img src=\"images/symbol_sum.gif\"
-  width=\"11\" height=\"14\" alt=\"∑\" border=\"0\" style=\"vertical-align:middle;\">I(n)
-  for 3<img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\">n<img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">2·10<sup>7</sup></p>"

data/data/problems/452.yml

@@ -1,8 +0,0 @@
----
-:id: 452
-:name: Long Products
-:url: http://projecteuler.net/problem=452
-:content: "\r\n<p>Define F(<var>m</var>,<var>n</var>) as the number of <var>n</var>-tuples
-  of positive integers for which the product of the elements doesn't exceed <var>m</var>.</p>\r\n<p>F(10,
-  10) = 571.</p>\r\n<p>F(10<sup>6</sup>, 10<sup>6</sup>) mod 1 234 567 891 = 252903833.</p>\r\n<p>Find
-  F(10<sup>9</sup>, 10<sup>9</sup>) mod 1 234 567 891.</p>\r\n\r\n"

data/data/problems/453.yml

@@ -1,16 +0,0 @@
----
-:id: 453
-:name: Lattice Quadrilaterals
-:url: http://projecteuler.net/problem=453
-:content: "\r\n<p>A <b>simple quadrilateral</b> is a polygon that has four distinct
-  vertices, has no straight angles and does not self-intersect.</p>\r\n\r\n<p>Let
-  Q(m, n) be the number of simple quadrilaterals whose vertices are lattice points
-  with coordinates (x,y) satisfying 0 <img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> x <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  m and 0 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"> y <img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> n.</p>\r\n\r\n<p>For
-  example, Q(2, 2) = 94 as can be seen below:</p>\r\n<p align=\"center\"><img src=\"project/images/p453_quad.png\"></p>\r\n<p>It
-  can also be verified that Q(3, 7) = 39590, Q(12, 3) = 309000 and Q(123, 45) = 70542215894646.</p>\r\n\r\n<p>Find
-  Q(12345, 6789) mod 135707531.</p>\r\n"

data/data/problems/454.yml

@@ -1,17 +0,0 @@
----
-:id: 454
-:name: Diophantine reciprocals III
-:url: http://projecteuler.net/problem=454
-:content: "\r\n<p>In the following equation <var>x</var>, <var>y</var>, and <var>n</var>
-  are positive integers.</p>\r\n<div style=\"text-align:center;\">\r\n<table align=\"center\"><tr>\n<td><div
-  style=\"text-align:center;\">1<br><img src=\"images/blackdot.gif\" width=\"15\"
-  height=\"1\" alt=\"\"><br><var>x</var>\n</div></td>\r\n<td> + </td>\r\n<td><div
-  style=\"text-align:center;\">1<br><img src=\"images/blackdot.gif\" width=\"15\"
-  height=\"1\" alt=\"\"><br><var>y</var>\n</div></td>\r\n<td> = </td>\r\n<td><div
-  style=\"text-align:center;\">1<br><img src=\"images/blackdot.gif\" width=\"15\"
-  height=\"1\" alt=\"\"><br><var>n</var>\n</div></td>\r\n</tr></table>\n</div>\r\n<p>For
-  a limit <var>L</var> we define F(<var>L</var>) as the number of solutions which
-  satisfy <var>x</var> <img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\"
-  alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\"><var>y</var> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>L</var>.</p>\r\n\r\n<p>We
-  can verify that F(15) = 4 and F(1000) = 1069.<br>\r\nFind F(10<sup>12</sup>).</p>\r\n"

data/data/problems/455.yml

@@ -1,16 +0,0 @@
----
-:id: 455
-:name: Powers With Trailing Digits
-:url: http://projecteuler.net/problem=455
-:content: "\r\n<p>Let f(n) be the largest positive integer x less than 10<sup>9</sup>
-  such that the last 9 digits of n<sup>x</sup> form the number <i>x</i> (including
-  leading zeros), or zero if no such integer exists.</p>\r\n\r\n<p>For example:</p>\r\n\r\n<ul>\n<li>f(4)
-  = 411728896 (4<sup>411728896</sup> = ...490<u>411728896</u>) </li>\r\n<li>f(10)
-  = 0</li>\r\n<li>f(157) = 743757 (157<sup>743757</sup> = ...567<u>000743757</u>)</li>\r\n<li>Σf(n),
-  2 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"> n <img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> 10<sup>3</sup>
-  = 442530011399</li>\r\n</ul>\n<p>Find Σf(n), 2 <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  n <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"> 10<sup>6</sup>.</p>\r\n\r\n"

data/data/problems/456.yml

@@ -1,15 +0,0 @@
----
-:id: 456
-:name: Triangles containing the origin II
-:url: http://projecteuler.net/problem=456
-:content: "\r\n<p>Define:<br><var>x</var><sub><var>n</var></sub> = (1248<sup><var>n</var></sup>
-  mod 32323) - 16161<br><var>y</var><sub><var>n</var></sub> = (8421<sup><var>n</var></sup>
-  mod 30103) - 15051<br>\r\nP<sub><var>n</var></sub> = {(<var>x</var><sub>1</sub>,
-  <var>y</var><sub>1</sub>), (<var>x</var><sub>2</sub>, <var>y</var><sub>2</sub>),
-  ..., (<var>x</var><sub><var>n</var></sub>, <var>y</var><sub><var>n</var></sub>)}\r\n</p>\r\n\r\n<p>For
-  example, P<sub>8</sub> = {(-14913, -6630), (-10161, 5625), (5226, 11896), (8340,
-  -10778), (15852, -5203), (-15165, 11295), (-1427, -14495), (12407, 1060)}.</p>\r\n\r\n<p>Let
-  C(<var>n</var>) be the number of triangles whose vertices are in P<sub><var>n</var></sub>
-  which contain the origin in the interior.</p>\r\n\r\n<p>\r\nExamples:<br>\r\nC(8)
-  = 20<br>\r\nC(600) = 8950634<br>\r\nC(40 000) = 2666610948988\r\n</p>\r\n\r\n<p>Find
-  C(2 000 000).\r\n\r\n</p>"

data/scripts/update_problems

@@ -1,68 +0,0 @@
-#!/usr/bin/env ruby
-
-# Gets all of the problems from projecteuler.net and serializes them as json
-# into the data/problems directory.  This way http requests do not need to be
-# each time the manager is asked to describe a problem.
-
-$LOAD_PATH << File.join(File.dirname(__FILE__), '..', 'lib')
-
-require 'colorize'
-require 'nokogiri'
-require 'open-uri'
-require 'yaml'
-
-require 'euler'
-
-# Number of seconds to wait in the beginning of each iteration of the http request loop
-sleep_time = 0.5
-
-puts
-puts 'Updating project Euler problem specs.'
-puts
-
-data_dir     = "#{__dir__}/../data"
-answers_file = "#{data_dir}/answers.yml"
-problems_dir = "#{data_dir}/problems"
-
-puts 'Data directory:     '.light_black + data_dir.underline
-puts 'Answers File:       '.light_black + answers_file.underline
-puts 'Problems Directory: '.light_black + problems_dir.underline
-puts
-
-problem_ids           = YAML.load_file(answers_file).keys
-problems_count        = problem_ids.count
-problems_count_digits = problems_count.to_s.size
-
-puts problems_count.to_s.underline + ' Problems will be updated.'
-puts
-
-# Fetch problems from projecteuler.net
-problems = problem_ids.map.with_index do |problem_id, index|
-  zero_padded_index      = (index + 1).to_s.rjust(problems_count_digits, '0')
-  zero_padded_problem_id =  problem_id.to_s.rjust(problems_count_digits, '0')
-
-  print "(#{zero_padded_index} / #{problems_count}) ##{zero_padded_index}"
-
-  sleep(sleep_time)
-
-  url = "http://projecteuler.net/problem=#{problem_id}"
-
-  doc     = Nokogiri::HTML(open(url))
-  problem = Euler::Problem.new({
-    id:       problem_id,
-    name:     doc.css('h2').first.inner_html,
-    url:      url,
-    content:  doc.css('.problem_content').first.inner_html
-  })
-
-  print " : " + problem.name.bold.underline
-
-  File.open("#{problems_dir}/#{problem.id}.yml", 'w') do |f|
-    f.write(problem.to_yaml)
-  end
-
-  print " \u2713".encode('utf-8').green.bold
-  puts
-
-  problem
-end