, digitCount: number) => {
- let { value: term } = sequence.next();
- let index = 1;
-
- while (term.toString().length !== digitCount) {
- term = sequence.next().value;
- index += 1;
- }
-
- return {
- value: term,
- index
- };
-};
-
-// Output
-
-const fibonacci = fibonacciSequence();
-const firstTerm = firstTermWithXDigits(fibonacci, 1000);
-
-console.log(firstTerm);
diff --git a/challenges/euler/src/26 - Reciprocal cycles.ts b/challenges/euler/src/26 - Reciprocal cycles.ts
deleted file mode 100644
index 4681c46..0000000
--- a/challenges/euler/src/26 - Reciprocal cycles.ts
+++ /dev/null
@@ -1,54 +0,0 @@
-// A unit fraction contains 1 in the numerator. The decimal representation of the unit fractions with denominators 2 to 10 are given:
-//
-// 1/2= 0.5
-// 1/3= 0.(3)
-// 1/4= 0.25
-// 1/5= 0.2
-// 1/6= 0.1(6)
-// 1/7= 0.(142857)
-// 1/8= 0.125
-// 1/9= 0.(1)
-// 1/10= 0.1
-//
-// Where 0.1(6) means 0.166666..., and has a 1-digit recurring cycle. It can be seen that 1/7 has a 6-digit recurring cycle.
-// Find the value of d < 1000 for which 1/d contains the longest recurring cycle in its decimal fraction part.
-export = {};
-
-const cycleLength = (denominator: number, numerator: number = 1) => {
- let dividend = numerator;
- let position = 1;
- let lastPosition: { [number: number]: number } = {};
-
- while (true) {
- const remainder = dividend % denominator;
-
- // If the remainder is zero, there is no recurring cycle
- if (remainder === 0) return 0;
-
- // If the remainder has been seen before, return.
- if (lastPosition.hasOwnProperty(remainder)) {
- return position - lastPosition[remainder];
- }
-
- // Move onto the next digit
- lastPosition[remainder] = position;
- position++;
- dividend = remainder * 10;
- }
-};
-
-let longestLength = 0;
-let correspondingNumber = null;
-
-for (let i = 1; i < 1000; i++) {
- const length = cycleLength(i);
-
- if (length > longestLength) {
- longestLength = length;
- correspondingNumber = i;
- }
-}
-
-console.log(
- `The number with the longest recurring cycle is ${correspondingNumber} with a length of ${longestLength}.`
-);
diff --git a/challenges/euler/src/28 - Number spiral diagonals.ts b/challenges/euler/src/28 - Number spiral diagonals.ts
deleted file mode 100644
index e599e0c..0000000
--- a/challenges/euler/src/28 - Number spiral diagonals.ts
+++ /dev/null
@@ -1,32 +0,0 @@
-// Starting with the number 1 and moving to the right in a clockwise direction a 5 by 5 spiral is formed as follows:
-// 21 22 23 24 25
-// 20 7 8 9 10
-// 19 6 1 2 11
-// 18 5 4 3 12
-// 17 16 15 14 13
-// It can be verified that the sum of the numbers on the diagonals is 101.
-// What is the sum of the numbers on the diagonals in a 1001 by 1001 spiral formed in the same way?
-export = {};
-
-const sumOfSpiralDiagonals = (size: number) => {
- let sum = 1;
-
- // Matrix is size n
- // Lowest number is n(n - 3) + 4
- // Numbers increase by n - 1
-
- for (let n = 3; n <= size; n += 2) {
- const corners = [];
-
- for (let i = n * (n - 3) + 3; corners.length < 4; i += n - 1) {
- corners.push(i);
- }
-
- sum += corners.reduce((a, b) => a + b);
- }
-
- return sum;
-};
-
-// Output
-console.log(sumOfSpiralDiagonals(1001));
diff --git a/challenges/euler/src/3 - Largest prime factor.ts b/challenges/euler/src/3 - Largest prime factor.ts
deleted file mode 100644
index 9251169..0000000
--- a/challenges/euler/src/3 - Largest prime factor.ts
+++ /dev/null
@@ -1,20 +0,0 @@
-// The prime factors of 13195 are 5, 7, 13 and 29.
-// What is the largest prime factor of the number 600851475143?
-export {};
-
-/**
- * Work out the largest prime factor of a number
- */
-const largestPrimeFactor = (number: number) => {
- let i = 2;
-
- while (i * i <= number) {
- if (number % i) i += 1;
- else number = Math.floor(number / i);
- }
-
- return number;
-};
-
-// Output
-console.log(largestPrimeFactor(600851475143));
diff --git a/challenges/euler/src/30 - Digit fifth powers.ts b/challenges/euler/src/30 - Digit fifth powers.ts
deleted file mode 100644
index c555a1d..0000000
--- a/challenges/euler/src/30 - Digit fifth powers.ts
+++ /dev/null
@@ -1,38 +0,0 @@
-// Surprisingly there are only three numbers that can be written as the sum of fourth powers of their digits:
-// 1634 = 1^4 + 6^4 + 3^4 + 4^4
-// 8208 = 8^4 + 2^4 + 0^4 + 8^4
-// 9474 = 9^4 + 4^4 + 7^4 + 4^4
-// As 1 = 1^4 is not a sum it is not included.
-// The sum of these numbers is 1634 + 8208 + 9474 = 19316.
-// Find the sum of all the numbers that can be written as the sum of fifth powers of their digits.
-export = {};
-
-// something times 9^5 = x digit number
-// 9^5 = 59049 therefore x >= 5
-// 6 * 9^5 = 354294
-
-const powers = [];
-
-for (let i = 0; i < 10; i++) {
- powers.push(i ** 5);
-}
-
-const powerSum = (n: number) => {
- let sum = 0;
-
- while (n > 0) {
- sum += powers[n % 10];
- n = (n / 10) | 0;
- }
-
- return sum;
-};
-
-let sum = 0;
-
-for (let i = 10; i < 6 * powers[9]; i++) {
- if (i === powerSum(i)) sum += i;
-}
-
-// Output
-console.log(sum);
diff --git a/challenges/euler/src/4 - Largest pallindrome product.ts b/challenges/euler/src/4 - Largest pallindrome product.ts
deleted file mode 100644
index 6044c49..0000000
--- a/challenges/euler/src/4 - Largest pallindrome product.ts
+++ /dev/null
@@ -1,28 +0,0 @@
-// A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99.
-// Find the largest palindrome made from the product of two 3-digit numbers.
-export {};
-
-/**
- * Work out the largest pallindromic number between a lower and upper bound.
- */
-const largestPallindromicNumber = (lowerBound: number, upperBound: number) => {
- // Work out all of the products of 3 digit numbers
- const products: number[] = [];
-
- for (let i = lowerBound; i < upperBound + 1; i++) {
- for (let j = lowerBound; j < upperBound + 1; j++) {
- products.push(i * j);
- }
- }
-
- // Filter for palindromic numbers
- const palindromic = products.filter(
- x => x.toString() === x.toString().split('').reverse().join('')
- );
-
- // Find the biggest palindrome number
- const sorted = palindromic.sort((a, b) => b - a);
- return sorted[0];
-};
-
-console.log(largestPallindromicNumber(100, 999));
diff --git a/challenges/euler/src/42 - Coded triangle numbers.ts b/challenges/euler/src/42 - Coded triangle numbers.ts
deleted file mode 100644
index 043c707..0000000
--- a/challenges/euler/src/42 - Coded triangle numbers.ts
+++ /dev/null
@@ -1,40 +0,0 @@
-// The nth term of the sequence of triangle numbers is given by, tn = ½n(n+1); so the first ten triangle numbers are:
-// 1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...
-// By converting each letter in a word to a number corresponding to its alphabetical position and adding these values we form a word value. For example, the word value for SKY is 19 + 11 + 25 = 55 = t10. If the word value is a triangle number then we shall call the word a triangle word.
-// Using words.txt (right click and 'Save Link/Target As...'), a 16K text file containing nearly two-thousand common English words, how many are triangle words?
-
-import fs from 'fs';
-import path from 'path';
-import { resources, alphabet } from '../constants.js';
-export = {};
-
-const words = fs
- .readFileSync(path.join(resources, 'p042_words.txt'))
- .toString()
- .split(',')
- .map(word => word.replace(/"/g, '').toLowerCase());
-
-const isTriangleNumber = (t: number) => {
- // One solution of the inverse triangle number formula
- const solution = (Math.sqrt(8 * t + 1) - 1) / 2;
-
- // This number must be an integer and greater than zero for it to be a triangle number
- return Number.isInteger(solution) && solution > 0;
-};
-
-let triangleWordCount = 0;
-
-for (const word of words) {
- const letters = word.split('');
- let sum = 0;
-
- for (const letter of letters) {
- const value = alphabet.indexOf(letter) + 1;
- sum += value;
- }
-
- if (isTriangleNumber(sum)) triangleWordCount++;
-}
-
-// Output
-console.log(`Out of nearly 2000 common English words, ${triangleWordCount} are triangle words!`);
diff --git a/challenges/euler/src/48 - Self powers.ts b/challenges/euler/src/48 - Self powers.ts
deleted file mode 100644
index e8230b5..0000000
--- a/challenges/euler/src/48 - Self powers.ts
+++ /dev/null
@@ -1,21 +0,0 @@
-// The series, 1^1 + 2^2 + 3^3 + ... + 10^10 = 10405071317.
-// Find the last ten digits of the series, 1^1 + 2^2 + 3^3 + ... + 1000^1000.
-export = {};
-
-const calculateSeries = (upperLimit: number): bigint => {
- let sum = BigInt(0);
-
- for (let i = 1; i <= upperLimit; i++) {
- sum += BigInt(i) ** BigInt(i);
- }
-
- return sum;
-};
-
-const lastNDigits = (number: number | bigint, n: number) => {
- const string = number.toString();
- return parseInt(string.substring(string.length - n));
-};
-
-// Output
-console.log(lastNDigits(calculateSeries(1000), 10));
diff --git a/challenges/euler/src/5 - Smallest multiple.ts b/challenges/euler/src/5 - Smallest multiple.ts
deleted file mode 100644
index 62b81fa..0000000
--- a/challenges/euler/src/5 - Smallest multiple.ts
+++ /dev/null
@@ -1,21 +0,0 @@
-// 2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.
-// What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20?
-export {};
-
-const canBeDivided = (x: number, n: number) => {
- for (; n > 0; n -= 1) {
- if (x % n !== 0) return false;
- }
-
- return true;
-};
-
-const divisibleTo = (n: number) => {
- if (n === 1) return 1;
-
- for (var step = divisibleTo(n - 1), i = step; !canBeDivided(i, n); i += step);
- return i;
-};
-
-// Output
-console.log(divisibleTo(20));
diff --git a/challenges/euler/src/6 - Sum square difference.ts b/challenges/euler/src/6 - Sum square difference.ts
deleted file mode 100644
index 996cfc4..0000000
--- a/challenges/euler/src/6 - Sum square difference.ts
+++ /dev/null
@@ -1,38 +0,0 @@
-// The sum of the squares of the first ten natural numbers is 1^2 + 2^2 + ... + 10^2 = 385
-// The square of the sum of the first ten natural numbers is (1 + 2 + ... + 10)^2 = 55^2 = 3025
-// Hence the difference between the sum of the squares of the first ten natural numbers and the square of the sum is 3025 - 385 = 2640.
-// Find the difference between the sum of the squares of the first one hundred natural numbers and the square of the sum.
-export {};
-
-/**
- * Calculate the sum of the squares between a lower and upper bound.
- */
-const sumOfSquares = (lowerBound: number, upperBound: number) => {
- // Calculate the square number of all the numbers between the bounds
- const squares: number[] = [];
-
- for (let i = lowerBound; i < upperBound + 1; i++) {
- squares.push(i ** 2);
- }
-
- // Return the sum
- return squares.reduce((a, b) => a + b);
-};
-
-/**
- * Square the sum of the numbers between a lower and upper bound, and return it.
- */
-const squareOfSum = (lowerBound: number, upperBound: number) => {
- // Get the sum of all of the numbers between the bounds
- const numbers: number[] = [];
-
- for (let i = lowerBound; i < upperBound + 1; i++) {
- numbers.push(i);
- }
-
- // Square the sum
- return numbers.reduce((a, b) => a + b) ** 2;
-};
-
-// Output
-console.log(squareOfSum(1, 100) - sumOfSquares(1, 100));
diff --git a/challenges/euler/src/67 - Maximum path sum II.ts b/challenges/euler/src/67 - Maximum path sum II.ts
deleted file mode 100644
index c363f31..0000000
--- a/challenges/euler/src/67 - Maximum path sum II.ts
+++ /dev/null
@@ -1,39 +0,0 @@
-// 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.
-// 3
-// 7 4
-// 2 4 6
-// 8 5 9 3
-// That is, 3 + 7 + 4 + 9 = 23.
-// Find the maximum total from top to bottom in p067_triangle.txt, a 15K text file containing a triangle with one-hundred rows.
-
-import fs from 'fs';
-import path from 'path';
-import { resources } from '../constants.js';
-export {};
-
-// Same method as 18 - Maximum path sum I
-const maximumPathSum = (triangle: number[][]) => {
- let row = triangle.length - 1;
-
- while (row--) {
- for (let col = 0; col <= row; col++) {
- triangle[row][col] =
- triangle[row][col] + Math.max(triangle[row + 1][col], triangle[row + 1][col + 1]);
- }
- }
-
- return triangle[0][0];
-};
-
-// Output
-const data = fs
- .readFileSync(path.join(resources, 'p067_triangle.txt')) // https://github.com/newtykins/the-honk/tree/main/challenges/euler/resources/p067_triangle.txt
- .toString()
- .split('\n')
- .map(row => {
- const values = row.split(' ');
- return values.map(v => parseInt(v));
- });
-const maximumSum = maximumPathSum(data);
-
-console.log(maximumSum);
diff --git a/challenges/euler/src/7 - 10001st Prime.ts b/challenges/euler/src/7 - 10001st Prime.ts
deleted file mode 100644
index 3fabe8c..0000000
--- a/challenges/euler/src/7 - 10001st Prime.ts
+++ /dev/null
@@ -1,32 +0,0 @@
-// By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.
-// What is the 10 001st prime number?
-export {};
-
-/**
- * Is this number prime?
- */
-const isPrime = (number: number) => {
- for (var i = 2; i < number; i++) {
- if (number % i === 0) return false;
- }
-
- return true;
-};
-
-/**
- * Calculate the nth prime number.
- */
-const nthPrime = (n: number) => {
- const primes: number[] = [];
- let number = 2;
-
- while (n > primes.length) {
- if (isPrime(number)) primes.push(number);
- number++;
- }
-
- return primes[n - 1];
-};
-
-// Output
-console.log(nthPrime(10001));
diff --git a/challenges/euler/src/8 - Largest product in a series.ts b/challenges/euler/src/8 - Largest product in a series.ts
deleted file mode 100644
index e1f6448..0000000
--- a/challenges/euler/src/8 - Largest product in a series.ts
+++ /dev/null
@@ -1,41 +0,0 @@
-// The four adjacent digits in the 1000-digit number that have the greatest product are 9 × 9 × 8 × 9 = 5832.
-// Find the thirteen adjacent digits in the 1000-digit number that have the greatest product. What is the value of this product?
-export {};
-
-const largestProduct = (number: bigint | number, adjacentDigits: number) => {
- let cursorIndex = 0;
- const selections: number[][] = [];
-
- while (cursorIndex < number.toString().length) {
- const characters = number.toString().split('');
-
- // Select the next 13 numbers
- const selection: number[] = [];
-
- for (let i = 0; i < adjacentDigits; i++) {
- selection.push(parseInt(characters[cursorIndex + i]));
- }
-
- if (!selection.includes(NaN)) selections.push(selection);
-
- // Keep moving the cursor along
- cursorIndex++;
- }
-
- // Work out the products
- const products: number[] = [];
-
- for (let i = 0; i < selections.length; i++) {
- products.push(selections[i].reduce((a, b) => a * b));
- }
-
- // Return the largest product
- return products.sort((a, b) => b - a)[0];
-};
-
-// Output
-const number = BigInt(
- '7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450'
-);
-
-console.log(largestProduct(number, 13));
diff --git a/challenges/euler/src/9 - Special Pythagorean triplet.ts b/challenges/euler/src/9 - Special Pythagorean triplet.ts
deleted file mode 100644
index 35d803b..0000000
--- a/challenges/euler/src/9 - Special Pythagorean triplet.ts
+++ /dev/null
@@ -1,30 +0,0 @@
-// A Pythagorean triplet is a set of three natural numbers, a < b < c, for which a^2 + b^2 = c^2
-// For example, 3^2 + 4^2 = 9 + 16 = 25 = 5^2
-// There exists exactly one Pythagorean triplet for which a + b + c = 1000.
-// Find the product abc.
-export {};
-
-/**
- * Find a Pythagorean triplet based on its sum
- * @see https://github.com/newtykins/the-honk/tree/main/challenges/euler/thoughts/9%20-%20Special%20Pythagorean%29triplet.md
- */
-const pythagoreanTriplet = (sum: number) => {
- let a: number,
- b = 1,
- c: number;
-
- for (; b < sum; b++) {
- a = -((sum * (2 * b) - sum * sum) / (2 * sum - 2 * b));
-
- if (Math.floor(a) === a) {
- c = sum - a - b;
- break;
- }
- }
-
- return { a, b, c };
-};
-
-// Output
-const triplet = pythagoreanTriplet(1000);
-console.log(triplet.a * triplet.b * triplet.c);
diff --git a/challenges/euler/thoughts/10 - Summation of primes.md b/challenges/euler/thoughts/10 - Summation of primes.md
deleted file mode 100644
index 23873ae..0000000
--- a/challenges/euler/thoughts/10 - Summation of primes.md
+++ /dev/null
@@ -1,23 +0,0 @@
-
-
-### Sieve of Eratosthenes Psuedocode
-
-[Source](https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes#Pseudocode)
-
-```
-algorithm Sieve of Eratosthenes is
- input: an integer n > 1.
- output: all prime numbers from 2 through n.
-
- let A be an array of Boolean values, indexed by integers 2 to n,
- initially all set to true.
-
- for i = 2, 3, 4, ..., not exceeding √n do
- if A[i] is true
- for j = i2, i2+i, i2+2i, i2+3i, ..., not exceeding n do
- A[j] := false
-
- return all i such that A[i] is true.
-```
-
-
diff --git a/challenges/euler/thoughts/15 - Lattice paths.md b/challenges/euler/thoughts/15 - Lattice paths.md
deleted file mode 100644
index 05e03d0..0000000
--- a/challenges/euler/thoughts/15 - Lattice paths.md
+++ /dev/null
@@ -1,17 +0,0 @@
-
-
-### Lattice Paths
-
-For a lattice with dimensions m x n, all paths will have m + n segments. m segments go down, n segments go right. To count m + n slots, count the ways to pick m downward moves - the rest will be rightward moves.
-
-
-
-
!}{m!n!})
-
-#### LaTeX
-
-```
-{m + n \choose m} = {m + n \choose n} = \frac{(m+n)!}{m!n!}
-```
-
-
-
-### Proof
-
-> let x be the sum
-
-
&space;\\a^2&space;+&space;b^2&space;=&space;(x&space;-&space;(a&space;+&space;b))^2&space;\\a^2&space;+&space;b^2&space;=&space;a^2&space;+&space;2ab&space;-&space;2ax&space;+&space;b^2&space;-&space;2bx&space;+&space;x^2&space;\\2ab&space;-&space;2ax&space;-&space;2bx&space;+&space;x^2&space;=&space;0&space;\\\\2bx&space;-&space;2ab&space;=&space;x^2&space;-&space;2ax&space;\\(\frac{x^2}{x})&space;-&space;2a&space;=&space;2b&space;-&space;(\frac{2ab}{x})&space;\\-2a&space;=&space;2b&space;-&space;(\frac{2ab}{x})&space;-&space;(\frac{x^2}{x})&space;\\\\a&space;=&space;\frac{2bx&space;-&space;x^2}{2x&space;-&space;2b})
-
-### LaTeX
-
-```
-c = x - (a + b) \\
-a^2 + b^2 = (x - (a + b))^2 \\
-a^2 + b^2 = a^2 + 2ab - 2ax + b^2 - 2bx + x^2 \\
-2ab - 2ax - 2bx + x^2 = 0 \\
-\\
-2bx - 2ab = x^2 - 2ax \\
-(\frac{x^2}{x}) - 2a = 2b - (\frac{2ab}{x}) \\
--2a = 2b - (\frac{2ab}{x}) - (\frac{x^2}{x}) \\
-\\
-a = \frac{2bx - x^2}{2x - 2b}
-```
-
-
- 
-