Suppose you want to show you can climb every rung of an endless ladder. You need two facts: you can get onto the first rung, and from any rung you can reach the next one. With both, rung 1 gives rung 2, rung 2 gives rung 3, and so on forever. Neither fact is enough alone: without the first you never start, and without the second you might be stuck at rung 5.
In a proof, the base case is the first rung: check P(1), or whatever the starting value is, directly. The inductive step is the climb: assume P(k) for an arbitrary k and use it to prove P(k+1). Take 2n>n. Base: 21=2>1. Step: if 2k>k, then 2k+1=2⋅2k>2k≥k+1 whenever k≥1. The assumption 2k>k is where the step gets its strength; a step that never uses it is not induction.
Checking n=1,2,3,4,5 is not induction: that is five rungs, not a rule for climbing. And not every claim with an n needs induction. "If n is odd, then n+1 is even" is one statement about any odd n, with nothing linking n=7 to n=9, and a direct proof settles it in a line. Induction fits when case k+1 is naturally built from case k.
Think of it like this. Induction is a line of dominoes: push over the first, set them so each falling one hits the next, and the whole line falls. Both parts matter, since a gap anywhere or a first domino nobody pushes stops everything. Real lines of dominoes run out, while induction keeps going through every integer.
Core idea. Mathematical induction proves a statement for all integers by checking a base case and showing that whenever it holds for n it must hold for n+1.