Tagged Questions

3
votes
1answer
64 views

Quadratic Primes

This is one of the slightly trickier Project Euler Questions I have seen (Question 27) Considering quadratics of the form: n² + an + b, where |a| < 1000 and |b| < 1000 where |n| is the ...
4
votes
4answers
213 views

Sum of primes less than 2,000,000

I have been attempting the questions at Project Euler and I am trying to find the sum of Primes under two million (question 10) The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17. Find the ...
5
votes
1answer
179 views

smallest number divisible by all numbers from 1 to 20? Project Euler question 5

I'm currently working my way through the questions on Project Euler and I am on question 5. Is this the best possible solution? Any suggestions welcomed! List<int> divisors = new ...
1
vote
1answer
264 views

Connect graph from 2d array

I just completed project euler problem 18 which is a dynamic programming question through a graph of a triangle of numbers. The goal is to find the path from top to bottom of the triangle that has the ...
3
votes
6answers
3k views

Find the largest Prime Factor of the number 600851475143

I am trying to complete this challenge, which is to find the Find the largest Prime Factor of the number 600851475143. My current solution is below: static void Main(string[] args) { const long ...
2
votes
5answers
926 views

Critique my code for determining numeric palindromes

I am working on bettering my C# skills, and recently wrote this program to solve a projecteuler.net problem (Problem description: "A palindromic number reads the same both ways. The largest palindrome ...