Let f1=1, f2=3, f3=4, f4=7,...f20=15127
Find f23
This one has an answer.
>>8775333
What kind of function is this?
>>8775354
Not a function. The numbers beside the fs are supposed to be subscripts but i no how latex good
>>8775360
Ah I was reading it as f of 1, f of 2, etc
>>8775333
It can be literally fucking anything. Cutting piece of cake vs powers of 2, etc etc.
Fuck you OP.
>>8775372
Fine. Heres a hint for the autist.
64079
Nice lucas numbers you prick
64079
u(n)=u(n-1)+u(n-2)
>>8775388
>This kid doesn't know about http://mathworld.wolfram.com/CircleDivisionbyChords.html
What's it like being this bad at math?
>>8775380
/thread
>>8775388
except you are the one who is retarded. 15127 is not in the Fibonacci sequence.
>>8775422
It could be in a fibonacci sequence, just not the original one.
f(n+2)=f(n+1)+f(n)
f(1) = 1
f(2) = 3
f(23) = 64079
even brainlet like me is able to solve such problem without math skill, what's happening sci
>retards helping an even bigger retard in a thinly veiled homework thread
this is why /sci/ is shit. brainlets tripping over each other to prove they aren't retarded.
64079
>>8775333
A retarded question.
The obvious solution is calculating an interpolating polynomial.
polyval(polyfit([1,2,3,4,20],[1,3,4,7,15127],4),23)
this returns 27745.3725490206
That is your answer.
>>8775333
>Found the Engineers
ITT: Making assumptions about a sequence