1 2 3 4 5 6 7 8 9 10 11 12 13 14


li1,…,in

l.(i1,…,in)     where l:List | Vector | Range | Relation | Divisor | Table | Rule,i:NN

{l1,…,lm}i1,i2,...,in ={l1 i2,…,in ,…,lm i2,…,in }i1
[l1,…,lm] i1,i2,...,in = [l1 i2,…,in ,…,lm i2,…,in ] i1







replace(l:List|Vector,i1:ZZ,…,in:ZZ,x)

replace({l1,...,li,...,lm},i,x)={l1,...,li-1,x,li+1,...,lm}

replace({l1,...,li1 ,...,lm},i1,...,in,x)={l1,...,li-1,replace(li1 ,i2,...,in,x),li1+1,...,lm}







replace(l:List|Vector,i1:List | Vector | Range,…,in:List | Vector | Range,x)

if r:Range then replace(l,i1,...,r,...,in,x)=replace(l,i1,...,[r],...,in,x)







li

l.i     where l:List | Vector | Range | Relation | Divisor | Table | Rule,i:NN

if n=length(l) & 1<=i<=n

{l1,…,ln}i=li
[l1,…,ln] i=li
(a..b..d)i=a+d*(i-1)
{i1→v1,…,in→vn}j=(ij→vj)
[i1→v1,…,in→vn]j=(ij→vj)
{i1 = v1,…,in = vn}j=(ij=vj)

if i<1 | i>n returns an error.







l{i1,…,in}

l.{i1,…,in}     where l:List | Vector | Range | Relation | Divisor | Table | Rule,i:NN

if m=length(l), 1<=ik<=m with k=1,...,n

l{i1,...,in}={li1 ,...,lin } if l={l1,...,lm} or l=a..b..d
l{i1,...,in}=[li1 ,...,lin ] if l=[l1,...,lm]






l [i1,…,in]

l.[i1,…,in]     where l:List | Vector | Range | Relation | Divisor | Table | Rule,i:NN

l [i1,…,in] =l{i1,…,in}







la..b..d

l.(a..b..d)     where l:List | Vector | Range | Relation | Divisor | Table | Rule,i:NN

l : notRange
la..b..d=l [a..b..d]
l : Range
si l=α..β..γ then la..b..d=(α+(a-1)*γ)..(α+(b-1)*γ)..(d*γ) where 1<=a<=length(l), 1<=b<=length(l).

[la..b..d] = [l] a..b..d .







l.i1.....in     where l:List | Vector | Range | Relation | Divisor | Table | Rule,i:NN

{l1,…,lm}.i1.i2.....in={l1.i2.....in,…,lm.i2.....in}.i1
[l1,…,lm].i1.i2.....in=[l1.i2.....in,…,lm.i2.....in)].i1







D(x)=y






Pn

Icon


P.n






P1

P2

Icon


P.1

P.2







R(x)=y






s.1

s.2






T(x)=y





mathsformore.com powered by WIRIS

©2003 maths for more sl. All rights reserved. Legal notice