I'm doing practise exam questions, and have got the following question :
Consider the function $\operatorname{five}: \Bbb N \to \Bbb N$ defined recursively as follows:
1) Base case: $\operatorname{five}(0) = 10$
2) Recursive case: $\operatorname{five}(x) = \operatorname{five}(x-1)+5$, for any $x>0$
prove using induction on the natural numbers that the following equality is true for all natural numbers $n \in \Bbb N$:
$$\operatorname{five}(n)=(n+2)*5$$
Here's what i've got down so far, but can't pass this point
Let $x=1 $
$$\operatorname{five}(1-1)=0 - 0+5 = 5 $$
Assume $x(k)$ holds $k+1$ must hold so the rest must hold...
I can't really write it in a mathematical way or get passed here=/ cheers in advance