|
|
The sequence of triangle numbers is generated by adding the natural numbers. So the 7th triangle number would be 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28. The first ten terms would be:
1, 3, 6, 10, 15, 21, 28, 36, 45, 55, …
Let us list the factors of [...]
The sequence of triangle numbers is generated by adding the natural numbers. So the 7th triangle number would be 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28. The first ten terms would be:
1, 3, 6, 10, 15, 21, 28, 36, 45, 55, …
Let us list the factors of [...]
?View Code SCHEME1
2
3
4
5
6
7
8
9
10
11
(define (even-fib limit)
(even-fib-helper 1 2 limit 0))
(define (even-fib-helper first second limit sum)
(cond ((> first limit) sum)
((= (remainder first 2) 0)
(even-fib-helper second (+ first second) limit (+ [...]
?View Code RUBY1
2
3
4
5
6
7
8
9
10
11
12
13
14
sum = 0
second = 2
first = 1
swap = 0
for test in 1..99
if first % 2 == 0 and first < 4000000
sum = sum + first
end
swap = first
first = second
second = swap + second
end
puts sum
gets
?View Code JAVA1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
public class Problem2
{
private static double sum = 0;
private static double number[] = new double[2];
private static double swap;
public static void main(String args[])
{
number[0]=1;
[...]
?View Code SCHEME1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
(define (3-or-5 limit)
(3-or-5-helper limit 0 0))
(define (3-or-5-helper limit start sum)
(cond ((= limit start) sum)
((and (= (remainder start 3) 0)
(> (remainder start 5) 0))
[...]
?View Code RUBY1
2
3
4
5
6
7
8
9
10
sum = 0
for count in 1…1000
if count % 3 == 0
sum = sum + count
elsif count % 5 == 0
sum = sum + count
end
end
puts sum
gets
?View Code PYTHON1
2
3
4
5
6
7
8
9
10
11
12
sum3 = 0
sum5 = 0
sum15 = 0
for x in range(0,1000,3):
sum3 = sum3 + x
for x in range(0,1000,5):
sum5 = sum5 + x
for x in range(0,1000,15):
sum15 = sum15 + x
result = [...]
It is very hard to come up with Prolog answers to Project Euler. If you have any please add as a comment to problems posted here.
?View Code PROLOG1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
gen(X,Y,[],B):-
X >= Y.
gen(X,Y,[Head|Tail],B):-
Y>X,
Head is X,
X1 is X + B,
gen(X1,Y,Tail,B).
sum(X,Y,Sum):-
gen(X,Y,List1,3),
[...]
I decided to post some older solutions I have. I had posted these on my forum; however it does not appear on the search engine so I think this will be more convenient.
?View Code JAVA1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
public class Problem1
{
public static void main(String args[])
{
[...]
|
|
