euler.euler021

consec-primes

(consec-primes a b)

given a generator function, returns the amount of consecutive prime numbers generated

find-max

(find-max nums)

Retrieve the product of the maximum

kvs

Recurring cycles of numbers under 1000.

p021

(p021)(p021 n)

Task: Evaluate the sum of all the amicable numbers under 10000.

p022

(p022)(p022 names)

Task: What is the total of all the name scores in the file?

p023

(p023)(p023 input)

Task: Find the sum of all the positive integers which cannot be written as the sum of two abundant numbers.

p024

(p024)

Task: What is the millionth lexicographic permutation of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9?

p025

(p025)(p025 n)

Task: What is the first term in the Fibonacci sequence to contain 1000 digits?

p026

(p026)

Task: Find the value of d < 1000 for which 1/d contains the longest recurring cycle in its decimal fraction part.

p027

(p027)(p027 nums)

Task: Find the product of the coefficients, a and b, for the quadratic expression that produces the maximum number of primes for consecutive values of n, starting with n = 0.

p028

(p028)(p028 n)

Task: What is the sum of the numbers on the diagonals in a 1001 by 1001 spiral formed in the same way?

p029

(p029)(p029 n)

Task: How many distinct terms are in the sequence generated by ab for 2 ≤ a ≤ 100 and 2 ≤ b ≤ 100?

p030

(p030)(p030 exp)

Task: Find the sum of all the numbers that can be written as the sum of fifth powers of their digits.

permute-nth

(permute-nth s pos)

Return permutation pos of the list of digits.

quadratic

(quadratic a b)

Returns a generator function of the form: n² + an + b.

quads

(quads nums)

All quadratic prime generators between a and b.

rec-cycle

(rec-cycle n d)

Find the longest recurring cycle in a fraction.