Let $f: \mathbb R \to \mathbb R$ fulfill the following $f(x+1)=f(x)$.
1.) Prove that for all $n \in Z$ $f(x+n)=f(x)$.
2.) Prove that if the limit $\lim_{x \to \infty} f(x)=L$ exists, then f is a constant.
1.) Since we're given that $n \in Z$, I was immediately drawn to using induction. f is a periodic function with a period of 1.
Let's try n=1:
$f(x+1)=f(x)$
This is correct because that's what was given. Let's assume for any $n\in N$ this statement still holds true. Let's try for $n+1$:
$f(x+(n+1)$
Since we assumed n is true we can set (n+1)=m, and $m\in N$,therefore
$f(x+m)=f(x)$
Is my work correct? By induction we assume it holds true for n, adding 1 is just adding another period to the function.
2.) I'm having difficulties even starting with this one. Was thinking about using derivatives but it's not explicitly given that f is differentiable.
Your proof is good for proving that $f(x+n)=f(x)$ for positive integers $m$.
However, if you notice that $$ f(x-1)=f((x-1)+1)=f(x) $$ you'll be able to complete the proof for negative integers as well.
For the second part, assume $f$ is not constant, so there are $x_1$ and $x_2$ with $f(x_1)\ne f(x_2)$. Consider the sequences $$ a_n=x_1+n,\qquad b_n=x_2+n $$ What can you say about $$ \lim_{n\to\infty}f(a_n) $$ and $$ \lim_{n\to\infty}f(b_n) $$ taking into account that $\lim_{x\to\infty}f(x)=L$?
If you can't use sequences, it's a bit more complicated. But you can notice that, given $M>0$, there always is $n$ such that $x_1+n>M$ and $x_2+n>M$.
Take $\varepsilon=|f(x_1)-f(x_2)|/2$ and try seeing what happens taking into account that $\lim_{x\to\infty}f(x)=L$.