All Questions
6 questions
3
votes
0
answers
132
views
Performance issue regarding Project Euler #60 in Scheme
I solved Project Euler #60:
The primes 3, 7, 109, and 673, are quite remarkable. By taking any two primes and concatenating them in any order the result will always be prime. For example, taking 7 ...
- 163
0
votes
1
answer
389
views
Project Euler # 3 in Haskell: largest prime factor of some number
The program works, but is extremely slow.
Project Euler problem 3
Problem: What is the largest prime factor of the number 600851475143?
...
- 159
7
votes
3
answers
617
views
Sieve of Sundaram for Project Euler 7
This is a sequel to my previous question: Sieve of Sundaram for Project Euler 7: Python implementation slower than C++ and R
I am trying to implement the Sieve of Sundaram in various languages to ...
- 611
1
vote
1
answer
102
views
Naive primality test and summation
I am starting to learn Haskell, so I coded a naive solution to the primality test and summation of primes (Project Euler Problem 10: sum of all primes under 2 million) . As I have an imperative ...
- 28k
2
votes
1
answer
270
views
Project Euler #3 in Haskell
Project Euler #3 asks:
The prime factors of 13195 are 5, 7, 13 and 29.
What is the largest prime factor of the number 600851475143 ?
I've written a general solution for any number:
...
- 1,243
5
votes
1
answer
1k
views
Computation for finding the largest prime factor of 600851475143 is slow
I implemented the following for Project 3 in Project Euler:
...
- 3,203