AngouriMath
SumOverSetf
Description
Summary
A sum over a set: sum(f(x), x in S) is the sum of f(x) over the members
x of S , each counted once. A binder, like Summationf, whose
range is a set rather than two bounds, and so has no index and no order: the sum over
the roots of a polynomial issum(f(w), w in { w : p(w) = 0 }) , which needs no
first root.
https://github.com/asc-community/AngouriMath/issues/1285
range is a set rather than two bounds, and so has no index and no order: the sum over
the roots of a polynomial is
first root.
https://github.com/asc-community/AngouriMath/issues/1285
Members
#ctor(AngouriMath.Entity,AngouriMath.Entity,AngouriMath.Entity)
MethodCodomain
PropertyDefaultCodomain
PropertyInitDirectChildren
MethodIntrinsicCondition
PropertyLatexizeNode
MethodOver
PropertyReplace(System.Func{AngouriMath.Entity,AngouriMath.Entity})
MethodStringizeNode
MethodToString
Method
Angouri © 2019-2023 · Project's repo · Site's repo · Octicons · Transparency · 4378 pages online