About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
June 2021 - Solution
While brute force is possible, certainly for the non-asterisked part of the problem, a quick way to determine possible representations as is using Cornacchia's algorithm, which can be easily implemented without relying on any number-theory-specific math library.
A simple solution with more than 100 digits arises for a=34 and b=75, giving the following solution:
7259701736680389461922586102342375953169154793471358981661239413987142371528493467259545421437269088935158394128249
(34, 75)
(2341523227685802973317116937233099044272373695299363945845, 1333030648893058553789277061401358577881136005688481248832)
(1688720447290015642452516760229506509635032011397287059257, 1484574852876236578030099116366398251085237658488907102090)
(1393905404716216131892233482794414472900782174600716102781, 871511778412605044471256876208116162244764418001268613572)