Let $k,m \in \mathbb{N}$, $a = k + m\sqrt{2}$
I have proved that $a = k + m\sqrt{2}$ is an irrational number.
Now, I am asked to prove that to every $n \in \mathbb{N}$, $(1+\sqrt{2})^n$ is an irrational number. And I can use what I have proved before (about $a = k + m\sqrt{2}$ being irrational).
I was advised to prove it with mathematical induction.
The base
We check the arguement for n=1: $(1+\sqrt{2})^1 = 1+\sqrt{2}$
We define $k,m=1$ , and 1 is a natural, so $k,m \in \mathbb{N}$
so $(1+\sqrt{2})^1 = 1+\sqrt{2} = k + m\sqrt{2}$ , Which I already proved to be irrational.
Inductive step
We assume $(1+\sqrt{2})^n$ is an irrational number. We need to prove $(1+\sqrt{2})^{n+1}$ is also irrational.
So, $(1+\sqrt{2})^{n+1}$ = $(1+\sqrt{2})^n \cdot (1+\sqrt{2})^1$ Because of exponent rules.
We proved in the base step that $(1+\sqrt{2})^1$ is irrational, and we assumed in the inductive step that $(1+\sqrt{2})^n$ is an irrational.
But how does it help me forward?
I cannot state that multiplication of 2 irrationals is an irrational. It is simply not true. So it is kind of confusing what I should do next.
In your inductive step, assume that $\exists k, m > 0 : (1+\sqrt{2})^n = k + m\sqrt2$. Then:
$$(1+\sqrt{2})^{n+1}$$ $$= (k + m\sqrt2)(1 + \sqrt 2)$$ $$= k + k\sqrt 2 + m\sqrt2 + 2m$$ $$= (k + 2m) + (k + m)\sqrt2$$
Since $k + 2m$ and $k + m$ are both positive integers, this expression fits the form that you have already proven to be irrational.