euler-manager 0.1.1 → 0.2.0

data/data/problems/264.yml

@@ -1,18 +1,17 @@
 ---
 :id: 264
 :name: Triangle Centres
-:url: http://projecteuler.net/problem=264
+:url: https://projecteuler.net/problem=264
 :content: "Consider all the triangles having:\n\n- All their vertices on <dfn title=\"Integer
   coordinates\">lattice points</dfn>.\n- <dfn title=\"Centre of the circumscribed
   circle\">Circumcentre</dfn> at the origin O.\n- <dfn title=\"Point where the three
   altitudes meet\">Orthocentre</dfn> at the point H(5, 0).\n\nThere are nine such
-  triangles having a perimeter ![≤]({{ images_dir }}/symbol_le.gif) 50.  \n\rListed
-  and shown in ascending order of their perimeter, they are:\n\n| A(-4, 3), B(5, 0),
-  C(4, -3)  \n\rA(4, 3), B(5, 0), C(-4, -3)  \n\rA(-3, 4), B(5, 0), C(3, -4)  \n  \n
-  \ \n  \n  \n\rA(3, 4), B(5, 0), C(-3, -4)  \n\rA(0, 5), B(5, 0), C(0, -5)  \n\rA(1,
-  8), B(8, -1), C(-4, -7)  \n  \n  \n  \n  \n\rA(8, 1), B(1, -8), C(-4, 7)  \n\rA(2,
-  9), B(9, -2), C(-6, -7)  \n\rA(9, 2), B(2, -9), C(-6, 7)  \n | ![]({{ images_dir
-  }}/p_264_TriangleCentres.gif) |\n\nThe sum of their perimeters, rounded to four
-  decimal places, is 291.0089.\n\nFind all such triangles with a perimeter ![≤]({{
-  images_dir }}/symbol_le.gif) 10<sup>5</sup>.  \n\rEnter as your answer the sum of
-  their perimeters rounded to four decimal places.\n\n"
+  triangles having a perimeter ≤ 50.  \nListed and shown in ascending order of their
+  perimeter, they are:\n\n| A(-4, 3), B(5, 0), C(4, -3)  \nA(4, 3), B(5, 0), C(-4,
+  -3)  \nA(-3, 4), B(5, 0), C(3, -4)  \n  \n  \nA(3, 4), B(5, 0), C(-3, -4)  \nA(0,
+  5), B(5, 0), C(0, -5)  \nA(1, 8), B(8, -1), C(-4, -7)  \n  \n  \nA(8, 1), B(1, -8),
+  C(-4, 7)  \nA(2, 9), B(9, -2), C(-6, -7)  \nA(9, 2), B(2, -9), C(-6, 7)  \n | ![p264_TriangleCentres.gif]({{
+  images_dir }}/p264_TriangleCentres.gif) |\n\nThe sum of their perimeters, rounded
+  to four decimal places, is 291.0089.\n\nFind all such triangles with a perimeter
+  ≤ 10<sup>5</sup>.  \nEnter as your answer the sum of their perimeters rounded to
+  four decimal places.\n\n"

data/data/problems/265.yml

@@ -1,10 +1,10 @@
 ---
 :id: 265
 :name: Binary Circles
-:url: http://projecteuler.net/problem=265
+:url: https://projecteuler.net/problem=265
 :content: "2<sup>N</sup> binary digits can be placed in a circle so that all the N-digit
   clockwise subsequences are distinct.\n\nFor N=3, two such circular arrangements
-  are possible, ignoring rotations:\n\n ![]({{ images_dir }}/p_265_BinaryCircles.gif)\n\nFor
+  are possible, ignoring rotations:\n\n ![p265_BinaryCircles.gif]({{ images_dir }}/p265_BinaryCircles.gif)\n\nFor
   the first arrangement, the 3-digit subsequences, in clockwise order, are:  \n 000,
   001, 010, 101, 011, 111, 110 and 100.\n\nEach circular arrangement can be encoded
   as a number by concatenating the binary digits starting with the subsequence of

data/data/problems/266.yml

@@ -1,10 +1,10 @@
 ---
 :id: 266
 :name: Pseudo Square Root
-:url: http://projecteuler.net/problem=266
-:content: "The divisors of 12 are: 1,2,3,4,6 and 12.  \n\rThe largest divisor of 12
-  that does not exceed the square root of 12 is 3.  \n\rWe shall call the largest
-  divisor of an integer <var>n</var> that does not exceed the square root of <var>n</var>
-  the pseudo square root (PSR) of <var>n</var>.  \n\rIt can be seen that PSR(3102)=47.\n\nLet
-  <var>p</var> be the product of the primes below 190.  \n\rFind PSR(<var>p</var>)
-  mod 10<sup>16</sup>.\n\n"
+:url: https://projecteuler.net/problem=266
+:content: "The divisors of 12 are: 1,2,3,4,6 and 12.  \nThe largest divisor of 12
+  that does not exceed the square root of 12 is 3.  \nWe shall call the largest divisor
+  of an integer <var>n</var> that does not exceed the square root of <var>n</var>
+  the pseudo square root (PSR) of <var>n</var>.  \nIt can be seen that PSR(3102)=47.\n\nLet
+  <var>p</var> be the product of the primes below 190.  \nFind PSR(<var>p</var>) mod
+  10<sup>16</sup>.\n\n"

data/data/problems/267.yml

@@ -1,7 +1,7 @@
 ---
 :id: 267
 :name: Billionaire
-:url: http://projecteuler.net/problem=267
+:url: https://projecteuler.net/problem=267
 :content: |+
   You are given a unique investment opportunity.
 

data/data/problems/268.yml

@@ -1,7 +1,7 @@
 ---
 :id: 268
 :name: Counting numbers with at least four distinct prime factors less than 100
-:url: http://projecteuler.net/problem=268
+:url: https://projecteuler.net/problem=268
 :content: |+
   It can be verified that there are 23 positive integers less than 1000 that are divisible by at least four distinct primes less than 100.
 

data/data/problems/269.yml

@@ -1,10 +1,10 @@
 ---
 :id: 269
 :name: Polynomials with at least one integer root
-:url: http://projecteuler.net/problem=269
+:url: https://projecteuler.net/problem=269
 :content: "A root or zero of a polynomial P(<var>x</var>) is a solution to the equation
-  P(<var>x</var>) = 0.   \n\rDefine P<sub><var>n</var></sub> as the polynomial whose
-  coefficients are the digits of <var>n</var>.  \n\rFor example, P<sub>5703</sub>(<var>x</var>)
+  P(<var>x</var>) = 0.   \nDefine P<sub><var>n</var></sub> as the polynomial whose
+  coefficients are the digits of <var>n</var>.  \nFor example, P<sub>5703</sub>(<var>x</var>)
   = 5<var>x</var><sup>3</sup> + 7<var>x</var><sup>2</sup> + 3.\n\nWe can see that:\n\n-
   P<sub><var>n</var></sub>(0) is the last digit of <var>n</var>,\n- P<sub><var>n</var></sub>(1)
   is the sum of the digits of <var>n</var>,\n- P<sub><var>n</var></sub>(10) is <var>n</var>

data/data/problems/27.yml

@@ -1,18 +1,15 @@
 ---
 :id: 27
 :name: Quadratic primes
-:url: http://projecteuler.net/problem=27
-:content: "Euler discovered the remarkable quadratic formula:\n\n_n_² + _n_ + 41\n\nIt
-  turns out that the formula will produce 40 primes for the consecutive values _n_
-  = 0 to 39. However, when _n_ = 40, 40<sup>2</sup> + 40 + 41 = 40(40 + 1) + 41 is
-  divisible by 41, and certainly when _n_ = 41, 41² + 41 + 41 is clearly divisible
-  by 41.\n\nThe incredible formula  _n_² ![−]({{ images_dir }}/symbol_minus.gif) 79_n_
-  + 1601 was discovered, which produces 80 primes for the consecutive values _n_ =
-  0 to 79. The product of the coefficients, ![−]({{ images_dir }}/symbol_minus.gif)79
-  and 1601, is ![−]({{ images_dir }}/symbol_minus.gif)126479.\n\nConsidering quadratics
-  of the form:\n\n> _n_² + _an_ + _b_, where |_a_| ![<]({{ images_dir }}/symbol_lt.gif)
-  1000 and |_b_| ![<]({{ images_dir }}/symbol_lt.gif) 1000  \n>   \n> \n> where |_n_|
-  is the modulus/absolute value of _n_  \n> e.g. |11| = 11 and | ![−]({{ images_dir
-  }}/symbol_minus.gif)4| = 4\n\nFind the product of the coefficients, _a_ and _b_,
-  for the quadratic expression that produces the maximum number of primes for consecutive
-  values of _n_, starting with _n_ = 0.\n\n"
+:url: https://projecteuler.net/problem=27
+:content: "Euler discovered the remarkable quadratic formula:\n\n$n^2 + n + 41$\n\nIt
+  turns out that the formula will produce 40 primes for the consecutive integer values
+  $0 \\le n \\le 39$. However, when $n = 40, 40^2 + 40 + 41 = 40(40 + 1) + 41$ is
+  divisible by 41, and certainly when $n = 41, 41^2 + 41 + 41$ is clearly divisible
+  by 41.\n\nThe incredible formula $n^2 - 79n + 1601$ was discovered, which produces
+  80 primes for the consecutive values $0 \\le n \\le 79$. The product of the coefficients,
+  −79 and 1601, is −126479.\n\nConsidering quadratics of the form:\n\n> $n^2 + an
+  + b$, where $|a| \\< 1000$ and $|b| \\le 1000$  \n>   \n> \n> where $|n|$ is the
+  modulus/absolute value of $n$  \n> e.g. $|11| = 11$ and $|-4| = 4$\n\nFind the product
+  of the coefficients, $a$ and $b$, for the quadratic expression that produces the
+  maximum number of primes for consecutive values of $n$, starting with $n = 0$.\n\n"

data/data/problems/270.yml

@@ -1,17 +1,17 @@
 ---
 :id: 270
 :name: Cutting Squares
-:url: http://projecteuler.net/problem=270
+:url: https://projecteuler.net/problem=270
 :content: |+
-  A square piece of paper with integer dimensions N ![×]({{ images_dir }}/symbol_times.gif)N is placed with a corner at the origin and two of its sides along the <var>x</var>- and <var>y</var>-axes. Then, we cut it up respecting the following rules:
+  A square piece of paper with integer dimensions N×N is placed with a corner at the origin and two of its sides along the <var>x</var>- and <var>y</var>-axes. Then, we cut it up respecting the following rules:
 
   - We only make straight cuts between two points lying on different sides of the square, and having integer coordinates.
   - Two cuts cannot cross, but several cuts can meet at the same border point.
   - Proceed until no more legal cuts can be made.
 
-  Counting any reflections or rotations as distinct, we call C(N) the number of ways to cut an N ![×]({{ images_dir }}/symbol_times.gif)N square. For example, C(1) = 2 and C(2) = 30 (shown below).
+  Counting any reflections or rotations as distinct, we call C(N) the number of ways to cut an N×N square. For example, C(1) = 2 and C(2) = 30 (shown below).
 
-   ![]({{ images_dir }}/p_270_CutSquare.gif)
+   ![p270_CutSquare.gif]({{ images_dir }}/p270_CutSquare.gif)
 
   What is C(30) mod 10<sup>8</sup> ?
 

data/data/problems/271.yml

@@ -1,10 +1,9 @@
 ---
 :id: 271
 :name: Modular Cubes, part 1
-:url: http://projecteuler.net/problem=271
+:url: https://projecteuler.net/problem=271
 :content: "For a positive number <var>n</var>, define S(<var>n</var>) as the sum of
-  the integers <var>x,</var> for which 1 ![<]({{ images_dir }}/symbol_lt.gif)<var>x</var>
-  ![<]({{ images_dir }}/symbol_lt.gif)<var>n</var> and  \n <var>x</var><sup>3</sup>
-  ![≡]({{ images_dir }}/symbol_cong.gif)1 mod <var>n</var>.\n\nWhen <var>n</var>=91,
-  there are 8 possible values for <var>x</var>, namely : 9, 16, 22, 29, 53, 74, 79,
-  81.  \n\rThus, S(91)=9+16+22+29+53+74+79+81=363.\n\nFind S(13082761331670030).\n\n"
+  the integers <var>x,</var> for which 1\\<<var>x</var>\\<<var>n</var> and  \n<var>x</var><sup>3</sup>≡1
+  mod <var>n</var>.\n\nWhen <var>n</var>=91, there are 8 possible values for <var>x</var>,
+  namely : 9, 16, 22, 29, 53, 74, 79, 81.  \nThus, S(91)=9+16+22+29+53+74+79+81=363.\n\nFind
+  S(13082761331670030).\n\n"

data/data/problems/272.yml

@@ -1,11 +1,9 @@
 ---
 :id: 272
 :name: Modular Cubes, part 2
-:url: http://projecteuler.net/problem=272
+:url: https://projecteuler.net/problem=272
 :content: "For a positive number <var>n</var>, define C(<var>n</var>) as the number
-  of the integers <var>x,</var> for which 1 ![<]({{ images_dir }}/symbol_lt.gif)<var>x</var>
-  ![<]({{ images_dir }}/symbol_lt.gif)<var>n</var> and  \n <var>x</var><sup>3</sup>
-  ![≡]({{ images_dir }}/symbol_cong.gif)1 mod <var>n</var>.\n\nWhen <var>n</var>=91,
-  there are 8 possible values for <var>x</var>, namely : 9, 16, 22, 29, 53, 74, 79,
-  81.  \n\rThus, C(91)=8.\n\nFind the sum of the positive numbers <var>n</var> ![≤]({{
-  images_dir }}/symbol_le.gif)10<sup>11</sup> for which C(<var>n</var>)=242.\n\n"
+  of the integers <var>x,</var> for which 1\\<<var>x</var>\\<<var>n</var> and  \n<var>x</var><sup>3</sup>≡1
+  mod <var>n</var>.\n\nWhen <var>n</var>=91, there are 8 possible values for <var>x</var>,
+  namely : 9, 16, 22, 29, 53, 74, 79, 81.  \nThus, C(91)=8.\n\nFind the sum of the
+  positive numbers <var>n</var>≤10<sup>11</sup> for which C(<var>n</var>)=242.\n\n"

data/data/problems/273.yml

@@ -1,17 +1,17 @@
 ---
 :id: 273
 :name: Sum of Squares
-:url: http://projecteuler.net/problem=273
+:url: https://projecteuler.net/problem=273
 :content: |+
-  Consider equations of the form: <var>a</var><sup>2</sup> + <var>b</var><sup>2</sup> = <var>N</var>, 0 ![≤]({{ images_dir }}/symbol_le.gif) <var>a</var> ![≤]({{ images_dir }}/symbol_le.gif) <var>b</var>, <var>a</var>, <var>b</var> and <var>N</var> integer.
+  Consider equations of the form: <var>a</var><sup>2</sup> + <var>b</var><sup>2</sup> = <var>N</var>, 0 ≤ <var>a</var> ≤ <var>b</var>, <var>a</var>, <var>b</var> and <var>N</var> integer.
 
   For <var>N</var>=65 there are two solutions:
 
   <var>a</var>=1, <var>b</var>=8 and <var>a</var>=4, <var>b</var>=7.
 
-  We call S(<var>N</var>) the sum of the values of <var>a</var> of all solutions of <var>a</var><sup>2</sup> + <var>b</var><sup>2</sup> = <var>N</var>, 0 ![≤]({{ images_dir }}/symbol_le.gif) <var>a</var> ![≤]({{ images_dir }}/symbol_le.gif) <var>b</var>, <var>a</var>, <var>b</var> and <var>N</var> integer.
+  We call S(<var>N</var>) the sum of the values of <var>a</var> of all solutions of <var>a</var><sup>2</sup> + <var>b</var><sup>2</sup> = <var>N</var>, 0 ≤ <var>a</var> ≤ <var>b</var>, <var>a</var>, <var>b</var> and <var>N</var> integer.
 
   Thus S(65) = 1 + 4 = 5.
 
-  Find ![∑]({{ images_dir }}/symbol_sum.gif)S(<var>N</var>), for all squarefree <var>N</var> only divisible by primes of the form 4<var>k</var>+1 with 4<var>k</var>+1 ![<]({{ images_dir }}/symbol_lt.gif) 150.
+  Find ∑S(<var>N</var>), for all squarefree <var>N</var> only divisible by primes of the form 4<var>k</var>+1 with 4<var>k</var>+1 \< 150.
 

data/data/problems/274.yml

@@ -1,11 +1,10 @@
 ---
 :id: 274
 :name: Divisibility Multipliers
-:url: http://projecteuler.net/problem=274
-:content: "For each integer <var>p</var> ![>]({{ images_dir }}/symbol_gt.gif) 1 coprime
-  to 10 there is a positive _divisibility multiplier_ <var>m</var> ![<]({{ images_dir
-  }}/symbol_lt.gif) <var>p</var> which preserves divisibility by <var>p</var> for
-  the following function on any positive integer, <var>n</var>:\n\n<var>f</var>(<var>n</var>)
+:url: https://projecteuler.net/problem=274
+:content: "For each integer <var>p</var> \\> 1 coprime to 10 there is a positive _divisibility
+  multiplier_ <var>m</var> \\< <var>p</var> which preserves divisibility by <var>p</var>
+  for the following function on any positive integer, <var>n</var>:\n\n<var>f</var>(<var>n</var>)
   = (all but the last digit of <var>n</var>) + (the last digit of <var>n</var>) \\*
   <var>m</var>\n\nThat is, if <var>m</var> is the divisibility multiplier for <var>p</var>,
   then <var>f</var>(<var>n</var>) is divisible by <var>p</var> if and only if <var>n</var>

data/data/problems/275.yml

@@ -1,7 +1,7 @@
 ---
 :id: 275
 :name: Balanced Sculptures
-:url: http://projecteuler.net/problem=275
+:url: https://projecteuler.net/problem=275
 :content: "Let us define a _balanced sculpture_ of order <var>n</var> as follows:\n\n-
   A <dfn title=\"An arrangement of identical squares connected through shared edges;
   holes are allowed.\">polyomino</dfn> made up of <var>n</var>+1 tiles known as the
@@ -12,6 +12,6 @@
   to zero.\n\nWhen counting the sculptures, any arrangements which are simply reflections
   about the <var>y</var>-axis, are <u>not</u> counted as distinct. For example, the
   18 balanced sculptures of order 6 are shown below; note that each pair of mirror
-  images (about the <var>y</var>-axis) is counted as one sculpture:\n\n ![]({{ images_dir
-  }}/p_275_sculptures2.gif)\n\nThere are 964 balanced sculptures of order 10 and 360505
-  of order 15.  \nHow many balanced sculptures are there of order 18?\n\n"
+  images (about the <var>y</var>-axis) is counted as one sculpture:\n\n ![p275_sculptures2.gif]({{
+  images_dir }}/p275_sculptures2.gif)\n\nThere are 964 balanced sculptures of order
+  10 and 360505 of order 15.  \nHow many balanced sculptures are there of order 18?\n\n"

data/data/problems/276.yml

@@ -1,9 +1,8 @@
 ---
 :id: 276
 :name: Primitive Triangles
-:url: http://projecteuler.net/problem=276
-:content: "Consider the triangles with integer sides a, b and c with a ![≤]({{ images_dir
-  }}/symbol_le.gif) b ![≤]({{ images_dir }}/symbol_le.gif) c.  \n\rAn integer sided
-  triangle (a,b,c) is called primitive if <dfn title=\" gcd(a,b,c)=gcd(a,gcd(b,c))\">
-  gcd(a,b,c)</dfn>=1.   \n\rHow many primitive integer sided triangles exist with
-  a perimeter not exceeding 10 000 000?\n\n"
+:url: https://projecteuler.net/problem=276
+:content: "Consider the triangles with integer sides a, b and c with a ≤ b ≤ c.  \nAn
+  integer sided triangle (a,b,c) is called primitive if <dfn title=\"gcd(a,b,c)=gcd(a,gcd(b,c))\">
+  gcd(a,b,c)</dfn>=1.   \nHow many primitive integer sided triangles exist with a
+  perimeter not exceeding 10 000 000?\n\n"

data/data/problems/277.yml

@@ -1,7 +1,7 @@
 ---
 :id: 277
 :name: A Modified Collatz sequence
-:url: http://projecteuler.net/problem=277
+:url: https://projecteuler.net/problem=277
 :content: "A modified Collatz sequence of integers is obtained from a starting value
   a<sub>1</sub> in the following way:\n\n<var>a<sub>n+1</sub></var> = <var>a<sub>n</sub></var>/3
   if <var>a<sub>n</sub></var> is divisible by 3. We shall denote this as a large downward
@@ -11,11 +11,10 @@
   - 1)/3 if <var>a<sub>n</sub></var> divided by 3 gives a remainder of 2. We shall
   denote this as a small downward step, \"d\".\n\nThe sequence terminates when some
   <var>a<sub>n</sub></var> = 1.\n\nGiven any integer, we can list out the sequence
-  of steps.  \n\rFor instance if <var>a</var><sub>1</sub>=231, then the sequence {<var>a<sub>n</sub></var>}={231,77,51,17,11,7,10,14,9,3,1}
+  of steps.  \nFor instance if <var>a</var><sub>1</sub>=231, then the sequence {<var>a<sub>n</sub></var>}={231,77,51,17,11,7,10,14,9,3,1}
   corresponds to the steps \"DdDddUUdDD\".\n\nOf course, there are other sequences
-  that begin with that same sequence \"DdDddUUdDD....\".  \n\rFor instance, if <var>a</var><sub>1</sub>=1004064,
-  then the sequence is DdDddUUdDDDdUDUUUdDdUUDDDUdDD.  \n\rIn fact, 1004064 is the
-  smallest possible <var>a</var><sub>1</sub> ![>]({{ images_dir }}/symbol_gt.gif)
-  10<sup>6</sup> that begins with the sequence DdDddUUdDD.\n\nWhat is the smallest
-  <var>a</var><sub>1</sub> ![>]({{ images_dir }}/symbol_gt.gif) 10<sup>15</sup> that
-  begins with the sequence \"UDDDUdddDDUDDddDdDddDDUDDdUUDd\"?\n\n"
+  that begin with that same sequence \"DdDddUUdDD....\".  \nFor instance, if <var>a</var><sub>1</sub>=1004064,
+  then the sequence is DdDddUUdDDDdUDUUUdDdUUDDDUdDD.  \nIn fact, 1004064 is the smallest
+  possible <var>a</var><sub>1</sub> \\> 10<sup>6</sup> that begins with the sequence
+  DdDddUUdDD.\n\nWhat is the smallest <var>a</var><sub>1</sub> \\> 10<sup>15</sup>
+  that begins with the sequence \"UDDDUdddDDUDDddDdDddDDUDDdUUDd\"?\n\n"

data/data/problems/278.yml

@@ -1,22 +1,19 @@
 ---
 :id: 278
 :name: Linear Combinations of Semiprimes
-:url: http://projecteuler.net/problem=278
-:content: "Given the values of integers 1 ![<]({{ images_dir }}/symbol_lt.gif) <var>a</var><sub>1</sub>
-  ![<]({{ images_dir }}/symbol_lt.gif) <var>a</var><sub>2</sub> ![<]({{ images_dir
-  }}/symbol_lt.gif)... ![<]({{ images_dir }}/symbol_lt.gif) <var>a</var><sub><var>n</var></sub>,
-  consider the linear combination  \n <var>q</var><sub>1</sub><var>a</var><sub>1</sub>
-  + <var>q</var><sub>2</sub><var>a</var><sub>2</sub> + ... + <var>q</var><sub><var>n</var></sub><var>a</var><sub><var>n</var></sub>
-  = <var>b</var>, using only integer values <var>q</var><sub><var>k</var></sub> ![≥]({{
-  images_dir }}/symbol_ge.gif) 0.\n\nNote that for a given set of <var>a</var><sub><var>k</var></sub>,
-  it may be that not all values of <var>b</var> are possible.  \n\rFor instance, if
-  <var>a</var><sub>1</sub> = 5 and <var>a</var><sub>2</sub> = 7, there are no <var>q</var><sub>1</sub>
-  ![≥]({{ images_dir }}/symbol_ge.gif) 0 and <var>q</var><sub>2</sub> ![≥]({{ images_dir
-  }}/symbol_ge.gif) 0 such that <var>b</var> could be  \n \r1, 2, 3, 4, 6, 8, 9, 11,
-  13, 16, 18 or 23.\r  \n\rIn fact, 23 is the largest impossible value of <var>b</var>
-  for <var>a</var><sub>1</sub> = 5 and <var>a</var><sub>2</sub> = 7.  \n We therefore
-  call <var>f</var>(5, 7) = 23.  \n Similarly, it can be shown that <var>f</var>(6,
-  10, 15)=29 and <var>f</var>(14, 22, 77) = 195.\n\nFind ![∑]({{ images_dir }}/symbol_sum.gif)
-  <var>f</var>(<var>p*q,p*r,q*r</var>), where <var>p</var>, <var>q</var> and <var>r</var>
-  are prime numbers and <var>p</var> &lt <var>q</var> ![<]({{ images_dir }}/symbol_lt.gif)
-  <var>r</var> ![<]({{ images_dir }}/symbol_lt.gif) 5000.\n\n"
+:url: https://projecteuler.net/problem=278
+:content: "Given the values of integers 1 \\< <var>a</var><sub>1</sub> \\< <var>a</var><sub>2</sub>
+  \\<... \\< <var>a</var><sub><var>n</var></sub>, consider the linear combination
+  \ \n<var>q</var><sub>1</sub><var>a</var><sub>1</sub> + <var>q</var><sub>2</sub><var>a</var><sub>2</sub>
+  + ... + <var>q</var><sub><var>n</var></sub><var>a</var><sub><var>n</var></sub> =
+  <var>b</var>, using only integer values <var>q</var><sub><var>k</var></sub> ≥ 0.\n\nNote
+  that for a given set of <var>a</var><sub><var>k</var></sub>, it may be that not
+  all values of <var>b</var> are possible.  \nFor instance, if <var>a</var><sub>1</sub>
+  = 5 and <var>a</var><sub>2</sub> = 7, there are no <var>q</var><sub>1</sub> ≥ 0
+  and <var>q</var><sub>2</sub> ≥ 0 such that <var>b</var> could be  \n 1, 2, 3, 4,
+  6, 8, 9, 11, 13, 16, 18 or 23.  \nIn fact, 23 is the largest impossible value of
+  <var>b</var> for <var>a</var><sub>1</sub> = 5 and <var>a</var><sub>2</sub> = 7.
+  \ \n We therefore call <var>f</var>(5, 7) = 23.  \n Similarly, it can be shown that
+  <var>f</var>(6, 10, 15)=29 and <var>f</var>(14, 22, 77) = 195.\n\nFind ∑ <var>f</var>(<var>p*q,p*r,q*r</var>),
+  where <var>p</var>, <var>q</var> and <var>r</var> are prime numbers and <var>p</var>
+  &lt <var>q</var> \\< <var>r</var> \\< 5000.\n\n"

data/data/problems/279.yml

@@ -1,7 +1,6 @@
 ---
 :id: 279
 :name: Triangles with integral sides and an integral angle
-:url: http://projecteuler.net/problem=279
-:content: |+
-  How many triangles are there with integral sides, at least one integral angle (measured in degrees), and a perimeter that does not exceed 10<sup>8</sup>?
-
+:url: https://projecteuler.net/problem=279
+:content: "How many triangles are there with integral sides, at least one integral
+  angle (measured in degrees), and a perimeter that does not exceed 10<sup>8</sup>?\n\n"

data/data/problems/28.yml

@@ -1,10 +1,10 @@
 ---
 :id: 28
 :name: Number spiral diagonals
-:url: http://projecteuler.net/problem=28
+:url: https://projecteuler.net/problem=28
 :content: "Starting with the number 1 and moving to the right in a clockwise direction
-  a 5 by 5 spiral is formed as follows:\n\n**21** 22 23 24 **25**  \n\r20   **7**
-   8   **9** 10  \n\r19  6   **1**  2 11  \n\r18   **5**  4   **3** 12  \n**17** 16
-  15 14 **13**\n\nIt can be verified that the sum of the numbers on the diagonals
-  is 101.\n\nWhat is the sum of the numbers on the diagonals in a 1001 by 1001 spiral
-  formed in the same way?\n\n"
+  a 5 by 5 spiral is formed as follows:\n\n**21** 22 23 24 **25**  \n20   **7**
+   8   **9** 10  \n19  6   **1**  2 11  \n18   **5**
+   4   **3** 12  \n**17** 16 15 14 **13**\n\nIt can be verified that the
+  sum of the numbers on the diagonals is 101.\n\nWhat is the sum of the numbers on
+  the diagonals in a 1001 by 1001 spiral formed in the same way?\n\n"

data/data/problems/280.yml

@@ -1,7 +1,7 @@
 ---
 :id: 280
 :name: Ant and seeds
-:url: http://projecteuler.net/problem=280
+:url: https://projecteuler.net/problem=280
 :content: "A laborious ant walks randomly on a 5x5 grid. The walk starts from the
   central square. At each step, the ant moves to an adjacent square at random, without
   leaving the grid; thus there are 2, 3 or 4 possible moves at each step depending
@@ -9,5 +9,5 @@
   of the lower row. When the ant isn't carrying a seed and reaches a square of the
   lower row containing a seed, it will start to carry the seed. The ant will drop
   the seed on the first empty square of the upper row it eventually reaches.\n\nWhat's
-  the expected number of steps until all seeds have been dropped in the top row?   \n\rGive
+  the expected number of steps until all seeds have been dropped in the top row?   \nGive
   your answer rounded to 6 decimal places.\n\n"

data/data/problems/281.yml

@@ -1,14 +1,12 @@
 ---
 :id: 281
 :name: Pizza Toppings
-:url: http://projecteuler.net/problem=281
+:url: https://projecteuler.net/problem=281
 :content: "You are given a pizza (perfect circle) that has been cut into <var>m</var>·<var>n</var>
   equal pieces and you want to have exactly one topping on each slice.\n\nLet <var>f</var>(<var>m</var>,<var>n</var>)
   denote the number of ways you can have toppings on the pizza with <var>m</var> different
-  toppings (<var>m</var>  ![≥]({{ images_dir }}/symbol_ge.gif) 2), using each topping
-  on exactly <var>n</var> slices (<var>n</var>  ![≥]({{ images_dir }}/symbol_ge.gif) 1).
+  toppings (<var>m</var> ≥ 2), using each topping on exactly <var>n</var> slices (<var>n</var> ≥ 1).
   \  \nReflections are considered distinct, rotations are not.\n\nThus, for instance,
   <var>f</var>(2,1) = 1, <var>f</var>(2,2) = <var>f</var>(3,1) = 2 and <var>f</var>(3,2) = 16.
-  \  \n<var>f</var>(3,2) is shown below:\n\n ![]({{ images_dir }}/p_281_pizza.gif)\n\nFind
-  the sum of all <var>f</var>(<var>m</var>,<var>n</var>) such that <var>f</var>(<var>m</var>,<var>n</var>) 
-  ![≤]({{ images_dir }}/symbol_le.gif) 10<sup>15</sup>.\n\n"
+  \  \n<var>f</var>(3,2) is shown below:\n\n ![p281_pizza.gif]({{ images_dir }}/p281_pizza.gif)\n\nFind
+  the sum of all <var>f</var>(<var>m</var>,<var>n</var>) such that <var>f</var>(<var>m</var>,<var>n</var>) ≤ 10<sup>15</sup>.\n\n"

data/data/problems/282.yml

@@ -1,13 +1,13 @@
 ---
 :id: 282
 :name: The Ackermann function
-:url: http://projecteuler.net/problem=282
+:url: https://projecteuler.net/problem=282
 :content: |+
   For non-negative integers <var>m</var>, <var>n</var>, the Ackermann function <var>A</var>(<var>m</var>, <var>n</var>) is defined as follows:
 
-   ![]({{ images_dir }}/p_282_formula.gif)
+   ![p282_formula.gif]({{ images_dir }}/p282_formula.gif)
 
   For example <var>A</var>(1, 0) = 2, <var>A</var>(2, 2) = 7 and <var>A</var>(3, 4) = 125.
 
-  Find ![]({{ images_dir }}/p_282formula3.gif)<var>A</var>(<var>n</var>, <var>n</var>) and give your answer mod 14<sup>8</sup>.
+  Find ![p282formula3.gif]({{ images_dir }}/p282formula3.gif)<var>A</var>(<var>n</var>, <var>n</var>) and give your answer mod 14<sup>8</sup>.
 

data/data/problems/283.yml

@@ -1,11 +1,10 @@
 ---
 :id: 283
 :name: Integer sided triangles for which the area/perimeter ratio is integral
-:url: http://projecteuler.net/problem=283
+:url: https://projecteuler.net/problem=283
 :content: "Consider the triangle with sides 6, 8 and 10. It can be seen that the perimeter
-  and the area are both equal to 24. \rSo the area/perimeter ratio is equal to 1.
-  \ \n\rConsider also the triangle with sides 13, 14 and 15. The perimeter equals
-  42 while the area is equal to 84. \rSo for this triangle the area/perimeter ratio
-  is equal to 2.\n\nFind the sum of the perimeters of all integer sided triangles
-  for which the area/perimeter ratios are equal to positive integers not exceeding
-  1000.\n\n"
+  and the area are both equal to 24. So the area/perimeter ratio is equal to 1.  \nConsider
+  also the triangle with sides 13, 14 and 15. The perimeter equals 42 while the area
+  is equal to 84. So for this triangle the area/perimeter ratio is equal to 2.\n\nFind
+  the sum of the perimeters of all integer sided triangles for which the area/perimeter
+  ratios are equal to positive integers not exceeding 1000.\n\n"

data/data/problems/284.yml

@@ -1,7 +1,7 @@
 ---
 :id: 284
 :name: Steady Squares
-:url: http://projecteuler.net/problem=284
+:url: https://projecteuler.net/problem=284
 :content: "The 3-digit number 376 in the decimal numbering system is an example of
   numbers with the special property that its square ends with the same digits: 376<sup>2</sup>
   = 141376. Let's call a number with this property a steady square.\n\nSteady squares
@@ -9,10 +9,9 @@
   the 3-digit number c37 is also a steady square: c37<sup>2</sup> = aa0c37, and the
   sum of its digits is c+3+7=18 in the same numbering system. The letters a, b, c
   and d are used for the 10, 11, 12 and 13 digits respectively, in a manner similar
-  to the hexadecimal numbering system.\n\nFor 1 ![≤]({{ images_dir }}/symbol_le.gif)
-  n ![≤]({{ images_dir }}/symbol_le.gif) 9, the sum of the digits of all the n-digit
-  steady squares in the base 14 numbering system is 2d8 (582 decimal). Steady squares
-  with leading 0's are not allowed.\n\nFind the sum of the digits of all the n-digit
-  steady squares in the base 14 numbering system for  \n\r1 ![≤]({{ images_dir }}/symbol_le.gif)
-  n ![≤]({{ images_dir }}/symbol_le.gif) 10000 (decimal) and give your answer in the
-  base 14 system using lower case letters where necessary.\n\n"
+  to the hexadecimal numbering system.\n\nFor 1 ≤ n ≤ 9, the sum of the digits of
+  all the n-digit steady squares in the base 14 numbering system is 2d8 (582 decimal).
+  Steady squares with leading 0's are not allowed.\n\nFind the sum of the digits of
+  all the n-digit steady squares in the base 14 numbering system for  \n1 ≤ n ≤ 10000
+  (decimal) and give your answer in the base 14 system using lower case letters where
+  necessary.\n\n"