41
IFT
* = function
IABCUV Returns a solution in integers
u
and
v
of
au
+
bv
=
c
,
where
a
,
b
, and
c
are integers.
<!
INTEGER
n
1
n
2
n
3
→
z
1
z
2
IBERNOULLI Returns the
n
th Bernoulli number for a given integer.*
N
n
1
→
z
1
IBP Performs integration by parts on a function.
<$
DERIV &
INTEG
‘
symb
1
’
‘
symb
2
’
→ ‘
symb
3
’
‘
symb
4
’
ICHINREM Solves a system of two congruences in integers using the
Chinese Remainder theorem.
<!
INTEGER
[
vector
1
]
[
vector
2
]
→ [
vector
3
]
IDIV2 For two integers,
a
and
b
, returns the integer part of
a
/
b
,
and the remainder,
r
.
<!
INTEGER
n
1
n
2
→
n
3
n
4
IDN Returns an identity matrix.
< %
CREATE
n
→ [[
R-matrix
identity
]]
IEGCD Given two integers
x
and
y
, returns three integers,
a
,
b
,
and
c
, such that:
ax
+
by = c.
<!
INTEGER
n
1
n
2
→
n
3
n
4
n
5
IF Starts IF … THEN … END and IF … THEN … ELSE …
END conditional structures.
<N
BRANCH
IFERR Starts IFERR … THEN … END and IFERR … THEN …
ELSE … END error trapping structures.
<N
ERROR
IFERR
IFFT Computes the one- or two-dimensional inverse discrete
Fourier transform of an array.
< P
FFT
[
array
]
1
→ [
array
]
2
IFT Executes
obj
if
T/F
is nonzero; discards
obj
if
T/F
is zero.
<N
BRANCH
T/F obj
→
Name Description Access Inputs Outputs
To Next Page
Loading...
