How many pairs of integers exist such that the equation has among its solutions two distinct real numbers whose product is 1.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Let n ≥ 2 be a positive integer. Then let y n = n + n 2 − 1 . There are integers a n , c n such that y n 2 0 2 0 = c n + a n n 2 − 1 . Then if b n = c n − n a n , it is easy to check that y n 2 0 2 0 = a n y n + b n . Now notice that 1 / y n = n − n 2 − 1 , the ( Galois ) conjugate of y n , and conjugating both sides immediately shows that ( 1 / y n ) 2 0 2 0 = a n ( 1 / y n ) + b n . (This can be checked directly as well, without any field theory.)
Since there are infinitely many y n , there are infinitely many equations of the form x 2 0 2 0 = a n x + b n which have two distinct real roots whose product is 1. It's possible that some of these equations are the same (i.e. a m = a n , b m = b n for some m , n ), but any particular equation of this type has finitely many roots, hence finitely many y n as roots, so there must be infinitely many distinct equations of this type as well.