Project Euler Algorithms

Hi there, welcome to Project Euler Algorithms. Below are a few maths problems from Project Euler that I've created user inputted algorithms for.
Note: This application will use a lot of CPU and memory if you enter very high numbers

• Find the sum of all the integers below X, that are multiples of Y and Z.
• The sum of all the even numbers in the Fibonacci sequence up to X (starting with 1, 2, 3, 5, 8, etc)
• Find the difference between the sum of the squares (1² + 2²...) and the square of the sum (1 + 2 + 3...)², for the first X numbers
• What is the smallest number that is evenly divisible by all of the numbers from 1 to X?
• What is the largest prime factor of X?
• Find the largest palindrome which is the product of two X digit numbers?
• Find the X prime number?
• Calculate the sum of all the prime number below X?

Martin Edwards