Euler project: Problem 1.

Problem description:

If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23. Find the sum of all the multiples of 3 or 5 below 1000.

Problem solving:

This is first problem in problem set, so algorithm is pretty obvious.

import java.util.stream.IntStream;

public class Problem_1 {
public static void main(String[] args) {
System.out.println(
IntStream
.range(0, 1000)
.filter(i -> i % 3 == 0 || i % 5 == 0)
.sum());
}

Answer: 233168

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s