Update of /cvsroot/aimmath/AIM/WEB-INF/maple
In directory sc8-pr-cvs1:/tmp/cvs-serv1834
Modified Files:
Random.mpl
Log Message:
A minor tweak
Index: Random.mpl
===================================================================
RCS file: /cvsroot/aimmath/AIM/WEB-INF/maple/Random.mpl,v
retrieving revision 1.5
retrieving revision 1.6
diff -C2 -d -r1.5 -r1.6
*** Random.mpl 1 Sep 2003 20:22:23 -0000 1.5
--- Random.mpl 3 Sep 2003 15:49:11 -0000 1.6
***************
*** 398,402 ****
`Package/Assign`(
! `Nice/Monomial`::procedure,
"Produces a monomial of the form @a*x^n@ where @a@ is randomly selected from @arange@ and @n@ is randomly selected from @deg@ if those arguments are present. If @deg@ or @arange@ are not passed as arguments the default value is @1..3@ for both. The argument @x@ is mandatory and can be any algebraic expression or Inert Expression.",
proc(x::{algebraic,InertExpr},deg,arange)
--- 398,402 ----
`Package/Assign`(
! `Nice/Monomial`::InertExpr,
"Produces a monomial of the form @a*x^n@ where @a@ is randomly selected from @arange@ and @n@ is randomly selected from @deg@ if those arguments are present. If @deg@ or @arange@ are not passed as arguments the default value is @1..3@ for both. The argument @x@ is mandatory and can be any algebraic expression or Inert Expression.",
proc(x::{algebraic,InertExpr},deg,arange)
***************
*** 419,423 ****
`Package/Assign`(
! `Nice/Binomial`::procedure,
"Produces a \"nice\" binomial from its arguments (which is more complicated than it sounds). If one looks through the problems assigned in a typical calculus or precalc book, one will notice that there are certain rules that authors tend to follow when designing \"nice\" questions. This procedure attempts to produce a \"nice\" random binomial in @x@ that is a sum of a monomial in @x@ and a constant term in a random order. The defaults for the degree of the monomial and the two coefficients can be overriden by supplying the appropriate arguments. The argument @x@ is mandatory and can be any algebraic expression or Inert Expression.",
proc(x::{algebraic,InertExpr},deg,arange,brange)
--- 419,423 ----
`Package/Assign`(
! `Nice/Binomial`::InertExpr,
"Produces a \"nice\" binomial from its arguments (which is more complicated than it sounds). If one looks through the problems assigned in a typical calculus or precalc book, one will notice that there are certain rules that authors tend to follow when designing \"nice\" questions. This procedure attempts to produce a \"nice\" random binomial in @x@ that is a sum of a monomial in @x@ and a constant term in a random order. The defaults for the degree of the monomial and the two coefficients can be overriden by supplying the appropriate arguments. The argument @x@ is mandatory and can be any algebraic expression or Inert Expression.",
proc(x::{algebraic,InertExpr},deg,arange,brange)
***************
*** 509,513 ****
`Package/Assign`(
! `Nice/Trinomial`::procedure,
"Produces a \"nice\" trinomial in @x@. See #Nice/Binomial# for more info.",
proc(x::{algebraic,InertExpr},deg,arange,brange,crange)
--- 509,513 ----
`Package/Assign`(
! `Nice/Trinomial`::InertExpr,
"Produces a \"nice\" trinomial in @x@. See #Nice/Binomial# for more info.",
proc(x::{algebraic,InertExpr},deg,arange,brange,crange)
|
