count_factors | Count all factors of a number |
data_11 | Matrix of integers for the Euler problem 11 |
data_13 | Matrix of integers for the Euler problem 13 |
data_18 | Lower triangle data for the Euler problem 18 |
data_67 | Lower triangle data for the Euler problem 67 |
data_8 | Vector of integers for the Euler problem 8 |
esieve | Sieve of Eratosthenes for generating primes 2:n |
euclid | Generate Pythagorean triples using Euclid's formula |
euler_1 | Project Euler 1: Multiples of 3 and 5 |
euler_10 | Project Euler 10: Summation of primes |
euler_11 | Project Euler 11: Largest product in a grid |
euler_12 | Project Euler 12: Highly divisible triangular number |
euler_13 | Project Euler 13: Large sum |
euler_14 | Project Euler 14: Longest Collatz sequence |
euler_18 | Project Euler 18 (67): Maximum path sum I (II) |
euler_2 | Project Euler 2: Even Fibonacci numbers |
euler_3 | Project Euler 3: Largest prime factor |
euler_4 | Project Euler 4: Largest palindrome product |
euler_5 | Project Euler 5: Smallest multiple |
euler_6 | Project Euler 6: Sum square difference |
euler_7 | Project Euler 7: 10001st prime |
euler_8 | Project Euler 8: Largest product in a series |
euler_9 | Project Euler 9: Special Pythagorean triplet |
find_factors | Find all factors of a number |
is_palindrome | Check if a number is a palindrome, i.e. it remains the same... |
is_prime | Work out if a number is a prime number |
triangle | Find triangle numbers |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.