euler-manager 0.0.1

data/data/problems/422.yml

@@ -0,0 +1,22 @@
+---
+:id: 422
+:name: Sequence of points on a hyperbola
+:url: http://projecteuler.net/problem=422
+:content: "\r\n<p>Let H be the hyperbola defined by the equation 12<var>x</var><sup>2</sup>
+  + 7<var>x</var><var>y</var> - 12<var>y</var><sup>2</sup> = 625.</p>\r\n\r\n<p>Next,
+  define X as the point (7, 1). It can be seen that X is in H.</p>\r\n\r\n<p>Now we
+  define a sequence of points in H, {P<sub><var>i</var></sub> : <var>i</var> <img
+  src=\"images/symbol_ge.gif\" width=\"10\" height=\"12\" alt=\"≥\" border=\"0\" style=\"vertical-align:middle;\">
+  1}, as:\r\n</p>\n<ul>\n<li> P<sub>1</sub> = (13, 61/4).\r\n</li>\n<li> P<sub>2</sub>
+  = (-43/6, -4).\r\n</li>\n<li> For <var>i</var> &gt; 2, P<sub><var>i</var></sub>
+  is the unique point in H that is different from P<sub><var>i</var>-1</sub> and such
+  that line P<sub><var>i</var></sub>P<sub><var>i</var>-1</sub> is parallel to line
+  P<sub><var>i</var>-2</sub>X. It can be shown that P<sub><var>i</var></sub> is well-defined,
+  and that its coordinates are always rational.\r\n</li>\n</ul>\n<img src=\"project/images/p422_hyperbola.gif\"><p>You
+  are given that P<sub>3</sub>  = (-19/2, -229/24), P<sub>4</sub> = (1267/144, -37/12)
+  and P<sub>7</sub> = (17194218091/143327232, 274748766781/1719926784).</p>\r\n\r\n<p>Find
+  P<sub><var>n</var></sub> for <var>n</var> = 11<sup>14</sup> in the following format:<br>If
+  P<sub><var>n</var></sub> = (<var>a</var>/<var>b</var>, <var>c</var>/<var>d</var>)
+  where the fractions are in lowest terms and the denominators are positive, then
+  the answer is (<var>a</var> + <var>b</var> + <var>c</var> + <var>d</var>) mod 1 000 000 007.</p>\r\n\r\n<p>For
+  <var>n</var> = 7, the answer would have been: 806236837.</p>\r\n"

data/data/problems/423.yml

@@ -0,0 +1,22 @@
+---
+:id: 423
+:name: Consecutive die throws
+:url: http://projecteuler.net/problem=423
+:content: "\r\n<p>Let <var>n</var> be a positive integer.<br>\r\nA 6-sided die is
+  thrown <var>n</var> times. Let <var>c</var> be the number of pairs of consecutive
+  throws that give the same value.</p>\r\n\r\n<p>For example, if <var>n</var> = 7
+  and the values of the die throws are (1,1,5,6,6,6,3), then the following pairs of
+  consecutive throws give the same value:<br>\r\n(<u>1,1</u>,5,6,6,6,3)<br>\r\n(1,1,5,<u>6,6</u>,6,3)<br>\r\n(1,1,5,6,<u>6,6</u>,3)<br>\r\nTherefore,
+  <var>c</var> = 3 for (1,1,5,6,6,6,3).</p>\r\n\r\n<p>Define C(<var>n</var>) as the
+  number of outcomes of throwing a 6-sided die <var>n</var> times such that <var>c</var>
+  does not exceed π(<var>n</var>).<sup>1</sup><br>\r\nFor example, C(3) = 216, C(4)
+  = 1290, C(11) = 361912500 and C(24) = 4727547363281250000.</p>\r\n\r\n<p>Define
+  S(<var>L</var>) as <img src=\"images/symbol_sum.gif\" width=\"11\" height=\"14\"
+  alt=\"∑\" border=\"0\" style=\"vertical-align:middle;\"> C(<var>n</var>) for 1 <img
+  src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>n</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, S(50) mod 1 000 000 007
+  = 832833871.</p>\r\n\r\n<p>Find S(50 000 000) mod 1 000 000 007.</p>\r\n\r\n<p><sup>1</sup>
+  π denotes the <b>prime-counting function</b>, i.e. π(<var>n</var>) is the number
+  of primes <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\"
+  border=\"0\" style=\"vertical-align:middle;\"><var>n</var>.</p>\r\n"

data/data/problems/424.yml

@@ -0,0 +1,37 @@
+---
+:id: 424
+:name: Kakuro
+:url: http://projecteuler.net/problem=424
+:content: "\r\n<p align=\"center\">\r\n<img src=\"project/images/p_424_kakuro1.gif\"></p>\r\n<p>\r\nThe
+  above is an example of a cryptic kakuro (also known as cross sums, or even sums
+  cross) puzzle, with its final solution on the right. (The common rules of kakuro
+  puzzles can be found easily on numerous internet sites. Other related information
+  can also be currently found at <a href=\"http://krazydad.com/\">krazydad.com</a>
+  whose author has provided the puzzle data for this challenge.)\r\n</p>\n<p>\r\n</p>\n<p>\r\nThe
+  downloadable text file (<a href=\"project/kakuro200.txt\">kakuro200.txt</a>) contains
+  the description of 200 such puzzles, a mix of 5x5 and 6x6 types. The first puzzle
+  in the file is the above example which is coded as follows:\r\n</p>\r\n<p>\r\n6,X,X,(vCC),(vI),X,X,X,(hH),B,O,(vCA),(vJE),X,(hFE,vD),O,O,O,O,(hA),O,I,(hJC,vB),O,O,(hJC),H,O,O,O,X,X,X,(hJE),O,O,X\r\n</p>\r\n<p>\r\nThe
+  first character is a numerical digit indicating the size of the information grid.
+  It would be either a 6 (for a 5x5 kakuro puzzle) or a 7 (for a 6x6 puzzle) followed
+  by a comma (,). The extra top line and left column are needed to insert information.\r\n</p>\r\n<p>\r\nThe
+  content of each cell is then described and followed by a comma, going left to right
+  and starting with the top line.<br>\r\nX = Gray cell, not required to be filled
+  by a digit.<br>\r\nO (upper case letter)= White empty cell to be filled by a digit.<br>\r\nA
+  = Or any one of the upper case letters from A to J to be replaced by its equivalent
+  digit in the solved puzzle.<br>\r\n( ) = Location of the encrypted sums. Horizontal
+  sums are preceded by a lower case \"h\" and vertical sums are preceded by a lower
+  case \"v\". Those are followed by one or two upper case letters depending if the
+  sum is a single digit or double digit one. For double digit sums, the first letter
+  would be for the \"tens\" and the second one for the \"units\". When the cell must
+  contain information for both a horizontal and a vertical sum, the first one is always
+  for the horizontal sum and the two are separated by a comma within the same set
+  of brackets, ex.: (hFE,vD). Each set of brackets is also immediately followed by
+  a comma.\r\n</p>\r\n<p>\r\nThe description of the last cell is followed by a Carriage
+  Return/Line Feed (CRLF) instead of a comma.\r\n</p>\r\n<p>\r\nThe required answer
+  to each puzzle is based on the value of each letter necessary to arrive at the solution
+  and according to the alphabetical order. As indicated under the example puzzle,
+  its answer would be 8426039571. At least 9 out of the 10 encrypting letters are
+  always part of the problem description. When only 9 are given, the missing one must
+  be assigned the remaining digit.\r\n</p>\r\n<p>\r\nYou are given that the sum of
+  the answers for the first 10 puzzles in the file is 64414157580.\r\n</p>\r\n<p>\r\nFind
+  the sum of the answers for the 200 puzzles.\r\n</p>\r\n\r\n\r\n\r\n"

data/data/problems/425.yml

@@ -0,0 +1,16 @@
+---
+:id: 425
+:name: Prime connection
+:url: http://projecteuler.net/problem=425
+:content: "\r\n<p>\r\nTwo positive numbers A and B are said to be <i>connected</i>
+  (denoted by \"A ↔ B\") if one of these conditions holds:<br>\r\n(1) A and B have
+  the same length and differ in exactly one digit; for example, 123 ↔ 173.<br>\r\n(2)
+  Adding one digit to the left of A (or B) makes B (or A); for example, 23 ↔ 223 and
+  123 ↔ 23.\r\n</p>\r\n<p>\r\nWe call a prime P a <i>2's relative</i> if there exists
+  a chain of connected primes between 2 and P and no prime in the chain exceeds P.\r\n</p>\r\n<p>\r\nFor
+  example, 127 is a 2's relative. One of the possible chains is shown below:<br>\r\n2
+  ↔ 3 ↔ 13 ↔ 113 ↔ 103 ↔ 107 ↔ 127<br>\r\nHowever, 11 and 103 are not 2's relatives.\r\n</p>\r\n<p>\r\nLet
+  F(N) be the sum of the primes <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\"
+  alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> N which are not 2's relatives.<br>\r\nWe
+  can verify that F(10<sup>3</sup>) = 431 and F(10<sup>4</sup>) = 78728.\r\n</p>\r\n<p>\r\nFind
+  F(10<sup>7</sup>).\r\n</p>\r\n"

data/data/problems/426.yml

@@ -0,0 +1,29 @@
+---
+:id: 426
+:name: Box-ball system
+:url: http://projecteuler.net/problem=426
+:content: "\r\n<p>\r\nConsider an infinite row of boxes. Some of the boxes contain
+  a ball. For example, an initial configuration of 2 consecutive occupied boxes followed
+  by 2 empty boxes, 2 occupied boxes, 1 empty box, and 2 occupied boxes can be denoted
+  by the sequence (2, 2, 2, 1, 2), in which the number of consecutive occupied and
+  empty boxes appear alternately.\r\n</p>\r\n<p>\r\nA turn consists of moving each
+  ball exactly once according to the following rule: Transfer the leftmost ball which
+  has not been moved to the nearest empty box to its right.\r\n</p>\r\n<p>\r\nAfter
+  one turn the sequence (2, 2, 2, 1, 2) becomes (2, 2, 1, 2, 3) as can be seen below;
+  note that we begin the new sequence starting at the first occupied box.\r\n</p>\r\n\r\n<div
+  align=\"center\">\r\n<img src=\"project/images/p_426_baxball1.gif\">\n</div>\r\n\r\n<p>\r\nA
+  system like this is called a <b>Box-Ball System</b> or <b>BBS</b> for short.\r\n</p>\r\n<p>\r\nIt
+  can be shown that after a sufficient number of turns, the system evolves to a state
+  where the consecutive numbers of occupied boxes is invariant. In the example below,
+  the consecutive numbers of <b>occupied boxes</b> evolves to [1, 2, 3]; we shall
+  call this the final state.\r\n</p>\r\n\r\n<div align=\"center\">\r\n<img src=\"project/images/p_426_baxball2.gif\">\n</div>\r\n\r\n<p>\r\nWe
+  define the sequence {<var>t</var><sub><var>i</var></sub>}:<br></p>\n<ul>\n<li>\n<var>s</var><sub>0</sub>
+  = 290797\r\n</li>\n<li>\n<var>s</var><sub><var>k</var>+1</sub> = <var>s</var><sub><var>k</var></sub><sup>2</sup>
+  mod 50515093\r\n</li>\n<li>\n<var>t</var><sub><var>k</var></sub> = (<var>s</var><sub><var>k</var></sub>
+  mod 64) + 1\r\n</li>\n</ul>\n<p>\r\nStarting from the initial configuration (<var>t</var><sub>0</sub>,
+  <var>t</var><sub>1</sub>, …, <var>t</var><sub>10</sub>), the final state becomes
+  [1, 3, 10, 24, 51, 75].<br>\r\nStarting from the initial configuration (<var>t</var><sub>0</sub>,
+  <var>t</var><sub>1</sub>, …, <var>t</var><sub>10 000 000</sub>), find the final
+  state.<br>\r\nGive as your answer the sum of the squares of the elements of the
+  final state. For example, if the final state is [1, 2, 3] then 14 ( = 1<sup>2</sup>
+  + 2<sup>2</sup> + 3<sup>2</sup>) is your answer.\r\n</p>\r\n"

data/data/problems/427.yml

@@ -0,0 +1,18 @@
+---
+:id: 427
+:name: n-sequences
+:url: http://projecteuler.net/problem=427
+:content: "\r\n<p>A sequence of integers S = {s<sub><var>i</var></sub>} is called
+  an <var>n-sequence</var> if it has <var>n</var> elements and each element s<sub><var>i</var></sub>
+  satisfies 1 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\"
+  border=\"0\" style=\"vertical-align:middle;\"> s<sub><var>i</var></sub><img src=\"images/symbol_le.gif\"
+  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>n</var>.
+  Thus there are <var>n</var><sup><var>n</var></sup> distinct <var>n</var>-sequences
+  in total.\r\nFor example, the sequence S = {1, 5, 5, 10, 7, 7, 7, 2, 3, 7} is a
+  10-sequence.</p>\r\n\r\n<p>For any sequence S, let L(S) be the length of the longest
+  contiguous subsequence of S with the same value.\r\nFor example, for the given sequence
+  S above, L(S) = 3, because of the three consecutive 7's.</p>\r\n\r\n<p>Let <var>f</var>(<var>n</var>)
+  = <img src=\"images/symbol_sum.gif\" width=\"11\" height=\"14\" alt=\"∑\" border=\"0\"
+  style=\"vertical-align:middle;\"> L(S) for all <var>n</var>-sequences S.</p>\r\n\r\n<p>For
+  example, <var>f</var>(3) = 45, <var>f</var>(7) = 1403689 and <var>f</var>(11) =
+  481496895121.</p>\r\n\r\n<p>Find <var>f</var>(7 500 000) mod 1 000 000 009.</p>\r\n\r\n\r\n"

data/data/problems/428.yml

@@ -0,0 +1,32 @@
+---
+:id: 428
+:name: Necklace of circles
+:url: http://projecteuler.net/problem=428
+:content: "\r\n<p>Let <var>a</var>, <var>b</var> and <var>c</var> be positive numbers.<br>\r\nLet
+  W, X, Y, Z be four collinear points where |WX| = <var>a</var>, |XY| = <var>b</var>,
+  |YZ| = <var>c</var> and |WZ| = <var>a</var> + <var>b</var> + <var>c</var>.<br>\r\nLet
+  C<sub>in</sub> be the circle having the diameter XY.<br>\r\nLet C<sub>out</sub>
+  be the circle having the diameter WZ.<br></p>\r\n\r\n<p>\r\nThe triplet (<var>a</var>,
+  <var>b</var>, <var>c</var>) is called a <em>necklace triplet</em> if you can place
+  <var>k</var> <img src=\"images/symbol_ge.gif\" width=\"10\" height=\"12\" alt=\"≥\"
+  border=\"0\" style=\"vertical-align:middle;\"> 3 distinct circles C<sub>1</sub>,
+  C<sub>2</sub>, ..., C<sub><var>k</var></sub> such that:\r\n</p>\n<ul>\n<li>C<sub><var>i</var></sub>
+  has no common interior points with any C<sub><var>j</var></sub> for 1 <img src=\"images/symbol_le.gif\"
+  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>i</var>,
+  <var>j</var> <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\"
+  border=\"0\" style=\"vertical-align:middle;\"><var>k</var> and <var>i</var> <img
+  src=\"images/symbol_ne.gif\" width=\"11\" height=\"10\" alt=\"≠\" border=\"0\" style=\"vertical-align:middle;\"><var>j</var>,\r\n</li>\n<li>C<sub><var>i</var></sub>
+  is tangent to both C<sub>in</sub> and C<sub>out</sub> 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>k</var>,\r\n</li>\n<li>C<sub><var>i</var></sub>
+  is tangent to C<sub><var>i</var>+1</sub> for 1 <img src=\"images/symbol_le.gif\"
+  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>i</var>
+  k, and\r\n</li>\n<li>C<sub><var>k</var></sub> is tangent to C<sub>1</sub>.\r\n</li>\n</ul>\n<p>\r\nFor
+  example, (5, 5, 5) and (4, 3, 21) are necklace triplets, while it can be shown that
+  (2, 2, 5) is not.\r\n</p>\r\n<p align=\"center\"><img src=\"project/images/p428_necklace.png\"></p>\r\n\r\n<p>\r\nLet
+  T(<var>n</var>) be the number of necklace triplets (<var>a</var>, <var>b</var>,
+  <var>c</var>) such that <var>a</var>, <var>b</var> and <var>c</var> are positive
+  integers, and <var>b</var> <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\"
+  alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>n</var>.\r\nFor example,
+  T(1) = 9, T(20) = 732 and T(3000) = 438106.\r\n</p>\r\n<p>\r\nFind T(1 000 000 000).\r\n</p>\r\n"

data/data/problems/429.yml

@@ -0,0 +1,10 @@
+---
+:id: 429
+:name: Sum of squares of unitary divisors
+:url: http://projecteuler.net/problem=429
+:content: "\r\n<p>\r\nA unitary divisor <var>d</var> of a number <var>n</var> is a
+  divisor of <var>n</var> that has the property gcd(<var>d, n/d</var>) = 1.<br>\r\nThe
+  unitary divisors of 4! = 24 are 1, 3, 8 and 24.<br>\r\nThe sum of their squares
+  is 1<sup>2</sup> + 3<sup>2</sup> + 8<sup>2</sup> + 24<sup>2</sup> = 650.\r\n</p>\r\n<p>\r\nLet
+  S(<var>n</var>) represent the sum of the squares of the unitary divisors of <var>n</var>.
+  Thus S(4!)=650.\r\n</p>\r\n<p>\r\nFind S(100 000 000!) modulo 1 000 000 009.\r\n</p>\r\n"

data/data/problems/43.yml

@@ -0,0 +1,17 @@
+---
+:id: 43
+:name: Sub-string divisibility
+:url: http://projecteuler.net/problem=43
+:content: "\r\n<p>The number, 1406357289, is a 0 to 9 pandigital number because it
+  is made up of each of the digits 0 to 9 in some order, but it also has a rather
+  interesting sub-string divisibility property.</p>\r\n<p>Let <i>d</i><sub>1</sub>
+  be the 1<sup>st</sup> digit, <i>d</i><sub>2</sub> be the 2<sup>nd</sup> digit, and
+  so on. In this way, we note the following:</p>\r\n<ul>\n<li>\n<i>d</i><sub>2</sub><i>d</i><sub>3</sub><i>d</i><sub>4</sub>=406
+  is divisible by 2</li>\r\n<li>\n<i>d</i><sub>3</sub><i>d</i><sub>4</sub><i>d</i><sub>5</sub>=063
+  is divisible by 3</li>\r\n<li>\n<i>d</i><sub>4</sub><i>d</i><sub>5</sub><i>d</i><sub>6</sub>=635
+  is divisible by 5</li>\r\n<li>\n<i>d</i><sub>5</sub><i>d</i><sub>6</sub><i>d</i><sub>7</sub>=357
+  is divisible by 7</li>\r\n<li>\n<i>d</i><sub>6</sub><i>d</i><sub>7</sub><i>d</i><sub>8</sub>=572
+  is divisible by 11</li>\r\n<li>\n<i>d</i><sub>7</sub><i>d</i><sub>8</sub><i>d</i><sub>9</sub>=728
+  is divisible by 13</li>\r\n<li>\n<i>d</i><sub>8</sub><i>d</i><sub>9</sub><i>d</i><sub>10</sub>=289
+  is divisible by 17</li>\r\n</ul>\n<p>Find the sum of all 0 to 9 pandigital numbers
+  with this property.</p>\r\n\r\n"

data/data/problems/430.yml

@@ -0,0 +1,20 @@
+---
+:id: 430
+:name: Range flips
+:url: http://projecteuler.net/problem=430
+:content: "\r\n<p><var>N</var> disks are placed in a row, indexed 1 to <var>N</var>
+  from left to right.<br>\r\nEach disk has a black side and white side. Initially
+  all disks show their white side.</p>\r\n\r\n<p>At each turn, two, not necessarily
+  distinct, integers <var>A</var> and <var>B</var> between 1 and <var>N</var> (inclusive)
+  are chosen uniformly at random.<br>\r\nAll disks with an index from <var>A</var>
+  to <var>B</var> (inclusive) are flipped.</p>\r\n\r\n<p>The following example shows
+  the case <var>N</var> = 8. At the first turn <var>A</var> = 5 and <var>B</var> =
+  2, and at the second turn <var>A</var> = 4 and <var>B</var> = 6.</p>\r\n\r\n<p align=\"center\"><img
+  src=\"project/images/p_430_flips.gif\"></p>\r\n\r\n<p>Let E(<var>N</var>, <var>M</var>)
+  be the expected number of disks that show their white side after <var>M</var> turns.<br>\r\nWe
+  can verify that E(3, 1) = 10/9, E(3, 2) = 5/3, E(10, 4) <img src=\"images/symbol_asymp.gif\"
+  width=\"11\" height=\"9\" alt=\"≈\" border=\"0\" style=\"vertical-align:middle;\">
+  5.157 and E(100, 10) <img src=\"images/symbol_asymp.gif\" width=\"11\" height=\"9\"
+  alt=\"≈\" border=\"0\" style=\"vertical-align:middle;\"> 51.893.</p>\r\n\r\n<p>Find
+  E(10<sup>10</sup>, 4000).<br>\r\nGive your answer rounded to 2 decimal places behind
+  the decimal point.</p>\r\n"

data/data/problems/431.yml

@@ -0,0 +1,33 @@
+---
+:id: 431
+:name: Square Space Silo
+:url: http://projecteuler.net/problem=431
+:content: "\r\n<p>Fred the farmer arranges to have a new storage silo installed on
+  his farm and having an obsession for all things square he is absolutely devastated
+  when he discovers that it is circular. Quentin, the representative from the company
+  that installed the silo, explains that they only manufacture cylindrical silos,
+  but he points out that it is resting on a square base. Fred is not amused and insists
+  that it is removed from his property.</p>\r\n\r\n<p>Quick thinking Quentin explains
+  that when granular materials are delivered from above a conical slope is formed
+  and the natural angle made with the horizontal is called the angle of repose. For
+  example if the angle of repose, $\\alpha = 30$ degrees, and grain is delivered at
+  the centre of the silo then a perfect cone will form towards the top of the cylinder.
+  In the case of this silo, which has a diameter of 6m, the amount of space wasted
+  would be approximately 32.648388556 m<sup>3</sup>. However, if grain is delivered
+  at a point on the top which has a horizontal distance of $x$ metres from the centre
+  then a cone with a strangely curved and sloping base is formed. He shows Fred a
+  picture.</p>\r\n\r\n<div style=\"text-align:center;\">\r\n   <img src=\"project/images/p_431_grain_silo.png\">\n</div>\r\n\r\n<p>We
+  shall let the amount of space wasted in cubic metres be given by $V(x)$. If $x =
+  1.114785284$, which happens to have three squared decimal places, then the amount
+  of space wasted, $V(1.114785284) \\approx 36$. Given the range of possible solutions
+  to this problem there is exactly one other option: $V(2.511167869) \\approx 49$.
+  It would be like knowing that the square is king of the silo, sitting in splendid
+  glory on top of your grain.</p>\r\n\r\n<p>Fred's eyes light up with delight at this
+  elegant resolution, but on closer inspection of Quentin's drawings and calculations
+  his happiness turns to despondency once more. Fred points out to Quentin that it's
+  the radius of the silo that is 6 metres, not the diameter, and the angle of repose
+  for his grain is 40 degrees. However, if Quentin can find a set of solutions for
+  this particular silo then he will be more than happy to keep it.</p>\r\n\r\n<p>If
+  Quick thinking Quentin is to satisfy frustratingly fussy Fred the farmer's appetite
+  for all things square then determine the values of $x$ for all possible square space
+  wastage options and calculate $\\sum x$ correct to 9 decimal places.</p>\r\n"

data/data/problems/432.yml

@@ -0,0 +1,13 @@
+---
+:id: 432
+:name: Totient sum
+:url: http://projecteuler.net/problem=432
+:content: "\r\n<p>\r\nLet S(<var>n,m</var>) = <img src=\"images/symbol_sum.gif\" width=\"11\"
+  height=\"14\" alt=\"∑\" border=\"0\" style=\"vertical-align:middle;\">φ(<var>n <img
+  src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
+  style=\"vertical-align:middle;\"> i</var>) for 1 <img src=\"images/symbol_le.gif\"
+  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>i
+  <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
+  style=\"vertical-align:middle;\"> m</var>. (φ is Euler's totient function)<br>\r\nYou
+  are given that S(510510,10<sup>6</sup> )= 45480596821125120. \r\n</p>\r\n<p>\r\nFind
+  S(510510,10<sup>11</sup>).<br>\r\nGive the last 9 digits of your answer.\r\n</p>\r\n\r\n"

data/data/problems/433.yml

@@ -0,0 +1,18 @@
+---
+:id: 433
+:name: Steps in Euclid's algorithm
+:url: http://projecteuler.net/problem=433
+:content: "\r\n<p>\r\nLet E(<var>x</var><sub>0</sub>, <var>y</var><sub>0</sub>) be
+  the number of steps it takes to determine the greatest common divisor of <var>x</var><sub>0</sub>
+  and <var>y</var><sub>0</sub> with <b>Euclid's algorithm</b>. More formally:<br><var>x</var><sub>1</sub>
+  = <var>y</var><sub>0</sub>, <var>y</var><sub>1</sub> = <var>x</var><sub>0</sub>
+  mod <var>y</var><sub>0</sub><br><var>x<sub>n</sub></var> = <var>y</var><sub><var>n</var>-1</sub>,
+  <var>y</var><sub><var>n</var></sub> = <var>x</var><sub><var>n</var>-1</sub> mod
+  <var>y</var><sub><var>n</var>-1</sub><br>\r\nE(<var>x</var><sub>0</sub>, <var>y</var><sub>0</sub>)
+  is the smallest <var>n</var> such that <var>y</var><sub><var>n</var></sub> = 0.\r\n</p>\r\n<p>\r\nWe
+  have E(1,1) = 1, E(10,6) = 3 and E(6,10) = 4.\r\n</p>\r\n<p>\r\nDefine S(N) as the
+  sum of E(<var>x,y</var>) for 1 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\"
+  alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>x,y</var> <img src=\"images/symbol_le.gif\"
+  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
+  N.<br>\r\nWe have S(1) = 1, S(10) = 221 and S(100) = 39826.\r\n</p>\r\n<p>\r\nFind
+  S(5·10<sup>6</sup>).\r\n</p>\r\n\r\n\r\n"

data/data/problems/434.yml

@@ -0,0 +1,32 @@
+---
+:id: 434
+:name: Rigid graphs
+:url: http://projecteuler.net/problem=434
+:content: "\r\n<p>Recall that a graph is a collection of vertices and edges connecting
+  the vertices, and that two vertices connected by an edge are called adjacent.<br>\r\nGraphs
+  can be embedded in Euclidean space by associating each vertex with a point in the
+  Euclidean space.<br>\r\nA <strong>flexible</strong> graph is an embedding of a graph
+  where it is possible to move one or more vertices continuously so that the distance
+  between at least two nonadjacent vertices is altered while the distances between
+  each pair of adjacent vertices is kept constant.<br>\r\nA <strong>rigid</strong>
+  graph is an embedding of a graph which is not flexible.<br>\r\nInformally, a graph
+  is rigid if by replacing the vertices with fully rotating hinges and the edges with
+  rods that are unbending and inelastic, no parts of the graph can be moved independently
+  from the rest of the graph.\r\n</p>\r\n<p>The <strong>grid graphs</strong> embedded
+  in the Euclidean plane are not rigid, as the following animation demonstrates:<br><img
+  src=\"project/images/p434_rigid.gif\"></p>\r\n<p>However, one can make them rigid
+  by adding diagonal edges to the cells. For example, for the 2x3 grid graph, there
+  are 19 ways to make the graph rigid:<br><img src=\"project/images/p434_rigid23.png\"></p>\r\n<p>Note
+  that for the purposes of this problem, we do not consider changing the orientation
+  of a diagonal edge or adding both diagonal edges to a cell as a different way of
+  making a grid graph rigid.\r\n</p>\r\n<p>Let <var>R</var>(<var>m</var>,<var>n</var>)
+  be the number of ways to make the <var>m</var> <img src=\"images/symbol_times.gif\"
+  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"><var>n</var>
+  grid graph rigid. <br>\r\nE.g. <var>R</var>(2,3) = 19 and <var>R</var>(5,5) = 23679901\r\n</p>\r\n<p>Define
+  <var>S</var>(<var>N</var>) as <img src=\"images/symbol_sum.gif\" width=\"11\" height=\"14\"
+  alt=\"∑\" border=\"0\" style=\"vertical-align:middle;\"><var>R</var>(<var>i</var>,<var>j</var>)
+  for 1 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
+  style=\"vertical-align:middle;\"><var>i</var>, <var>j</var> <img src=\"images/symbol_le.gif\"
+  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>N</var>.<br>\r\nE.g.
+  <var>S</var>(5) = 25021721.<br>\r\nFind <var>S</var>(100), give your answer modulo
+  1000000033\r\n</p>\r\n"

data/data/problems/435.yml

@@ -0,0 +1,21 @@
+---
+:id: 435
+:name: Polynomials of Fibonacci numbers
+:url: http://projecteuler.net/problem=435
+:content: "\r\n<p>The <strong>Fibonacci numbers</strong> {f<sub>n</sub>, n <img src=\"images/symbol_ge.gif\"
+  width=\"10\" height=\"12\" alt=\"≥\" border=\"0\" style=\"vertical-align:middle;\">
+  0} are defined recursively as f<sub>n</sub> = f<sub>n-1</sub> + f<sub>n-2</sub>
+  with base cases f<sub>0</sub> = 0 and f<sub>1</sub> = 1.</p>\r\n<p>Define the polynomials
+  {F<sub>n</sub>, n <img src=\"images/symbol_ge.gif\" width=\"10\" height=\"12\" alt=\"≥\"
+  border=\"0\" style=\"vertical-align:middle;\"> 0} as F<sub>n</sub>(x) = <img src=\"images/symbol_sum.gif\"
+  width=\"11\" height=\"14\" alt=\"∑\" border=\"0\" style=\"vertical-align:middle;\">f<sub>i</sub>x<sup>i</sup>
+  for 0 <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.</p>\r\n<p>For
+  example, F<sub>7</sub>(x) = x + x<sup>2</sup> + 2x<sup>3</sup> + 3x<sup>4</sup>
+  + 5x<sup>5</sup> + 8x<sup>6</sup> + 13x<sup>7</sup>, and F<sub>7</sub>(11) = 268357683.</p>\r\n<p>Let
+  n = 10<sup>15</sup>. Find the sum [<img src=\"images/symbol_sum.gif\" width=\"11\"
+  height=\"14\" alt=\"∑\" border=\"0\" style=\"vertical-align:middle;\"><sub>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;\">100</sub>
+  F<sub>n</sub>(x)] mod 1307674368000 (= 15!).</p>\r\n"

data/data/problems/436.yml

@@ -0,0 +1,21 @@
+---
+:id: 436
+:name: Unfair wager
+:url: http://projecteuler.net/problem=436
+:content: "\r\n<p>Julie proposes the following wager to her sister Louise.<br>\r\nShe
+  suggests they play a game of chance to determine who will wash the dishes.<br>\r\nFor
+  this game, they shall use a generator of independent random numbers uniformly distributed
+  between 0 and 1.<br>\r\nThe game starts with <var>S</var> = 0.<br>\r\nThe first
+  player, Louise, adds to <var>S</var> different random numbers from the generator
+  until <var>S</var> &gt; 1 and records her last random number '<var>x</var>'.<br>\r\nThe
+  second player, Julie, continues adding to <var>S</var> different random numbers
+  from the generator until <var>S</var> &gt; 2 and records her last random number
+  '<var>y</var>'.<br>\r\nThe player with the highest number wins and the loser washes
+  the dishes, i.e. if <var>y</var> &gt; <var>x</var> the second player wins.</p>\r\n\r\n<p>For
+  e<var>x</var>ample, if the first player draws 0.62 and 0.44, the first player turn
+  ends since 0.62+0.44 &gt; 1 and <var>x</var> = 0.44.<br>\r\nIf the second players
+  draws 0.1, 0.27 and 0.91, the second player turn ends since 0.62+0.44+0.1+0.27+0.91
+  &gt; 2 and <var>y</var> = 0.91.\r\nSince <var>y</var> &gt; <var>x</var>, the second
+  player wins.</p>\r\n\r\n<p>Louise thinks about it for a second, and objects: \"That's
+  not fair\".<br>\r\nWhat is the probability that the second player wins?<br>\r\nGive
+  your answer rounded to 10 places behind the decimal point in the form 0.abcdefghij</p>\r\n\r\n"

data/data/problems/437.yml

@@ -0,0 +1,22 @@
+---
+:id: 437
+:name: Fibonacci primitive roots
+:url: http://projecteuler.net/problem=437
+:content: "\r\n<p>\r\nWhen we calculate 8<sup>n</sup> modulo 11 for n=0 to 9 we get:
+  1, 8, 9, 6, 4, 10, 3, 2, 5, 7.<br>\r\nAs we see all possible values from 1 to 10
+  occur. So 8 is a <b>primitive root</b> of 11.<br>\r\nBut there is more:<br>\r\nIf
+  we take a closer look we see:<br>\r\n1+8=9<br>\r\n8+9=17<img src=\"images/symbol_cong.gif\"
+  width=\"9\" height=\"11\" alt=\"≡\" border=\"0\" style=\"vertical-align:middle;\">6
+  mod 11<br>\r\n9+6=15<img src=\"images/symbol_cong.gif\" width=\"9\" height=\"11\"
+  alt=\"≡\" border=\"0\" style=\"vertical-align:middle;\">4 mod 11<br>\r\n6+4=10<br>\r\n4+10=14<img
+  src=\"images/symbol_cong.gif\" width=\"9\" height=\"11\" alt=\"≡\" border=\"0\"
+  style=\"vertical-align:middle;\">3 mod 11<br>\r\n10+3=13<img src=\"images/symbol_cong.gif\"
+  width=\"9\" height=\"11\" alt=\"≡\" border=\"0\" style=\"vertical-align:middle;\">2
+  mod 11<br>\r\n3+2=5<br>\r\n2+5=7<br>\r\n5+7=12<img src=\"images/symbol_cong.gif\"
+  width=\"9\" height=\"11\" alt=\"≡\" border=\"0\" style=\"vertical-align:middle;\">1
+  mod 11.\r\n</p>\r\nSo the powers of 8 mod 11 are cyclic with period 10, and 8<sup>n</sup>
+  + 8<sup>n+1</sup> ≡ 8<sup>n+2</sup> (mod 11).<br>\r\n8 is called a <b>Fibonacci
+  primitive root</b> of 11.<br>\r\nNot every prime has a Fibonacci primitive root.<br>\r\nThere
+  are 323 primes less than 10000 with one or more Fibonacci primitive roots and the
+  sum of these primes is 1480491.<br>\r\nFind the sum of the primes less than 100,000,000
+  with at least one Fibonacci primitive root.\r\n\r\n\r\n"

data/data/problems/438.yml

@@ -0,0 +1,29 @@
+---
+: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"