Find (with proof) the length of the longest arithmetic subsequence of the Fibonacci sequence.
$\small\textbf{Source:}$ Self-made, but probably well-known by now.
Samiun Fateeha Ira wrote:But subsequence does not necessarily need to be of consecutive terms of the original sequence, does it?
Samiun Fateeha Ira wrote:But subsequence does not necessarily need to be of consecutive terms of the original sequence, does it?
Nirjhor wrote:A substring of a string is any portion cut off from the string, so... I'm not quite sure about what is meant here by subseq.
Users browsing this forum: No registered users and 1 guest