**Tell us what’s happening:**

There is a bug in the logic of my code, why is it not working for the integer 4 when the integer 4 is part of the range? and it seems to be doing what I want for all the other integers. Why is this?

work done so far on codepen

To finish this problem, I will attempt to use the method as explained in the end of this video

how to turn the above video into pseduocode?

Attempt: any unique prime element found must be included in the product. if a mini array contains a repeated prime, then we need to use it in the product corresponding to the highest number of times it appears in any mini array.

so what I would like to do is to start pushing each element from each mini primes array into a larger array, and if there is an element encountered which was already pushed, we need to check the current miniprime array if that same element appears again, and if it does we keep pushing it, -1 to take into account the element that was already pushed. Then just reduce the array multiplying all the values together and return that…

so basically, why is my code not working for the integer 4, and how can I describe the last step better?

```
function smallestCommons(arr) {
return arr;
}
smallestCommons([1,5]);
```

**Your browser information:**

User Agent is: `Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/71.0.3578.98 Safari/537.36`

.

**Link to the challenge:**

https://learn.freecodecamp.org/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/smallest-common-multiple