In[25]:=
?Quotient
Quotient[n, m] gives the integer
quotient of n and m, defined as
Floor[n/m].
;[o]
Quotient[n, m] gives the integer
quotient of n and m, defined as
Floor[n/m].
More detailed information can be obtained by using ??.
In[26]:=
??Mod
Mod[m, n] gives the remainder on
division of m by n. The result
has the same sign as n.
Attributes[Mod] =
{Listable, Protected}
;[o]
Mod[m, n] gives the remainder on
division of m by n. The result
has the same sign as n.
Attributes[Mod] =
{Listable, Protected}
If you don't know the name of a command, then you can
search by using a * in the command name. For example,
to find all commands beginning with Div, use ?Div*
In[27]:=
?Div*
Divide
DivideBy
DivisionFreeRowReduction
Divisors
DivisorSigma
;[o]
Divide
DivideBy
DivisionFreeRowReduction
Divisors
DivisorSigma
Exercise: Find out what DivisorSigma does and use to verify that
2305843008139952128
is a perfect number. You can also use Divisors to find the divisors of the
number and
FactorInteger to find the prime factorization.
Up to Tutorial