Determine all possible five digit positive decimal (base 10) integer(s) of the form abbbb, with a ≠ b, that contain no leading zeroes, such that (abbbb² - 1) is equal to a positive ten digit integer (with no leading zeroes) containing each of the digits 0 to 9 exactly once.

Note: While the solution may be trivial with the aid of a computer program, show how to derive it without one.

(In reply to analytical and brief by Ady TZIDON)

Thanks AT.

I confirm having hyperlinked your methodology in my solution.

Posted by K Sengupta on 2008-08-25 13:05:36