(Inspired from Conway´s Base-13 function - see)
Kα(x) ∈ ℝ; x ∈ ℝ; α ∈ ℝ; 0 < α < π/2
Imagine x written as infinit Base-12 number
Def: e ∈ { 0, 1, 2, ... 8, 9, A, B } (Base-12 digit)
Def: d ∈ { 0, 1, 2, ... 8, 9 } (decimal digit)
x in Base-12 has the Form: ±e+.e*
From now on ignore the point '.' and the sign in front - only look at the pure digits e+
We will generate n ∈ ℕ from e+ and we are lookingh for the very last A or B digit.
if e+ = e*Ad*Ad* : | Kα(x) = rowα,n(x) | (n = decimal number from d* inbetween A and A) |
if e+ = e*Bd*Ad* : | Kα(x) = rowα,-n(x) | (n = decimal number from d* inbetween B and A) |
if e+ = e*Ad*Bd* : | Kα(x) = colα,n(x) | (n = decimal number from d* inbetween A and B) |
if e+ = e*Bd*Bd* : | Kα(x) = colα,-n(x) | (n = decimal number from d* inbetween B and B) |
if e+ = d*Ad* : | Kα(x) = rowα,0(x) | |
if e+ = d*Bd* : | Kα(x) = colα,0(x) | |
if e+ = d+ : | Kα(x) = rowα,0(x) | |
else : | Kα(x) = colα,0(x) |
rowα,n(x) = x tanα + n/cosα
colα,n(x) = x cotα + n/sinα
Kπ/2(x) = K0(x)
First we define K(x, ε); ε ∈ ℝ; 0 < ε ⋘ 1
Def: C(x) ist Conway´s Base-13 function.
Take x as Base-12 as before, ignore point and sign and get e+
if x - ⎣x⎦ < ε : | K(x, ε) = C(x) | |
if e+ = e*Ad*Ad* : | K(x, ε) = n | (n = decimal number from d* inbetween A and A) |
if e+ = e*Bd*Ad* : | K(x, ε) = -n | (n = decimal number from d* inbetween B and A) |
if e+ = e*Ad*Bd* : | K(x, ε) = n | (n = decimal number from d* inbetween A and B) |
if e+ = e*Bd*Bd* : | K(x, ε) = -n | (n = decimal number from d* inbetween B and B) |
else : | K(x, ε) = 0 |
K0(x) = K(x, ε) for ε → 0