Preliminary attempt to document the polymod method in Int.pod

gistfile1.txt

=head2 routine polymod

Defined as:

    method polymod(Int:D: +@mods)      

Usage:

    INTEGER.polymod(LIST)               # Is this correct ?

Returns a sequence of mod results corresponding to the divisors in @mods.          # text taken verbatim from https://design.perl6.org/S32/Numeric.html
If the number of divisors is finite, returns one more result than the number 
of divisors, and the final result is the remainder after all the divisions. 
If the number of divisors is infinite, runs until the remainder is 0. 
The Int version of this method assumes all the divisors are also integers. 
Coerce the invocant to Num or Rat if you wish to use fractional operations.
  
    say 3600.polymod(60,60,24);     # (0 0 1 0)         # perhaps more clearly explained examples are necessary ?