===================================================================
RCS file: /home/cvs/OpenXM/src/asir-doc/parts/builtin/num.texi,v
retrieving revision 1.7
retrieving revision 1.9
diff -u -p -r1.7 -r1.9
--- OpenXM/src/asir-doc/parts/builtin/num.texi	2002/09/03 01:50:59	1.7
+++ OpenXM/src/asir-doc/parts/builtin/num.texi	2003/12/18 10:26:20	1.9
@@ -1,4 +1,4 @@
-@comment $OpenXM: OpenXM/src/asir-doc/parts/builtin/num.texi,v 1.6 2002/08/08 05:24:37 noro Exp $
+@comment $OpenXM: OpenXM/src/asir-doc/parts/builtin/num.texi,v 1.8 2003/04/19 15:44:59 noro Exp $
 \BJP
 @node 数の演算,,, 組み込み函数
 @section 数の演算
@@ -46,7 +46,7 @@
 @item return
 \JP 整数
 \EG integer
-@item i1,i2
+@item i1 i2
 \JP 整数
 \EG integer
 @end table
@@ -159,7 +159,7 @@ Returns 0 if the argument @var{i} is negative.
 @item return
 \JP 整数
 \EG integer
-@item i1,i2,i
+@item i1 i2 i
 \JP 整数
 \EG integer
 @end table
@@ -260,7 +260,7 @@ In most cases @code{3} is the fastest, but there are e
 @item return
 \JP 整数
 \EG integer
-@item i1,i2
+@item i1 i2
 \JP 整数
 \EG integer
 @end table
@@ -287,6 +287,26 @@ If one of argument is equal to 0, the return 0.
 @fref{igcd igcdcntl}, @fref{mt_save mt_load}.
 @end table
 
+\JP @node isqrt,,, 数の演算
+\EG @node isqrt,,, Numbers
+@subsection @code{isqrt}
+@findex isqrt
+
+@table @t
+@item isqrt(@var{n})
+\JP :: 平方根を越えない最大の整数を求める. 
+\EG :: The integer square root of @var{n}.
+@end table
+
+@table @var
+@item return
+\JP 非負整数
+\EG non-negative integer
+@item n
+\JP 非負整数
+\EG non-negative integer
+@end table
+
 \JP @node inv,,, 数の演算
 \EG @node inv,,, Numbers
 @subsection @code{inv}
@@ -302,7 +322,7 @@ If one of argument is equal to 0, the return 0.
 @item return
 \JP 整数
 \EG integer
-@item i,m
+@item i m
 \JP 整数
 \EG integer
 @end table