SOLUTION: A function f is defined for integers m and n as given: {{{ f(mn) = f(m)*f(n)-f(m+n)+1001}}}, where either m or n is equal to 1, and f(1) = 2. a) Prove that {{{ f(x)=f(x-1)+1001}

Question 1145171: A function f is defined for integers m and n as given: , where either m or n is equal to 1, and f(1) = 2.
a) Prove that
b) Find the value of f(9999).
Answer by Edwin McCravy(20056) (Show Source): You can put this solution on YOUR website!
A function f is defined for integers m and n as given:
, where either m or n is equal to 1,
and f(1) = 2.
a) Prove that

Let m = x-1 and n = 1



Edwin

RELATED QUESTIONS
A function f is defined for integers m and n as given: f(mn)=f(m)f(n)-f(m+n)+ 1001, where (answered by ikleyn)

A function f is defined for integers m and n as given: f(mn)=f(m)*f(n)-f(m+n)+1001,... (answered by Edwin McCravy)

The function f(n) takes the integers to the real numbers such that f(m + n) + f(m - n) = (answered by CPhill,ikleyn)

The function f satisfies f(m + n) = f(m) + f(n) - 2f(mn + m + n + 1) + m^2 + n^2 for... (answered by CPhill)

A function f(n) defined for all positive integers has the property that f(m) + f(n) =... (answered by Edwin McCravy)

If f is a function such that for all integers m and n, f(m,1) = m+1 and f(m,n) =... (answered by MathLover1)

Determine whether the function f : Z � Z → Z is onto if a) f (m, n) = m. b) f (m, (answered by Edwin McCravy)

if f is a function such that for all integer m and n, f(m, 1) =m+1 and F(m, n) = F(m+2,... (answered by ikleyn,greenestamps)

If a sequence is defined recursively by f(0)=2 and f(n+1)=-2f(n)+3 for n>or=0 then f(2)... (answered by greenestamps)