how would you express recursively this functions and maps:
f(n) =∑ ceiling(i/2) for i=0 to n
f(n,k)= ∑ k+2i from i=0 to n
{0,1} f(x,y)={ 1 if x !=y; 0 otherwise}
f(x,y)={ 1 if x is a prefix of y; 0 otherwise}
thanks...
Hello ps1313No. Try a few values of , and work out :So instead of taking pairs of values of , even and odd, you'll have to take groups of 3, depending on the remainder 0, 1 or 2, that leaves when divided by 3.
... and so on.
I haven't worked it out, but I suspect that you'll need to link and now, rather than and . Try it and see.
Grandad