I have a good understanding of how to use induction, but these two proof are really puzzling me.
1)Use mathematical induction to prove that for every positive integer $n$ greater than $23$, there exist nonnegative integers $x$ and $y$ for which $n = 7x + 5y.$
For this one. Do I have to do anything with the $x$ and $y$? I know I need to show $n+1$ is true but am I suppose to rewrite $n = 7x + 5y$ to something like $n+1 = 7x + 5y+1$ and use the induction hypothesis to plug that in for $n+1$ in $n+1>23$?
2) Prove that given any integer $n > 1$, there is a power of $2$ that is bigger than $\frac{n}{2}$ and less than or equal to $n$.
This one wasn't specified that it can be done by induction, but I am pretty sure it can be. (I hope) I am thinking the inequality should look like this $n \ge 2^n> \frac{n}{2}$ but how can $n\ge 2^n$ be true when $n > 1$?
Prove the first one using strong induction. Just note explicitly that $$ 24 = 2\cdot 7 + 2 \cdot 5,\\ 25 = 0\cdot 7 + 5 \cdot 5,\\ 26 = 3 \cdot 7 + 1\cdot 5,\\ 27 = 1 \cdot 7 + 4\cdot 5,\\ 28 = 4\cdot 7 + 0 \cdot 5; $$ then for any $n\ge 29$, using the assumption that $n-5=5x+7y$ (since $n-5$ is larger than $23$), $n$ is equal to $5(x+1)+7y$.