could you please explain whats going on after the 0ull

ahah when two Shifu meet

Yea it should be 2n+2 where n is the vector size.

Thank you! :-) It was a ton of fun.

Will do a couple other translations soon. Lisp isn't that hard when you already know Clojure and Racket, lol

Thank you.

I've BookMarked your gitter Profile for private interaction Letting you the first to be informed if I published newer Katas

Ha, yes, I just joined today. Looking forward to more kata :-)

You have yourself a great week!

Ha, yes, I was surprised as well! :-)

It was a great kata.

Thank you!

Thank you Zizou!

The description states:

Have no fear , It is guaranteed that no Zeroes will exists .

But it seems the JavaScript translation does include the value 0 by generating arrays with the following code:

const arr = Array.from(
  { length: randint(4, 40) },
  () => randint(
    -Math.pow(10, randint(1, 3)),
     Math.pow(10, randint(1, 3))
  )
);

I've taken care of this in Rust with an interval of [-1_000, 0) U (0, 1_000], so excluding 0.

You have a great weekend as well! :-)

Haha, hooray! Thank you.

Time for dinner :-)

Have a great evening Zizou.

I have just submitted a fork below, including the Rust examples, just like the author did for Prolog.

I think this might be because the Prolog translation updated the description. I haven't added anything as far as I know, so I'll have to fork it, I think.

Haha, yes, they do! I like translating them :-)

The translation is fine and the solution is elegant, as Always, But Since this translation is 3 Months Old then I should turn a blind eye to 40 Assertions found in the random testing section as you've known recently that the Minimum number of iterations (Assertions) is 100

I have changed the iterations to 100. I didn't know that was the minimum at the time of translation, as you've already mentioned :-)

Also Since I'm not fully aware of the Maximum Capacity of Rust Variables to store positive numbers, Is Generating Primorial of (15) Cause an Overflow (the result that may Exceed the max. Limit of Positive number) or it's Just safe to do it ??

It currently goes up to 14 as the random range's upper bound is not inclusive.

The product of the first 14 prime numbers is <= std::u64::MAX, which is the return value, see:

fn main() {
    let p: u64 = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43].iter().product();
    
    if p < std::u64::MAX {
        println!("Yes, the value fits!");
    }
}

It should print Yes, the value fits!, as can be seen in this Rust playground.

If you want me to increase it to 15, that also works without overflow.

Have a great evening!

My solutions for translations aren't that great, I'm just trying to make sure they're functionally correct, above all else :D

Cheers!

Yes, it all seems to be working now! Phew. :-)

Thank you!