Approved

Approved

I don't know math incredibly well, but I feel like this was really poorly worded. Wasn't sure what it wanted me to do for a while.

added random tests to Rust

Fixed JS.

Lua translation!

Reference solution was buggy and returned wrong expected result for integer=2. Should be fixed now.

Can you post your code, so i could use it to reproduce and fix the issue?

1) test random tests (TestFindTheDivisors)
     test/solution_test.exs:21
     Assertion with == failed
     code:  assert divisors(n) == check_divisors(n)
     left:  [1, 2]
     right: [2, 1]
     stacktrace:
       (elixir 1.15.7) lib/enum.ex:989: anonymous fn/3 in Enum.each/2
       (elixir 1.15.7) lib/enum.ex:4379: Enum.reduce_range/5
       (elixir 1.15.7) lib/enum.ex:2514: Enum.each/2
       test/solution_test.exs:22: (test)

There is a problem with one assertion in the Elixir version.
The exercise requires to return a sorted list, but it fails when it gets [1, 2] it is supposed to expect [2, 1]

How can this code be a best practice? It is at least twice as slow as the mathematical method of calculating the square root of a number

True but you have to use floor division in that case, otherwise you will get an error for range doesn't work with floats

very good

Rust (and probably other languages) doesn't have a test for square numbers, so plenty of solutions double count the square root.

At some point your solution returned "15 is a prime", while it should return [ 3, 5 ].

expected '15 is a prime' to deeply equal [ 3, 5 ] what?