You are not logged in.
Pages: 1
Hi.
I need a function, which has the property:
Thank you.
IPBLE: Increasing Performance By Lowering Expectations.
Offline
Krassi, it seems to be that:
f(0) = f(-2)
f(1) = f(-3)
f(2) = f(-4)
and so on. At least that's the only constaint that I could come up with. So it seems that:
f(k) = k for k >= 0
f(k) = f(-k + 2) for k < 0
Works. But I have yet to really test it.
"In the real world, this would be a problem. But in mathematics, we can just define a place where this problem doesn't exist. So we'll go ahead and do that now..."
Offline
f(k)=k for k>=0?
But then f(3)=3f(2)+1=7...
IPBLE: Increasing Performance By Lowering Expectations.
Offline
f(n+1)= nf(n)+f(n-1)
f(n+2)= (n+1) f(n+1)+ f(n)
= ((n+1)n+1) f(n)+ (n+1) f(n-1)
f(n+3)= (n+2) f(n+2) +f(n+1)
= ... I don't want to write it out
X'(y-Xβ)=0
Offline
f(n+1)= nf(n)+f(n-1)
f(n+2)= (n+1) f(n+1)+ f(n)
= ((n+1)n+1) f(n)+ (n+1) f(n-1)f(n+3)= (n+2) f(n+2) +f(n+1)
= ... I don't want to write it out
It will go bigger and bigger, besause in the expansion of f(x) there are 2 f-s.
You will get something as a Fibbonacci tree.
I'm starting to think that there won't be a simple function with this property. What about an integral?
IPBLE: Increasing Performance By Lowering Expectations.
Offline
I guess it's a couple ways bigger than exponential.
Because exponential multiplies by a constant over and over, but
this multiplies by an increasing number, plus the small addition of the second term looking back a couple.
How do you think up these things, anyway?
igloo myrtilles fourmis
Offline
It must involve the factorials.
I can find limits for this functions (m(x)<=f(x)<=M(x) for every x), and thus some asymptotic relations.
But I want the exact function.
IPBLE: Increasing Performance By Lowering Expectations.
Offline
Pages: 1