1097 lines
31 KiB
HTML
1097 lines
31 KiB
HTML
<!doctype html>
|
|
<html lang="en">
|
|
<head>
|
|
<meta charset="utf-8">
|
|
<meta name="viewport" content="width=device-width, initial-scale=1, shrink-to-fit=no">
|
|
<meta name="description" content="Felix Martin's Homepage">
|
|
<link rel="shortcut icon" type="image/png" href="https://www.felixm.de/static/mannaz.png"/>
|
|
<title>Euler - Felix Martin</title>
|
|
<meta name="author" content="Felix Martin">
|
|
<link href="https://www.felixm.de/static/template.css" rel="stylesheet">
|
|
</head>
|
|
<body>
|
|
<header>
|
|
<div class="container">
|
|
<div class="row">
|
|
<div class="col">
|
|
<h1><a href="https://www.felixm.de">Felix Martin</a></h1>
|
|
</div>
|
|
</div>
|
|
</header>
|
|
|
|
<main role="main">
|
|
<div class="container">
|
|
<div class="row">
|
|
<div class="col">
|
|
<h2>Project Euler</h2>
|
|
</div>
|
|
</div>
|
|
<div class="row">
|
|
<div class="col">
|
|
<table class="table table-hover table-striped">
|
|
<thead>
|
|
<tr>
|
|
<th style="width: 20%" scope="col">Link</th>
|
|
<th style="width: 30%" scope="col">Completion date</th>
|
|
<th style="width: 50%" scope="col">Tags</th>
|
|
</tr>
|
|
</thead>
|
|
<tbody>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem001.html">Problem 001</a></td>
|
|
<td>Tue, 19 Aug 2014, 20:11</td>
|
|
<td>
|
|
|
|
<kbd>brute force</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem002.html">Problem 002</a></td>
|
|
<td>Tue, 19 Aug 2014, 20:36</td>
|
|
<td>
|
|
|
|
<kbd>fibonacci</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem003.html">Problem 003</a></td>
|
|
<td>Tue, 19 Aug 2014, 23:35</td>
|
|
<td>
|
|
|
|
<kbd>prime</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem004.html">Problem 004</a></td>
|
|
<td>Wed, 20 Aug 2014, 13:27</td>
|
|
<td>
|
|
|
|
<kbd>palindrome</kbd>
|
|
|
|
<kbd>combinations</kbd>
|
|
|
|
<kbd>brute force</kbd>
|
|
|
|
<kbd>timeit</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem005.html">Problem 005</a></td>
|
|
<td>Wed, 20 Aug 2014, 14:32</td>
|
|
<td>
|
|
|
|
<kbd>reduce</kbd>
|
|
|
|
<kbd>divisible</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem006.html">Problem 006</a></td>
|
|
<td>Wed, 20 Aug 2014, 15:13</td>
|
|
<td>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem007.html">Problem 007</a></td>
|
|
<td>Wed, 20 Aug 2014, 15:40</td>
|
|
<td>
|
|
|
|
<kbd>prime</kbd>
|
|
|
|
<kbd>nth prime</kbd>
|
|
|
|
<kbd>nth</kbd>
|
|
|
|
<kbd>generator</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem008.html">Problem 008</a></td>
|
|
<td>Wed, 20 Aug 2014, 16:03</td>
|
|
<td>
|
|
|
|
<kbd>product</kbd>
|
|
|
|
<kbd>reduce</kbd>
|
|
|
|
<kbd>slice</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem009.html">Problem 009</a></td>
|
|
<td>Wed, 20 Aug 2014, 17:06</td>
|
|
<td>
|
|
|
|
<kbd>brute force</kbd>
|
|
|
|
<kbd>pythagorean</kbd>
|
|
|
|
<kbd>triplet</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem010.html">Problem 010</a></td>
|
|
<td>Wed, 20 Aug 2014, 20:28</td>
|
|
<td>
|
|
|
|
<kbd>primes</kbd>
|
|
|
|
<kbd>brute force</kbd>
|
|
|
|
<kbd>timeit</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem011.html">Problem 011</a></td>
|
|
<td>Sun, 31 Aug 2014, 07:39</td>
|
|
<td>
|
|
|
|
<kbd>brute force</kbd>
|
|
|
|
<kbd>product</kbd>
|
|
|
|
<kbd>matrix</kbd>
|
|
|
|
<kbd>tricky</kbd>
|
|
|
|
<kbd>diagonal</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem012.html">Problem 012</a></td>
|
|
<td>Sun, 31 Aug 2014, 17:07</td>
|
|
<td>
|
|
|
|
<kbd>triangular</kbd>
|
|
|
|
<kbd>number</kbd>
|
|
|
|
<kbd>divisors</kbd>
|
|
|
|
<kbd>factorization</kbd>
|
|
|
|
<kbd>prime</kbd>
|
|
|
|
<kbd>group</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem013.html">Problem 013</a></td>
|
|
<td>Sun, 31 Aug 2014, 19:03</td>
|
|
<td>
|
|
|
|
<kbd>brute force</kbd>
|
|
|
|
<kbd>sum</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem014.html">Problem 014</a></td>
|
|
<td>Sun, 31 Aug 2014, 19:45</td>
|
|
<td>
|
|
|
|
<kbd>collatz</kbd>
|
|
|
|
<kbd>cache</kbd>
|
|
|
|
<kbd>deque</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem015.html">Problem 015</a></td>
|
|
<td>Sun, 31 Aug 2014, 20:05</td>
|
|
<td>
|
|
|
|
<kbd>factorial</kbd>
|
|
|
|
<kbd>grid</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem016.html">Problem 016</a></td>
|
|
<td>Sun, 31 Aug 2014, 20:49</td>
|
|
<td>
|
|
|
|
<kbd>c</kbd>
|
|
|
|
<kbd>manual</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem017.html">Problem 017</a></td>
|
|
<td>Sun, 31 Aug 2014, 21:20</td>
|
|
<td>
|
|
|
|
<kbd>count</kbd>
|
|
|
|
<kbd>numbers</kbd>
|
|
|
|
<kbd>tricky</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem018.html">Problem 018</a></td>
|
|
<td>Thu, 4 Sep 2014, 20:38</td>
|
|
<td>
|
|
|
|
<kbd>fold</kbd>
|
|
|
|
<kbd>reduce</kbd>
|
|
|
|
<kbd>search</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem019.html">Problem 019</a></td>
|
|
<td>Fri, 5 Sep 2014, 09:56</td>
|
|
<td>
|
|
|
|
<kbd>weekdays</kbd>
|
|
|
|
<kbd>brain</kbd>
|
|
|
|
<kbd>brute force</kbd>
|
|
|
|
<kbd>leap year</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem020.html">Problem 020</a></td>
|
|
<td>Fri, 5 Sep 2014, 10:42</td>
|
|
<td>
|
|
|
|
<kbd>factorial</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem021.html">Problem 021</a></td>
|
|
<td>Fri, 5 Sep 2014, 14:39</td>
|
|
<td>
|
|
|
|
<kbd>amicable</kbd>
|
|
|
|
<kbd>sieve of eratosthenes</kbd>
|
|
|
|
<kbd>factors</kbd>
|
|
|
|
<kbd>timeit</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem022.html">Problem 022</a></td>
|
|
<td>Fri, 5 Sep 2014, 15:24</td>
|
|
<td>
|
|
|
|
<kbd>sorting</kbd>
|
|
|
|
<kbd>lexicographical order</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem023.html">Problem 023</a></td>
|
|
<td>Thu, 5 Nov 2015, 14:48</td>
|
|
<td>
|
|
|
|
<kbd>perfect number</kbd>
|
|
|
|
<kbd>abundant</kbd>
|
|
|
|
<kbd>factors</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem024.html">Problem 024</a></td>
|
|
<td>Thu, 5 Nov 2015, 16:04</td>
|
|
<td>
|
|
|
|
<kbd>permutation</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem025.html">Problem 025</a></td>
|
|
<td>Fri, 5 Sep 2014, 14:57</td>
|
|
<td>
|
|
|
|
<kbd>fibonacci</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem026.html">Problem 026</a></td>
|
|
<td>Mon, 9 Nov 2015, 22:11</td>
|
|
<td>
|
|
|
|
<kbd>reciprocal</kbd>
|
|
|
|
<kbd>division</kbd>
|
|
|
|
<kbd>nominator</kbd>
|
|
|
|
<kbd>denominator</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem027.html">Problem 027</a></td>
|
|
<td>Mon, 21 Aug 2017, 21:11</td>
|
|
<td>
|
|
|
|
<kbd>quadratic</kbd>
|
|
|
|
<kbd>primes</kbd>
|
|
|
|
<kbd>formula</kbd>
|
|
|
|
<kbd>brain</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem028.html">Problem 028</a></td>
|
|
<td>Wed, 23 Aug 2017, 15:54</td>
|
|
<td>
|
|
|
|
<kbd>spiral</kbd>
|
|
|
|
<kbd>diagonals</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem029.html">Problem 029</a></td>
|
|
<td>Fri, 25 Aug 2017, 10:03</td>
|
|
<td>
|
|
|
|
<kbd>distinct</kbd>
|
|
|
|
<kbd>powers</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem030.html">Problem 030</a></td>
|
|
<td>Fri, 25 Aug 2017, 12:13</td>
|
|
<td>
|
|
|
|
<kbd>digit</kbd>
|
|
|
|
<kbd>powers</kbd>
|
|
|
|
<kbd>brute force</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem031.html">Problem 031</a></td>
|
|
<td>Fri, 25 Aug 2017, 13:02</td>
|
|
<td>
|
|
|
|
<kbd>recursion</kbd>
|
|
|
|
<kbd>coins</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem032.html">Problem 032</a></td>
|
|
<td>Wed, 30 Aug 2017, 14:25</td>
|
|
<td>
|
|
|
|
<kbd>pandigital</kbd>
|
|
|
|
<kbd>products</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem033.html">Problem 033</a></td>
|
|
<td>Mon, 12 Feb 2018, 17:29</td>
|
|
<td>
|
|
|
|
<kbd>gcd</kbd>
|
|
|
|
<kbd>curious</kbd>
|
|
|
|
<kbd>faction</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem034.html">Problem 034</a></td>
|
|
<td>Mon, 12 Feb 2018, 17:57</td>
|
|
<td>
|
|
|
|
<kbd>factorial</kbd>
|
|
|
|
<kbd>brute force</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem035.html">Problem 035</a></td>
|
|
<td>Tue, 13 Feb 2018, 09:14</td>
|
|
<td>
|
|
|
|
<kbd>circular</kbd>
|
|
|
|
<kbd>combinations</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem036.html">Problem 036</a></td>
|
|
<td>Fri, 11 May 2018, 02:38</td>
|
|
<td>
|
|
|
|
<kbd>palindrome</kbd>
|
|
|
|
<kbd>brute force</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem037.html">Problem 037</a></td>
|
|
<td>Sun, 13 May 2018, 16:46</td>
|
|
<td>
|
|
|
|
<kbd>primes</kbd>
|
|
|
|
<kbd>truncated</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem038.html">Problem 038</a></td>
|
|
<td>Sat, 19 May 2018, 23:45</td>
|
|
<td>
|
|
|
|
<kbd>concatenated</kbd>
|
|
|
|
<kbd>product</kbd>
|
|
|
|
<kbd>pandigital</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem039.html">Problem 039</a></td>
|
|
<td>Sun, 20 May 2018, 21:16</td>
|
|
<td>
|
|
|
|
<kbd>triangle</kbd>
|
|
|
|
<kbd>right</kbd>
|
|
|
|
<kbd>integer</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem040.html">Problem 040</a></td>
|
|
<td>Sun, 20 May 2018, 00:40</td>
|
|
<td>
|
|
|
|
<kbd>champernowne</kbd>
|
|
|
|
<kbd>product</kbd>
|
|
|
|
<kbd>fraction</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem041.html">Problem 041</a></td>
|
|
<td>Wed, 19 Dec 2018, 20:14</td>
|
|
<td>
|
|
|
|
<kbd>pandigital</kbd>
|
|
|
|
<kbd>prime</kbd>
|
|
|
|
<kbd>fermat</kbd>
|
|
|
|
<kbd>test</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem042.html">Problem 042</a></td>
|
|
<td>Thu, 20 Dec 2018, 16:14</td>
|
|
<td>
|
|
|
|
<kbd>triangle</kbd>
|
|
|
|
<kbd>words</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem043.html">Problem 043</a></td>
|
|
<td>Fri, 21 Dec 2018, 16:28</td>
|
|
<td>
|
|
|
|
<kbd>pandigital</kbd>
|
|
|
|
<kbd>divisibility</kbd>
|
|
|
|
<kbd>permutations</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem044.html">Problem 044</a></td>
|
|
<td>Sat, 22 Dec 2018, 22:57</td>
|
|
<td>
|
|
|
|
<kbd>pentagonal</kbd>
|
|
|
|
<kbd>brute force</kbd>
|
|
|
|
<kbd>improve</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem045.html">Problem 045</a></td>
|
|
<td>Sat, 22 Dec 2018, 23:17</td>
|
|
<td>
|
|
|
|
<kbd>triangular</kbd>
|
|
|
|
<kbd>pentagonal</kbd>
|
|
|
|
<kbd>hexagonal</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem046.html">Problem 046</a></td>
|
|
<td>Sat, 22 Dec 2018, 23:39</td>
|
|
<td>
|
|
|
|
<kbd>prime</kbd>
|
|
|
|
<kbd>goldbach</kbd>
|
|
|
|
<kbd>composite</kbd>
|
|
|
|
<kbd>square</kbd>
|
|
|
|
<kbd>fermat</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem047.html">Problem 047</a></td>
|
|
<td>Sun, 23 Dec 2018, 00:24</td>
|
|
<td>
|
|
|
|
<kbd>trial division</kbd>
|
|
|
|
<kbd>prime</kbd>
|
|
|
|
<kbd>brute force</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem048.html">Problem 048</a></td>
|
|
<td>Sun, 23 Dec 2018, 00:32</td>
|
|
<td>
|
|
|
|
<kbd>brute force</kbd>
|
|
|
|
<kbd>self power</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem049.html">Problem 049</a></td>
|
|
<td>Sun, 23 Dec 2018, 01:10</td>
|
|
<td>
|
|
|
|
<kbd>permutations</kbd>
|
|
|
|
<kbd>primes</kbd>
|
|
|
|
<kbd>sequence</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem050.html">Problem 050</a></td>
|
|
<td>Sun, 23 Dec 2018, 02:38</td>
|
|
<td>
|
|
|
|
<kbd>brute force</kbd>
|
|
|
|
<kbd>consecutive</kbd>
|
|
|
|
<kbd>primes</kbd>
|
|
|
|
<kbd>search</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem051.html">Problem 051</a></td>
|
|
<td>Sun, 23 Dec 2018, 23:47</td>
|
|
<td>
|
|
|
|
<kbd>prime</kbd>
|
|
|
|
<kbd>combinations</kbd>
|
|
|
|
<kbd>replacement</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem052.html">Problem 052</a></td>
|
|
<td>Mon, 24 Dec 2018, 02:32</td>
|
|
<td>
|
|
|
|
<kbd>digits</kbd>
|
|
|
|
<kbd>permutations</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem053.html">Problem 053</a></td>
|
|
<td>Mon, 24 Dec 2018, 23:29</td>
|
|
<td>
|
|
|
|
<kbd>combinatoric</kbd>
|
|
|
|
<kbd>selection</kbd>
|
|
|
|
<kbd>factorial</kbd>
|
|
|
|
<kbd>airplane</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem054.html">Problem 054</a></td>
|
|
<td>Mon, 24 Dec 2018, 23:30</td>
|
|
<td>
|
|
|
|
<kbd>poker</kbd>
|
|
|
|
<kbd>airplane</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem055.html">Problem 055</a></td>
|
|
<td>Mon, 24 Dec 2018, 23:32</td>
|
|
<td>
|
|
|
|
<kbd>lychrel</kbd>
|
|
|
|
<kbd>airplane</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem056.html">Problem 056</a></td>
|
|
<td>Mon, 24 Dec 2018, 23:33</td>
|
|
<td>
|
|
|
|
<kbd>power</kbd>
|
|
|
|
<kbd>brute force</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem057.html">Problem 057</a></td>
|
|
<td>Mon, 24 Dec 2018, 23:35</td>
|
|
<td>
|
|
|
|
<kbd>square root</kbd>
|
|
|
|
<kbd>gcd</kbd>
|
|
|
|
<kbd>airplane</kbd>
|
|
|
|
<kbd>fractions</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem058.html">Problem 058</a></td>
|
|
<td>Sat, 29 Dec 2018, 09:00</td>
|
|
<td>
|
|
|
|
<kbd>prime</kbd>
|
|
|
|
<kbd>fermat</kbd>
|
|
|
|
<kbd>spiral</kbd>
|
|
|
|
<kbd>diagonal</kbd>
|
|
|
|
<kbd>todo</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem059.html">Problem 059</a></td>
|
|
<td>Sat, 5 Jan 2019, 00:10</td>
|
|
<td>
|
|
|
|
<kbd>xor</kbd>
|
|
|
|
<kbd>cipher</kbd>
|
|
|
|
<kbd>encryption</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem060.html">Problem 060</a></td>
|
|
<td>Sun, 6 Jan 2019, 05:00</td>
|
|
<td>
|
|
|
|
<kbd>prime</kbd>
|
|
|
|
<kbd>pairs</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem061.html">Problem 061</a></td>
|
|
<td>Sun, 6 Jan 2019, 05:32</td>
|
|
<td>
|
|
|
|
<kbd>search</kbd>
|
|
|
|
<kbd>cyclic</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem062.html">Problem 062</a></td>
|
|
<td>Sun, 6 Jan 2019, 05:47</td>
|
|
<td>
|
|
|
|
<kbd>cubes</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem063.html">Problem 063</a></td>
|
|
<td>Sun, 6 Jan 2019, 06:17</td>
|
|
<td>
|
|
|
|
<kbd>powers</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem064.html">Problem 064</a></td>
|
|
<td>Tue, 22 Jan 2019, 05:10</td>
|
|
<td>
|
|
|
|
<kbd>fractions</kbd>
|
|
|
|
<kbd>square roots</kbd>
|
|
|
|
<kbd>sequence</kbd>
|
|
|
|
<kbd>periodic</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem065.html">Problem 065</a></td>
|
|
<td>Wed, 23 Jan 2019, 05:54</td>
|
|
<td>
|
|
|
|
<kbd>expansion</kbd>
|
|
|
|
<kbd>e</kbd>
|
|
|
|
<kbd>sequence</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem066.html">Problem 066</a></td>
|
|
<td>Mon, 28 Jan 2019, 21:08</td>
|
|
<td>
|
|
|
|
<kbd>diophantine</kbd>
|
|
|
|
<kbd>equation</kbd>
|
|
|
|
<kbd>pell's equation</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr>
|
|
|
|
<td><a href="EulerProblem067.html">Problem 067</a></td>
|
|
<td>Fri, 5 Sep 2014, 07:36</td>
|
|
<td>
|
|
|
|
<kbd>reduce</kbd>
|
|
|
|
<kbd>triangle</kbd>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
|
|
<tr class="table-warning">
|
|
|
|
<td><a href="EulerProblem068.html">Problem 068</a></td>
|
|
<td></td>
|
|
<td>
|
|
|
|
</td>
|
|
</tr>
|
|
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
</div>
|
|
</div><!-- /.container -->
|
|
|
|
<!-- FOOTER -->
|
|
<footer class="container">
|
|
<p class="float-right"><a href="#">Back to top</a></p>
|
|
<p>© 2017-2018 Felix Martin ·
|
|
<a href="#">Impressum</a> ·
|
|
<a href="https://code.felixm.de">Code</a>
|
|
</p>
|
|
</footer>
|
|
</main>
|
|
</body>
|
|
</html> |