A number pair ( ) is called special, if and are positive integers, and have the same prime divisors, and and have the same prime divisors too. For example ( ) is a special number pair.
is it true, that there are infinite many special number pairs?
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.
Claim: The number pair ( 2 n − 2 , 2 2 n − 2 n + 1 ) is special for any n ≥ 2 integer.
Proof: Since 2 n − 2 = 2 ( 2 n − 1 − 1 ) and 2 2 n − 2 n + 1 = 2 n + 1 ( 2 n − 1 − 1 ) , they must have the same prime divisors, namely 2 and the prime factors of 2 n − 1 − 1 . Moreover ( 2 n − 1 ) 2 = 2 2 n − 2 n + 1 + 1 , hence 2 n − 1 and 2 2 n − 2 n + 1 + 1 must have the same prime divisors too. Thus by the definition of special number pairs, our claim is true.
According to this there is a unique special number pair for every n ≥ 2 , hence there are indeed infinitely many of them.