RNT2.6.2. Eisenstein's Criterion is like a super helpful detective that tells you whether a number can be broken down into simpler parts, just by looking at its digits and how it behaves with other numbers.
Imagine you have a big candy bar, and you want to know if it can be split evenly among your friends. Instead of breaking it apart right away, you check the digits (the numbers on the label) and see how they act when divided by another number, let’s say 3.
The Detective's Clue
Eisenstein’s detective uses a special clue: if a number looks like this:
a_n x^n + a_{n-1} x^{n-1} + ... + a_1 x + a_0
And when you check the digits (a_n, a_{n-1}, ..., a_0) with another number (let’s say 3), it behaves nicely, like all digits are divisible by 3, except the last one, which isn't, then you know for sure that this big candy bar can’t be split evenly among your friends in certain ways.
It's like having a special rule book for detectives who love candies and numbers. They use it to solve mysteries faster!
Examples
- A polynomial like $x^2 + x + 1$ might be hard to factor, but Eisenstein's Criterion gives a simple rule using prime numbers to check if it can’t be factored.
- It works like a shortcut for proving polynomials are irreducible.
Ask a question
See also
- Why Do Numbers Sometimes Act Like They’re Alive?
- How Does 8128 and Perfect Numbers - Numberphile Work?
- How Does 37 - Numberphile Work?
- How Does 1 and Prime Numbers - Numberphile Work?
- How Does Imaginary Numbers Are Real [Part 1: Introduction] Work?