language agnostic - What are some algorithms for finding a closed form function given an integer sequence? -
I see a program's way to take an integer sequence and spit a closed form function. Something like this:
Returned: 1,3,6,10,15
Return: n (n + 1) / 2
Samples can be useful Are; Language is unimportant
It touches an extremely deep, refined, and active field of mathematics. In some cases (linear repetition) and negligent (2, 3, 5, 7, 11, 13, .... seems to be close to others) is damn close to trivial, for example seeing and seeing the Herb you can start Wilf's book on this topic (CF page 1 (2E)) but this will only get you so far.
But I think that your best bet is to lose, ask Sloan's comprehensive question when you must know, and instead read one of the most eccentric people in this dark subject Spend your time in
Anyone who tells you this problem is solvable, you will get snake oil (cf. page 118's wolfbook (2e).)
Comments
Post a Comment