add gcd and lcm infix ops

Author: TimToady

S03-operators.pod

@@ -15,8 +15,8 @@ Synopsis 3: Perl 6 Operators
 
     Created: 8 Mar 2004
 
-    Last Modified: 31 Mar 2011
-    Version: 222
+    Last Modified: 11 May 2011
+    Version: 223
 
 =head1 Overview
 
@@ -36,7 +36,7 @@ each level:
     N  Autoincrement     ++ --
     R  Exponentiation    **
     L  Symbolic unary    ! + - ~ ? | || +^ ~^ ?^ ^
-    L  Multiplicative    * / % %% +& +< +> ~& ~< ~> ?& div mod
+    L  Multiplicative    * / % %% +& +< +> ~& ~< ~> ?& div mod gcd lcm
     L  Additive          + - +| +^ ~| ~^ ?| ?^
     L  Replication       x xx
     X  Concatenation     ~
@@ -879,6 +879,24 @@ C<< infix:<?&> >>, boolean and
 Converts both arguments to type C<Bool> and then ANDs those, returning the
 resulting C<Bool>.
 
+=item *
+
+C<< infix:<gcd> >>, greatest common divisor
+
+    $x gcd $y
+
+Converts both arguments to an integral type and then finds the largest integer
+that both arguments are evenly divisible by, and returns that integer.
+
+=item *
+
+C<< infix:<lcm> >>, least common multiple
+
+    $x lcm $y
+
+Converts both arguments to an integral type and then finds the smallest integer
+that is evenly divisible by both arguments, and returns that integer.
+
 =back
 
 Any bit shift operator may be turned into a rotate operator with the