Home > Just Math
Politically Correct Moduli (Posted on 2005-09-03) |
|
The quadratic equation x^2-3x+2=0 has the "correct" number of solutions modulo 5 and 7. However, modulo 6 the equation has four solutions; namely, 1, 2, 4, and 5. For what positive integers n does the equation x^2-3x+2=0 have exactly two incongruent solutions modulo n?
|
Submitted by McWorter
|
Rating: 4.0000 (2 votes)
|
|
Solution:
|
(Hide)
|
Answer: powers of a single prime. If x^2-3x+2 is congruent 0 modulo n=p^k, where p is a prime, then, since x-1 and x-2 are relatively prime, p divides only one of x-1 and x-2. Hence x is congruent 1 or 2 modulo n.
On the other hand, let n=ab, where a and b are relatively prime and both greater than 1. Then there exist integers u and v such that au+bv=1. Set x=au+1. Then x=-bv+2 as well. Hence x-1 is divisible by a and x-2 is divisible by b. Thus the product, x^2-3x+2, is congruent 0 modulo n=ab. The integer x=-bv+2 is not congruent to 1 modulo n because this implies bv is congruent 1 modulo n, contradiction. Similarly, x is not congruent 2 modulo n. Hence x^2-3x+2 has at least three incongruent roots modulo n=ab. |
Comments: (
You must be logged in to post comments.)
|
|
Please log in:
Forums (5)
Newest Problems
Random Problem
FAQ |
About This Site
Site Statistics
New Comments (7)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On
Chatterbox:
|