mathscapes v0.0.3

mathscapes Collection of math algorithms

Roadmap 2020

mathscapes ├ core │ ├ logic │ ├ set 7Apr v0.0.1 │ ├ category │ └ computation └ pure ├ quantity │ ├ natural 9Apr v0.0.3 │ ├ integers 9Apr v0.0.3 │ ├ rational │ ├ real │ ├ complex │ └ infinite ├ structure │ ├ combinatorics │ ├ number │ ├ group │ ├ graph │ ├ order │ └ algebra ├ space │ ├ geometry │ ├ trigonometry │ ├ differential │ ├ topology │ ├ fractal-geometry │ └ measure └ change ├ calculus ├ vector-calculus ├ differential-eq ├ dynamical-systems ├ chaos └ complex-analysis

set

_map (it, f)
_filter (it, f) _lim (it, f) _set (card) Class

fset (list) Finite set; extends _set iset (f) Infinite set; extends _set

len (S) Returns length of S has (S, e) Returns if S contains a element e cpy (S) Returns a copy of S add (S, e) Adds e to S rem (S, e) Removes e from S str (S) Returns a string of all elements of S uni (S1, S2) Returns S1 ∪ S2 com (S1, S2) Returns S1 ∩ S2 dif (S1, S2) Returns S1 - S2 sdif (S1, S2) Returns S1 ∆ S2 cpro (S1, S2) Returns S1 × S2 pow* (S) Returns ℙ(S)

map (S, f) filter (S, f) lim (S, f)

is.nl (S) Returns if S is null is.sub (S1, S2) Returns if S1 ⊆ S2 is.sup* (S1, S2) Returns if S1 ⊇ S2 is.eq (S1, S2) Returns if S1 = S2 is.dj (S1, S2) Returns if S1 and S2 are disjoint

• Under development

Note: Most set operations are implemented for fsets only at the moment.