standard_description: Recognize that sequences are functions, sometimes defined recursively, whose domain is a subset of the integers. For example, the Fibonacci sequence is defined recursively by f(0) = f(1) = 1, f(n+1) = f(n) + f(n-1) for n ³ 1.
problem_activity: Task
Given a function $f$, is the statement $$f(x+h)=f(x)+f(h)$$ true for any two numbers $x$ and $h$? If so, prove it. If not, find a function for which the statement is true and a function for which the statement is false.


aligns: no