Don't think we need induction here.
We observe that
Since a multiple of
![](https://latex.codecogs.com/png.latex?\bg_white 14n + 3 )
differs from a multiple of
![](https://latex.codecogs.com/png.latex?\bg_white 21n + 1 )
by 1, we cannot have any positive integer greater than 1 simultaneously divide
![](https://latex.codecogs.com/png.latex?\bg_white 14n + 3 )
and
![](https://latex.codecogs.com/png.latex?\bg_white 21n +1 )
. Hence the greatest common divisor of the fraction's numerator and denominator is 1, so the fraction is irreducible. Q.E.D.