Talk:Integer roots

as a test...

Does     As a test, you can calculate ···     to be taken literally, or should it be inferred that it   is   to be the test?   The underscoring was added by me.   -- Gerard Schildberger (talk) 01:47, 11 May 2016 (UTC)

Do you mean the test is the algorithm to be used, or just a suggestion that that's the method   (or a method)   to be used?   -- Gerard Schildberger (talk) 01:47, 11 May 2016 (UTC)

Perhaps this is misleading. It certainly should not be the only test.

How should entries handle the case of a   zero   root?   -- Gerard Schildberger (talk) 01:47, 11 May 2016 (UTC)

Uncertain about that - ideas?

If you change the task's requirements that the root be a positive integer, that kills two birds with one stone.   -- Gerard Schildberger (talk) 02:37, 11 May 2016 (UTC)

In the task's requirements, it's mentioned that   N   is an integer.   If   N   is negative, it means that the resultant root is the reciprocal of the   abs(N)^th   root.   Is this the intent of the task?   -- Gerard Schildberger (talk) 01:56, 11 May 2016 (UTC)

I would change that to "non-negative integer".

In the interim, for the REXX computer language entry, I used a general-purpose integer root (of any number) which bypasses the problem of multiplying a number by a gihugeic number to get around the problems with handling a decimal fraction.   The numbers being passed to the   iRoot   function could mimic the suggested method if required.

The REXX entry also handles negative roots, which are allowed by the current task requirements.   -- Gerard Schildberger (talk) 01:47, 11 May 2016 (UTC)

principal N^th root

I assume that this task wants the   principal   N^th   root?   It usually goes without saying, but ya never know.   -1.41421···   is one of the square roots.   -- Gerard Schildberger (talk) 03:08, 11 May 2016 (UTC)