Project Euler > Problem 5 > Smallest multiple (Java Solution)


2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.

What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20?



The solution may include methods that will be found here: .

public interface EulerSolution{

public String run();

 * Solution to Project Euler problem 5
 * By Nayuki Minase

import java.math.BigInteger;

public final class p005 implements EulerSolution {
 public static void main(String[] args) {
  System.out.println(new p005().run());
 public String run() {
  BigInteger allLcm = BigInteger.ONE;
  for (int i = 1; i <= 20; i++)
   allLcm = lcm(BigInteger.valueOf(i), allLcm);
  return allLcm.toString();
 private static BigInteger lcm(BigInteger x, BigInteger y) {
  return x.divide(x.gcd(y)).multiply(y);

No comments :

Post a Comment

Follow Me

If you like our content, feel free to follow me to stay updated.


Enter your email address:

We hate spam as much as you do.

Upload Material

Got an exam, project, tutorial video, exercise, solutions, unsolved problem, question, solution manual? We are open to any coding material. Why not upload?


Copyright © 2012 - 2014 Java Problems  --  About  --  Attribution  --  Privacy Policy  --  Terms of Use  --  Contact