euler-manager 0.1.1 → 0.2.0

data/data/problems/159.yml

@@ -1,19 +1,17 @@
 ---
 :id: 159
 :name: Digital root sums of factorisations
-:url: http://projecteuler.net/problem=159
-:content: "A composite number can be factored many different ways. \rFor instance,
-  not including multiplication by one, 24 can be factored in 7 distinct ways:\n\n\r24
-  = 2x2x2x3  \n\r24 = 2x3x4  \n\r24 = 2x2x6  \n\r24 = 4x6  \n\r24 = 3x8  \n\r24 =
-  2x12  \n\r24 = 24\r\n\nRecall that the digital root of a number, in base 10, is
-  found by adding together the digits of that number, \rand repeating that process
-  until a number is arrived at that is less than 10. \rThus the digital root of 467
-  is 8.\n\nWe shall call a Digital Root Sum (DRS) the sum of the digital roots of
-  the individual factors of our number.  \n\r The chart below demonstrates all of
-  the DRS values for 24.\n\n| Factorisation | Digital Root Sum |\n| --- | --- |\n|
-  \n2x2x2x3\n | \n9\n |\n| \n2x3x4\n | \n9\n |\n| \n2x2x6\n | \n10\n |\n| \n4x6\n
-  | \n10\n |\n| \n3x8\n | \n11\n |\n| \n2x12\n | \n5\n |\n| \n24\n | \n6\n |\n\nThe
-  maximum Digital Root Sum of 24 is 11.  \n\rThe function mdrs(<var>n</var>) gives
-  the maximum Digital Root Sum of <var>n</var>. So mdrs(24)=11.  \n\rFind ![∑]({{
-  images_dir }}/symbol_sum.gif)mdrs(<var>n</var>) for 1 ![<]({{ images_dir }}/symbol_lt.gif)
-  <var>n</var> ![<]({{ images_dir }}/symbol_lt.gif) 1,000,000.\n\n"
+:url: https://projecteuler.net/problem=159
+:content: "A composite number can be factored many different ways. For instance, not
+  including multiplication by one, 24 can be factored in 7 distinct ways:\n\n24 =
+  2x2x2x3  \n24 = 2x3x4  \n24 = 2x2x6  \n24 = 4x6  \n24 = 3x8  \n24 = 2x12  \n24 =
+  24\n\nRecall that the digital root of a number, in base 10, is found by adding together
+  the digits of that number, and repeating that process until a number is arrived
+  at that is less than 10. Thus the digital root of 467 is 8.\n\nWe shall call a Digital
+  Root Sum (DRS) the sum of the digital roots of the individual factors of our number.
+  \ \n The chart below demonstrates all of the DRS values for 24.\n\n| Factorisation
+  | Digital Root Sum |\n| --- | --- |\n| \n2x2x2x3\n | \n9\n |\n| \n2x3x4\n | \n9\n
+  |\n| \n2x2x6\n | \n10\n |\n| \n4x6\n | \n10\n |\n| \n3x8\n | \n11\n |\n| \n2x12\n
+  | \n5\n |\n| \n24\n | \n6\n |\n\nThe maximum Digital Root Sum of 24 is 11.  \nThe
+  function mdrs(<var>n</var>) gives the maximum Digital Root Sum of <var>n</var>.
+  So mdrs(24)=11.  \nFind ∑mdrs(<var>n</var>) for 1 \\< <var>n</var> \\< 1,000,000.\n\n"

data/data/problems/16.yml

@@ -1,7 +1,7 @@
 ---
 :id: 16
 :name: Power digit sum
-:url: http://projecteuler.net/problem=16
+:url: https://projecteuler.net/problem=16
 :content: |+
   2<sup>15</sup> = 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26.
 

data/data/problems/160.yml

@@ -1,7 +1,7 @@
 ---
 :id: 160
 :name: Factorial trailing digits
-:url: http://projecteuler.net/problem=160
+:url: https://projecteuler.net/problem=160
 :content: "For any N, let f(N) be the last five digits before the trailing zeroes
-  in N!.  \n\rFor example,\n\n9! = 362880 so f(9)=36288  \n\r10! = 3628800 so f(10)=36288
-  \ \n\r20! = 2432902008176640000 so f(20)=17664\n\nFind f(1,000,000,000,000)\n\n"
+  in N!.  \nFor example,\n\n9! = 362880 so f(9)=36288  \n10! = 3628800 so f(10)=36288
+  \ \n20! = 2432902008176640000 so f(20)=17664\n\nFind f(1,000,000,000,000)\n\n"

data/data/problems/161.yml

@@ -1,12 +1,12 @@
 ---
 :id: 161
 :name: Triominoes
-:url: http://projecteuler.net/problem=161
-:content: "A triomino is a shape consisting of three squares joined via the edges.\rThere
-  are two basic forms:\n\n![]({{ images_dir }}/p_161_trio1.gif)\n\nIf all possible
-  orientations are taken into account there are six:\n\n![]({{ images_dir }}/p_161_trio3.gif)\n\nAny
-  n by m grid for which nxm is divisible by 3 can be tiled with triominoes.  \n\rIf
+:url: https://projecteuler.net/problem=161
+:content: "A triomino is a shape consisting of three squares joined via the edges.
+  There are two basic forms:\n\n![]({{ images_dir }}/p161_trio1.gif)\n\nIf all possible
+  orientations are taken into account there are six:\n\n![]({{ images_dir }}/p161_trio3.gif)\n\nAny
+  n by m grid for which nxm is divisible by 3 can be tiled with triominoes.  \nIf
   we consider tilings that can be obtained by reflection or rotation from another
   tiling as different there are 41 ways a 2 by 9 grid can be tiled with triominoes:\n\n![]({{
-  images_dir }}/p_161_k9.gif)\n\nIn how many ways can a 9 by 12 grid be tiled in this
+  images_dir }}/p161_k9.gif)\n\nIn how many ways can a 9 by 12 grid be tiled in this
   way by triominoes?\n\n"

data/data/problems/162.yml

@@ -1,14 +1,14 @@
 ---
 :id: 162
 :name: Hexadecimal numbers
-:url: http://projecteuler.net/problem=162
+:url: https://projecteuler.net/problem=162
 :content: "In the hexadecimal number system numbers are represented using 16 different
   digits:\n\n0,1,2,3,4,5,6,7,8,9,A,B,C,D,E,F\n\nThe hexadecimal number AF when written
   in the decimal number system equals 10x16+15=175.\n\nIn the 3-digit hexadecimal
-  numbers 10A, 1A0, A10, and A01 the digits 0,1 and A are all present.  \n\rLike numbers
+  numbers 10A, 1A0, A10, and A01 the digits 0,1 and A are all present.  \nLike numbers
   written in base ten we write hexadecimal numbers without leading zeroes.\n\nHow
   many hexadecimal numbers containing at most sixteen hexadecimal digits exist with
-  all of the digits 0,1, and A present at least once?  \n\rGive your answer as a hexadecimal
+  all of the digits 0,1, and A present at least once?  \nGive your answer as a hexadecimal
   number.\n\n(A,B,C,D,E and F in upper case, without any leading or trailing code
   that marks the number as hexadecimal and without leading zeroes , e.g. 1A3F and
   not: 1a3f and not 0x1a3f and not $1A3F and not #1A3F and not 0000001A3F)\n\n"

data/data/problems/163.yml

@@ -1,10 +1,10 @@
 ---
 :id: 163
 :name: Cross-hatched triangles
-:url: http://projecteuler.net/problem=163
+:url: https://projecteuler.net/problem=163
 :content: "Consider an equilateral triangle in which straight lines are drawn from
   each vertex to the middle of the opposite side, such as in the _size 1_ triangle
-  in the sketch below.\n\n ![]({{ images_dir }}/p_163.gif)\n\nSixteen triangles of
+  in the sketch below.\n\n ![]({{ images_dir }}/p163.gif)\n\nSixteen triangles of
   either different shape or size or orientation or location can now be observed in
   that triangle. Using _size 1_ triangles as building blocks, larger triangles can
   be formed, such as the _size 2_ triangle in the above sketch. One-hundred and four
@@ -13,5 +13,5 @@
   contains 4 _size 1_ triangle building blocks. A _size 3_ triangle would contain
   9 _size 1_ triangle building blocks and a _size n_ triangle would thus contain _n<sup>2</sup>
   size 1_ triangle building blocks.\n\nIf we denote T(<var>n</var>) as the number
-  of triangles present in a triangle of _size <var>n</var>_, then\n\nT(1) = 16  \n\rT(2)
+  of triangles present in a triangle of _size <var>n</var>_, then\n\nT(1) = 16  \nT(2)
   = 104\n\nFind T(36).\n\n"

data/data/problems/164.yml

@@ -2,7 +2,6 @@
 :id: 164
 :name: Numbers for which no three consecutive digits have a sum greater than a given
   value
-:url: http://projecteuler.net/problem=164
-:content: |+
-  How many 20 digit numbers <var>n</var> (without any leading zero) exist such that no three consecutive digits of <var>n</var> have a sum greater than 9?
-
+:url: https://projecteuler.net/problem=164
+:content: "How many 20 digit numbers <var>n</var> (without any leading zero) exist
+  such that no three consecutive digits of <var>n</var> have a sum greater than 9?\n\n"

data/data/problems/165.yml

@@ -1,29 +1,29 @@
 ---
 :id: 165
 :name: Intersections
-:url: http://projecteuler.net/problem=165
+:url: https://projecteuler.net/problem=165
 :content: "A segment is uniquely defined by its two endpoints.  \n By considering
-  two line segments in plane geometry there are three possibilities:  \n \rthe segments
+  two line segments in plane geometry there are three possibilities:  \n the segments
   have zero points, one point, or infinitely many points in common.\n\nMoreover when
   two segments have exactly one point in common it might be the case that that common
   point is an endpoint of either one of the segments or of both. If a common point
   of two segments is not an endpoint of either of the segments it is an interior point
-  of both segments.  \n\rWe will call a common point T of two segments L<sub>1</sub>
+  of both segments.  \nWe will call a common point T of two segments L<sub>1</sub>
   and L<sub>2</sub> a true intersection point of L<sub>1</sub> and L<sub>2</sub> if
   T is the only common point of L<sub>1</sub> and L<sub>2</sub> and T is an interior
   point of both segments.\n\nConsider the three segments L<sub>1</sub>, L<sub>2</sub>,
-  and L<sub>3</sub>:\n\nL<sub>1</sub>: (27, 44) to (12, 32)  \n\rL<sub>2</sub>: (46,
-  53) to (17, 62)  \n\rL<sub>3</sub>: (46, 70) to (22, 40)\n\nIt can be verified that
+  and L<sub>3</sub>:\n\nL<sub>1</sub>: (27, 44) to (12, 32)  \nL<sub>2</sub>: (46,
+  53) to (17, 62)  \nL<sub>3</sub>: (46, 70) to (22, 40)\n\nIt can be verified that
   line segments L<sub>2</sub> and L<sub>3</sub> have a true intersection point. We
   note that as the one of the end points of L<sub>3</sub>: (22,40) lies on L<sub>1</sub>
   this is not considered to be a true point of intersection. L<sub>1</sub> and L<sub>2</sub>
   have no common point. So among the three line segments, we find one true intersection
   point.\n\nNow let us do the same for 5000 line segments. To this end, we generate
   20000 numbers using the so-called \"Blum Blum Shub\" pseudo-random number generator.\n\ns<sub>0</sub>
-  = 290797  \n  \n  \n\rs<sub>n+1</sub> = s<sub>n</sub> ![×]({{ images_dir }}/symbol_times.gif)s<sub>n</sub>
-  (modulo 50515093)  \n  \n  \n\rt<sub>n</sub> = s<sub>n</sub> (modulo 500)\n\nTo
-  create each line segment, we use four consecutive numbers t<sub>n</sub>. That is,
-  the first line segment is given by:\n\n(t<sub>1</sub>, t<sub>2</sub>) to (t<sub>3</sub>,
-  t<sub>4</sub>)\n\nThe first four numbers computed according to the above generator
-  should be: 27, 144, 12 and 232. The first segment would thus be (27,144) to (12,232).\n\nHow
-  many distinct true intersection points are found among the 5000 line segments?\n\n"
+  = 290797  \n  \ns<sub>n+1</sub> = s<sub>n</sub>×s<sub>n</sub> (modulo 50515093)
+  \ \n  \nt<sub>n</sub> = s<sub>n</sub> (modulo 500)\n\nTo create each line segment,
+  we use four consecutive numbers t<sub>n</sub>. That is, the first line segment is
+  given by:\n\n(t<sub>1</sub>, t<sub>2</sub>) to (t<sub>3</sub>, t<sub>4</sub>)\n\nThe
+  first four numbers computed according to the above generator should be: 27, 144,
+  12 and 232. The first segment would thus be (27,144) to (12,232).\n\nHow many distinct
+  true intersection points are found among the 5000 line segments?\n\n"

data/data/problems/166.yml

@@ -1,11 +1,9 @@
 ---
 :id: 166
 :name: Criss Cross
-:url: http://projecteuler.net/problem=166
-:content: "A 4x4 grid is filled with digits d, 0 ![≤]({{ images_dir }}/symbol_le.gif)
-  d ![≤]({{ images_dir }}/symbol_le.gif) 9.\n\nIt can be seen that in the grid\n\n6
-  3 3 0  \n\r5 0 4 3  \n\r0 7 1 4  \n\r1 2 4 5\n\nthe sum of each row and each column
-  has the value 12. Moreover the sum of each diagonal is also 12.\n\nIn how many ways
-  can you fill a 4x4 grid with the digits d, 0 ![≤]({{ images_dir }}/symbol_le.gif)
-  d ![≤]({{ images_dir }}/symbol_le.gif) 9 so that each row, each column, and both
-  diagonals have the same sum?\n\n"
+:url: https://projecteuler.net/problem=166
+:content: "A 4x4 grid is filled with digits d, 0 ≤ d ≤ 9.\n\nIt can be seen that in
+  the grid\n\n6 3 3 0  \n5 0 4 3  \n0 7 1 4  \n1 2 4 5\n\nthe sum of each row and
+  each column has the value 12. Moreover the sum of each diagonal is also 12.\n\nIn
+  how many ways can you fill a 4x4 grid with the digits d, 0 ≤ d ≤ 9 so that each
+  row, each column, and both diagonals have the same sum?\n\n"

data/data/problems/167.yml

@@ -1,14 +1,13 @@
 ---
 :id: 167
 :name: Investigating Ulam sequences
-:url: http://projecteuler.net/problem=167
+:url: https://projecteuler.net/problem=167
 :content: "For two positive integers a and b, the Ulam sequence U(a,b) is defined
-  by U(a,b)<sub>1</sub> = a, U(a,b)<sub>2</sub> = b and for k > 2,\rU(a,b)<sub>k</sub>
+  by U(a,b)<sub>1</sub> = a, U(a,b)<sub>2</sub> = b and for k \\> 2, U(a,b)<sub>k</sub>
   is the smallest integer greater than U(a,b)<sub>(k-1)</sub> which can be written
   in exactly one way as the sum of two distinct previous members of U(a,b).\n\nFor
-  example, the sequence U(1,2) begins with  \n\r1, 2, 3 = 1 + 2, 4 = 1 + 3, 6 = 2
-  + 4, 8 = 2 + 6, 11 = 3 + 8;  \n\r5 does not belong to it because 5 = 1 + 4 = 2 +
-  3 has two representations as the sum of two previous members, likewise 7 = 1 + 6
-  = 3 + 4.\n\nFind ![∑]({{ images_dir }}/symbol_sum.gif)U(2,2<var>n</var>+1)<sub><var>k</var></sub>
-  for 2 ![≤]({{ images_dir }}/symbol_le.gif) <var>n</var> ![≤]({{ images_dir }}/symbol_le.gif)10,
+  example, the sequence U(1,2) begins with  \n1, 2, 3 = 1 + 2, 4 = 1 + 3, 6 = 2 +
+  4, 8 = 2 + 6, 11 = 3 + 8;  \n5 does not belong to it because 5 = 1 + 4 = 2 + 3 has
+  two representations as the sum of two previous members, likewise 7 = 1 + 6 = 3 +
+  4.\n\nFind ∑U(2,2<var>n</var>+1)<sub><var>k</var></sub> for 2 ≤ <var>n</var> ≤10,
   where <var>k</var> = 10<sup>11</sup>.\n\n"

data/data/problems/168.yml

@@ -1,11 +1,9 @@
 ---
 :id: 168
 :name: Number Rotations
-:url: http://projecteuler.net/problem=168
+:url: https://projecteuler.net/problem=168
 :content: "Consider the number 142857. We can right-rotate this number by moving the
-  last digit (7) to the front of it, giving us 714285.  \n\rIt can be verified that
-  714285=5 ![×]({{ images_dir }}/symbol_times.gif)142857.  \n\rThis demonstrates an
-  unusual property of 142857: it is a divisor of its right-rotation.\n\nFind the last
-  5 digits of the sum of all integers <var>n</var>, 10 ![<]({{ images_dir }}/symbol_lt.gif)
-  <var>n</var> ![<]({{ images_dir }}/symbol_lt.gif) 10<sup>100</sup>, that have this
-  property.\n\n"
+  last digit (7) to the front of it, giving us 714285.  \nIt can be verified that
+  714285=5×142857.  \nThis demonstrates an unusual property of 142857: it is a divisor
+  of its right-rotation.\n\nFind the last 5 digits of the sum of all integers <var>n</var>,
+  10 \\< <var>n</var> \\< 10<sup>100</sup>, that have this property.\n\n"

data/data/problems/169.yml

@@ -2,8 +2,8 @@
 :id: 169
 :name: Exploring the number of different ways a number can be expressed as a sum of
   powers of 2
-:url: http://projecteuler.net/problem=169
+:url: https://projecteuler.net/problem=169
 :content: "Define f(0)=1 and f(<var>n</var>) to be the number of different ways <var>n</var>
   can be expressed as a sum of integer powers of 2 using each power no more than twice.\n\nFor
   example, f(10)=5 since there are five different ways to express 10:\n\n1 + 1 + 8
-  \ \n\r1 + 1 + 4 + 4  \n1 + 1 + 2 + 2 + 4  \n\r2 + 4 + 4  \n\r2 + 8\n\nWhat is f(10<sup>25</sup>)?\n\n"
+  \ \n1 + 1 + 4 + 4  \n1 + 1 + 2 + 2 + 4  \n2 + 4 + 4  \n2 + 8\n\nWhat is f(10<sup>25</sup>)?\n\n"

data/data/problems/17.yml

@@ -1,11 +1,11 @@
 ---
 :id: 17
 :name: Number letter counts
-:url: http://projecteuler.net/problem=17
+:url: https://projecteuler.net/problem=17
 :content: "If the numbers 1 to 5 are written out in words: one, two, three, four,
   five, then there are 3 + 3 + 5 + 4 + 4 = 19 letters used in total.\n\nIf all the
   numbers from 1 to 1000 (one thousand) inclusive were written out in words, how many
-  letters would be used?\n\n  \n  \n\n**NOTE:** Do not count spaces or hyphens. For
-  example, 342 (three hundred and forty-two) contains 23 letters and 115 (one hundred
-  and fifteen) contains 20 letters. The use of \"and\" when writing out numbers is
-  in compliance with British usage.\n\n"
+  letters would be used?\n\n  \n\n**NOTE:** Do not count spaces or hyphens. For example,
+  342 (three hundred and forty-two) contains 23 letters and 115 (one hundred and fifteen)
+  contains 20 letters. The use of \"and\" when writing out numbers is in compliance
+  with British usage.\n\n"

data/data/problems/170.yml

@@ -1,13 +1,12 @@
 ---
 :id: 170
 :name: Find the largest 0 to 9 pandigital that can be formed by concatenating products
-:url: http://projecteuler.net/problem=170
-:content: "Take the number 6 and multiply it by each of 1273 and 9854:\n\n6 ![×]({{
-  images_dir }}/symbol_times.gif) 1273 = 7638  \n\r6 ![×]({{ images_dir }}/symbol_times.gif)
-  9854 = 59124\n\nBy concatenating these products we get the 1 to 9 pandigital 763859124.
-  We will call 763859124 the \"concatenated product of 6 and (1273,9854)\". Notice
-  too, that the concatenation of the input numbers, 612739854, is also 1 to 9 pandigital.\n\nThe
-  same can be done for 0 to 9 pandigital numbers.\n\nWhat is the largest 0 to 9 pandigital
-  10-digit concatenated product of an integer with two or more other integers, such
-  that the concatenation of the input numbers is also a 0 to 9 pandigital 10-digit
-  number?\n\n"
+:url: https://projecteuler.net/problem=170
+:content: "Take the number 6 and multiply it by each of 1273 and 9854:\n\n6 × 1273
+  = 7638  \n6 × 9854 = 59124\n\nBy concatenating these products we get the 1 to 9
+  pandigital 763859124. We will call 763859124 the \"concatenated product of 6 and
+  (1273,9854)\". Notice too, that the concatenation of the input numbers, 612739854,
+  is also 1 to 9 pandigital.\n\nThe same can be done for 0 to 9 pandigital numbers.\n\nWhat
+  is the largest 0 to 9 pandigital 10-digit concatenated product of an integer with
+  two or more other integers, such that the concatenation of the input numbers is
+  also a 0 to 9 pandigital 10-digit number?\n\n"

data/data/problems/171.yml

@@ -1,11 +1,10 @@
 ---
 :id: 171
 :name: Finding numbers for which the sum of the squares of the digits is a square
-:url: http://projecteuler.net/problem=171
+:url: https://projecteuler.net/problem=171
 :content: "For a positive integer <var>n</var>, let f(<var>n</var>) be the sum of
   the squares of the digits (in base 10) of <var>n</var>, e.g.\n\nf(3) = 3<sup>2</sup>
-  = 9,  \n\rf(25) = 2<sup>2</sup> + 5<sup>2</sup> = 4 + 25 = 29,  \n\rf(442) = 4<sup>2</sup>
+  = 9,  \nf(25) = 2<sup>2</sup> + 5<sup>2</sup> = 4 + 25 = 29,  \nf(442) = 4<sup>2</sup>
   + 4<sup>2</sup> + 2<sup>2</sup> = 16 + 16 + 4 = 36\n\nFind the last nine digits
-  of the sum of all <var>n</var>, 0 ![<]({{ images_dir }}/symbol_lt.gif) <var>n</var>
-  ![<]({{ images_dir }}/symbol_lt.gif) 10<sup>20</sup>, such that f(<var>n</var>)
-  is a perfect square.\n\n"
+  of the sum of all <var>n</var>, 0 \\< <var>n</var> \\< 10<sup>20</sup>, such that
+  f(<var>n</var>) is a perfect square.\n\n"

data/data/problems/172.yml

@@ -1,7 +1,6 @@
 ---
 :id: 172
 :name: Investigating numbers with few repeated digits
-:url: http://projecteuler.net/problem=172
-:content: |+
-  How many 18-digit numbers <var>n</var> (without leading zeros) are there such that no digit occurs more than three times in <var>n</var>?
-
+:url: https://projecteuler.net/problem=172
+:content: "How many 18-digit numbers <var>n</var> (without leading zeros) are there
+  such that no digit occurs more than three times in <var>n</var>?\n\n"

data/data/problems/173.yml

@@ -2,11 +2,11 @@
 :id: 173
 :name: Using up to one million tiles how many different "hollow" square laminae can
   be formed?
-:url: http://projecteuler.net/problem=173
+:url: https://projecteuler.net/problem=173
 :content: |+
   We shall define a square lamina to be a square outline with a square "hole" so that the shape possesses vertical and horizontal symmetry. For example, using exactly thirty-two square tiles we can form two different square laminae:
 
-   ![]({{ images_dir }}/p_173_square_laminas.gif)
+   ![]({{ images_dir }}/p173_square_laminas.gif)
 
   With one-hundred tiles, and not necessarily using all of the tiles at one time, it is possible to form forty-one different square laminae.
 

data/data/problems/174.yml

@@ -2,17 +2,17 @@
 :id: 174
 :name: Counting the number of "hollow" square laminae that can form one, two, three,
   ... distinct arrangements
-:url: http://projecteuler.net/problem=174
+:url: https://projecteuler.net/problem=174
 :content: |+
   We shall define a square lamina to be a square outline with a square "hole" so that the shape possesses vertical and horizontal symmetry.
 
   Given eight tiles it is possible to form a lamina in only one way: 3x3 square with a 1x1 hole in the middle. However, using thirty-two tiles it is possible to form two distinct laminae.
 
-   ![]({{ images_dir }}/p_173_square_laminas.gif)
+   ![]({{ images_dir }}/p173_square_laminas.gif)
 
   If <var>t</var> represents the number of tiles used, we shall say that <var>t</var> = 8 is type L(1) and <var>t</var> = 32 is type L(2).
 
-  Let N(<var>n</var>) be the number of <var>t</var> ![≤]({{ images_dir }}/symbol_le.gif) 1000000 such that <var>t</var> is type L(<var>n</var>); for example, N(15) = 832.
+  Let N(<var>n</var>) be the number of <var>t</var> ≤ 1000000 such that <var>t</var> is type L(<var>n</var>); for example, N(15) = 832.
 
-  What is ![∑]({{ images_dir }}/symbol_sum.gif) N(<var>n</var>) for 1 ![≤]({{ images_dir }}/symbol_le.gif) <var>n</var> ![≤]({{ images_dir }}/symbol_le.gif) 10?
+  What is ∑ N(<var>n</var>) for 1 ≤ <var>n</var> ≤ 10?
 

data/data/problems/175.yml

@@ -2,18 +2,17 @@
 :id: 175
 :name: Fractions involving the number of different ways a number can be expressed
   as a sum of powers of 2
-:url: http://projecteuler.net/problem=175
-:content: "\rDefine f(0)=1 and f(<var>n</var>) to be the number of ways to write <var>n</var>
-  as a sum of powers of 2 where no power occurs more than twice.   \n  \n  \n\r\rFor
-  example, f(10)=5 since there are five different ways to express 10:  \n10 = 8+2
-  = 8+1+1 = 4+4+2 = 4+2+2+1+1 = 4+4+1+1  \n  \n  \n\r\rIt can be shown that for every
-  fraction <var>p/q</var> (<var>p</var> ![>]({{ images_dir }}/symbol_gt.gif)0, <var>q</var>
-  ![>]({{ images_dir }}/symbol_gt.gif)0) there exists at least one integer <var>n</var>
-  such that  \n f(<var>n</var>)/f(<var>n</var>-1)=<var>p/q</var>.  \n  \n  \n\rFor
-  instance, the smallest <var>n</var> for which f(<var>n</var>)/f(<var>n</var>-1)=13/17
-  is 241.  \n\rThe binary expansion of 241 is 11110001.  \n\rReading this binary number
+:url: https://projecteuler.net/problem=175
+:content: "\r Define f(0)=1 and f(<var>n</var>) to be the number of ways to write
+  <var>n</var> as a sum of powers of 2 where no power occurs more than twice.   \n
+  \ \nFor example, f(10)=5 since there are five different ways to express 10:  \n10
+  = 8+2 = 8+1+1 = 4+4+2 = 4+2+2+1+1 = 4+4+1+1  \n  \nIt can be shown that for every
+  fraction <var>p/q</var> (<var>p</var>\\>0, <var>q</var>\\>0) there exists at least
+  one integer <var>n</var> such that  \n f(<var>n</var>)/f(<var>n</var>-1)=<var>p/q</var>.
+  \ \n  \nFor instance, the smallest <var>n</var> for which f(<var>n</var>)/f(<var>n</var>-1)=13/17
+  is 241.  \nThe binary expansion of 241 is 11110001.  \nReading this binary number
   from the most significant bit to the least significant bit there are 4 one's, 3
   zeroes and 1 one. We shall call the string 4,3,1 the Shortened Binary Expansion
-  of 241.  \n  \n  \n\rFind the Shortened Binary Expansion of the smallest <var>n</var>
-  for which  \n f(<var>n</var>)/f(<var>n</var>-1)=123456789/987654321.  \n  \n  \n\rGive
-  your answer as comma separated integers, without any whitespaces.\r\n"
+  of 241.  \n  \nFind the Shortened Binary Expansion of the smallest <var>n</var>
+  for which  \n f(<var>n</var>)/f(<var>n</var>-1)=123456789/987654321.  \n  \nGive
+  your answer as comma separated integers, without any whitespaces.\n"

data/data/problems/176.yml

@@ -1,7 +1,7 @@
 ---
 :id: 176
 :name: Right-angled triangles that share a cathetus
-:url: http://projecteuler.net/problem=176
+:url: https://projecteuler.net/problem=176
 :content: |+
   The four right-angled triangles with sides (9,12,15), (12,16,20), (5,12,13) and (12,35,37) all have one of the shorter sides (catheti) equal to 12. It can be shown that no other integer sided right-angled triangle exists with one of the catheti equal to 12.
 

data/data/problems/177.yml

@@ -1,11 +1,11 @@
 ---
 :id: 177
 :name: Integer angled Quadrilaterals
-:url: http://projecteuler.net/problem=177
+:url: https://projecteuler.net/problem=177
 :content: |+
   Let ABCD be a convex quadrilateral, with diagonals AC and BD. At each vertex the diagonal makes an angle with each of the two sides, creating eight corner angles.
 
-  ![]({{ images_dir }}/p_177_quad.gif)
+  ![]({{ images_dir }}/p177_quad.gif)
 
   For example, at vertex A, the two angles are CAD, CAB.
 

data/data/problems/178.yml

@@ -1,9 +1,9 @@
 ---
 :id: 178
 :name: Step Numbers
-:url: http://projecteuler.net/problem=178
-:content: "\rConsider the number 45656.   \n\rIt can be seen that each pair of consecutive
-  digits of 45656 has a difference of one.  \n\rA number for which every pair of consecutive
-  digits has a difference of one is called a step number.  \n\rA pandigital number
-  contains every decimal digit from 0 to 9 at least once.  \n\r\rHow many pandigital
-  step numbers less than 10<sup>40</sup> are there?\r\r\n"
+:url: https://projecteuler.net/problem=178
+:content: "\r Consider the number 45656.   \nIt can be seen that each pair of consecutive
+  digits of 45656 has a difference of one.  \nA number for which every pair of consecutive
+  digits has a difference of one is called a step number.  \nA pandigital number contains
+  every decimal digit from 0 to 9 at least once.  \nHow many pandigital step numbers
+  less than 10<sup>40</sup> are there?\n"

data/data/problems/179.yml

@@ -1,7 +1,7 @@
 ---
 :id: 179
 :name: Consecutive positive divisors
-:url: http://projecteuler.net/problem=179
-:content: |+
-  Find the number of integers 1 ![<]({{ images_dir }}/symbol_lt.gif) n ![<]({{ images_dir }}/symbol_lt.gif) 10<sup>7</sup>, for which <var>n</var> and <var>n</var> + 1 have the same number of positive divisors. For example, 14 has the positive divisors 1, 2, 7, 14 while 15 has 1, 3, 5, 15.
-
+:url: https://projecteuler.net/problem=179
+:content: "Find the number of integers 1 \\< n \\< 10<sup>7</sup>, for which <var>n</var>
+  and <var>n</var> + 1 have the same number of positive divisors. For example, 14
+  has the positive divisors 1, 2, 7, 14 while 15 has 1, 3, 5, 15.\n\n"

data/data/problems/18.yml

@@ -1,17 +1,16 @@
 ---
 :id: 18
 :name: Maximum path sum I
-:url: http://projecteuler.net/problem=18
+:url: https://projecteuler.net/problem=18
 :content: "By starting at the top of the triangle below and moving to adjacent numbers
   on the row below, the maximum total from top to bottom is 23.\n\n**3**  \n**7**
-  4  \n\r2 **4** 6  \n\r8 5 **9** 3\n\nThat is, 3 + 7 + 4 + 9 = 23.\n\nFind the maximum
-  total from top to bottom of the triangle below:\n\n75  \n\r95 64  \n\r17 47 82  \n\r18
-  35 87 10  \n\r20 04 82 47 65  \n\r19 01 23 75 03 34  \n\r88 02 77 73 07 63 67  \n\r99
-  65 04 28 06 16 70 92  \n\r41 41 26 56 83 40 80 70 33  \n\r41 48 72 33 47 32 37 16
-  94 29  \n\r53 71 44 65 25 43 91 52 97 51 14  \n\r70 11 33 28 77 73 17 78 39 68 17
-  57  \n\r91 71 52 38 17 14 91 43 58 50 27 29 48  \n\r63 66 04 68 89 53 67 30 73 16
-  69 87 40 31  \n\r04 62 98 27 23 09 70 98 73 93 38 53 60 04 23\n\n**NOTE:** As there
-  are only 16384 routes, it is possible to solve this problem by trying every route.
-  However, [Problem 67](problem=67), is the same challenge with a triangle containing
-  one-hundred rows; it cannot be solved by brute force, and requires a clever method!
-  ;o)\n\n"
+  4  \n2 **4** 6  \n8 5 **9** 3\n\nThat is, 3 + 7 + 4 + 9 = 23.\n\nFind the maximum
+  total from top to bottom of the triangle below:\n\n75  \n95 64  \n17 47 82  \n18
+  35 87 10  \n20 04 82 47 65  \n19 01 23 75 03 34  \n88 02 77 73 07 63 67  \n99 65
+  04 28 06 16 70 92  \n41 41 26 56 83 40 80 70 33  \n41 48 72 33 47 32 37 16 94 29
+  \ \n53 71 44 65 25 43 91 52 97 51 14  \n70 11 33 28 77 73 17 78 39 68 17 57  \n91
+  71 52 38 17 14 91 43 58 50 27 29 48  \n63 66 04 68 89 53 67 30 73 16 69 87 40 31
+  \ \n04 62 98 27 23 09 70 98 73 93 38 53 60 04 23\n\n**NOTE:** As there are only
+  16384 routes, it is possible to solve this problem by trying every route. However,
+  [Problem 67](problem=67), is the same challenge with a triangle containing one-hundred
+  rows; it cannot be solved by brute force, and requires a clever method! ;o)\n\n"