Statement true for all prime numbers -- can this be done by Math Induction?

Question

Let's say that you want to prove a statement is true for all prime numbers. Can this be done by Math Induction?

Answer 1

Let's say that you want to prove a statement is true for all prime numbers.
Such as Fermat's Last Theorem:

$$ X^p+Y^p=Z^p$$

has no non-trivial integer solutions for all primes $p>2$.

Can this be done by Math Induction?

This is not known.