$a_1=1$; $a_{n+1}=\sqrt{3a_n-1}$ $\quad$ $(n\ge1)$
Now I have to show it is true for $n=1$, which is easy. I have to assume it is true for $n=k$, therefore:
$\sqrt{3a_{k}-1}$ $\gt$ $\sqrt{3a_{k-1}-1}$
And I have to show that it is true for $n=k+1$ , so I have to prove:
$\sqrt{3a_{k+1}-1}$ $\gt$ $\sqrt{3a_{k}-1}$
Have I set this out correctly?
This is the point where I get stuck. From looking at it, it already looks like a very weak induction.
Your inductive hypothesis is: $\sqrt{3a_{k} - 1} > a_{k}$.
In proving the $k \implies k+1$ case:
Remember that $\sqrt{3a_{k+1} - 1}$ can be re-written in terms of $a_k$.
Specifically:
$a_{k+1} = \sqrt{3a_{k} - 1}$; so your inequality becomes:
$$\sqrt{3\sqrt{3a_{k} - 1} - 1} > \sqrt{3a_{k} - 1} \iff 3\sqrt{3a_{k} - 1} - 1 > 3a_{k} - 1 \iff \sqrt{3a_{k} - 1} > a_{k}$$
where we have assumed positivity throughout, and the final inequality is your inductive hypothesis.