euler-manager 0.1.1 → 0.2.0

data/data/problems/180.yml

@@ -1,27 +1,24 @@
 ---
 :id: 180
 :name: Rational zeros of a function of three variables
-:url: http://projecteuler.net/problem=180
+:url: https://projecteuler.net/problem=180
 :content: "For any integer <var>n</var>, consider the three functions\n\n<var>f</var><sub>1,<var>n</var></sub>(<var>x</var>,<var>y</var>,<var>z</var>)
   = <var>x</var><sup><var>n</var>+1</sup> + <var>y</var><sup><var>n</var>+1</sup>
-  ![−]({{ images_dir }}/symbol_minus.gif) <var>z</var><sup><var>n</var>+1</sup>  \n<var>f</var><sub>2,<var>n</var></sub>(<var>x</var>,<var>y</var>,<var>z</var>)
+  − <var>z</var><sup><var>n</var>+1</sup>  \n<var>f</var><sub>2,<var>n</var></sub>(<var>x</var>,<var>y</var>,<var>z</var>)
   = (<var>xy</var> + <var>yz</var> + <var>zx</var>)\\*(<var>x</var><sup><var>n</var>-1</sup>
-  + <var>y</var><sup><var>n</var>-1</sup> ![−]({{ images_dir }}/symbol_minus.gif)
-  <var>z</var><sup><var>n</var>-1</sup>)  \n<var>f</var><sub>3,<var>n</var></sub>(<var>x</var>,<var>y</var>,<var>z</var>)
+  + <var>y</var><sup><var>n</var>-1</sup> − <var>z</var><sup><var>n</var>-1</sup>)
+  \ \n<var>f</var><sub>3,<var>n</var></sub>(<var>x</var>,<var>y</var>,<var>z</var>)
   = <var>xyz</var>\\*(<var>x</var><sup><var>n</var>-2</sup> + <var>y</var><sup><var>n</var>-2</sup>
-  ![−]({{ images_dir }}/symbol_minus.gif) <var>z</var><sup><var>n</var>-2</sup>)\n\nand
-  their combination\n\n<var>f</var><sub><var>n</var></sub>(<var>x</var>,<var>y</var>,<var>z</var>)
+  − <var>z</var><sup><var>n</var>-2</sup>)\n\nand their combination\n\n<var>f</var><sub><var>n</var></sub>(<var>x</var>,<var>y</var>,<var>z</var>)
   = <var>f</var><sub>1,<var>n</var></sub>(<var>x</var>,<var>y</var>,<var>z</var>)
   + <var>f</var><sub>2,<var>n</var></sub>(<var>x</var>,<var>y</var>,<var>z</var>)
-  ![−]({{ images_dir }}/symbol_minus.gif) <var>f</var><sub>3,<var>n</var></sub>(<var>x</var>,<var>y</var>,<var>z</var>)\n\nWe
+  − <var>f</var><sub>3,<var>n</var></sub>(<var>x</var>,<var>y</var>,<var>z</var>)\n\nWe
   call (<var>x</var>,<var>y</var>,<var>z</var>) a golden triple of order <var>k</var>
   if <var>x</var>, <var>y</var>, and <var>z</var> are all rational numbers of the
-  form <var>a</var> / <var>b</var> with  \n\r0 ![<]({{ images_dir }}/symbol_lt.gif)
-  <var>a</var> ![<]({{ images_dir }}/symbol_lt.gif) <var>b</var> ![≤]({{ images_dir
-  }}/symbol_le.gif) <var>k</var> and there is (at least) one integer <var>n</var>,
-  so that <var>f</var><sub><var>n</var></sub>(<var>x</var>,<var>y</var>,<var>z</var>)
+  form <var>a</var> / <var>b</var> with  \n0 \\< <var>a</var> \\< <var>b</var> ≤ <var>k</var>
+  and there is (at least) one integer <var>n</var>, so that <var>f</var><sub><var>n</var></sub>(<var>x</var>,<var>y</var>,<var>z</var>)
   = 0.\n\nLet <var>s</var>(<var>x</var>,<var>y</var>,<var>z</var>) = <var>x</var>
-  + <var>y</var> + <var>z</var>.  \n\rLet <var>t</var> = <var>u</var> / <var>v</var>
+  + <var>y</var> + <var>z</var>.  \nLet <var>t</var> = <var>u</var> / <var>v</var>
   be the sum of all distinct <var>s</var>(<var>x</var>,<var>y</var>,<var>z</var>)
   for all golden triples (<var>x</var>,<var>y</var>,<var>z</var>) of order 35.  \n
   All the <var>s</var>(<var>x</var>,<var>y</var>,<var>z</var>) and <var>t</var> must

data/data/problems/181.yml

@@ -1,7 +1,7 @@
 ---
 :id: 181
 :name: Investigating in how many ways objects of two different colours can be grouped
-:url: http://projecteuler.net/problem=181
+:url: https://projecteuler.net/problem=181
 :content: |+
   Having three black objects B and one white object W they can be grouped in 7 ways like this:
 

data/data/problems/182.yml

@@ -1,14 +1,13 @@
 ---
 :id: 182
 :name: RSA encryption
-:url: http://projecteuler.net/problem=182
+:url: https://projecteuler.net/problem=182
 :content: "The RSA encryption is based on the following procedure:\n\nGenerate two
   distinct primes <var>p</var> and <var>q</var>.  \nCompute <var>n=pq</var> and φ=(<var>p</var>-1)(<var>q</var>-1).
-  \ \n\rFind an integer <var>e</var>, 1 ![<]({{ images_dir }}/symbol_lt.gif)<var>e</var>
-  ![<]({{ images_dir }}/symbol_lt.gif)φ, such that gcd(<var>e</var>,φ)=1.\n\nA message
-  in this system is a number in the interval [0,<var>n</var>-1].  \n\rA text to be
-  encrypted is then somehow converted to messages (numbers in the interval [0,<var>n</var>-1]).
-  \ \n\rTo encrypt the text, for each message, <var>m</var>, <var>c</var>=<var>m</var><sup><var>e</var></sup>
+  \ \nFind an integer <var>e</var>, 1\\<<var>e</var>\\<φ, such that gcd(<var>e</var>,φ)=1.\n\nA
+  message in this system is a number in the interval [0,<var>n</var>-1].  \nA text
+  to be encrypted is then somehow converted to messages (numbers in the interval [0,<var>n</var>-1]).
+  \ \nTo encrypt the text, for each message, <var>m</var>, <var>c</var>=<var>m</var><sup><var>e</var></sup>
   mod <var>n</var> is calculated.\n\nTo decrypt the text, the following procedure
   is needed: calculate <var>d</var> such that <var>ed</var>=1 mod φ, then for each
   encrypted message, <var>c</var>, calculate <var>m=c<sup>d</sup></var> mod <var>n</var>.\n\nThere
@@ -16,13 +15,12 @@
   mod <var>n=m</var>.  \nWe call messages <var>m</var> for which <var>m<sup>e</sup></var>
   mod <var>n=m</var> unconcealed messages.\n\nAn issue when choosing <var>e</var>
   is that there should not be too many unconcealed messages.   \nFor instance, let
-  <var>p</var>=19 and <var>q</var>=37.  \n\rThen <var>n</var>=19\\*37=703 and φ=18\\*36=648.
-  \ \n\rIf we choose <var>e</var>=181, then, although gcd(181,648)=1 it turns out
-  that all possible messages  \n<var>m</var> (0 ![≤]({{ images_dir }}/symbol_le.gif)<var>m</var>
-  ![≤]({{ images_dir }}/symbol_le.gif)<var>n</var>-1) are unconcealed when calculating
-  <var>m<sup>e</sup></var> mod <var>n</var>.  \n\rFor any valid choice of <var>e</var>
-  there exist some unconcealed messages.  \n\rIt's important that the number of unconcealed
-  messages is at a minimum.\n\nChoose <var>p</var>=1009 and <var>q</var>=3643.  \n\rFind
-  the sum of all values of <var>e</var>, 1 ![<]({{ images_dir }}/symbol_lt.gif)<var>e</var>
-  ![<]({{ images_dir }}/symbol_lt.gif)φ(1009,3643) and gcd(<var>e</var>,φ)=1, so that
-  the number of unconcealed messages for this value of <var>e</var> is at a minimum.\n\n"
+  <var>p</var>=19 and <var>q</var>=37.  \nThen <var>n</var>=19\\*37=703 and φ=18\\*36=648.
+  \ \nIf we choose <var>e</var>=181, then, although gcd(181,648)=1 it turns out that
+  all possible messages  \n<var>m</var> (0≤<var>m</var>≤<var>n</var>-1) are unconcealed
+  when calculating <var>m<sup>e</sup></var> mod <var>n</var>.  \nFor any valid choice
+  of <var>e</var> there exist some unconcealed messages.  \nIt's important that the
+  number of unconcealed messages is at a minimum.\n\nChoose <var>p</var>=1009 and
+  <var>q</var>=3643.  \nFind the sum of all values of <var>e</var>, 1\\<<var>e</var>\\<φ(1009,3643)
+  and gcd(<var>e</var>,φ)=1, so that the number of unconcealed messages for this value
+  of <var>e</var> is at a minimum.\n\n"

data/data/problems/183.yml

@@ -1,20 +1,17 @@
 ---
 :id: 183
 :name: Maximum product of parts
-:url: http://projecteuler.net/problem=183
+:url: https://projecteuler.net/problem=183
 :content: "Let N be a positive integer and let N be split into <var>k</var> equal
   parts, <var>r</var> = N/<var>k</var>, so that N = <var>r</var> + <var>r</var> +
-  ... + <var>r</var>.  \n\rLet P be the product of these parts, P = <var>r</var> ![×]({{
-  images_dir }}/symbol_times.gif) <var>r</var> ![×]({{ images_dir }}/symbol_times.gif)
-  ... ![×]({{ images_dir }}/symbol_times.gif) <var>r</var> = <var>r</var><sup><var>k</var></sup>.\n\nFor
-  example, if 11 is split into five equal parts, 11 = 2.2 + 2.2 + 2.2 + 2.2 + 2.2,
-  then P = 2.2<sup>5</sup> = 51.53632.\n\nLet M(N) = P<sub>max</sub> for a given value
-  of N.\n\nIt turns out that the maximum for N = 11 is found by splitting eleven into
-  four equal parts which leads to P<sub>max</sub> = (11/4)<sup>4</sup>; that is, M(11)
-  = 14641/256 = 57.19140625, which is a terminating decimal.\n\nHowever, for N = 8
-  the maximum is achieved by splitting it into three equal parts, so M(8) = 512/27,
-  which is a non-terminating decimal.\n\nLet D(N) = N if M(N) is a non-terminating
-  decimal and D(N) = -N if M(N) is a terminating decimal.\n\nFor example, ΣD(N) for
-  5 ![≤]({{ images_dir }}/symbol_le.gif) N ![≤]({{ images_dir }}/symbol_le.gif) 100
-  is 2438.\n\nFind ΣD(N) for 5 ![≤]({{ images_dir }}/symbol_le.gif) N ![≤]({{ images_dir
-  }}/symbol_le.gif) 10000.\n\n"
+  ... + <var>r</var>.  \nLet P be the product of these parts, P = <var>r</var> × <var>r</var>
+  × ... × <var>r</var> = <var>r</var><sup><var>k</var></sup>.\n\nFor example, if 11
+  is split into five equal parts, 11 = 2.2 + 2.2 + 2.2 + 2.2 + 2.2, then P = 2.2<sup>5</sup>
+  = 51.53632.\n\nLet M(N) = P<sub>max</sub> for a given value of N.\n\nIt turns out
+  that the maximum for N = 11 is found by splitting eleven into four equal parts which
+  leads to P<sub>max</sub> = (11/4)<sup>4</sup>; that is, M(11) = 14641/256 = 57.19140625,
+  which is a terminating decimal.\n\nHowever, for N = 8 the maximum is achieved by
+  splitting it into three equal parts, so M(8) = 512/27, which is a non-terminating
+  decimal.\n\nLet D(N) = N if M(N) is a non-terminating decimal and D(N) = -N if M(N)
+  is a terminating decimal.\n\nFor example, ΣD(N) for 5 ≤ N ≤ 100 is 2438.\n\nFind
+  ΣD(N) for 5 ≤ N ≤ 10000.\n\n"

data/data/problems/184.yml

@@ -1,13 +1,13 @@
 ---
 :id: 184
 :name: Triangles containing the origin
-:url: http://projecteuler.net/problem=184
+:url: https://projecteuler.net/problem=184
 :content: |+
-  Consider the set <var>I<sub>r</sub></var> of points (<var>x</var>,<var>y</var>) with integer co-ordinates in the interior of the circle with radius <var>r</var>, centered at the origin, i.e. <var>x</var><sup>2</sup> + <var>y</var><sup>2</sup> ![<]({{ images_dir }}/symbol_lt.gif) <var>r</var><sup>2</sup>.
+  Consider the set <var>I<sub>r</sub></var> of points (<var>x</var>,<var>y</var>) with integer co-ordinates in the interior of the circle with radius <var>r</var>, centered at the origin, i.e. <var>x</var><sup>2</sup> + <var>y</var><sup>2</sup> \< <var>r</var><sup>2</sup>.
 
   For a radius of 2, <var>I</var><sub>2</sub> contains the nine points (0,0), (1,0), (1,1), (0,1), (-1,1), (-1,0), (-1,-1), (0,-1) and (1,-1). There are eight triangles having all three vertices in <var>I</var><sub>2</sub> which contain the origin in the interior. Two of them are shown below, the others are obtained from these by rotation.
 
-  ![]({{ images_dir }}/p_184.gif)
+  ![]({{ images_dir }}/p184.gif)
 
   For a radius of 3, there are 360 triangles containing the origin in the interior and having all vertices in <var>I</var><sub>3</sub> and for <var>I</var><sub>5</sub> the number is 10600.
 

data/data/problems/185.yml

@@ -1,21 +1,21 @@
 ---
 :id: 185
 :name: Number Mind
-:url: http://projecteuler.net/problem=185
+:url: https://projecteuler.net/problem=185
 :content: "The game Number Mind is a variant of the well known game Master Mind.\n\nInstead
   of coloured pegs, you have to guess a secret sequence of digits. After each guess
   you're only told in how many places you've guessed the correct digit. So, if the
   sequence was 1234 and you guessed 2036, you'd be told that you have one correct
   digit; however, you would NOT be told that you also have another digit in the wrong
   place.\n\nFor instance, given the following guesses for a 5-digit secret sequence,\n\n90342
-  ;2 correct  \n\r70794 ;0 correct  \n\r39458 ;2 correct  \n\r34109 ;1 correct  \n\r51545
-  ;2 correct  \n\r12531 ;1 correct\n\nThe correct sequence 39542 is unique.\n\nBased
-  on the following guesses,\n\n5616185650518293 ;2 correct  \n\r3847439647293047 ;1
-  correct  \n\r5855462940810587 ;3 correct  \n\r9742855507068353 ;3 correct  \n\r4296849643607543
-  ;3 correct  \n\r3174248439465858 ;1 correct  \n\r4513559094146117 ;2 correct  \n\r7890971548908067
-  ;3 correct  \n\r8157356344118483 ;1 correct  \n\r2615250744386899 ;2 correct  \n\r8690095851526254
-  ;3 correct  \n\r6375711915077050 ;1 correct  \n\r6913859173121360 ;1 correct  \n\r6442889055042768
-  ;2 correct  \n\r2321386104303845 ;0 correct  \n\r2326509471271448 ;2 correct  \n\r5251583379644322
-  ;2 correct  \n\r1748270476758276 ;3 correct  \n\r4895722652190306 ;1 correct  \n\r3041631117224635
-  ;3 correct  \n\r1841236454324589 ;3 correct  \n\r2659862637316867 ;2 correct\n\nFind
+  ;2 correct  \n70794 ;0 correct  \n39458 ;2 correct  \n34109 ;1 correct  \n51545
+  ;2 correct  \n12531 ;1 correct\n\nThe correct sequence 39542 is unique.\n\nBased
+  on the following guesses,\n\n5616185650518293 ;2 correct  \n3847439647293047 ;1
+  correct  \n5855462940810587 ;3 correct  \n9742855507068353 ;3 correct  \n4296849643607543
+  ;3 correct  \n3174248439465858 ;1 correct  \n4513559094146117 ;2 correct  \n7890971548908067
+  ;3 correct  \n8157356344118483 ;1 correct  \n2615250744386899 ;2 correct  \n8690095851526254
+  ;3 correct  \n6375711915077050 ;1 correct  \n6913859173121360 ;1 correct  \n6442889055042768
+  ;2 correct  \n2321386104303845 ;0 correct  \n2326509471271448 ;2 correct  \n5251583379644322
+  ;2 correct  \n1748270476758276 ;3 correct  \n4895722652190306 ;1 correct  \n3041631117224635
+  ;3 correct  \n1841236454324589 ;3 correct  \n2659862637316867 ;2 correct\n\nFind
   the unique 16-digit secret sequence.\n\n"

data/data/problems/186.yml

@@ -1,19 +1,18 @@
 ---
 :id: 186
 :name: Connectedness of a network
-:url: http://projecteuler.net/problem=186
+:url: https://projecteuler.net/problem=186
 :content: "Here are the records from a busy telephone system with one million users:\n\n|
   RecNr | Caller | Called |\n| 1 | 200007 | 100053 |\n| 2 | 600183 | 500439 |\n| 3
   | 600863 | 701497 |\n| ... | ... | ... |\n\nThe telephone number of the caller and
   the called number in record n are Caller(n) = S<sub>2n-1</sub> and Called(n) = S<sub>2n</sub>
   where S<sub>1,2,3,...</sub> come from the \"Lagged Fibonacci Generator\":\n\nFor
-  1 ![≤]({{ images_dir }}/symbol_le.gif) k ![≤]({{ images_dir }}/symbol_le.gif) 55,
-  S<sub>k</sub> = [100003 - 200003k + 300007k<sup>3</sup>] (modulo 1000000)  \n\rFor
-  56 ![≤]({{ images_dir }}/symbol_le.gif) k, S<sub>k</sub> = [S<sub>k-24</sub> + S<sub>k-55</sub>]
-  (modulo 1000000)\n\nIf Caller(n) = Called(n) then the user is assumed to have misdialled
-  and the call fails; otherwise the call is successful.\n\nFrom the start of the records,
-  we say that any pair of users X and Y are friends if X calls Y or vice-versa. Similarly,
-  X is a friend of a friend of Z if X is a friend of Y and Y is a friend of Z; and
-  so on for longer chains.\n\nThe Prime Minister's phone number is 524287. After how
-  many successful calls, not counting misdials, will 99% of the users (including the
-  PM) be a friend, or a friend of a friend etc., of the Prime Minister?\n\n"
+  1 ≤ k ≤ 55, S<sub>k</sub> = [100003 - 200003k + 300007k<sup>3</sup>] (modulo 1000000)
+  \ \nFor 56 ≤ k, S<sub>k</sub> = [S<sub>k-24</sub> + S<sub>k-55</sub>] (modulo 1000000)\n\nIf
+  Caller(n) = Called(n) then the user is assumed to have misdialled and the call fails;
+  otherwise the call is successful.\n\nFrom the start of the records, we say that
+  any pair of users X and Y are friends if X calls Y or vice-versa. Similarly, X is
+  a friend of a friend of Z if X is a friend of Y and Y is a friend of Z; and so on
+  for longer chains.\n\nThe Prime Minister's phone number is 524287. After how many
+  successful calls, not counting misdials, will 99% of the users (including the PM)
+  be a friend, or a friend of a friend etc., of the Prime Minister?\n\n"

data/data/problems/187.yml

@@ -1,11 +1,11 @@
 ---
 :id: 187
 :name: Semiprimes
-:url: http://projecteuler.net/problem=187
-:content: "A composite is a number containing at least two prime factors. For example,
-  15 = 3 ![×]({{ images_dir }}/symbol_times.gif) 5; 9 = 3 ![×]({{ images_dir }}/symbol_times.gif)
-  3; 12 = 2 ![×]({{ images_dir }}/symbol_times.gif) 2 ![×]({{ images_dir }}/symbol_times.gif)
-  3.\n\nThere are ten composites below thirty containing precisely two, not necessarily
-  distinct, prime factors:\r4, 6, 9, 10, 14, 15, 21, 22, 25, 26.\n\nHow many composite
-  integers, <var>n</var> ![<]({{ images_dir }}/symbol_lt.gif) 10<sup>8</sup>, have
-  precisely two, not necessarily distinct, prime factors?\n\n"
+:url: https://projecteuler.net/problem=187
+:content: |+
+  A composite is a number containing at least two prime factors. For example, 15 = 3 × 5; 9 = 3 × 3; 12 = 2 × 2 × 3.
+
+  There are ten composites below thirty containing precisely two, not necessarily distinct, prime factors: 4, 6, 9, 10, 14, 15, 21, 22, 25, 26.
+
+  How many composite integers, <var>n</var> \< 10<sup>8</sup>, have precisely two, not necessarily distinct, prime factors?
+

data/data/problems/188.yml

@@ -1,9 +1,9 @@
 ---
 :id: 188
 :name: The hyperexponentiation of a number
-:url: http://projecteuler.net/problem=188
+:url: https://projecteuler.net/problem=188
 :content: "The hyperexponentiation or tetration of a number a by a positive integer
-  b, denoted by a↑↑b or <sup>b</sup>a, is recursively defined by:  \n  \n  \n\ra↑↑1
-  = a,  \n\ra↑↑(k+1) = a<sup>(a↑↑k)</sup>.\n\nThus we have e.g. 3↑↑2 = 3<sup>3</sup>
-  = 27, hence 3↑↑3 = 3<sup>27</sup> = 7625597484987 and 3↑↑4 is roughly 10<sup>3.6383346400240996*10^12</sup>.\n\nFind
+  b, denoted by a↑↑b or <sup>b</sup>a, is recursively defined by:  \n  \na↑↑1 = a,
+  \ \na↑↑(k+1) = a<sup>(a↑↑k)</sup>.\n\nThus we have e.g. 3↑↑2 = 3<sup>3</sup> = 27,
+  hence 3↑↑3 = 3<sup>27</sup> = 7625597484987 and 3↑↑4 is roughly 10<sup>3.6383346400240996*10^12</sup>.\n\nFind
   the last 8 digits of 1777↑↑1855.\n\n"

data/data/problems/189.yml

@@ -1,14 +1,14 @@
 ---
 :id: 189
 :name: Tri-colouring a triangular grid
-:url: http://projecteuler.net/problem=189
+:url: https://projecteuler.net/problem=189
 :content: "Consider the following configuration of 64 triangles:\n\n ![]({{ images_dir
-  }}/p_189_grid.gif)\n\nWe wish to colour the interior of each triangle with one of
+  }}/p189_grid.gif)\n\nWe wish to colour the interior of each triangle with one of
   three colours: red, green or blue, so that no two neighbouring triangles have the
   same colour. Such a colouring shall be called valid. Here, two triangles are said
-  to be neighbouring if they share an edge.  \n\rNote: if they only share a vertex,
+  to be neighbouring if they share an edge.  \nNote: if they only share a vertex,
   then they are not neighbours.\n\nFor example, here is a valid colouring of the above
-  grid:\n\n ![]({{ images_dir }}/p_189_colours.gif)\n\nA colouring C' which is obtained
+  grid:\n\n ![]({{ images_dir }}/p189_colours.gif)\n\nA colouring C' which is obtained
   from a colouring C by rotation or reflection is considered _distinct_ from C unless
   the two are identical.\n\nHow many distinct valid colourings are there for the above
   configuration?\n\n"

data/data/problems/19.yml

@@ -1,7 +1,7 @@
 ---
 :id: 19
 :name: Counting Sundays
-:url: http://projecteuler.net/problem=19
+:url: https://projecteuler.net/problem=19
 :content: "You are given the following information, but you may prefer to do some
   research for yourself.\n\n- 1 Jan 1900 was a Monday.\n- Thirty days has September,
   \ \nApril, June and November.  \nAll the rest have thirty-one,  \nSaving February

data/data/problems/190.yml

@@ -1,11 +1,11 @@
 ---
 :id: 190
 :name: Maximising a weighted product
-:url: http://projecteuler.net/problem=190
+:url: https://projecteuler.net/problem=190
 :content: |+
   Let S<sub>m</sub> = (x<sub>1</sub>, x<sub>2</sub>, ... , x<sub>m</sub>) be the m-tuple of positive real numbers with x<sub>1</sub> + x<sub>2</sub> + ... + x<sub>m</sub> = m for which P<sub>m</sub> = x<sub>1</sub> \* x<sub>2</sub><sup>2</sup> \* ... \* x<sub>m</sub><sup>m</sup> is maximised.
 
   For example, it can be verified that [P<sub>10</sub>] = 4112 ([] is the integer part function).
 
-  Find Σ[P<sub>m</sub>] for 2 ![≤]({{ images_dir }}/symbol_le.gif) m ![≤]({{ images_dir }}/symbol_le.gif) 15.
+  Find Σ[P<sub>m</sub>] for 2 ≤ m ≤ 15.
 

data/data/problems/191.yml

@@ -1,14 +1,14 @@
 ---
 :id: 191
 :name: Prize Strings
-:url: http://projecteuler.net/problem=191
+:url: https://projecteuler.net/problem=191
 :content: "A particular school offers cash rewards to children with good attendance
   and punctuality. If they are absent for three consecutive days or late on more than
   one occasion then they forfeit their prize.\n\nDuring an n-day period a trinary
   string is formed for each child consisting of L's (late), O's (on time), and A's
   (absent).\n\nAlthough there are eighty-one trinary strings for a 4-day period that
   can be formed, exactly forty-three strings would lead to a prize:\n\nOOOO OOOA OOOL
-  OOAO OOAA OOAL OOLO OOLA OAOO OAOA  \n\rOAOL OAAO OAAL OALO OALA OLOO OLOA OLAO
-  OLAA AOOO  \n\rAOOA AOOL AOAO AOAA AOAL AOLO AOLA AAOO AAOA AAOL  \n\rAALO AALA
-  ALOO ALOA ALAO ALAA LOOO LOOA LOAO LOAA  \n\rLAOO LAOA LAAO\n\nHow many \"prize\"
-  strings exist over a 30-day period?\n\n"
+  OOAO OOAA OOAL OOLO OOLA OAOO OAOA  \nOAOL OAAO OAAL OALO OALA OLOO OLOA OLAO OLAA
+  AOOO  \nAOOA AOOL AOAO AOAA AOAL AOLO AOLA AAOO AAOA AAOL  \nAALO AALA ALOO ALOA
+  ALAO ALAA LOOO LOOA LOAO LOAA  \nLAOO LAOA LAAO\n\nHow many \"prize\" strings exist
+  over a 30-day period?\n\n"

data/data/problems/192.yml

@@ -1,18 +1,14 @@
 ---
 :id: 192
 :name: Best Approximations
-:url: http://projecteuler.net/problem=192
-:content: "Let <var>x</var> be a real number.  \n\rA _best approximation_ to <var>x</var>
+:url: https://projecteuler.net/problem=192
+:content: "Let <var>x</var> be a real number.  \nA _best approximation_ to <var>x</var>
   for the _denominator bound_ <var>d</var> is a rational number <var>r</var>/<var>s</var>
-  _in reduced form_, with <var>s</var> ![≤]({{ images_dir }}/symbol_le.gif) <var>d</var>,
-  such that any rational number which is closer to <var>x</var> than <var>r</var>/<var>s</var>
-  has a denominator larger than <var>d</var>:\n\n|<var>p</var>/<var>q</var>-<var>x</var>|
-  ![<]({{ images_dir }}/symbol_lt.gif) |<var>r</var>/<var>s</var>-<var>x</var>| ![⇒]({{
-  images_dir }}/symbol_implies.gif) <var>q</var> ![>]({{ images_dir }}/symbol_gt.gif)
-  <var>d</var>\n\nFor example, the best approximation to ![√]({{ images_dir }}/symbol_radic.gif)13
-  for the denominator bound 20 is 18/5 and the best approximation to ![√]({{ images_dir
-  }}/symbol_radic.gif)13 for the denominator bound 30 is 101/28.\n\nFind the sum of
-  all denominators of the best approximations to ![√]({{ images_dir }}/symbol_radic.gif)<var>n</var>
-  for the denominator bound 10<sup>12</sup>, where <var>n</var> is not a perfect square
-  and 1 ![<]({{ images_dir }}/symbol_lt.gif) <var>n</var> ![≤]({{ images_dir }}/symbol_le.gif)
-  100000.\n\n"
+  _in reduced form_, with <var>s</var> ≤ <var>d</var>, such that any rational number
+  which is closer to <var>x</var> than <var>r</var>/<var>s</var> has a denominator
+  larger than <var>d</var>:\n\n|<var>p</var>/<var>q</var>-<var>x</var>| \\< |<var>r</var>/<var>s</var>-<var>x</var>|
+  ⇒ <var>q</var> \\> <var>d</var>\n\nFor example, the best approximation to √13 for
+  the denominator bound 20 is 18/5 and the best approximation to √13 for the denominator
+  bound 30 is 101/28.\n\nFind the sum of all denominators of the best approximations
+  to √<var>n</var> for the denominator bound 10<sup>12</sup>, where <var>n</var> is
+  not a perfect square and 1 \\< <var>n</var> ≤ 100000.\n\n"

data/data/problems/193.yml

@@ -1,7 +1,7 @@
 ---
 :id: 193
 :name: Squarefree Numbers
-:url: http://projecteuler.net/problem=193
+:url: https://projecteuler.net/problem=193
 :content: |+
   A positive integer <var>n</var> is called squarefree, if no square of a prime divides <var>n</var>, thus 1, 2, 3, 5, 6, 7, 10, 11 are squarefree, but not 4, 8, 9, 12.
 

data/data/problems/194.yml

@@ -1,15 +1,15 @@
 ---
 :id: 194
 :name: Coloured Configurations
-:url: http://projecteuler.net/problem=194
-:content: "Consider graphs built with the units A: ![]({{ images_dir }}/p_194_GraphA.png)\rand
-  B: ![]({{ images_dir }}/p_194_GraphB.png), where the units are glued along\rthe
-  vertical edges as in the graph ![]({{ images_dir }}/p_194_Fig.png).\n\nA configuration
-  of type (<var>a</var>,<var>b</var>,<var>c</var>) is a graph thus built of <var>a</var>
+:url: https://projecteuler.net/problem=194
+:content: "Consider graphs built with the units A: ![]({{ images_dir }}/p194_GraphA.png)and
+  B: ![]({{ images_dir }}/p194_GraphB.png), where the units are glued along the vertical
+  edges as in the graph ![]({{ images_dir }}/p194_Fig.png).\n\nA configuration of
+  type (<var>a</var>,<var>b</var>,<var>c</var>) is a graph thus built of <var>a</var>
   units A and <var>b</var> units B, where the graph's vertices are coloured using
   up to <var>c</var> colours, so that no two adjacent vertices have the same colour.
-  \ \n\rThe compound graph above is an example of a configuration of type (2,2,6),
-  in fact of type (2,2,<var>c</var>) for all <var>c</var> ![≥]({{ images_dir }}/symbol_ge.gif)
-  4.\n\nLet N(<var>a</var>,<var>b</var>,<var>c</var>) be the number of configurations
-  of type (<var>a</var>,<var>b</var>,<var>c</var>).  \n\rFor example, N(1,0,3) = 24,
-  N(0,2,4) = 92928 and N(2,2,3) = 20736.\n\nFind the last 8 digits of N(25,75,1984).\n\n"
+  \ \nThe compound graph above is an example of a configuration of type (2,2,6), in
+  fact of type (2,2,<var>c</var>) for all <var>c</var> ≥ 4.\n\nLet N(<var>a</var>,<var>b</var>,<var>c</var>)
+  be the number of configurations of type (<var>a</var>,<var>b</var>,<var>c</var>).
+  \ \nFor example, N(1,0,3) = 24, N(0,2,4) = 92928 and N(2,2,3) = 20736.\n\nFind the
+  last 8 digits of N(25,75,1984).\n\n"

data/data/problems/195.yml

@@ -1,11 +1,10 @@
 ---
 :id: 195
 :name: Inscribed circles of triangles with one angle of 60 degrees
-:url: http://projecteuler.net/problem=195
+:url: https://projecteuler.net/problem=195
 :content: "Let's call an integer sided triangle with exactly one angle of 60 degrees
-  a 60-degree triangle.  \n\rLet <var>r</var> be the radius of the inscribed circle
+  a 60-degree triangle.  \nLet <var>r</var> be the radius of the inscribed circle
   of such a 60-degree triangle.\n\nThere are 1234 60-degree triangles for which <var>r</var>
-  ![≤]({{ images_dir }}/symbol_le.gif) 100.\r  \nLet T(<var>n</var>) be the number
-  of 60-degree triangles for which <var>r</var> ![≤]({{ images_dir }}/symbol_le.gif)
-  <var>n</var>, so  \n\r T(100) = 1234,  T(1000) = 22767, and  T(10000) = 359912.\n\nFind
-  T(1053779).\n\n"
+  ≤ 100.  \nLet T(<var>n</var>) be the number of 60-degree triangles for which <var>r</var>
+  ≤ <var>n</var>, so  \n T(100) = 1234,&nbsp; T(1000) = 22767, and&nbsp; T(10000)
+  = 359912.\n\nFind T(1053779).\n\n"

data/data/problems/196.yml

@@ -1,17 +1,18 @@
 ---
 :id: 196
 :name: Prime triplets
-:url: http://projecteuler.net/problem=196
-:content: "Build a triangle from all positive integers in the following way:\n\n 1
-  \ \n\r 2  3  \n\r 4  5  6  \n\r 7  8  9 10  \n11 12 13 14 15  \n\r16 17 18 19 20
-  21  \n\r22 23 24 25 26 27 28  \n29 30 31 32 33 34 35 36  \n37 38 39 40 41 42 43
-  44 45  \n\r46 47 48 49 50 51 52 53 54 55  \n\r56 57 58 59 60 61 62 63 64 65 66  \n\r.
-  . .\n\nEach positive integer has up to eight neighbours in the triangle.\n\nA set
-  of three primes is called a _prime triplet_ if one of the three primes has the other
-  two as neighbours in the triangle.\n\nFor example, in the second row, the prime
-  numbers 2 and 3 are elements of some prime triplet.\n\nIf row 8 is considered, it
-  contains two primes which are elements of some prime triplet, i.e. 29 and 31.  \n\rIf
-  row 9 is considered, it contains only one prime which is an element of some prime
-  triplet: 37.\n\nDefine S(<var>n</var>) as the sum of the primes in row <var>n</var>
-  which are elements of any prime triplet.  \n\rThen S(8)=60 and S(9)=37.\n\nYou are
-  given that S(10000)=950007619.\n\nFind  S(5678027) + S(7208785).\n\n"
+:url: https://projecteuler.net/problem=196
+:content: "Build a triangle from all positive integers in the following way:\n\n&nbsp;1
+  \ \n&nbsp;2&nbsp; 3  \n&nbsp;4&nbsp;&nbsp;5&nbsp;&nbsp;6  \n&nbsp;7&nbsp;&nbsp;8&nbsp;&nbsp;9
+  10  \n11 12 13 14 15  \n16 17 18 19 20 21  \n22 23 24 25 26 27 28  \n29 30 31 32
+  33 34 35 36  \n37 38 39 40 41 42 43 44 45  \n46 47 48 49 50 51 52 53 54 55  \n56
+  57 58 59 60 61 62 63 64 65 66  \n. . .\n\nEach positive integer has up to eight
+  neighbours in the triangle.\n\nA set of three primes is called a _prime triplet_
+  if one of the three primes has the other two as neighbours in the triangle.\n\nFor
+  example, in the second row, the prime numbers 2 and 3 are elements of some prime
+  triplet.\n\nIf row 8 is considered, it contains two primes which are elements of
+  some prime triplet, i.e. 29 and 31.  \nIf row 9 is considered, it contains only
+  one prime which is an element of some prime triplet: 37.\n\nDefine S(<var>n</var>)
+  as the sum of the primes in row <var>n</var> which are elements of any prime triplet.
+  \ \nThen S(8)=60 and S(9)=37.\n\nYou are given that S(10000)=950007619.\n\nFind
+  &nbsp;S(5678027) + S(7208785).\n\n"

data/data/problems/197.yml

@@ -1,11 +1,10 @@
 ---
 :id: 197
 :name: Investigating the behaviour of a recursively defined sequence
-:url: http://projecteuler.net/problem=197
-:content: "Given is the function <var>f</var>(<var>x</var>) = ![⌊]({{ images_dir }}/symbol_lfloor.gif)2<sup>30.403243784-<var>x</var><sup>2</sup></sup>
-  ![⌋]({{ images_dir }}/symbol_rfloor.gif) ![×]({{ images_dir }}/symbol_times.gif)
-  10<sup>-9</sup> ( ![⌊]({{ images_dir }}/symbol_lfloor.gif) ![⌋]({{ images_dir }}/symbol_rfloor.gif)
-  is the floor-function),  \n\rthe sequence <var>u<sub>n</sub></var> is defined by
-  <var>u</var><sub>0</sub> = -1 and <var>u</var><sub><var>n</var>+1</sub> = <var>f</var>(<var>u<sub>n</sub></var>).\n\nFind
-  <var>u<sub>n</sub></var> + <var>u</var><sub><var>n</var>+1</sub> for <var>n</var>
-  = 10<sup>12</sup>.  \n\rGive your answer with 9 digits after the decimal point.\n\n"
+:url: https://projecteuler.net/problem=197
+:content: "Given is the function <var>f</var>(<var>x</var>) = ⌊2<sup>30.403243784-<var>x</var><sup>2</sup></sup>⌋
+  × 10<sup>-9</sup> ( ⌊ ⌋ is the floor-function),  \nthe sequence <var>u<sub>n</sub></var>
+  is defined by <var>u</var><sub>0</sub> = -1 and <var>u</var><sub><var>n</var>+1</sub>
+  = <var>f</var>(<var>u<sub>n</sub></var>).\n\nFind <var>u<sub>n</sub></var> + <var>u</var><sub><var>n</var>+1</sub>
+  for <var>n</var> = 10<sup>12</sup>.  \nGive your answer with 9 digits after the
+  decimal point.\n\n"