Efficient Generation of Large Congruent Numbers via k-order Recursive Composition

Abstract We present a deterministic method for constructing congruent numbers of exponential magnitude with O(k) operations, addressing the computational intractability of generating certified large congruent numbers. The method enables empirical validation of asymptotic conjectures and provides training data for machine learning approaches to the congruent number problem.