Project Euler 932 - 2025

Official link: https://projecteuler.net/problem=932

Note: Problem is tentatively 5%

Thought Process

Very simple problem, brute force works just fine.

If the discriminant> 0, we get 2 different solutions.

Interactive Code

Input an integer (yourinput)

Code will output all pairs (a, b) such that ab is a 2025-number less than 10^yourinput and T(yourinput)