My question really is, what is the proof of the following:?
The answer to the above sequence question can be any number N and rationalized by the following equation:
f(x) = 192 - 97C(x,1) + 38C(x,2) - [32-N]C(x,4)
where C(a,b) = a! / [(a-b)! b!]
and which implies that f(1) = 95, f(2) = 36, f(3) = 15 f(4) = N
2006-06-18
16:16:48
·
2 answers
·
asked by
Scott R
6
in
Science & Mathematics
➔ Mathematics
The question was originally asked a little while ago at:
http://answers.yahoo.com/question/index;_ylt=Al4bT9wa8eL0PiWC14B6WUPsy6IX?qid=20060618090802AAxjV1V
2006-06-18
16:19:06 ·
update #1
Eulercrosser
where do you need to evaluate N! ?
2006-06-18
16:41:58 ·
update #2
The function f only needs to have values at 1,2,3,4,....
2006-06-18
16:44:50 ·
update #3
Eulercrosser-
Gotcha...
C'mon tho, you're a math guy. C is the combinitorial function and C(a,b)=0 when a
2006-06-18
16:50:36 ·
update #4
The real point here is that C(x,k) is a polynomial in x of degree k, since
C(x,k) = x(x-1)(x-2)...(x-k+1)/k!
2006-06-18
16:53:42 ·
update #5
Actually, you can get away with
f(x-1) = 95 - 59C(x,1) + 38C(x,2) -[32-N]C(x,3)
A polynomial of degree 3.
2006-06-18
17:00:40 ·
update #6
Or,
F(y) = 95 - 59C(y+1,1) + 38C(y+1,2) -[32-N]C(y+1,3)
2006-06-18
17:03:16 ·
update #7
Eulercrosser
Die Antwort ist richtig.
2006-06-18
17:07:36 ·
update #8
Yea Lagrange no good unless you change variable and define for larger x; Newton Interpolation is probably the best as here.
2006-06-18
17:27:41 ·
update #9