## Where communities thrive

• Join over 1.5M+ people
• Join over 100K+ communities
• Free without limits
##### Activity
Marc Tannous
@tannousmarc
hiint
hint
CamperBot
@camperbot

hint [6/7]

type hint for next hint :pencil: [Contribute at the FCC Wiki]

Marc Tannous
@tannousmarc
hint
hint
CamperBot
@camperbot
These hints depend on people like you! Please add to this :point_right: Bonfire's Wiki Hints Page
Scott Stringfellow
@stringf5
hint
CamperBot
@camperbot

hint [1/7]

## ## :construction: After this are possible spoiler hints.

Make sure you've tried to hard to solve it yourself before proceeding. :construction:

type hint for next hint :pencil: [Contribute at the FCC Wiki]

Scott Stringfellow
@stringf5
hint
CamperBot
@camperbot

hint [2/7]

## # Explanation:

This particular problem can be confusing because most people look for the smallest common multiple of the two number but forget the keyword range. This means that if you get [1,5] then you have to check for the smallest common multiple for all these numbers [1,2,3,4,5] that is evenly divisible by all of them.

type hint for next hint :pencil: [Contribute at the FCC Wiki]

Scott Stringfellow
@stringf5
hint
CamperBot
@camperbot

hint [3/7]

## Hint: 1

Create an array with all the numbers that are missing from the original array to make it easier to check when having to check for even division.

type hint for next hint :pencil: [Contribute at the FCC Wiki]

Scott Stringfellow
@stringf5
hint
CamperBot
@camperbot

hint [4/7]

## Hint: 2

You can use modulo % to check if the reminder is 0, which means it is evenly divisible.

type hint for next hint :pencil: [Contribute at the FCC Wiki]

Scott Stringfellow
@stringf5
hint
CamperBot
@camperbot

hint [5/7]

## Hint: 3

If you sort the array from greater to lowest then you can check for the first two numbers as it is more likely to the the smallest common multiple than the lower numbers.

type hint for next hint :pencil: [Contribute at the FCC Wiki]

Scott Stringfellow
@stringf5
hint
CamperBot
@camperbot

hint [6/7]

type hint for next hint :pencil: [Contribute at the FCC Wiki]

Scott Stringfellow
@stringf5
hint
Scott Stringfellow
@stringf5
hint
CamperBot
@camperbot
These hints depend on people like you! Please add to this :point_right: Bonfire's Wiki Hints Page
Ali
@demirovicAli
Bonfire: Smallest Common Multiple
CamperBot
@camperbot

## :fire:Bonfire: Smallest Common Multiple :link:

function smallestCommons(arr) {
return arr;
}

smallestCommons([1,5]);

Find the smallest number that is evenly divisible by all numbers in the provided range.

more info:  bf details | bf links | hint

Ali
@demirovicAli
hint
CamperBot
@camperbot

hint [1/7]

## ## :construction: After this are possible spoiler hints.

Make sure you've tried to hard to solve it yourself before proceeding. :construction:

type hint for next hint :pencil: [Contribute at the FCC Wiki]

Ali
@demirovicAli
hint
CamperBot
@camperbot

hint [2/7]

## # Explanation:

This particular problem can be confusing because most people look for the smallest common multiple of the two number but forget the keyword range. This means that if you get [1,5] then you have to check for the smallest common multiple for all these numbers [1,2,3,4,5] that is evenly divisible by all of them.

type hint for next hint :pencil: [Contribute at the FCC Wiki]

Ali
@demirovicAli
hint
CamperBot
@camperbot

hint [3/7]

## Hint: 1

Create an array with all the numbers that are missing from the original array to make it easier to check when having to check for even division.

type hint for next hint :pencil: [Contribute at the FCC Wiki]

Ali
@demirovicAli
hint
CamperBot
@camperbot

hint [4/7]

## Hint: 2

You can use modulo % to check if the reminder is 0, which means it is evenly divisible.

type hint for next hint :pencil: [Contribute at the FCC Wiki]

Ali
@demirovicAli
hint
CamperBot
@camperbot

hint [5/7]

## Hint: 3

If you sort the array from greater to lowest then you can check for the first two numbers as it is more likely to the the smallest common multiple than the lower numbers.

type hint for next hint :pencil: [Contribute at the FCC Wiki]

Ali
@demirovicAli
hint
CamperBot
@camperbot

hint [6/7]

type hint for next hint :pencil: [Contribute at the FCC Wiki]

Ali
@demirovicAli
hint
hint
CamperBot
@camperbot
These hints depend on people like you! Please add to this :point_right: Bonfire's Wiki Hints Page
Satchmo37
@Satchmo37
hitn
hint
CamperBot
@camperbot

hint [1/7]

## ## :construction: After this are possible spoiler hints.

Make sure you've tried to hard to solve it yourself before proceeding. :construction:

type hint for next hint :pencil: [Contribute at the FCC Wiki]

Satchmo37
@Satchmo37
hint
CamperBot
@camperbot

hint [2/7]

## # Explanation:

This particular problem can be confusing because most people look for the smallest common multiple of the two number but forget the keyword range. This means that if you get [1,5] then you have to check for the smallest common multiple for all these numbers [1,2,3,4,5] that is evenly divisible by all of them.

type hint for next hint :pencil: [Contribute at the FCC Wiki]

Satchmo37
@Satchmo37
hint
CamperBot
@camperbot

hint [3/7]

## Hint: 1

Create an array with all the numbers that are missing from the original array to make it easier to check when having to check for even division.

type hint for next hint :pencil: [Contribute at the FCC Wiki]

Satchmo37
@Satchmo37
hint
CamperBot
@camperbot

hint [4/7]

## Hint: 2

You can use modulo % to check if the reminder is 0, which means it is evenly divisible.

type hint for next hint :pencil: [Contribute at the FCC Wiki]

Satchmo37
@Satchmo37
hint
CamperBot
@camperbot

hint [5/7]

## Hint: 3

If you sort the array from greater to lowest then you can check for the first two numbers as it is more likely to the the smallest common multiple than the lower numbers.

type hint for next hint :pencil: [Contribute at the FCC Wiki]

Satchmo37
@Satchmo37
hint