Parameter name: request
Translate Request has too much data
Parameter name: request
Evariste Galois
A former colleague wondered if the quadratic formula held when are complex numbers.
He could, of course, have figured this out by the process of completing the square:
If then exactly when (thanks to James Tanton for this trick).
This happens exactly when or, equivalently when .
This leads us to the equivalent form from which we deduce the quadratic formula.
What did we need to get this line of reasoning to work?
We need to know that if then exactly when . This means we can multiply and divide by non-zero quantities (as well as add and subtract).In exchanging for we are using commutativity of multiplication. We use this again in expanding the squareIn current mathematical parlance, this means the quantities come from a field. Examples are the field of rational numbers, the field of real numbers, and the field of complex numbers.
To take the final step from to we need to be able to extract square roots. In the field of real numbers we can always do this for non-negative numbers, but already the field of rational numbers presents difficulties. For the complex field we can always solve for but the square root function does not exist as it does for positive real numbers.
The numbers where we add and multiply modulo 7 – keeping only the remainder after division by 7 – form a field, denoted
The only point that might be in doubt is division by a non-zero quantity, but we can see this can always be carried out from the following table of multiplicative inverses:
So to solve a quadratic equation where the quantities come from we can reach the step and then wonder if we can always solve this equation.
For example if try to solve the quadratic equation where come from we reach the step mod 7.
What solutions, if any, are there to mod 7?
So there are two solutions for to : .
This gives or so that or
We can replace the number 7, above, by any prime number to get a field denoted .
The existence of multiplicative inverses follows from Euclid’s algorithm, and when is not a prime number it’s easy to see that division by non-zero quantities in is not always possible.
When the equation has a solution in , the number is called a quadratic residue mod p.
Determining which numbers are quadratic residues mod p is a solved, but interesting, problem that is an excellent investigation for students, and it comes simply out of trying to solve quadratic equations over these fields.
But this does not exhaust the finite fields, and for every prime number and positive integer there is a field – known as a Galois field – with elements.
So now we want to know under what conditions we can solve where come from a finite field.
When the quantities are rational numbers we again have the question of whether the equation has a rational number solution for
This, of course boils down to when has a rational number solution when is a rational number – that is, to when square roots of positive rational numbers are again rational numbers.
Thinking about exactly what we need to solve a quadratic equation leads us straightforwardly to solving quadratic equations over less often encountered number fields, which in turn leads us directly to interesting and deep questions of number theory, which, nevertheless, are capable of being investigated by school students.
Investigating quadratic residues mod p, p prime, might also lead to more respect for the subtle intricacies of the square root as a function. The answer to is not resolved by simply writing .
Tagged as: completing the square, field, finite field, Galois field, prime number, quadratic equation, quadratic residue
No comments:
Post a Comment