Application Guide

factor()
Catalog >
Note: See also cFactor() for factoring all the
way to complex coefficients in pursuit of
linear factors.
factor(rationalNumber) returns the rational
number factored into primes. For
composite numbers, the computing time
grows exponentially with the number of
digits in the second-largest factor. For
example, factoring a 30-digit integer could
take more than a day, and factoring a 100-
digit number could take more than a
century.
To stop a calculation manually,
• Handheld: Hold down the c key and
press · repeatedly.
• Windows®: Hold down the F12 key and
press Enter repeatedly.
• Macintosh®: Hold down the F5 key and
press Enter repeatedly.
• iPad®: The app displays a prompt. You
can continue waiting or cancel.
If you merely want to determine if a
number is prime, use isPrime() instead. It is
much faster, particularly if rationalNumber
is not prime and if the second-largest factor
has more than five digits.
FCdf()
Catalog >
FCdf
(lowBound,upBound,dfNumer,dfDenom) ⇒
number if lowBound and upBound are
numbers, list if lowBound and upBound are
lists
FCdf
(lowBound,upBound,dfNumer,dfDenom) ⇒
number if lowBound and upBound are
numbers, list if lowBound and upBound are
lists
Alphabetical Listing 69