The following are terms:
459986536544739960976836 = 7^28 + 7 + 28 = 49^14 + 49 - 14,
1237940039285380274899124273 = 4^45 + 4 + 45 = 64^15 + 64 - 15,
6362685...0216378 (46 digits) = 9^48 + 9 + 48 = 81^24 + 81 - 24, and
1000000...0000070 (61 digits) = 10^60 + 10 + 60 = 100^30 + 100 - 30. (End)
Sequence is infinite.
If a, b > 1 and b^a-b == 0 mod a+1 then b^c+b+c is a term for c = ab(b^(a-1)-1)/(a+1), y = c/a, x = b^a.
If b > 1 and b <> 2 mod 3, then b^(2b(b-1)/3)+b(2b+1)/3 is a term.
If b > 2, then b^((b-1)(b^(b-2)-1)) + b + (b-1)(b^(b-2)-1) is a term. (End)
Either c>=3 or y>=3. If c=y=2, we get b^2+b+2=x^2+x-2, i.e. (x-b)(x+b+1) = 4. Since x>1 and b>1, x+b+1>4, a contradiction.
This allows for a faster search algorithm by assuming c>=3 and y>=3. The cases c=2 and y>=3 can be dealt with by picking y>=3 and solving for b in the quadratic equation b^2+b+2=x^y+x-y. Similarly for c>=3 and y=2. This approach was used to confirm a(9). (End)
|