<p>CONCEPTS</p>

d2ceb8ab-964c-4f1a-9712-e260c31f946a 77 4 5 decimal

&[DATE] &[TIME] - &[FILENAME]

function name

3 lele

x a b lele a x ≤ (x b ≤ (&

- acronyms of the symbols involved - names like HTML entities syntax: le, lt, ge, gt 'l' is for 'less' 'g' is for 'greater' 't' is for 'than' 'e' is for 'equal to'

3 lelt

x a b lelt a x ≤ (x b < (&

3 ltle

x a b ltle a x < (x b ≤ (&

3 ltlt

x a b ltlt a x < (x b < (&

all functions are font-scalable: * minor issues with font-size less than 10pt; * thickness scaling not available.

3 gege

x a b gege a x ≥ (x b ≥ (&

3 gegt

x a b gegt a x ≥ (x b > (&

3 gtge

x a b gtge a x > (x b ≥ (&

3 gtgt

x a b gtgt a x > (x b > (&

cases(2n+1) n>0 {3,5...}

a x 0 > b cases

T.R c.r 0.75 T.R 1 ≡ 0.75 0.0652 T.R ln * + T.R 15 lelt 0.75 1 0.2 11 T.R / - ln - ln * - sqrt * T.R 550 lelt 0.65 1 0.138 11 T.R / - ln - ln * - (* T.R 50 ≥ n.d. cases :

a x 0 > b x 0 < c cases

x f 3 x 0 > 2 x 1 - 0.5 - ltlt 1 x 2 - < 1 - cases :

x f x c.r 50 50 c.r . 20 #ff0000 1 5 mat 2 1 sys

symbolic optimization (mainly useful to use with integrals) * any not null condition is like a 'true' (by design)

z c.e k.r 2^z.min z.0 / ln * z.min c.t * z.min z.0 / ln z.min c.t * 7 + (* z z.min ≤ k.r 2^z z.0 / ln * z c.t * z z.0 / ln z c.t * 7 + (* cases :

a x 0 > b x 0 < c cases x 0 > (0 ≠ (a * x 0 > (0 ≡ (x 0 < (0 ≠ (b * x 0 < (0 ≡ (c * + (* +

optimization numeric: nested if/else

change f(x) optimization x f x 35 int #

a x 0 > b x 0 < c cases #

z c.e z# z.min z z.min ≤ z cases : k.r 2^z# z.0 / ln * z# c.t * z# z.0 / ln z# c.t * 7 + (* 21 line :

optimization none: no function calls

a x 0 > b x 0 < c cases a x 0 > b x 0 < c cases

Kronecker(2)

i j Kronecker 1 i j ≡ 0 cases

show cases() on 'none' optimization

33 Kronecker 1

34 Kronecker 0

N perc N 100 /

perc(1)

N permil N 1000 /

permil(1)

Ceil(1)

3.1 Ceil 4

* will be moved into the Statistical Tools Plugin

3.9 Ceil 4

Floor(1)

3.9 Floor 3

* will be moved into the Statistical Tools Plugin

3.1 Floor 3

at(2)

z f z diff x at

at(3)

x f x diff a b at

x sin x.0 x.1 at x.1 sin x.0 sin -

x sin x.0 at x.0 sin

z sin x at x sin 2 π * x * x π + at

a b f 2 a * b + :

x y f y 2 x * +

implicit equivalence: - any unknown needs a value; - values are set sorting unknowns in alphabetical order.

a b f x y 21 sys at y 2 x * +

a b f x y 12 mat at y 2 x * +

a b f x y 21 mat at y 2 x * +

a b f a y 12 mat at y 2 a * +

"a" untouched

a b f b a 12 mat at a 2 b * +

swap unknowns

explicit equivalence: - allowed total or partial replacement; - random sorting allowed;

a b f a x ≡ b y ≡ 21 sys at y 2 x * +

a b f a x ≡ b y ≡ 12 mat at y 2 x * +

a b f a x ≡ b y ≡ 21 mat at y 2 x * +

a b f b y ≡ a x ≡ 12 mat at y 2 x * +

random sorting

a b f a x ≡ at b 2 x * +

partial replacement

a b f b y ≡ at y 2 a * +

partial replacement

a b f z x ≡ at b 2 a * +

absent unknown to replace

f z 3^(z diff :

z 3^(z diff 3 z 2^*

352^* 75

f 5 at 75

priorities & parameters

x f z! 1 z + / z x + (* (z 15 sum :

4 f 235.4

x f 4 at 235.4

k n k int 3 at k n k int k 3 ≡ (at

<p>CONCEPTS</p>

grad(1)

f grad

for writing math only

grad(2)

f x grad

for writing math only

lapl(1)

f lapl

for writing math only

lapl(2)

f x lapl

for writing math only