Ad
  • Custom User Avatar

    Yep, you are correct i've tried to solve this kata in Scala. Thanks for you quickly answer, a kind regard ;)

  • Custom User Avatar

    @ivitojv ,, Well ..

    • Thanks Bro for pointing out :blush: :blush:..
    • You've Tried solving this kata in Scala , Haven't You ?? :wink: :wink:
    • It's the most recent translation of this kata just 2 hours ago , and when I've tried solving using my solution in C++, yeah the result was (11) , because all the previous prime numbers addition will clearly lead to non-prome sum , So I'll mention the Scala Translator to do the Necessary :point_up_2::point_up_2:
    • Also i'll keep the the issue unresolved till modifications take place .. :+1: :+1:
    • Happy to be the First to follow you Bro .. hope you the best .. Regards ,, Zizou :relaxed: :relaxed:
  • Custom User Avatar

    This test failed:
    Feature: The TransformToPrime object can compute the smallest number needed to convert the sum of a list of integers to a prime number Scenario: Computing minimumNumber824,106,198,358,349,276,434,425,752,190,491,376,573,884) should result in 5

    That sequence of numbers sums 6236 plus 5 = 6241 and that number is not prime. Its 79x79. The correct answer is 11.

  • Custom User Avatar

    The instructions are misleading. It says that all numbers in the list must be greater than zero, so there shouldn't ever be a result that zero is the smallest number you can insert to make the sum prime. If you're inserting the solution into the list, it only makes sense that the solution can't be zero.