can any identity involving integers be proved by mathematical induction

Question

Hello mathematics community,

Today I was studying mathematical induction which is an axiom.

I was wondering

1. Can "ANY" identity or inequality involving integers which is already proven can also be proved by mathematical induction?

2. Are there any theorems which can only be proved using mathematical induction?

3.As far as I know we have first principle of mathematical induction, second principle of mathematical induction

Do we have nth principle of mathematical induction also, if yes can I know problems involving it.(n value being larger upto 10 or even more).

I dont know what tags are to be kept for this question....

Thankyou for your valuable time.

EDIT

I have found the answer for the third question and the example of such a problem is to prove the that the number of triangles in a triangulation of polygon of n sides is n-2. Here is the link https://www.youtube.com/watch?v=Z9sYIWHIvNc

Answer 1

As a logical matter, the answer to 1. is yes, since any proof could be inserted into an inductive proof. As a practical matter, the answer is no, since some proofs about integers are best proven using fields in which integers are embedded (real or complex numbers, for example).

The answer to 2. is yes, if you mean "require the assumptions that induction uses". In particular, when using mathematical induction on integers we assume the set of natural numbers is well ordered (every nonempty subset has a least element). This assumption is equivalent to the Axiom of Choice.

Answer 2

Here is an integer identity which can easily be proved, but not by induction:

$$p\in\mathbb{P}\implies[p=2]\vee[p=3]\vee[p\equiv\pm1\pmod6]$$

However, I have no idea how to prove that it cannot be proved by induction.