We describe the results of an experiment in which the Nuprl proof development system was used in conjunction with a collection of simple proof-assisting programs to constructively prove a substantial theorem of number theory. We believe that these results indicate the promise of an approach to reasoning about computationally meaningful mathematics by which both proof construction and the results of formal reasoning are mathematically comprehensible.