Oh. Here;
A number is Fibonacci if and only if one or both of (5n2 + 4) or (5n2 – 4) is a perfect square.
Turn your text into a string array where each element of the array corresponds to each word. Then iterate over the array and return the word of each index that passes the above test.
Oh.
Here;
>A number is Fibonacci if and only if one or both of (5n2 + 4) or (5n2 – 4) is a perfect square.
Turn your text into a string array where each element of the array corresponds to each word. Then iterate over the array and return the word of each index that passes the above test.
(post is archived)