GCD

XMLWordPrintable

    • Hide

      1) Change the description of 5.16.36 GCD to:
      Summary: Returns the greatest common divisor (GCD)
      Syntax: GCD(

      { NumberSequenceList X }

      + )
      Returns: Number
      Constraints: For all a in X: INT(a) >= 0 and for at least one a in X: INT(a)>0
      Semantics: Return the largest integer N such that for every a in X: INT(a) is a multiple of N.
      Note: If for all a in X: INT(a)=0 the return value is implementation-defined but is either an error or 0.

      2) delete the test case GCD(0;0)

      Show
      1) Change the description of 5.16.36 GCD to: Summary: Returns the greatest common divisor (GCD) Syntax: GCD( { NumberSequenceList X } + ) Returns: Number Constraints: For all a in X: INT(a) >= 0 and for at least one a in X: INT(a)>0 Semantics: Return the largest integer N such that for every a in X: INT(a) is a multiple of N. Note: If for all a in X: INT(a)=0 the return value is implementation-defined but is either an error or 0. 2) delete the test case GCD(0;0)

      == 6.15.35 GCD ==

      "Return the largest value that can be evenly divided (no remainder) into
      the given numbers." should be "Return the largest value that can divide
      the given numbers evenly (no remainder)."

            Assignee:
            Andreas Guelzow (Inactive)
            Reporter:
            Robert Weir (Inactive)
            Votes:
            0 Vote for this issue
            Watchers:
            0 Start watching this issue

              Created:
              Updated:
              Resolved: