I understand. I think there is a) not to reinvent the wheels, and b) write one's own code to show capability. Depending on the goals we may have different views, but I completely understand you.

Regarding the 3rd requirement: since every number is a multiple of 1, which is a perfect square, any number would meet this requirement? Or did you mean to exclude 1 here?

Good Kata! I had the mathematical details worked out but I don't know much C# grammar yet I want to make it work. I know my code may not look good/professional but I enjoy it~

I never solved PE 209 but seeing it mentioned here hopefully this is a hint :)

And I passed the C test with essentially the same code...
Hopefully someone can check the C++ random test generator

I am having a C++ random test with all clues being zero... Not sure what to do...

I am not sure why but in R, I have to load data0 in my code otherwise the testing part won't run... otherwise this kata works fine

Sorry to hear that.. I will try this later in a different language.

I believe there is more to this issue; changing the testing range doesn't fix it completely...

For n as small as 10206 I got [1,3,4,5,14,142,10205] but the "correct" answer appears to be [1,2,3,8,13,142,10205].

Can anyone confirm the solution for n = 9226449, or n = 9856924?
I got {1, 3, 4, 5, 14, 75, 4295, 9226448} for n = 9226449 but the system thinks the answer is {1, 2, 3, 8, 13, 75, 4295, 9226448}. I was using R.

Thanks it is working now.